Knowledge reduction in formal decision contexts based on an order-preserving mapping

International Journal of General Systems

Volumn 41, Issue 2, 2012, Pages 143-161

  Li, Jinhai ^a   Mei, Changlin ^a   Lv, Yuejin ^b  

^a XI'AN JIAOTONG UNIVERSITY   (China)

^b GUANGXI UNIVERSITY   (China)

Author keywords

concept lattice; formal concept analysis; formal context; formal decision context; knowledge reduction; order preserving mapping

Indexed keywords

CONCEPT LATTICES; FORMAL CONCEPT ANALYSIS; FORMAL CONTEXT; FORMAL DECISION CONTEXT; KNOWLEDGE REDUCTION;

INFORMATION ANALYSIS; MAPPING;

BOOLEAN FUNCTIONS;

EID: 84863069737     PISSN: 03081079     EISSN: 15635104     Source Type: Journal    
DOI: 10.1080/03081079.2011.634410     Document Type: Article

References (32)

1. Arévalo, G., Desnos, N., Huchard, M., Urtado, C. and Vauttier, S., 2009. Formal concept analysisbased service classification to dynamically build efficient software component directories. International journal of general systems, 38 (4), 427-453.
2. Bastide, Y., Pasquier, N., Taouil, R., Stumme, G. and Lakhal, L., 2000. Mining minimal nonredundant association rules using frequent closed item sets. In: Proceedings of the 1st international conference on computational logic, Berlin: Springer-Verlag, 972-986.
3. Bělohlávek, R., Baets, B.D., Outrata, J. and Vychodil, V., 2009. Inducing decision trees via concept lattices. International journal of general systems, 38 (4), 455-467.
4. Boulicaut, J.-F., Bykowski, A. and Rigotti, C., 2000. Approximation of frequency queries by means of free-sets. In: Proceedings of the 4th European conference on principles and practice of knowledge discovery in databases, Berlin: Springer-Verlag, 75-85.
5. Boulicaut, J.-F., Bykowski, A. and Rigotti, C., 2003. Free-sets: A condensed representation of Boolean data for the approximation of frequency queries. Data mining and knowledge discovery, 7 (1), 5-22.
6. Calders, T., Rigotti, C. and Boulicaut, J.-F., 2005. A survey on condensed representations for frequent sets. In: J.-F. Boulicaut, L. De Raedt and H. Mannila, eds. Constraint-based mining and inductive databases. Berlin: Springer, 64-80.
7. Carpineto, C. and Romano, G., 1993. Galois: An order-theoretic approach to conceptual clustering. In: Proceedings of the 1993 international conference on machine learning (ICML'93), San Francisco: Morgan Kaufmann, 33-40.
8. Carpineto, C. and Romano, G., 1996. A lattice conceptual clustering system and its application to browsing retrieval. Machine learning, 10, 95-122. (Pubitemid 126724381)
9. Carpineto, C. and Romano, G., 2004. Exploiting the potential of concept lattices for information retrieval with CREDO. Journal of universal computer sciences, 10 (8), 985-1013. (Pubitemid 41151532)
10. Cole, R., Eklund, P. and Stumme, G., 2003. Document retrieval for e-mail search and discovery using formal concept analysis. Applied artificial intelligence, 17 (3), 257-280.
11. Elloumi, S., Jaam, J., Hasnah, A., Jaoua, A. and Nafkha, I., 2004. A multi-level conceptual data reduction approach based on the Lukasiewicz implication. Information sciences, 163 (4), 253-262.
12. Ganter, B. and Wille, R., 1999. Formal concept analysis: Mathematical foundations. Berlin: Springer.
13. Godin, R., Missaoui, R. and Alaoui, H., 1995. Incremental concept formation algorithm based on Galois (concept) lattices. Computation intelligence, 11 (2), 246-267.
14. Hamrouni, T., Ben Yahia, S. and Mephu Nguifo, E., 2008. Succinct minimal generators: Theoretical foundations and applications. International journal of foundations of computer science, 19 (2), 271-296.
15. Ho, T.B., 1995. An approach to concept formation based on formal concept analysis. IEICE transactions on information and systems, E782D (5), 553-559.
16. Hungerford, T.M., 1974. Algebra. Berlin: Springer-Verlag.
17. Li, J., Mei, C. and Lv, Y., 2011. A heuristic knowledge-reduction method for decision formal contexts. Computers and mathematics with applications, 61 (4), 1096-1106.
18. Liu, M., Shao, M.W., Zhang, W.X. and Wu, C., 2007. Reduction method for concept lattices based on rough set theory and its application. Computers and mathematics with applications, 53 (9), 1390-1410. (Pubitemid 46756160)
19. Nguyen, P.H.P. and Corbett, D., 2006. A basic mathematical framework for conceptual graphs. IEEE transactions on knowledge and data engineering, 18 (2), 261-271. (Pubitemid 43281192)
20. Skowron, A., 1993. Boolean reasoning for implication rules generation. Methodologies for intelligent systems. Berlin: Springer-Verlag, 295-305.
21. Skowron, A. and Rauszer, C., 1992. The discernibility matrices and functions in information systems. Intelligent decision support: handbook of application and advances of the rough sets theory. Boston/Dordrecht/London: Kluwer Academic Publishers, 331-362.
22. Stumme, G., Wille, R. and Wille, U., 1998. Conceptual knowledge discovery in databases using formal concept analysis methods. Lecture notes in artificial intelligence, 1510, 450-458. (Pubitemid 128145865)
23. Valtchev, P., Missaoui, R. and Godin, R., 2004. Formal concept analysis for knowledge discovery and data mining: The new challenge. In: Proceedings of the 2nd international conference on formal concept analysis, Berlin: Springer-Verlag, 352-371. (Pubitemid 38271487)
24. Wang, H. and Zhang, W.X., 2008a. Approaches to knowledge reduction in generalized consistent decision formal context. Mathematical and computer modelling, 48, 1677-1684.
25. Wang, X. and Zhang, W.X., 2008b. Relations of attribute reduction between object and property oriented concept lattices. Knowledge-based systems, 21, 398-403.
26. Wei, L., Qi, J.J. and Zhang, W.X., 2008. Attribute reduction theory of concept lattice based on decision formal contexts. Science in China: Series F - information sciences, 51 (7), 910-923.
27. Wille, R., 1982. Restructuring lattice theory: An approach based on hierarchies of concepts. In: I. Rival, ed. Ordered sets. Dordrecht: Reidel, 445-470.
28. Wu, W.Z., Leung, Y. and Mi, J.S., 2009. Granular computing and knowledge reduction in formal contexts. IEEE transactions on knowledge and data engineering, 21 (10), 1461-1474.
29. Zaki, M.J., 2004. Mining non-redundant association rules. Data mining and knowledge discovery, 9 (3), 223-248. (Pubitemid 39193158)
30. Zhang, W.X., Ma, J.M. and Fan, S.Q., 2007. Variable threshold concept lattices. Information sciences, 177 (22), 4883-4892.
31. Zhang, W.X. and Qiu, G.F., 2005. Uncertain decision making based on rough sets. Beijing: Tsinghua University Press.
32. Zhang, W.X., Wei, L. and Qi, J.J., 2005. Attribute reduction theory and approach to concept lattice. Science in China: Series F - information sciences, 48 (6), 713-726. (Pubitemid 44113733)