p.1881
p.1885
p.1889
p.1895
p.1901
p.1905
p.1909
p.1915
p.1919
Research on Computing the Covers of a Given Concept
Abstract:
In order to construct concept lattice without rebuilding the whole structure, we introduced some basic notions in FCA and Graph, such as concept, cover, maxmod and so on. In Section 2, we elaborated the procedures of a proposed algorithm for computing the covers by adding non-dominating maxmods to the intent of a given concept. After that we analyzed time complexity with comparison to other relevant researches and proved that our algorithm is superior to other algorithms. In the end, we discussed a few open issues.
Info:
Periodical:
Pages:
1901-1904
Citation:
Online since:
January 2014
Authors:
Price:
Сopyright:
© 2014 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: