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.
G. Jeh, и J. Widom. KDD '02: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, стр. 538--543. New York, NY, USA, ACM, (2002)
M. y Gómez, A. Gelbukh, и A. López-López. Proceedings of the 10th International Conference on Conceptual Structures (ICCS 2002), том 2393 из Lecture Notes in Computer Science, стр. 122-136. Springer, (2002)
J. Ganascia, и J. Velcin. Proceedings of the 12th International Conference on Conceptual Structures (ICCS 2004), том 3127 из Lecture Notes in Computer Science, стр. 156-169. Springer, (2004)
I. Dhillon, Y. Guan, и B. Kulis. KDD '05: Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, стр. 629--634. New York, NY, USA, ACM Press, (2005)