Armenian Journal of Mathematics

Characterizing trees in property-oriented concept lattices

Mao, Hua (2016) Characterizing trees in property-oriented concept lattices. Armenian Journal of Mathematics, 8 (2). pp. 86-95. ISSN 1829-1163

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
231Kb

Abstract

Property-oriented concept lattices are systems of conceptual clusters called property-oriented concepts, which are partially ordered by the subconcept/superconcept relationships. Property-oriented concept lattices are basic structures used in formal concept analysis. In general, a property-oriented concept lattice may contain overlapping clusters and is not to be a tree construction. Additionally, tree-like classification schemes are appealing and are produced by several clustering methods. In this paper, we present necessary and sufficient conditions on input data for the output property-oriented concept lattice to form a tree after one removes its greatest element. After applying to input data for which the associated property-oriented concept lattice is a tree, we present an algorithm for computing property-oriented concept lattices.

Item Type:Article
Subjects:05-xx Combinatorics
06-xx Order, lattices, ordered algebraic structures
ID Code:587
Deposited By:Professor hua mao
Deposited On:03 Nov 2016 11:53
Last Modified:22 Dec 2016 14:56

Repository Staff Only: item control page