Supervised kernel density estimation K-means

FD Bortoloti, E de Oliveira, PM Ciarelli - Expert Systems with Applications, 2021 - Elsevier
K-means is a well-known unsupervised-learning algorithm. It assigns data points to k
clusters, the centers of which are termed centroids. However, these centroids have a …

From data mining to knowledge mining: Application to intelligent agents

A Chemchem, H Drias - Expert Systems with Applications, 2015 - Elsevier
The last decade, the computers world became a huge wave of data. Data mining tasks were
invoked to tackle this problem in order to extract the interesting knowledge. The recent …

Different Methods for Cluster's Representation and Their Impact on the Effectiveness of Searching Through Such a Structure

T **ȩski, A Nowak-Brzezińska - … , ICCCI 2018, Bristol, UK, September 5-7 …, 2018 - Springer
In this paper the topic of clustering and searching through clusters generated from real-world
knowledge bases is discussed. Authors analyze three methods of cluster's representatives …

[PDF][PDF] Fouille parallèles des règles d'association sur GPU

Y Djenouri - 2014 - dspace.usthb.dz
Résumé La fouille des règles d'association est un processus qui permet de déduire un
ensemble de règles reliant les di érentes données d'une base de transactions. Avec …