Sciweavers

1836 search results - page 129 / 368
» Mining Clustering Dimensions
Sort
View
ICAI
2004
15 years 3 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...
ICDM
2010
IEEE
216views Data Mining» more  ICDM 2010»
14 years 11 months ago
K-AP: Generating Specified K Clusters by Efficient Affinity Propagation
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
Xiangliang Zhang, Wei Wang, Kjetil Nørv&ari...
ICDM
2009
IEEE
167views Data Mining» more  ICDM 2009»
14 years 11 months ago
Self-Adaptive Anytime Stream Clustering
Clustering streaming data requires algorithms which are capable of updating clustering results for the incoming data. As data is constantly arriving, time for processing is limited...
Philipp Kranen, Ira Assent, Corinna Baldauf, Thoma...
122
Voted
ICDM
2010
IEEE
200views Data Mining» more  ICDM 2010»
14 years 11 months ago
Bayesian Maximum Margin Clustering
Abstract--Most well-known discriminative clustering models, such as spectral clustering (SC) and maximum margin clustering (MMC), are non-Bayesian. Moreover, they merely considered...
Bo Dai, Baogang Hu, Gang Niu
KDD
2012
ACM
281views Data Mining» more  KDD 2012»
13 years 4 months ago
Active spectral clustering via iterative uncertainty reduction
Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straightforw...
Fabian L. Wauthier, Nebojsa Jojic, Michael I. Jord...