A Knowledge Reduction Method Based on Concept Lattice


Article Preview

Formal concept analysis and rough set theory provide two different methods for data analysis and knowledge processing. Knowledge reduct in this paper combines the two models. For an initial data sets described by formal context, look for absolute necessary attribute sets by applying rough set theory. The sets can image the concepts and hiberarchy structure completely. Then calculate the value cores of attributes values for all objects and delete redundant attributes. At last, delete repeated instances and get the minimum formal context. Construct the concept lattice of the minimum formal context can diminish the size of concept lattice of the initial table at a certain extent.



Advanced Materials Research (Volumes 219-220)

Edited by:

Helen Zhang, Gang Shen and David Jin






X. Y. Wang "A Knowledge Reduction Method Based on Concept Lattice", Advanced Materials Research, Vols. 219-220, pp. 604-607, 2011

Online since:

March 2011





[1] Yang Baohua. A New Attribute Reducing Algorithm[J]. Computer Technology and Development, 2006, 16(5): 80–84.

[2] Wang Hong, Zhang Wenxiu. Comparative Study on Formal Concept Analysis and Rough Set Theory [J]. Computer Engineering. 2006, 32(8): 42–44.

[3] Zhang Dongling. Realization of Attribute Reducing Algorithm Based on Rough Set[J]. Computer Applications, 2006, 26(6): 78-82.

[4] Ho T B. Incremental Conceptual clustering in the framework of galois lattice[C]. In: Lu H, Motoda H, Ziu H eds. KDD: Techniques and Applications, Word Scientific, 1997: 49~64.

[5] Huaiguo F, Engelbert M N. A Parallel Algorithm to Generate Formal concept for large Data[C]. In: Second International Conference on Formal Concept Analysis(ICFCA2004) , Sydney, 2004: 394~401.

DOI: 10.1007/978-3-540-24651-0_33

[6] Mineau G W, Godin R. Automatic structuring of knowledge bases by conceptual clustering[J]. IEEE Trans Knowledge Data Eng, 1995; 7( 5) : 824~829.

DOI: 10.1109/69.469834

In order to see related information, you need to Login.