关键词: 粗值关系, 概念格, 元组概念, 属性值概念, 横向并

Abstract: Relational data acquisition is an important field.In order to improve the utility and pertinence to data mining，this paper proposes a method for alternately constructing tuple-concepts and attribute-value-concepts from a relation，which is based on the hierarchies of attribute domains.These hierarchies of attribute domains are forbidden in the ordinary relations.This paper further defines rough-valued relations.Consequently，each tuple-concept is corresponding to a concept extent of some rough-valued relation，and it is proved that the concept lattice of the horizontal union of a relation and its rough-valued relations are exactly equal to the horizontal union of concept lattices of these factor relations.Thus，one can construct a complex concept lattice from simple ones，which may reduce complexity of constructing concept lattice of a complex relation.

Key words: rough-valued relations, concept lattices, tuple-concepts, attribute-value-concepts, horizontal union