Sciweavers

25041 search results - page 86 / 5009
» Algorithms for Clustering Data
Sort
View
IAJIT
2008
115views more  IAJIT 2008»
13 years 8 months ago
Optimal Fuzzy Clustering in Overlapping Clusters
: The fuzzy c-means clustering algorithm has been widely used to obtain the fuzzy k-partitions. This algorithm requires that the user gives the number of clusters k. To find automa...
Ouafae Ammor, Abdelmounim Lachkar, Khadija Slaoui,...
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
14 years 14 days ago
Finding Generalized Projected Clusters In High Dimensional Spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
Charu C. Aggarwal, Philip S. Yu
SAC
2005
ACM
14 years 1 months ago
Rearranging data objects for efficient and stable clustering
When a partitional structure is derived from a data set using a data mining algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of...
Gyesung Lee, Xindong Wu, Jinho Chon
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
14 years 8 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney
SDM
2012
SIAM
452views Data Mining» more  SDM 2012»
11 years 10 months ago
Density-based Projected Clustering over High Dimensional Data Streams
Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately ...
Irene Ntoutsi, Arthur Zimek, Themis Palpanas, Peer...