Sciweavers

1959 search results - page 71 / 392
» Multiple Kernel Clustering.
Sort
View
MST
2010
86views more  MST 2010»
13 years 3 months ago
Fixed-Parameter Enumerability of Cluster Editing and Related Problems
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
Peter Damaschke
ICPR
2002
IEEE
14 years 10 months ago
Data Clustering Using Evidence Accumulation
We explore the idea of evidence accumulation for combining the results of multiple clusterings. Initially, n d-dimensional data is decomposed into a large number of compact cluste...
Ana L. N. Fred, Anil K. Jain
PKDD
2010
Springer
146views Data Mining» more  PKDD 2010»
13 years 6 months ago
Nonparametric Bayesian Clustering Ensembles
Forming consensus clusters from multiple input clusterings can improve accuracy and robustness. Current clustering ensemble methods require specifying the number of consensus clust...
Pu Wang, Carlotta Domeniconi, Kathryn Blackmond La...
SDM
2009
SIAM
220views Data Mining» more  SDM 2009»
14 years 6 months ago
Bayesian Cluster Ensembles.
Cluster ensembles provide a framework for combining multiple base clusterings of a dataset to generate a stable and robust consensus clustering. There are important variants of th...
Hongjun Wang, Hanhuai Shan, Arindam Banerjee
IJCAI
2007
13 years 10 months ago
Computation of Initial Modes for K-modes Clustering Algorithm Using Evidence Accumulation
Clustering accuracy of partitional clustering algorithm for categorical data primarily depends upon the choice of initial data points (modes) to instigate the clustering process. ...
Shehroz S. Khan, Shri Kant