Advertisement

Concept Lattice Simplification in Formal Concept Analysis Using Attribute Clustering

  • K. Sumangali Email author
  • Ch. Aswani Kumar 
Original Research
  • 226 Downloads

Abstract

In Formal Concept Analysis (FCA), a concept lattice graphically portrays the underlying relationships between the objects and attributes of an information system. One of the key complexity problems of concept lattices lies in extracting the useful information. The unorganized nature of attributes in huge contexts often does not yield an informative lattice in FCA. Moreover, understanding the collective relationships between attributes and objects in a larger many valued context is more complicated. In this paper, we introduce a novel approach for deducing a smaller and meaningful concept lattice from which excerpts of concepts can be inferred. In existing attribute-based concept lattice reduction methods for FCA, mostly either the attribute size or the context size is reduced. Our approach involves in organizing the attributes into clusters using their structural similarities and dissimilarities, which is commonly known as attribute clustering, to produce a derived context. We have observed that the deduced concept lattice inherits the structural relationship of the original one. Furthermore, we have mathematically proved that a unique surjective inclusion mapping from the original lattice to the deduced one exists.

Keywords

Attribute clustering Concept lattice Formal concept analysis Many-valued context Poset Proximity 

Notes

References

  1. Agarwal BM (2009) Business mathematics and statistics. Ane, New DelhiGoogle Scholar
  2. Aswani Kumar C, Srinivas S (2010) Mining associations in health care data using formal concept analysis and singular value decomposition. J Biol Syst 18(04):787–807MathSciNetGoogle Scholar
  3. Au WH, Chan KC, Wong AK, Wang Y (2005) Attribute clustering for grouping, selection, and classification of gene expression data. IEEE/ACM Trans Comput Biol Bioinfor 2(2):83–101Google Scholar
  4. Belohlavek R, Macko J (2011) Selecting important concepts using weights. In: International conference on formal concept analysis. Springer, Berlin, pp. 65–80zbMATHGoogle Scholar
  5. Belohlavek R, Vychodil V (2009) Formal concept analysis with background knowledge: attribute priorities. IEEE Trans Syst Man Cybern Part C (Appl Rev) 39(4):399–409Google Scholar
  6. Bělohlávek R, Sklenář V (2005a) Formal concept analysis over attributes with levels of granularity. In: International conference on computational intelligence for modelling, control and automation, 2005 and international conference on intelligent agents, web technologies and internet commerce, vol 1. IEEE, pp. 619–624Google Scholar
  7. Bělohlávek R, Sklenář V (2005b) Formal concept analysis constrained by attribute-dependency formulas. In: International conference on formal concept analysis. Springer, Berlin, pp. 176–191Google Scholar
  8. Belohlávek R, Sklenár V, Zacpal J (2005) Concept lattices constrained by systems of partitions. In: Proceeding Znalosti, pp. 5–8Google Scholar
  9. Buzmakov A, Kuznetsov S, Napoli A (2015) Sofia: how to make FCA polynomial? In: Proceedings of the 4th international conference on what can FCA do for artificial intelligence? vol 1430, pp. 27–34Google Scholar
  10. Carpineto C, Romano G (1996) A lattice conceptual clustering system and its application to browsing retrieval. Mach Learn 24(2):95–122Google Scholar
  11. Carpineto C, Romano G (2004) Concept data analysis: theory and applications. Wiley, New YorkzbMATHGoogle Scholar
  12. Ch AK, Dias SM, Vieira NJ (2015) Knowledge reduction in formal contexts using non-negative matrix factorization. Math Comput Simul 109:46–63MathSciNetGoogle Scholar
  13. Cheung KS, Vogel D (2005) Complexity reduction in lattice-based information retrieval. Inf Retr 8(2):285–299Google Scholar
  14. Codocedo V, Taramasco C, Astudillo H (2011) Cheating to achieve formal concept analysis over a large formal context. In: The eighth international conference on concept lattices and their applications-CLA 2011, pp. 349–362Google Scholar
  15. Dias SM, Vieira N (2010) Reducing the size of concept lattices: the JBOS approach. In: CLA, vol 672, pp 80–91Google Scholar
  16. Dias SM, Vieira NJ (2015) Concept lattices reduction: definition, analysis and classification. Expert Syst Appl 42(20):7084–7097Google Scholar
  17. Elloumi S, Jaam J, Hasnah A, Jaoua A, Nafkha I (2004) A multi-level conceptual data reduction approach based on the Lukasiewicz implication. Inf Sci 163(4):253–262MathSciNetzbMATHGoogle Scholar
  18. Ganter B, Wille R (1999). Formal concept analysis: mathematical foundations. Springer, New YorkzbMATHGoogle Scholar
  19. Han J, Kamber M (2006). Data mining, southeast Asia edition: concepts and techniques. Morgan kaufmann, San FranciscoGoogle Scholar
  20. Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv (CSUR) 31(3):264–323Google Scholar
  21. Janusz A, Ślęzak D (2012) Utilization of attribute clustering methods for scalable computation of reducts from high-dimensional data. In: Federated conference on computer science and information systems (FedCSIS), 2012, pp. 295–302. IEEEGoogle Scholar
  22. Kauer M, Krupka M (2014) Removing an incidence from a formal context. In: CLA (pp 195–206)Google Scholar
  23. Knuth KH (2007) Lattice theory, measures and probability. In: Knuth KH, Caticha A, Center JL, Giffin A, Rodríguez CC (eds.), AIP conference proceedings, vol 954, No. 1. AIP, pp. 23–36Google Scholar
  24. Krötzsch M, Hitzler P, Zhang GQ (2005) Morphisms in context. In: International conference on conceptual structures. Springer, Berlin Heidelberg, pp. 223–237Google Scholar
  25. Kumar C (2011) Knowledge discovery in data using formal concept analysis and random projections. Int J Appl Math Comput Sci 21(4):745–756Google Scholar
  26. Kumar CA (2012) Fuzzy clustering-based formal concept analysis for association rules mining. Appl Artif Intell 26(3):274–301MathSciNetGoogle Scholar
  27. Kumar CA, Srinivas S (2010) Concept lattice reduction using fuzzy K-means clustering. Expert Syst Appl 37(3):2696–2704Google Scholar
  28. Kumar CA, Sumangali K (2012) Performance evaluation of employees of an organization using formal concept analysis. In: International conference on pattern recognition, informatics and medical engineering (PRIME), 2012. IEEE, pp. 94–98Google Scholar
  29. Kumar CA, Ishwarya MS, Loo CK (2015) Formal concept analysis approach to cognitive functionalities of bidirectional associative memory. Biol Inspir Cognit Archit 12:20–33Google Scholar
  30. Kuznetsov SO (2001) On computing the size of a lattice and related decision problems. Order 18(4):313–321MathSciNetzbMATHGoogle Scholar
  31. Li J, Mei C, Xu W, Qian Y (2015) Concept learning via granular computing: a cognitive viewpoint. Inf Sci 298:447–467MathSciNetzbMATHGoogle Scholar
  32. Li C, Li J, He M (2016) Concept lattice compression in incomplete contexts based on K medoids clusteing. Int J Mach Learn Cybern 7(4):539–552MathSciNetGoogle Scholar
  33. Li J, Huang C, Qi J, Qian Y, Liu W (2017) Three-way cognitive concept learning via multi-granularity. Inf Sci 378:244–263Google Scholar
  34. Liu M, Shao M, Zhang W, Wu C (2007) Reduction method for concept lattices based on rough set theory and its application. Comput Math Appl 53(9):1390–1410MathSciNetzbMATHGoogle Scholar
  35. Martin TP, Rahim NA, Majidian A (2013) A general approach to the measurement of change in fuzzy concept lattices. Soft Comput 17(12):2223–2234zbMATHGoogle Scholar
  36. Medina J (2012) Relating attribute reduction in formal, object-oriented and property-oriented concept lattices. Comput Math Appl 64(6):1992–2002MathSciNetzbMATHGoogle Scholar
  37. Melo C, Le-Grand B, Aufaure MA (2013) Browsing large concept lattices through tree extraction and reduction methods. Int J Intell Inf Technol 9(4):16–34Google Scholar
  38. Messai N, Devignes MD, Napoli A, Smail-Tabbone M (2008) Many-valued concept lattices for conceptual clustering and information retrieval. In: ECAI, vol 178, pp 127–131)Google Scholar
  39. Mi JS, Liu J, Xie B (2008) Multi-scaled concept lattices. In: IEEE international conference on granular computing, 2008, GrC 2008. IEEE, pp. 54–58Google Scholar
  40. Pham DT, Dimov SS, Nguyen CD (2005) Selection of K in K-means clustering. Proc Inst Mech Eng Part C J Mech Eng Sci 219(1):103–119Google Scholar
  41. Poelmans J, Ignatov DI, Kuznetsov SO, Dedene G (2013) Formal concept analysis in knowledge processing: a survey on applications. Expert Syst Appl 40(16):6538–6560Google Scholar
  42. Priss U (2006) Formal concept analysis in information science. Arist 40(1):521–543Google Scholar
  43. Quan TT, Hui SC, Cao TH (2004) A fuzzy FCA-based approach to conceptual clustering for automatic generation of concept hierarchy on uncertainty data. In: Proceedings of the 2004 concept lattices and their applications workshop, pp. 1–12Google Scholar
  44. Stumme G, Taouil R, Bastide Y, Pasquier N, Lakhal L (2002) Computing iceberg concept lattices with TITANIC. Data Knowl Eng 42(2):189–222zbMATHGoogle Scholar
  45. Sumangali K, Kumar CA (2013) Critical analysis on open source lmss using fca. Int J Distance Educ Technol (IJDET) 11(4):97–111Google Scholar
  46. Sumangali K, Kumar CA (2014) Determination of interesting rules in FCA using information gain. In: First international conference on networks & soft computing (ICNSC), 2014. IEEE, pp. 304–308Google Scholar
  47. Sumangali K, Kumar CA (2017) A comprehensive overview on the foundations of formal concept analysis. Knowl Manag E Learn Int J 9(4):512–538Google Scholar
  48. Sumangali K, Aswani Kumar Ch, Jinhai L (2017) Concept Compression in Formal Concept Analysis Using Entropy-Based Attribute Priority. Appl Artificial Intell 31:1–28Google Scholar
  49. Tversky A (1977) Features of similarity. Psychol Rev 84(4):327Google Scholar
  50. Wen Z, Yan Z, Yao L, Zhaoman Z (2010) Concept reduction on interval formal concept analysis. In: 9th IEEE international conference on cognitive informatics (ICCI), 2010. IEEE, pp. 899–903Google Scholar
  51. Wu WZ, Leung Y, Mi JS (2009) Granular computing and knowledge reduction in formal contexts. IEEE Trans Knowl Data Eng 21(10):1461–1474Google Scholar
  52. Xu R, Wunsch D (2005) Survey of clustering algorithms. IEEE Trans Neural Netw 16(3):645–678Google Scholar
  53. Xu ZB, Liang JY, Dang CY, Chin KS (2002) Inclusion degree: a perspective on measures for rough set data analysis. Inf Sci 141(3):227–236MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.School of Information Technology and EngineeringVellore Institute of TechnologyVelloreIndia

Personalised recommendations