Theory and Algorithms Research on New Concept Lattice Generated Based on Detrimental of Old Concept Lattice

Article Preview

Abstract:

This paper reveals the changesof concept collection and propertyof Hasse graph after detrimental. Detrimental construction algorithm of concept latticethis paper present is valid. In practical applications, if the property changes, you need to remove some of the properties, using the algorithm proposed in this paper can slim down directly. Based on above content, this paper is divided into three parts; the first part introduces the basic concepts of concept lattices and its basic structure. The second part introduces the basic principle of concept lattice attribute reduction and itsalgorithm. The third part is focus onincremental and detrimental algorithm analysis of node types.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2004-2007

Citation:

Online since:

January 2015

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2015 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Nourine L,Raynaud O.Afastalgorithm for Building Lattices[J].Information Process Letter.1999,71(5/6):199—204.

Google Scholar

[2] Godin R,Moussaoui,Alaui H.an Incrementalconcept information Algorithm based on Galois(Concept)Lattices[J].Computational Intelligence,1995,11(2):246—267.

Google Scholar

[3] Van Der Merwe D,Obiedkov S,Kourie D.Addintent:A Newincremental Algorithm for Constructing Concept Lattices[G]/LNCS 296 1;Proc Of The 2nd IntConson Formconceptanalysis.Berlin:Springer,2004:372—385.

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

Google Scholar

[4] Liu Zongtian,Qiang Yu,Zhou Wen,Et A1.A Fuzzy Conceptlattice Model And its Incremental Construction Algorithm[J].Chinese Journal of Computers,2007,30(2):184-188.

Google Scholar