Joint Cluster Based Co-clustering for Clustering Ensembles

  • Tianming Hu
  • Liping Liu
  • Chao Qu
  • Sam Yuan Sung
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4093)


This paper introduces a new method for solving clustering ensembles, that is, combining multiple clusterings over a common dataset into a final better one. The ensemble is reduced to a graph that simultaneously models as vertices the original clusters in the ensemble and the joint clusters derived from them. Only edges linking vertices from different types are considered. The resulting graph can be partitioned efficiently to produce the final clustering. Finally, the proposed method is evaluated against two graph formulations commonly used.


Consensus Function Normalize Mutual Information Graph Partitioning True Cluster Cluster Ensemble 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Fred, A., Jain, A.K.: Combining multiple clustering using evidence accumulation. IEEE Transactions on Pattern Analysis and Machine Intelligence 27(6), 835–850 (2005)CrossRefGoogle Scholar
  2. 2.
    Topchy, A., Jain, A.K., Punch, W.: Clustering ensembles: Models of consensus and weak partitions. IEEE Transactions on Pattern Analysis and Machine Intelligence 27(12), 1866–1881 (2005)CrossRefGoogle Scholar
  3. 3.
    Zhou, Z.H., Tang, W.: Clusterer ensemble. Knowledge-Based Systems 19(1), 77–83 (2006)CrossRefGoogle Scholar
  4. 4.
    Dietterich, T.G.: Ensemble methods in machine learning. In: Proceedings of the 2nd International Workshop on Multiple Classifier Systems, pp. 1–15 (2001)Google Scholar
  5. 5.
    Ghosh, J.: Multiclassifier systems: Back to the future. In: Proceedings of the 3rd International Workshop on Multiple Classifier Systems, pp. 1–15 (2002)Google Scholar
  6. 6.
    Barthelemy, J.P., Leclerc, B.: The median procedure for partition. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 19, 3–33 (1995)MathSciNetGoogle Scholar
  7. 7.
    Strehl, A., Ghosh, J.: Cluster ensembles - a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research 3, 583–617 (2002)MathSciNetGoogle Scholar
  8. 8.
    Topchy, A., Jain, A.K., Punch, W.: Combining multiple weak clusterings. In: Proceedings of the IEEE International Conference on Data Mining, pp. 331–338 (2003)Google Scholar
  9. 9.
    Dudoit, S., Fridlyand, J.: Bagging to improve the accuracy of a clustering procedure. Bioinformatics 19(9), 1090–1099 (2003)CrossRefGoogle Scholar
  10. 10.
    Topchy, A., Law, M.H., Jain, A.K., Fred, A.: Analysis of consensus partition in cluster ensemble. In: Proceedings of The 4th IEEE International Conference on Data Mining, pp. 225–232 (2004)Google Scholar
  11. 11.
    Kargupta, H., Huang, W., Johnson, E.: Distributed clustering using collective principal component analysis. Knowledge and Information Systems Journal 3, 422–448 (2001)CrossRefzbMATHGoogle Scholar
  12. 12.
    Topchy, A., Minaei, B., Jain, A., Punch, W.: Adaptive clustering ensembles. In: Proceedings of the International Conference on Pattern Recognition, pp. 272–275 (2004)Google Scholar
  13. 13.
    Topchy, A., Jain, A.K., Punch, W.: A mixture model of clustering ensembles. In: Proceedings of the 4th SIAM International Conference on Data Mining (2004)Google Scholar
  14. 14.
    Mirkin, B.: Reinterpreting the category utility function. Machine Learning 45(2), 219–228 (2001)CrossRefzbMATHMathSciNetGoogle Scholar
  15. 15.
    Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel hypergraph partitioning: Applications in VLSI domain. In: Proceedings of the 34th Conference on Design Automation, pp. 526–529 (1997)Google Scholar
  16. 16.
    Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22, 888–905 (2000)CrossRefGoogle Scholar
  17. 17.
    Hagen, L., Kahng, A.: New spectral methods for ratio cut partitioning and clustering. IEEE Transactions on CAD 11, 1074–1085 (1992)CrossRefGoogle Scholar
  18. 18.
    Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing 20(1), 359–392 (1998)CrossRefMathSciNetGoogle Scholar
  19. 19.
    Barnard, S.T., Simon, H.D.: A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. In: Proceedings of the 6th SIAM Conference on Parallel Processing for Scientific Computing, pp. 711–718 (1993)Google Scholar
  20. 20.
    Dhillon, I.S.: Co-clustering documents and words using bipartite spectral graph partitioning. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 269–274 (2001)Google Scholar
  21. 21.
    Sun, J., Qu, H., Chakrabarti, D., Faloutsos, C.: Relevance search and anomaly detection in bipartite graphs. ACM SIGKDD Explorations 7(2), 48–55 (2005)CrossRefGoogle Scholar
  22. 22.
    Zhang, Y., Chu, C.H., Ji, X., Zha, H.: Correlating summarization of multisource news with k-way graph bi-clustering. ACM SIGKDD Explorations 6(2), 34–42 (2004)CrossRefGoogle Scholar
  23. 23.
    Jain, A., Dubes, R.: Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs (1988)zbMATHGoogle Scholar
  24. 24.
    Newman, D.J., Hettich, S., Blake, C.L., Merz, C.J.: UCI repository of machine learning databases (1998),

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Tianming Hu
    • 1
  • Liping Liu
    • 1
  • Chao Qu
    • 1
  • Sam Yuan Sung
    • 2
  1. 1.Department of Computer ScienceDongGuan University of TechnologyDongGuanChina
  2. 2.Department of Computer ScienceSouth Texas UniversityMcAllenUSA

Personalised recommendations