Sciweavers

1013 search results - page 7 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
BIBE
2009
IEEE
131views Bioinformatics» more  BIBE 2009»
13 years 11 months ago
Learning Scaling Coefficient in Possibilistic Latent Variable Algorithm from Complex Diagnosis Data
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...
Zong-Xian Yin
TKDE
2008
148views more  TKDE 2008»
13 years 7 months ago
Semisupervised Clustering with Metric Learning using Relative Comparisons
Semisupervised clustering algorithms partition a given data set using limited supervision from the user. The success of these algorithms depends on the type of supervision and also...
Nimit Kumar, Krishna Kummamuru
ICAI
2004
13 years 9 months ago
A Comparison of Resampling Methods for Clustering Ensembles
-- Combination of multiple clusterings is an important task in the area of unsupervised learning. Inspired by the success of supervised bagging algorithms, we propose a resampling ...
Behrouz Minaei-Bidgoli, Alexander P. Topchy, Willi...
SOCIALCOM
2010
13 years 5 months ago
Measuring Similarity between Sets of Overlapping Clusters
The typical task of unsupervised learning is to organize data, for example into clusters, typically disjoint clusters (eg. the K-means algorithm). One would expect (for example) a...
Mark K. Goldberg, Mykola Hayvanovych, Malik Magdon...
CORR
2011
Springer
132views Education» more  CORR 2011»
12 years 11 months ago
Spatially-Aware Comparison and Consensus for Clusterings
This paper proposes a new distance metric between clusterings that incorporates information about the spatial distribution of points and clusters. Our approach builds on the idea ...
Parasaran Raman, Jeff M. Phillips, Suresh Venkatas...