Skip to main content

Advertisement

Springer Nature Link
Log in

Concept reduction in formal concept analysis based on representative concept matrix

  • Original Article
  • Published:
International Journal of Machine Learning and Cybernetics Aims and scope Submit manuscript

Abstract

Reduction theory is an important topic in formal concept analysis, and the research of reduction theory generally focuses on attribute reduction. Attribute reduction deletes redundant attributes and simplifies formal context. Nevertheless, it may lose part of original information of formal context. As a new direction of knowledge reduction, concept reduction avoids the defects of information loss caused by attribute reduction and enriches reduction theory. Concept reduction not only preserves the binary relation of a formal context, but also reduces the number of formal concepts. Furthermore, the information of formal context can be expressed simply and completely, and the complexity of solving problems with formal concept analysis can be reduced. In this paper, the definition of representative concept matrix is given to visualize the connection between concepts and binary relation. Then, the method for calculating concept reducts by representative concept matrix is obtained, and two simplified representative concept matrices named the clarified representative concept matrix and the minimal representative concept matrix are proposed. In addition, an algorithm for obtaining the minimal representative concept matrix is presented and compared with the previous algorithm. Finally, from the perspective of concept consistent set and minimal representative concept matrix respectively, the characteristics of three types of concepts, i.e., core concepts, relatively necessary concepts and absolutely unnecessary concepts, are discussed.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

Availability of data and materials

The datasets analysed during the current study are available in the UCI Machine Learning Repository, http://archive.ics.uci.edu/ml/datasets.php.

References

  1. Wille R (1982) Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival I (ed) Ordered sets. Reidel Publishing Company, Dordrecht-Boston, pp 445–470

    Chapter  Google Scholar 

  2. Ganter B, Wille R (1999) Formal concept analysis: mathematical foundations. Springer-Verlag, Berlin Heidelberg

    Book  MATH  Google Scholar 

  3. Kumar CA, Srinivas S (2010) Concept lattice reduction using fuzzy K-Means clustering. Expert Syst Appl 37:2696–2704

    Article  Google Scholar 

  4. Sumangali K, Kumar CA (2019) Concept lattice simplification in formal concept analysis using attribute clustering. J Ambient Intell Humaniz Comput 10(6):2327–2343

    Article  Google Scholar 

  5. Li JH, Wei L, Zhang Z et al (2020) Concept lattice theory and method and their research prospect. Pattern Recogn Artificial Intelligence (in Chinese) 33(7):619–642

    Google Scholar 

  6. Kuznetsov SO, Obiedkov SA (2002) Comparing performance of algorithms for generating concept lattices. J Exp Theoret Artif Intell 14(2–3):189–216

    Article  MATH  Google Scholar 

  7. Li MZ, Wang GY (2016) Approximate concept construction with three-way decisions and attribute reduction in incomplete contexts. Knowl-Based Syst 91:165–178

    Article  Google Scholar 

  8. Qian T, Wei L, Qi JJ (2017) Constructing three-way concept lattices based on apposition and subposition of formal contexts. Knowl-Based Syst 116:39–48

    Article  Google Scholar 

  9. Zhang WX, Wei L, Qi JJ (2005) Attribute reduction theory and approach to concept lattice. Sci China Series F 48(6):713–726

    MathSciNet  MATH  Google Scholar 

  10. Wei L, Qi JJ, Zhang WX (2008) Attribute reduction theory of concept lattice based on decision formal contexts. Sci China Series F 51(7):910–923

    MathSciNet  MATH  Google Scholar 

  11. Ren RS, Wei L (2016) The attribute reductions of three-way concept lattices. Knowl-Based Syst 99:92–102

    Article  Google Scholar 

  12. Wu WZ, Leung Y, Mi JS (2009) Granular computing and knowledge reduction in formal contexts. IEEE Trans Knowl Data Eng 21(10):1461–1474

    Article  Google Scholar 

  13. Wang X, Zhang WX (2009) Knowledge reduction in concept lattices based on irreducible elements. Lecture Notes in Computer Science (Transactions on Computational Science V: Special Issue on Cognitive Knowledge Representation). 5540:128–142

  14. Li TJ, Li MZ, Gao Y (2013) Attribute reduction of concept lattice based on irreducible elements. Int J Wavelets Multiresolut Inf Process 11(6):1–24

    Article  MathSciNet  MATH  Google Scholar 

  15. Shao MW, Yang HZ, Wu WZ (2015) Knowledge reduction in formal fuzzy contexts. Knowl-Based Syst 73(1):265–275

    Article  Google Scholar 

  16. Shao MW, Li KW (2017) Attribute reduction in generalized one-sided formal contexts. Inf Sci 378:317–327

    Article  MathSciNet  MATH  Google Scholar 

  17. Li JH, Mei CL, Lv YJ (2013) Incomplete decision contexts: Approximate concept construction, rule acquisition and knowledge reduction. Int J Approximate Reason 54(1):149–165

    Article  MathSciNet  MATH  Google Scholar 

  18. Wei L, Liu L, Qi JJ, Qian T (2020) Rules acquisition of formal decision contexts based on three-way concept lattices. Inf Sci 516:529–544

    Article  MathSciNet  MATH  Google Scholar 

  19. Yao YY (2016) Rough-set concept analysis: interpreting RS-definable concepts based on ideas from formal concept analysis. Inf Sci 346–347:442–462

    Article  MathSciNet  MATH  Google Scholar 

  20. Qi JJ, Wei L, Wan Q (2019) Multi-level granularity in formal concept analysis. Granular Comput 4(3):351–362

    Article  Google Scholar 

  21. Yao YY (2020) Three-way granular computing, rough sets, and formal concept analysis. Int J Approximate Reason 116:106–125

    Article  MathSciNet  MATH  Google Scholar 

  22. Bartl E, Konecny J (2016) L-concept analysis with positive and negative attributes. Inf Sci 360:96–111

    Article  MATH  Google Scholar 

  23. Zhao XR, Miao DQ, Fujita H (2021) Variable-precision three-way concepts in L-contexts. Int J Approximate Reason 130:107–125

    Article  MathSciNet  MATH  Google Scholar 

  24. Zhi HL, Li JH, Li YN (2022) Multi-level conflict analysis based on fuzzy formal contexts. IEEE Trans Fuzzy Syst. https://doi.org/10.1109/TFUZZ.2022.3167789

    Article  Google Scholar 

  25. Qi JJ, Wei L, Yao YY (2014) Three-way formal concept analysis. In: Miao DQ, Pedrycz W, Slezak D, Peters G, Hu QH, Wang RZ, editors. Rough Sets and Knowledge Technology. vol. 8818 of Lecture Notes in Computer Science. Cham: Springer International Publishing; p. 732–741

  26. Qi JJ, Qian T, Wei L (2016) The connections between three-way and classical concept lattices. Knowl-Based Syst 91:143–151

    Article  Google Scholar 

  27. Keprt A, Snášel V (2004) Binary factor analysis with help of formal concepts. In: Snasel V, Bělohlávek R, (eds). Proc. CLA 2004. Ostrava: Czech Republic; p. 90–101

  28. Bělohlávek R, Vychodil V (2006) On Boolean factor analysis with formal concepts as factors. In: SCIS and ISIS 2006. Tokyo; p. 1054–1059

  29. Bělohlávek R, Vychodil V (2010) Discovery of optimal factors in binary data via a novel method of matrix decomposition. J Comput Syst Sci 76(1):3–20

    Article  MathSciNet  MATH  Google Scholar 

  30. Trnecka M, Trneckova M (2018) Data reduction for Boolean matrix factorization algorithms based on formal concept analysis. Knowl-Based Syst 158:75–80

    Article  Google Scholar 

  31. Keprt A, Snášel V (2005) Binary factor analysis with genetic algorithms. In: Dote Y, Furuhashi T, Koppen M, Ohuchi A, Ohsawa Y (eds) Abraham A. Springer-Verlag, Berlin, Soft Computing as Transdisciplinary Science and Technology. Advances in Soft Computing. Muroran, pp 1259–1268

    Google Scholar 

  32. Frolov AA, Husek D, Polyakov PY (2013) Boolean factor analysis by expectation-maximization method. In: Proceedings of the Third International Conference on Intelligent Human Computer Interaction. vol. 179 of Advances in Intelligent Systems and Computing. Prague: Springer-Verlag Berlin; p. 243–254

  33. Ignatov DI, Nenova E, Konstantinova N, Konstantinov AV (2014) Boolean matrix factorisation for collaborative filtering: an FCA-based approach. In: Agre G, Hitzler P, Krisnadhi A, Kuznetsov S, (eds) Artificial intelligence: methodology, systems, and applications. vol. 8722 of Lecture Notes in Artificial Intelligence. Varna: Springer-Verlag Berlin; p. 47–58

  34. Kocayusufoglu F, Hoang MX, Singh AK (2018) Summarizing network processes with network-constrained Boolean matrix factorization. In: 2018 IEEE International Conference on Data Mining (ICDM). IEEE International Conference on Data Mining. Singapore: IEEE; p. 237–246

  35. Bělohlávek R, Trnecka M (2015) From-below approximations in Boolean matrix factorization: geometry and new algorithm. J Comput Syst Sci 81(8):1678–1697

    Article  MathSciNet  MATH  Google Scholar 

  36. Wei L, Cao L, Qi JJ, Zhang WX (2020) Concept reduction and concept characteristics in formal concept analysis. Scientia Sinica Inform (in Chinese) 50(12):1817–1833

    Google Scholar 

  37. Cao L, Wei L, Qi JJ (2018) Concept reduction preserving binary relations. Pattern Recogn Artif Intell (in Chinese) 31(6):516–524

    Google Scholar 

  38. Wang X, Peng ZH, Li JY, Wu WZ (2021) Method of concept reduction based on concept discernibility matrix. Comput Sci (in Chinese) 48(1):125–130

    Google Scholar 

  39. Li JY, Li XX, Wang X, Wu WZ (2020) Reduction of triadic concepts based on triadic factor analysis. J Nanjing Univ (Nat Sci) (in Chinese) 56(4):480–493

    Google Scholar 

  40. Xie XX, Li JJ, Chen DX, Lin RD (2020) Concept reduction of preserving binary relations based on Boolean matrix. J Shandong Univ (Nat Sci) (in Chinese) 55(5):32–45

    MATH  Google Scholar 

  41. Yao YY (2015) The two sides of the theory of rough sets. Knowl-Based Syst 80:67–77

    Article  Google Scholar 

  42. Pawlak Z (1982) Rough set. Int J Comput Inform Sci 11:341–356

    Article  MATH  Google Scholar 

  43. Zhan JM, Wang QM (2019) Certain types of soft coverings based rough sets with applications. Int J Mach Learn Cybern 10(5):1065–1076

    Article  Google Scholar 

  44. Yang X, Huang B (2022) Dominance-based fuzzy rough sets in multi-scale decision tables. Int J Mach Learn Cybern. https://doi.org/10.1007/s13042-022-01629-0

    Article  Google Scholar 

  45. Yao YY, Fu R (2013) The concept of reducts in Pawlak three-step rough set analysis. Transact Rough Sets XVI 7736:53–72

    Article  MATH  Google Scholar 

  46. Yao YY (2012) An outline of a theory of three-way decisions. In: Yao J, Yang Y, Slowinski R, Greco S, Li H, Mitra S, et al., editors. Rough Sets and Current Trends in Computing, Vol. 7413 of Lecture Notes in Computer Science. Springer Berlin Heidelberg; p. 1–17

  47. Yao YY (2018) Three-way decision and granular computing. Int J Approximate Reason 103:107–123

    Article  MATH  Google Scholar 

  48. Yao YY (2020) Tri-level thinking: Models of three-way decision. Int J Mach Learn Cybern 11(5):947–959

    Article  Google Scholar 

  49. Moore RE (1966) Interval Analysis. Prentice-Hall, Englewood Cliffs, New Jersey

    MATH  Google Scholar 

  50. Hu BQ, Wong H, Yiu KFC (2018) Equivalent structures of interval sets and fuzzy interval sets. Int J Intell Syst 33(1):68–92

    Article  Google Scholar 

Download references

Acknowledgements

This work was partially supported by the National Natural Science Foundation of China (Nos. 12171392, 61976244, 62006190, 12101478) and Natural Science Basic Research Program of Shaanxi (Program No. 2021JM-141).

Author information

Authors and Affiliations

  1. School of Mathematics, Northwest University, Xuefu Street, Xi’an, 710127, Shaanxi, People’s Republic of China

    Siyu Zhao & Ling Wei

  2. School of Mathematics and Statistics, Xianyang Normal University, Wenlin Road, Xianyang, 712000, Shaanxi, People’s Republic of China

    Siyu Zhao

  3. School of Computer Science and Technology, Xidian University, Taibai South Road, Xi’an, 710071, Shaanxi, People’s Republic of China

    Jianjun Qi & Junan Li

  4. Institute of Concepts, Cognition and Intelligence, Northwest University, Xuefu Street, Xi’an, 710127, Shaanxi, People’s Republic of China

    Siyu Zhao & Ling Wei

  5. School of Mathematics and Statistics, Minnan Normal University, Qianzhi Street, Zhangzhou, 363000, Fujian, People’s Republic of China

    Ling Wei

Authors
  1. Siyu Zhao
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Jianjun Qi
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Junan Li
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Ling Wei
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding authors

Correspondence to Jianjun Qi or Ling Wei.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhao, S., Qi, J., Li, J. et al. Concept reduction in formal concept analysis based on representative concept matrix. Int. J. Mach. Learn. & Cyber. 14, 1147–1160 (2023). https://doi.org/10.1007/s13042-022-01691-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13042-022-01691-8

Keywords