Sciweavers

25041 search results - page 78 / 5009
» Algorithms for Clustering Data
Sort
View
ICPR
2008
IEEE
14 years 2 months ago
An extended version of the k-means method for overlapping clustering
This paper deals with overlapping clustering, a trade off between crisp and fuzzy clustering. It has been motivated by recent applications in various domains such as information r...
Guillaume Cleuziou
GECCO
2004
Springer
124views Optimization» more  GECCO 2004»
14 years 1 months ago
Clustering with Niching Genetic K-means Algorithm
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and fail to consistently and efficiently identify high quality solutions (best known...
Weiguo Sheng, Allan Tucker, Xiaohui Liu
ICDM
2009
IEEE
110views Data Mining» more  ICDM 2009»
14 years 2 months ago
Projective Clustering Ensembles
Recent advances in data clustering concern clustering ensembles and projective clustering methods, each addressing different issues in clustering problems. In this paper, we consi...
Francesco Gullo, Carlotta Domeniconi, Andrea Tagar...
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
14 years 8 months ago
CLICKS: an effective algorithm for mining subspace clusters in categorical datasets
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods, Clicks mines subs...
Mohammed Javeed Zaki, Markus Peters, Ira Assent, T...
BMCBI
2010
121views more  BMCBI 2010»
13 years 5 months ago
A grammar-based distance metric enables fast and accurate clustering of large sets of 16S sequences
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
David J. Russell, Samuel F. Way, Andrew K. Benson,...