Publication Details:

Established in 2008

Journal or Publication Title:

Armenian Journal of Mathematics=Հայկական մաթեմատիկական հանդես

Date of publication:

2016

Volume:

8

Number:

2

ISSN:

1829-1163

Official URL:

Contributor(s):

Գլխ. խմբ.՝ Անրի Ներսեսյան ; Պատ. խմբ.՝ Լինդա Խաչատրյան ; Խմբ. տեղակալ՝ Ռաֆայել Բարխուդարյան

Coverage:

86-95

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.

Publisher:

National Academy of Sciences of Armenia

Date created:

2016-12-22

Format:

pdf

Identifier:

oai:arar.sci.am:13295

General note:

Electronic Open Access Publication of the National Academy of Sciences of Armenia

Digitization:

ՀՀ ԳԱԱ Հիմնարար գիտական գրադարան

Location of original object:

ՀՀ ԳԱԱ Հիմնարար գիտական գրադարան