Reduction method for concept lattices based on rough set theory and its application

Computers and Mathematics with Applications

Volumn 53, Issue 9, 2007, Pages 1390-1410

  Liu, Min ^a   Shao, Mingwen ^a   Zhang, Wenxiu ^b   Wu, Cheng ^a  

^a TSINGHUA UNIVERSITY   (China)

^b XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Attribute reduction; Concept lattice; Formal context; Object reduction; Rough set; Scheduling

Indexed keywords

COMPUTATION THEORY; FUNCTION EVALUATION; INFORMATION SYSTEMS; ROUGH SET THEORY; SCHEDULING;

ATTRIBUTE REDUCTION; CONCEPT LATTICES; FORMAL CONCEPT ANALYSIS; OBJECT REDUCTION;

DATA REDUCTION;

EID: 34248562070     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2006.03.040     Document Type: Article

References (31)

1. Wille R. Restructuring lattice theory: An approach based on hierarchies of concepts. In: Rival I. (Ed). Ordered Sets (1982), Reidel, Dordrecht, Boston 445-470
2. Gediga G., and Wille R. Formal Concept Analysis, Mathematic Foundations (1999), Springer, Berlin
3. Carpineto C., and Romano G. A lattice conceptual clustering system and its application to browsing retrieval. Machine Learning 10 (1996) 95-122
4. M. Faid, R. Missaoi, R. Godin, Mining complex structures using context concatenation in formal concept analysis, in: International KRUSE Symposium, Vancouver, BC, 11-13 August, 1997
5. Godin R., and Missaoi R. An incremental concept formation approach for learning from databases. Formal methods in databases and software engineering. Theoretical Computer Science 133 (1994) 387-419 (special issue)
6. Harms S.K., and Deogum J.S. Sequential association rule mining with time lags. Journal of Intelligent Information Systems 22 1 (2004) 7-22
7. Wille R. Knowledge acquisition by methods of formal concept analysis. In: Diday E. (Ed). Data Analysis, Learning Symbolic and Numeric Knowledge (1989), Nova Science, New York 365-380
8. Lehmann F., and Wille R. A Triadic Approach to Formal Concept Analysis. Lecture Notes in Artificial Intelligence vol. 954 (1995) 32-43
9. Ferre S., and Ridoux O. A logical generalization of formal concept analysis. The Eighth International Conference on Conceptual Structures. ICCS2000, Darmstadt, Germany. Lecture Notes in Artificial Intelligence vol. 1867 (2000) 371-384
10. Deogun J.S., and Saqer J. Monotone concepts for formal concept analysis. Discrete Applied Mathematics 144 (2004) 70-78
11. Pawlak Z. Rough sets. International Journal of Computer and Information Science 11 (1982) 341-356
12. Pawlak Z. Rough sets theory and it's application to data analysis. Cybernetics Systems, An International Journal 29 (1998) 661-688
13. A. Skowron, A synthesis of decision rules: Applications of discernibility matrix, in: Proceedings of the International Conference on Intelligent Information Systems, Augustow, Poland, 1993, pp. 30-46
14. Thusaku S. Rule discovery in database with missing values based on rough set model. In: Zhong N., and Zhou L.Z. (Eds). Methodologies for Knowledge Discover and Data Mining (1999), Springer, Beijing, China 274-278
15. Y.Y. Yao, Concept lattices in rough set theory, in: Proceedings of 23rd International Meeting of the North American Fuzzy Information Processing Society, 2004
16. Y.Y. Yao, A comparative study of formal concept analysis and rough set theory in data analysis, rough sets and current trends in computing, in: Proceedings of 3rd International Conference, RSCT'04, 2004
17. G. Gediga, I. Duntsch, Modal-style operators in qualitative data analysis, in: Proceedings of the 2002 IEEE International Conference on Data Mining, 2002, pp. 155-162
18. Hu K., Sui Y., Lu Y., Wang J., and Shi C. Concept approximation in concept lattice, knowledge discovery and data mining. Proceedings of the 5th Pacific-Asia Conference. PAKDD 2001. Lecture Notes in Computer Science vol. 2035 (2001) 167-173
19. Kent R.E. Rough concept analysis: A synthesis of rough sets and formal concept analysis. Fundamenta Informaticae 27 (1996) 169-181
20. Saquer J., and Deogun J.S. Formal rough concept analysis. New directions in Rough Sets, Data Mining, and Granular-Soft. Lecture Notes in Computer Science vol. 1711 (1999), Springer, Berlin 91-99
21. Y.Y. Yao, Y.H. Chen, Rough set approximations in formal concept analysis, in: Proceedings of 23rd International Meeting of the North American Fuzzy Information Processing Society, 2004
22. Shao M.W., and Zhang W.X. The Set Approximation in Formal Contexts. Lecture Notes in Computer science vol. 3641 (2005), Springer, Berlin 43-53
23. Pagliani P. From concept lattices to approximation spaces: Algebraic structures of some spaces of partial objects. Fundamenta Informaticae 18 (1993) 1-18
24. Wolff K.E. A conceptual view of knowledge bases in rough set theory. Rough Sets and Current Trends in Computing (Second International Conference RSCTC 2000). Lecture Notes in Computer Science vol. 2005 (2001), Springer, Berlin 220-228
25. Duntsch I., and Gediga G. Approximation operators in qualitative data analysis. In: Swart H., Orlowska E., Schmidt G., and Roubens M. (Eds). Theory and Application of Relational Structures as Knowledge Instruments (2003), Springer, Heidelberg 216-233
26. Peter B. Scheduling Algorithms. 3rd ed. (2001), Springer, Berlin
27. Liu M., Dong M.Y., and Wu C. An iterative layered tabu search algorithm for complex job shop scheduling problem. Chinese Journal of Electronics 14 3 (2005) 519-523
28. Skowron A., and Rauszer C. The discernibility matrices and functions in information systems. In: Slowinski R. (Ed). Intelligent Decision Support: Handbook of Applications and Advances of Rough Sets Theory (1992), Kluwer Academic Publisher, Dordrecht 331-362
29. M. Kryszkiewicz, Knowledge reduction in information systems, Ph.D. Thesis, University of Technology, Warsaw, 1994
30. Skowron A. Extracting laws from decision tables. Computational Intelligence 11 2 (1995) 371-388
31. Asano M., and Ohta H. A heuristic for job shop scheduling to minimize total weighted tardiness. Computers and Industrial Engineering 42 (2002) 137-147