Concept lattices reduction: Definition, analysis and classification

Expert Systems with Applications

Volumn 42, Issue 20, 2015, Pages 7084-7097

  Dias, Sérgio M ^a,b   Vieira, Newton J ^a  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^b Federal Service of Data Processing (SERPRO)   (Brazil)

Author keywords

Concept lattices; Formal concept analysis; Reduction

Indexed keywords

CLASSIFICATION (OF INFORMATION); INFORMATION ANALYSIS; KNOWLEDGE REPRESENTATION; REDUCTION;

COMPUTATIONAL COSTS; CONCEPT LATTICES; DIFFERENT CLASS; FORMAL CONCEPT ANALYSES (FCA); FORMAL CONCEPTS;

FORMAL CONCEPT ANALYSIS;

EID: 84930652494     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2015.04.044     Document Type: Article

References (89)

1. F. Alqadah, and R. Bhatnagar Similarity measures in formal concept analysis Annals of Mathematics and Artificial Intelligence 61 2011 245 256 http://dx.doi.org/10.1007/s10472-011-9257-7
2. G. Arévalo, A. Berry, M. Huchard, G. Perrot, and A. Sigayret Performances of galois sub-hierarchy-building algorithms Proceedings of international conference on Formal concept analysis - ICFCA 2007 Springer-Verlag Berlin, Heidelberg 166 180
3. M.A. Babin, and S.O. Kuznetsov Approximating concept stability Proceedings of international conference on formal concept analysis - ICFCA 2012 Springer 7 15
4. Belohlavek, R., & Sklenar, V. (2005). Formal concept analysis over attributes with levels of granularity. In Computational intelligence for modelling, control and automation and international conference on intelligent agents, web technologies and internet commerce (Vol. 1, pp. 619 -624). doi: http://dx.doi.org/10.http://dx.doi.org/10.1109/CIMCA.2005.1631332.
5. R. Belohlavek, B. Baets, and J. Konecny Zoom-in/zoom-out algorithms for FCA with attribute granularity E. Gelenbe, R. Lent, G. Sakellari, Computer and information sciences II 2012 Springer London 549 555 http://dx.doi.org/10.1007/978-1-4471-2155-8-70
6. Belohlavek, R., Sklenár, V., & Zacpal, J. (2004). Concept lattices constrained by attribute dependencies. In Proceedings of Dateso, CEUR workshop proceedings (pp. 56-66).
7. R. Belohlavek, and J. Macko Selecting important concepts using weights Proceedings of international conference on formal concept analysis - ICFCA 2011 Springer-Verlag Berlin, Heidelberg 65 80
8. R. Belohlavek, V. Sklenár, and J. Zacpal Formal concept analysis with hierarchically ordered attributes International Journal of General Systems 33 2004 383 394
9. R. Belohlavek, and V. Vychodil Formal concept analysis with constraints by closure operators H. Schärfe, P. Hitzler, P. Ohrstrom, Proceedings of the international conference on conceptual structures - ICCS Lecture notes in computer science Vol. 4068 2006 Springer 131 143 http://dx.doi.org/10.1007/11787181-10
10. R. Belohlavek, and V. Vychodil Formal concept analysis with background knowledge: Attribute priorities Transactions on Systems, Man, and Cybernetics Part C 39 2009 399 409
11. R. Belohlavek, and V. Vychodil Closure-based constraints in formal concept analysis Discrete Applied Mathematics 161 2013 1894 1911 http://dx.doi.org/10.1016/j.dam.2013.02.029
12. K. Bertet, and B. Monjardet The multiple facets of the canonical direct unit implicational basis Theoretical Computer Science 411 2010 2155 2166 http://dx.doi.org/10.1016/j.tcs.2009.12.021
13. Boulicaut, J. -F., & Besson, J. (2008). Actionability and formal concepts: A data mining perspective. In Proceedings of international conference on formal concept analysis - ICFCA (pp. 14-31). doi: http://dx.doi.org/10.1007/978-3-540-78137-0-2.
14. Brito, P., & Polaillon, G. (2011). Homogeneity and stability in conceptual analysis. In Proceedings of international conference on concept lattices and their applications - CLA, Nancy, France (pp. 251-263).
15. Cabrera, I. P., Ojeda-Aciego, M., & Pócs, J. (2014). Ordering objects via attribute preferences. In International Conference on Concept Lattices and their Applications - CLA (pp. 157-168)
16. Cerf. L. (2010). Constraint-based mining of closed patterns in noisy n-ary relations (Ph.D. thesis). Lyon: National Institute for Applied Sciences.
17. A.K. Ch, S.M. Dias, and N.J. Vieira Knowledge reduction in formal contexts using non-negative matrix factorization Mathematics and Computers in Simulation 109 2015 46 63 http://dx.doi.org/10.1016/j.matcom.2014.08.004
18. K.S.K. Cheung, and D. Vogel Complexity reduction in lattice-based information retrieval Information Retrieval 8 2005 285 299 http://dx.doi.org/10.1007/s10791-005-5663-y
19. Codocedo, V., Taramasco, C., & Astudill, H. (2011). Cheating to achieve formal concept analysis over a large formal context. In Proceedings of international conference on concept lattices and their applications - CLA, Nancy, France (pp. 349-362).
20. B. Davey, and H. Priestley Introduction to lattices and order 1990 Cambridge University Press, Cambridge England
21. Dias, S. M., & Vieira, N. J. (2010). Reducing the size of concept lattices: The JBOS approach. In Proceedings of the 7th International Conference on Concept Lattices and Their Applications, Seville, Spain (Vol. 672, pp. 80-91).
22. S.M. Dias, and N.J. Vieira Applying the JBOS reduction method for relevant knowledge extraction Expert Systems with Applications 40 2013 1880 1887 http://dx.doi.org/10.1016/j.eswa.2012.http://dx.doi.org/10.010
23. A. Formica Concept similarity in formal concept analysis: An information content approach Knowledge-Based Systems 21 2008 80 87 http://dx.doi.org/10.1016/j.knosys.2007.02.001
24. Formica, A. (2012). Similarity reasoning for the semantic web based on fuzzy concept lattices: An informal approach. Information Systems Frontiers (pp. 1-10). doi: http://dx.doi.org/10.http://dx.doi.org/10.1007/s10796-011-9340-y.
25. Gajdos, P., Moravec, P., & Snásel, V. (2004). Concept lattice generation by singular value decomposition. In Proceedings of international conference on concept lattices and their applications - CLA (pp. 102 -110).
26. Ganter, B., & Stumme, G. (2003). Formal concept analysis: Methods and applications in computer science. Technical Report Otto - von - Guericke - Universitat Magdeburg. URL: .
27. B. Ganter, and S. Kuznetsov Pattern structures and their projections H. Delugach, G. Stumme, Conceptual structures: Broadening the base Lecture notes in computer science Vol. 2120 2001 Springer Berlin/ Heidelberg 129 142 http://dx.doi.org/10.1007/3-540-44583-8-10
28. B. Ganter, and R. Wille Formal concept analysis: Mathematical foundations 1999 Springer-Verlag Germany
29. Gél, A. (2011). Links between modular decomposition of concept lattice and bimodular decomposition of a context. In Proceedings of international conference on concept lattices and their applications - CLA, Nancy, France (pp. 393-403).
30. R. Godin, and H. Mili Building and maintaining analysis-level class hierarchies using galois lattices SIGPLAN Notices 28 1993 394 410 http://dx.doi.org/10.1145/167962.165931
31. R. Godin, E. Saunders, and J. Gecsei Lattice model of browsable data spaces Information Sciences 40 1986 89 116 http://dx.doi.org/10.1016/0020-0255(86)90001-0
32. B. Grand, M. Soto, and M.-A. Aufaure Conceptual and spatial footprints for complex systems analysis: Application to the semantic web Proceedings of the 20th international conference on database and expert systems applications DEXA '09 2009 Springer-Verlag Berlin, Heidelberg 114 127 http://dx.doi.org/10.1007/978-3-642-03573-9-9
33. P.D. Grünwald The minimum description length principle 2007 MIT Press
34. A.K. Jain, M.N. Murty, and P.J. Flynn Data clustering: A review ACM Computer Survey 31 1999 264 323 http://dx.doi.org/10.1145/331499.331504
35. Kauer, M., & Krupka, M. (2014). Removing an incidence from a formal context. In International conference on concept lattices and their applications - CLA (pp. 195-206).
36. M. Kaytoue, S.O. Kuznetsov, A. Napoli, and S. Duplessis Mining gene expression data with pattern structures in formal concept analysis Information Sciences 181 2011 1989 2001 http://dx.doi.org/10.1016/j.ins.20http://dx.doi.org/10.07.007
37. King, C. S. (2004). Complexity reduction in lattice-based information retrieval: theory, prototype development, and evaluation (Ph.D. thesis). City University of Hong Kong.
38. M. Klimushkin, S. Obiedkov, and C. Roth Approaches to the selection of relevant concepts in the case of noisy data L. Kwuida, B. Sertkaya, Proceedings of international conference on formal concept analysis - ICFCA 2010 Springer Berlin, Heidelberg 255 266
39. M. Krupka On complexity reduction of concept lattices: Three counter examples Information Retrieval 15 2012 151 156
40. C.A. Kumar Fuzzy clustering-based formal concept analysis for association rules mining Applied Artificial Intelligence 26 2012 274 301 http://dx.doi.org/10.1080/08839514.2012.648457
41. C.A. Kumar, and S. Srinivas Concept lattice reduction using fuzzy k-means clustering Expert Systems with Applications 37 2010 2696 2704 http://dx.doi.org/10.1016/j.eswa.2009.09.026
42. C.A. Kumar, and S. Srinivas Mining associations in health care data using formal concept analysis and singular value decomposition Journal of Biological Systems 18 2010 787 807 http://dx.doi.org/10.1142/S0218339010003512
43. S. Kuznetsov Stability as an estimate of the degree of substantiation of hypotheses derived on the basis of operational similarity Nauchn. Tekh. Inf. 1990 21 29
44. S. Kuznetsov On stability of a formal concept Annals of Mathematics and Artificial Intelligence 49 2007 101 115 http://dx.doi.org/10.1007/s10472-007-9053-6
45. S. Kuznetsov, S. Obiedkov, and C. Roth Reducing the representation complexity of lattice-based taxonomies U. Priss, S. Polovina, R. Hill, Proceedings of the international conference on conceptual structures - ICCS Lecture notes in artificial intelligence Vol. 4604 2007 Springer-Verlag Berlin, He idelberg 241 254
46. S.O. Kuznetsov, and J. Poelmans Knowledge representation and processing with formal concept analysis Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery 3 2013 200 215 http://dx.doi.org/10.1002/widm.1088
47. J. Li, C. Mei, and Y. Lv A heuristic knowledge-reduction method for decision formal contexts Computers & Mathematics with Applications 61 2011 1096 1106 http://dx.doi.org/10.1016/j.camwa.20http://dx.doi.org/10.12.060
48. J. Li, C. Mei, and Y. Lv Knowledge reduction in decision formal contexts Knowledge-Based Systems 24 2011 709 715 http://dx.doi.org/10.1016/j.knosys.2011.02.011
49. J. Li, C. Mei, and Y. Lv Knowledge reduction in real decision formal contexts Information Sciences 189 2012 191 207 http://dx.doi.org/10.1016/j.ins.2011.11.041
50. J. Li, C. Mei, and Y. Lv Incomplete decision contexts: Approximate concept construction, rule acquisition and knowledge reduction International Journal of Approximate Reasoning 54 2013 149 165 http://dx.doi.org/10.1016/j.ijar.2012.07.005
51. J. Liu, and J.-S. Mi A novel approach to attribute reduction in formal concept lattices Lecture notes in computer science - rough sets and knowledge technology Vol. 5009 2008 Springer Berlin, Heidelberg 426 433
52. J. Medina Relating attribute reduction in formal, object-oriented and property-oriented concept lattices Computers & Mathematics with Applications 64 2012 1992 2002 http://dx.doi.org/10.1016/j.camwa.2012.03.087
53. J. Muangprathub, V. Boonjing, and P. Pattaraintakorn A new case-based classification using incremental concept lattice knowledge Data & Knowledge Engineering 83 2013 39 53 http://dx.doi.org/10.1016/j.datak.2012.http://dx.doi.org/10.001
54. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal Discovering frequent closed itemsets for association rules Database theory ICDT99 1999 Springer 398 416
55. Z. Pawlak Rough sets International Journal of Parallel Programming 11 1982 341 356 http://dx.doi.org/10.1007/BF01001956
56. Pei, D., Li, M. -Z., & Mi, J. -S. (2011). Attribute reduction in fuzzy decision formal contexts. In 2011 International conference on machine learning and cybernetics (ICMLC) (Vol. 1, pp. 204 -208). doi: http://dx.doi.org/10.http://dx.doi.org/10.1109/ICMLC.2011.6016665.
57. D. Pei, and J.-S. Mi Attribute reduction in decision formal context based on homomorphism International Journal of Machine Learning and Cybernetics 2 2011 289 293 http://dx.doi.org/10.1007/s13042-011-0034-z
58. N. Pernelle, M.-C. Rousset, H. Soldano, and V. Ventos ZooM: A nested Galois lattices-based system for conceptual clustering Journal of Experimental & Theoretical Artificial Intelligence 14 2002 157 187 http://dx.doi.org/10.1080/09528130210164189
59. L. Pisková, T. Horv Áth, and S. Kralči ranking formal concepts by utilizing matrix factorization, Studia Universitatis Babes-Bolyai Informatica 59 2014
60. Poelmans, J., Elzinga, P., Viaene, S., & Dedene, G. (2010). Formal concept analysis in knowledge discovery: A survey. In ICCS (pp. 139-153). doi: http://dx.doi.org/10.http://dx.doi.org/10.1007/978-3-642-14197-3-15.
61. J. Poelmans, S.O. Kuznetsov, D.I. Ignatov, and G. Dedene Formal concept analysis in knowledge processing: A survey on models and techniques Expert Systems with Applications 40 2013 6601 6623 http://dx.doi.org/10.1016/j.eswa.2013.05.007
62. Poshyvanyk, D., & Marcus, A. (2007). Combining formal concept analysis with information retrieval for concept location in source code. In 15th IEEE international conference on program comprehension, 2007. ICPC '07 (pp. 37 -48). doi: http://dx.doi.org/10.http://dx.doi.org/10.1109/ICPC.2007.13.
63. U. Priss, and L.J. Old Data weeding techniques applied to roget's thesaurus Proceedings international conference on knowledge processing and data analysis KONT'07/KPP'07 2011 Springer-Verlag Berlin, Heidelberg 150 163
64. J.-J. Qi Attribute reduction in formal contexts based on a new discernibility matrix Journal of Applied Mathematics and Computing 30 2009 305 314 http://dx.doi.org/10.1007/s12190-008-0174-9
65. T.M. Riadh, B. Le Grand, M.-A. Aufaure, and M. Soto Conceptual and statistical footprints for social networks' characterization Proceedings of the 3rd workshop on social network mining and analysis SNA-KDD '09 2009 ACM New York, NY, USA 1 8 http://dx.doi.org/10.1145/1731011.1731019
66. M.D. Rice, and M. Siff Clusters, concepts, and pseudometrics Electronic Notes in Theoretical Computer Science 40 2001 323 346 http://dx.doi.org/10.1016/S1571-0661(05)80060-X
67. Roth, C., Obiedkov, S., & Kourie, D. G. (2006). Towards concise representation for taxonomies of epistemic communities. In Proceeding of the international conference on concept lattices and their applications (pp. 205-218).
68. Shao, M. -W. (2005). The reduction for two kind of generalized concept lattices. In Proceedings of 2005 international conference on machine learning and cybernetics (Vol. 4, pp. 2217-2222). doi: http://dx.doi.org/10.http://dx.doi.org/10.1109/ICMLC.2005.1527313.
69. Snásel, V., Dahwa Abdulla, H., & Polovincak, M. (2007). Behavior of the concept lattice reduction to visualizing data after using matrix decompositions. In 4th International conference on innovations in information technology, IIT '07 (pp. 392 -396). doi: http://dx.doi.org/10.http://dx.doi.org/10.1109/IIT.2007.4430480.
70. Snásel, V., Polovincak, M., Abdulla, H. M. D., & Horak, Z. (2008). On concept lattices and implication bases from reduced contexts. In Proceedings of the international conference on conceptual structures - ICCS (pp. 83-90).
71. Soldano, H., Ventos, V., Champesme, M., & Forge, D. (2010). Incremental construction of alpha lattices and association rules. In knowledge-based and intelligent information and engineering systems (pp. 351-360).
72. G. Stumme, R. Taouil, Y. Bastide, N. Pasquier, and L. Lakhal Computing iceberg concept lattices with titanic Data and Knowledge Engineering 189-222 34 2002 http://dx.doi.org/10.1016/S0169-023X(02)00057-5
73. P.-N. Tan, M. Steinbach, and V. Kumar Introduction to data mining 2005 Addison-Wesley Longman Publishing Co., Inc. Boston, MA, USA
74. Taouil, R., & Bastide, Y. (2001). Computing proper implications. In 9th International Conference on Conceptual Structures, Stanford, CA, US (p. 13).
75. V. Ventos, and H. Soldano Alpha galois lattices: An overview Proceedings of international conference on formal concept analysis - ICFCA 2005 Springer 298 313
76. B. Vo, F. Coenen, and B. Le A new method for mining frequent weighted itemsets based on wit-trees Expert Systems with Applications 40 2013 1256 1264 http://dx.doi.org/10.1016/j.eswa.2012.08.065
77. Wang, X., & Zhang, W. (2010). Attribute reduction in concept lattices based on deletion transformations. In Sixth international conference on natural computation - ICNC (Vol. 4, pp. 2065 -2069). doi: http://dx.doi.org/10.http://dx.doi.org/10.1109/ICNC.20http://dx.doi.org/10.5582340.
78. Wang, J., Liang, J., & Qian, Y. (2010). A heuristic method to attribute reduction for concept lattice. In International conference on machine learning and cybernetics, ICMLC (pp. 483-487). doi: http://dx.doi.org/10.http://dx.doi.org/10.1109/ICMLC.20http://dx.doi.org/10.5581015.
79. X. Wang, and J. Ma A novel approach to attribute reduction in concept lattices G.-Y. Wang, J. Peters, A. Skowron, Y. Yao, Rough sets and knowledge technology Lecture notes in computer science Vol. 4062 2006 Springer Berlin/ Heidelberg 522 529 http://dx.doi.org/10.1007/11795131-76
80. H. Wang, and W.-X. Zhang Approaches to knowledge reduction in generalized consistent decision formal context Mathematical and Computer Modelling 48 2008 1677 1684 http://dx.doi.org/10.1016/j.mcm.2008.06.007
81. X. Wang, and W. Zhang Relations of attribute reduction between object and property oriented concept lattices Knowledge-Based System 21 2008 398 403
82. X. Wang, and W. Zhang Concept lattices of subcontexts of a context Fundamentals of Information 90 2009 157 169
83. L. Wei, J. Qi, and W. Zhang Attribute reduction theory of concept lattice based on decision formal contexts Science in China Series F: Information Sciences 51 2008 910 923 http://dx.doi.org/10.1007/s11432-008-0067-4
84. Wille, R. (1982). Restructuring lattice theory: An approach based on hierarchies of concepts. In I. Rival (Ed.): Ordered sets (pp. 445-470).
85. Yan, S., Yun, L., & Luan, L. (2009). A concept similarity method in structural and semantic levels. In 2009 Second international symposium on information science and engineering (ISISE) (pp. 620 -623). doi: http://dx.doi.org/10.http://dx.doi.org/10.1109/ISISE.2009.133.
86. Yevtushenko, S. A. (2000). System of data analysis "concept explorer". In Proceedings of the 7th national conference on artificial intelligence KII-2000, Russia (pp. 127-134).
87. U. Yun, H. Shin, K.H. Ryu, and E. Yoon An efficient mining algorithm for maximal weighted frequent patterns in transactional databases Knowledge-Based Systems 33 2012 53 64 http://dx.doi.org/10.1016/j.knosys.2012.02.002
88. S. Zhang, P. Guo, J. Zhang, X. Wang, and W. Pedrycz A completeness analysis of frequent weighted concept lattices and their algebraic properties Data & Knowledge Engineering 2012 104 117 http://dx.doi.org/10.1016/j.datak.2012.08.002
89. W. Zhang, L. Wei, and J. Qi Attribute reduction theory and approach to concept lattice Science in China Series F: Information Sciences 48 2005 713 726 http://dx.doi.org/10.1360/122004-104