A Non-parametric Maximum Entropy Clustering
暂无分享,去创建一个
[1] Masashi Sugiyama,et al. On Information-Maximization Clustering: Tuning Parameter Selection and Analytic Solution , 2011, ICML.
[2] Sergei Vassilvitskii,et al. k-means++: the advantages of careful seeding , 2007, SODA '07.
[3] José Carlos Príncipe,et al. Information theoretic clustering , 2002, Scholarpedia.
[4] Geoffrey J. McLachlan,et al. Mixture models : inference and applications to clustering , 1989 .
[5] Andreas Krause,et al. Discriminative Clustering by Regularized Information Maximization , 2010, NIPS.
[6] Sebastian Nowozin,et al. Information Theoretic Clustering Using Minimum Spanning Trees , 2012, DAGM/OAGM Symposium.
[7] Jacob Goldberger,et al. Nonparametric Information Theoretic Clustering Algorithm , 2010, ICML.
[8] Hideitsu Hino,et al. Information estimators for weighted observations , 2013, Neural Networks.
[9] Pietro Perona,et al. Self-Tuning Spectral Clustering , 2004, NIPS.
[10] G. W. Milligan,et al. A Study of the Comparability of External Criteria for Hierarchical Cluster Analysis. , 1986, Multivariate behavioral research.
[11] Anil K. Jain,et al. Data clustering: a review , 1999, CSUR.
[12] Michael I. Jordan,et al. On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.