Pattern Recognition and Image Analysis

, Volume 26, Issue 4, pp 681–687 | Cite as

Semi-supervised classification using multiple clusterings

Mathematical Method in Pattern Recognition
  • 58 Downloads

Abstract

Graph determines the performance of graph-based semi-supervised classification. In this paper, we investigate how to construct a graph from multiple clusterings and propose a method called Semi-Supervised Classification using Multiple Clusterings (SSCMC in short). SSCMC firstly projects original samples into different random subspaces and performs clustering on the projected samples. Then, it constructs a graph by setting an edge between two samples if these two samples are clustered in the same cluster for each clustering. Next, it combines these graphs into a composite graph and incorporates the resulting composite graph with a graph-based semi-supervised classifier based on local and global consistency. Our experimental results on two publicly available facial images show that SSCMC not only achieves higher accuracy than other related methods, but also is robust to input parameters.

Keywords

semi-supervised classification multiple clusterings composite graph 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    X. Zhu, “Semi-supervised learning literature survey,” Tech. Rep. (Department of Computer Science, Univ. of Wisconsin, Madison, 2008), no. 1530.Google Scholar
  2. 2.
    R. Duda, P. Hart, and D. Stork, Pattern Classification (John Wiley and Sons, 2012).MATHGoogle Scholar
  3. 3.
    X. J. Zhu, Z. Ghahramani, and J. Lafferty, “Semisupervised learning using Gaussian fields and harmonic functions,” in Proc. 20th Int. Conf. on Machine Learning (Washington, 2003), pp. 912–919.Google Scholar
  4. 4.
    D. Y. Zhou, O. Bousquet, T. N. Lal, J. Weston, and B. Scholköpf, “Learning with local and global consistency,” in Proc. Advances in Neural Information Processing Systems Conf. (Vancouver, 2003), pp. 321–328.Google Scholar
  5. 5.
    G. X. Yu, G. J. Zhang, C. Domeniconi, Z. W. Yu, and J. You, “Semi-supervised classification based on random subspace dimensionality reduction,” Pattern Recogn. 45 (3), 1119–1135 (2012).CrossRefMATHGoogle Scholar
  6. 6.
    W. Liu and S. Chang, “Robust multi-class transductive learning with graphs,” in Proc. 19th IEEE Conf. on Computer Vision and Pattern Recognition (Miami, 2009), pp. 381–388.Google Scholar
  7. 7.
    J. D. Wang, F. Wang, C. S. Zhang, H. C. Shen, and L. Quan, “Linear neighborhood propagation and its applications,” IEEE Trans. Pattern Anal. Mach. Intell. 31 (9), 1600–1615 (2009).CrossRefGoogle Scholar
  8. 8.
    L. Parsons, Q. Hua, and H. Liu, “Subspace clustering for high dimensional data: A review,” ACM SIGKDD Explor. 6 (1), 90–105 (2004).CrossRefGoogle Scholar
  9. 9.
    G. X. Yu, H. Peng, J. Wei, and Q. L. Ma, “Mixture graph based semi-supervised dimensionality reduction,” Pattern Recogn. Image Anal. 20 (4), 536–541 (2010).CrossRefGoogle Scholar
  10. 10.
    M. Karasuyama and H. Mamitsuka, “Multiple graph label propagation by sparse integration,” IEEE Trans. Neural Netw. Learn. Syst. 45 (12), 1999–2012 (2013).CrossRefGoogle Scholar
  11. 11.
    G. X. Yu, H. Rangwala, C. Domeniconi, G. J. Zhang, and Z. L. Zhang, “Protein function prediction by integrating multiple kernels,” in Proc. 23rd Int. Joint Conf. on Artificial Intelligence (Beijing, 2013), pp. 1869–1875.Google Scholar
  12. 12.
    G. X. Yu, H. L. Zhu, C. Domeniconi, and M. Guo, “Integrating multiple networks for protein function prediction,” BMC Syst. Biol. 9 (S1), S3 (2015).CrossRefGoogle Scholar
  13. 13.
    C. Cortes, M. Mohri, and A. Rostamizadeh, “Algorithms for learning kernels based on centered alignment,” J. Mach. Learn. Res. 13 (1), 795–828 (2012).MathSciNetMATHGoogle Scholar
  14. 14.
    X. H. Fu, X. C. Zou, X. T. Zou, and G. X. Yu, “Semisupervised dimensionality reduction based on composite graph,” J. Comput. Inf. Syst. 10 (19), 8429–8437 (2014).Google Scholar
  15. 15.
    M. Maier, U. V. Luxburg, and M. Hein, “Influence of graph construction on graph-based clustering measures,” in Proc. 21st Conf. Advances Neural Information Processing Systems (Vancouver, 2008), pp. 1025–1032.Google Scholar
  16. 16.
    G. X. Yu, G. J. Zhang, Z. W. Yu, C. Domeniconi, J. You, and G. Q. Han, “Semi-supervised ensemble classification in subspaces,” Appl. Soft Comput. 12 (5), 1511–1522 (2012).CrossRefGoogle Scholar
  17. 17.
    A. Fred and A. Jain, “Combing multiple clusterings using evidence accumulation,” IEEE Trans. Pattern Anal. Mach. Intell. 27 (6), 442–451(2002).Google Scholar
  18. 18.
    S. Samaria and A. C. Harter, “Parameterisation of a stochastic model for human face identification,” in Proc. 2nd IEEE Workshop on Applications of Computer Vision (Sarasota, FL, 1994), pp. 138–142.Google Scholar
  19. 19.
    T. Sim, S. Baker, and M. Bsat, “The CMU pose, illumination, and expression (PIE) database,” IEEE Trans. Pattern Anal. Mach. Intell. 25 (12), 1615–1618 (2003).CrossRefGoogle Scholar
  20. 20.
    P. N. Belhumeur, J. P. Hespanha, and D. J. Kriegman, “Eigenfaces vs fisherfaces: recognition using class specific linear projection,” IEEE Trans. Pattern Anal. Mach. Intell. 19 (7), 711–720 (1997).CrossRefGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2016

Authors and Affiliations

  1. 1.College of Computer and Information ScienceSouthwest UniversityChongqingChina

Personalised recommendations