Sciweavers

4009 search results - page 157 / 802
» Clustering on Complex Graphs
Sort
View
ICDE
1999
IEEE
183views Database» more  ICDE 1999»
16 years 5 months ago
ROCK: A Robust Clustering Algorithm for Categorical Attributes
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) simi...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
SSDBM
2006
IEEE
123views Database» more  SSDBM 2006»
15 years 10 months ago
Mining Hierarchies of Correlation Clusters
The detection of correlations between different features in high dimensional data sets is a very important data mining task. These correlations can be arbitrarily complex: One or...
Elke Achtert, Christian Böhm, Peer Kröge...
170
Voted
CEC
2009
IEEE
15 years 8 months ago
Automatic clustering with multi-objective Differential Evolution algorithms
—This paper applies the Differential Evolution (DE) algorithm to the task of automatic fuzzy clustering in a Multi-objective Optimization (MO) framework. It compares the performa...
Kaushik Suresh, Debarati Kundu, Sayan Ghosh, Swaga...
BIBE
2004
IEEE
107views Bioinformatics» more  BIBE 2004»
15 years 7 months ago
Enhanced pClustering and Its Applications to Gene Expression Data
Clustering has been one of the most popular methods to discover useful biological insights from DNA microarray. An interesting paradigm is simultaneous clustering of both genes an...
Sungroh Yoon, Christine Nardini, Luca Benini, Giov...
CORR
2010
Springer
81views Education» more  CORR 2010»
14 years 11 months ago
Analysis of Agglomerative Clustering
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
Marcel R. Ackermann, Johannes Blömer, Daniel ...