Outlier-robust clustering using independent components
暂无分享,去创建一个
[1] Anthony K. H. Tung,et al. CURLER: finding and visualizing nonlinear correlation clusters , 2005, SIGMOD '05.
[2] Hans-Peter Kriegel,et al. OPTICS: ordering points to identify the clustering structure , 1999, SIGMOD '99.
[3] Christian Böhm,et al. Robust information-theoretic clustering , 2006, KDD '06.
[4] Dimitrios Gunopulos,et al. Automatic subspace clustering of high dimensional data for data mining applications , 1998, SIGMOD '98.
[5] Christian Böhm,et al. Computing Clusters of Correlation Connected objects , 2004, SIGMOD '04.
[6] Chris H. Q. Ding,et al. K-means clustering via principal component analysis , 2004, ICML.
[7] D. Rubin,et al. Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .
[8] Andrew W. Moore,et al. X-means: Extending K-means with Efficient Estimation of the Number of Clusters , 2000, ICML.
[9] Michael I. Jordan,et al. On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.
[10] Tian Zhang,et al. BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.
[11] Greg Hamerly,et al. Learning the k in k-means , 2003, NIPS.
[12] Angelo M. Mineo,et al. A Software Tool for the Exponential Power Distribution: The normalp Package , 2005 .
[13] Hans-Peter Kriegel,et al. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.
[14] Philip S. Yu,et al. Finding generalized projected clusters in high dimensional spaces , 2000, SIGMOD '00.
[15] Peter Grünwald,et al. A tutorial introduction to the minimum description length principle , 2004, ArXiv.
[16] Catherine Blake,et al. UCI Repository of machine learning databases , 1998 .
[17] Hans-Peter Kriegel,et al. LOF: identifying density-based local outliers , 2000, SIGMOD '00.