user- Here you have a DBSCAN code implemented in C++, boost and stl
- Consensus clustering has emerged as an important elaboration of the classical clustering problem. Consensus clustering, also called aggregation of clusteri...Consensus clustering has emerged as an important elaboration of the classical clustering problem. Consensus clustering, also called aggregation of clustering (or partitions), refers to the situation in which a number of different (input) clusterings have been obtained for a particular dataset and it is desired to find a single (consensus) clustering which is a better fit in some sense than the existing clusterings. Consensus clustering is thus the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. When cast as an optimization problem, consensus clustering is known as median partition, and has been shown to be NP-complete.
- EM has been shown to have favorable convergence properties, automatical satisfaction of constraints, and fast convergence. The next section explains the tr...EM has been shown to have favorable convergence properties, automatical satisfaction of constraints, and fast convergence. The next section explains the traditional approach to deriving the EM algorithm and proving its convergence property. Section 3.3 covers the interpretion the EM algorithm as the maximization of two quantities: the entropy and the expectation of complete-data likelihood. Then, the K-means algorithm and the EM algorithm are compared. The conditions under which the EM algorithm is reduced to the K-means are also explained. The discussion in Section 3.4 generalizes the EM algorithm described in Sections 3.2 and 3.3 to problems with partial-data and hidden-state. We refer to this new type of EM as the doubly stochastic EM. Finally, the chapter is concluded in Section 3.5.
- The MCL algorithm is short for the Markov Cluster Algorithm, a fast and scalable unsupervised cluster algorithm for graphs based on simulation of (stochast...The MCL algorithm is short for the Markov Cluster Algorithm, a fast and scalable unsupervised cluster algorithm for graphs based on simulation of (stochastic) flow in graphs.
- Nonnegative Matrix Factorization via Alternating Non-negativity-constrained Least Squares (NMF/ANLS)
- A list of cluster papers. Includes some links to source code.
- Compare k-means and PAM. PAM is also known as k-medoids.
- Useful bullet points on different types of clustering.
- This tool performs spectral clustering using either sparse similarity matrix (nearest neighbors) or the Nystrom method.
- Kluwer Academic Publishers, (2003)
- (2010)cite arxiv:1011.5270 .
- MultiClust: 1st International Workshop on Discovering, Summarizing and Using Multiple Clusterings Held in Conjunction with KDD 2010, Washington, DC, (2010)
- British Journal of Mathematical and Statistical Psychology 59(1):1--34 (2006)
- (2007)
- Physica A: Statistical Mechanics and its Applications 302(1-4):70--79 (2001)
- IEEE Transactions on Knowledge and Data Engineering 19(8):1026-1041 (2007)
- Large-Scale Distributed Systems for Information Retrieval (2010)
- Information Processing \& Management 24(5):577--597 (1988)
- Information processing \& management 38(4):559--582 (2002)
- Information Processing \& Management 42(5):1137--1150 (2006)
- CIKM '01: Proceedings of the tenth international conference on Information and knowledge management, page 33--40. New York, NY, USA, ACM, (2001)
- (1996)
- Artificial Intelligence: Methodology, Systems, and Applications (2008)
- (1996)
- (1986)
- Information systems 5(3):189--195 (1980)
- International Journal of Intelligent Computing and Cybernetics 1(4):484--508 (2008)
- (2008)
- ECIR'08: Proceedings of the IR research, 30th European conference on Advances in information retrieval, page 454--462. Berlin, Heidelberg, Springer-Verlag, (2008)
