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.
ClusterViz is a software to visualize the clustering process using the family of k-means algorithms. The program is free software under the GNU General Public License (GPL). ClusterViz allows to cluster data while visualizing an up to three dimensional projection. The clustering process is visualized using OpenGL. As clustering algorithms the family of k-means algorithms is implemented, including mixture models.
M. Ackermann, und J. Blömer. Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '09), Seite 1088--1097. Society for Industrial and Applied Mathematics (SIAM), (2009)
D. Arthur, und S. Vassilvitskii. SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, Seite 1027--1035. Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, (2007)
C. Ding, T. Li, D. Luo, und W. Peng. SIGIR '08: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, Seite 831--832. New York, NY, USA, ACM, (2008)
M. Ester, H. Kriegel, J. Sander, und X. Xu. Proc. of 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96), Seite 226-231. (1996)
T. Falkowski, A. Barth, und M. Spiliopoulou. In Proc. of the 2007 IEEE / WIC / ACM International Conference on Web Intelligence,, Seite 112-115. (2007)