Skip to main content
SpringerLink
Log in

Supervised Classification Box Algorithm Based on Graph Partitioning

  • Conference paper
  • First Online:
Progress in Computer Recognition Systems (CORES 2019)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 977))

Included in the following conference series:

  • 621 Accesses

Abstract

In this paper we introduce the supervised classification algorithm called Box algorithm based on feature space partitioning. The construction of Box algorithm is closely linked to the solution of computational geometry problem involving heuristic maximal clique cover problem satisfying the k-nearest neighbor rule. We first apply a heuristic algorithm to partition a graph into a minimal number of maximal cliques and subsequently the cliques are merged by means of the k-nearest neighbor rule. The main advantage of the new approach is decomposition of the l-class problem (\(l > 2\)) into l single-class optimization problems. The performance of the Box algorithm is demonstrated to be significantly better than SVM in computer experiments involving real Monk’s dataset from UCI depository and simulated normal data.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bentley J (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18:509–517

    Article  Google Scholar 

  2. Cheng H, Vua K, Huaa K (2009) Subspace projection: a unified framework for a class of partition-based dimension reduction techniques. Inf Sci 179:1234–1248

    Article  Google Scholar 

  3. Güvenir H, Emeksiz N, Ikizler N, Ormeci N (2004) Diagnosis of gastric carcinoma by classification on feature projections. Artif Intell Med 23:231–240

    Article  Google Scholar 

  4. Güvenir H, Sirin I (1966) Classification by feature partitioning. Mach Learn 23:47–67

    Google Scholar 

  5. Iovanella A, Scoppola B, Scoppola E (2007) Some spin glass ideas applied to the clique problem. J Stat Phys 126:895–915

    Article  MathSciNet  Google Scholar 

  6. Kumar K, Negi A (2007) A feature partitioning approach to subspace classification. In: Proceedings of the TENCON IEEE conference, pp 1–4

    Google Scholar 

  7. Kumar K, Negi A (2007) A novel approach to eigenpalm features using feature-partitioning framework. In: Proceedings of the international conference on machine vision applications, Tokyo, pp 29–32

    Google Scholar 

  8. Kumar K, Negi A (2008) Novel approaches to principal component analysis of image data based on feature partitioning framework. Pattern Recogn Lett 29:254–264

    Article  Google Scholar 

  9. Kumar K, Negi A (2008) SubXPCA and a generalized feature partitioning approach to principal component analysis. Pattern Recogn 41:1398–1409

    Article  Google Scholar 

  10. Kumlander D (2005) Problems of optimization: an exact algorithm for finding a maximum clique optimized for dense graphs. In: Proceedings of the Estonian academy of sciences, physics, mathematics, vol 54, pp 79–86

    Google Scholar 

  11. Nene S, Nayar S (1997) A simple algorithm for nearest neighbor search in high dimensions. IEEE Trans Pattern Anal Mach Intell 19:989–1003

    Article  Google Scholar 

  12. Pelillo M, Torsello A (2006) Payoff-monotonic game dynamics and the maximum clique problem. Neural Comput 18:1215–1258

    Article  MathSciNet  Google Scholar 

  13. Valev V (2004) Supervised pattern recognition by parallel feature partitioning. Pattern Recogn 37:463–467

    Article  Google Scholar 

  14. Valev V (2004) Supervised pattern recognition with heterogeneous features. Int J Mach Graph Vis 13:345–353

    MATH  Google Scholar 

  15. Valev V (2011) Machine learning of syndromes for different types of features. In: Proceedings of the international conference on high performance computing and simulation, pp 504–509

    Google Scholar 

  16. Valev V (2014) From binary features to non-reducible descriptors in supervised pattern recognition problems. Pattern Recogn Lett 45:106–114

    Article  Google Scholar 

  17. Valev V, Yanev N (2012) Classification using graph partitioning. In: Proceedings of the 21st international conference on pattern recognition. IEEE Xplore, Tsukuba, Japan, pp 1261–1264

    Google Scholar 

  18. Valev V, Yanev N, Krzyżak A (2016) A new geometrical approach for solving the supervised pattern recognition problem. In: Proceedings of the 23rd international conference on pattern recognition. IEEE Xplore, Cancun, Mexico, pp 1648–1652

    Google Scholar 

  19. Wang H, Obremski T, Alidaee B, Kochenberger G (2008) Clique partitioning for clustering. Commun Stat - Simul Comput 37:1–13

    Article  Google Scholar 

  20. Wang R, Tang Z, Cao Q (2003) An efficient approximation algorithm for finding a maximum clique using hopfield network learning. Neural Comput 15:1605–1619

    Article  Google Scholar 

  21. Yanev N, Balev S (1999) A combinatorial approach to the classification problem. Eur J Oper Res 115:339–350

    Article  Google Scholar 

  22. Yang G, Tang Z, Zhang Z, Zhu Y (2007) A flexible annealing chaotic neural network to maximum clique problem. Int J Neural Syst 17:183–192

    Article  Google Scholar 

Download references

Acknowledgments

Research of N. Yanev was partially supported by the French-Bulgarian contract “RILA”, 01/4, 2018. Research of A. Krzyżak was supported by the Natural Sciences and Engineering Research Council under Grant RGPIN-2015-06412. K. Ben Suliman research was supported by the Libyan Government.

Author information

Authors and Affiliations

  1. Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, 1113, Sofia, Bulgaria

    Ventzeslav Valev & Nicola Yanev

  2. Department of Computer Science and Software Engineering, Concordia University, Montreal, QC, H3G 1M8, Canada

    Adam Krzyżak & Karima Ben Suliman

Authors
  1. Ventzeslav Valev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicola Yanev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Adam Krzyżak
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Karima Ben Suliman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Adam Krzyżak .

Editor information

Editors and Affiliations

  1. Faculty of Electronics, Wroclaw University of Science and Technology, Wrocław, Poland

    Robert Burduk

  2. Faculty of Electronics, Wroclaw University of Science and Technology, Wrocław, Poland

    Marek Kurzynski

  3. Faculty of Electronics, Wroclaw University of Science and Technology, Wrocław, Poland

    Michał Wozniak

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Valev, V., Yanev, N., Krzyżak, A., Ben Suliman, K. (2020). Supervised Classification Box Algorithm Based on Graph Partitioning. In: Burduk, R., Kurzynski, M., Wozniak, M. (eds) Progress in Computer Recognition Systems. CORES 2019. Advances in Intelligent Systems and Computing, vol 977. Springer, Cham. https://doi.org/10.1007/978-3-030-19738-4_28

Download citation

Publish with us

Policies and ethics

Search

Navigation