Concept lattice is a powerful tool for data analysis. It has been applied widely to machine learning, knowledge discovery and software engineering and so on. Some aspects of concept lattice have been studied widely such as building lattice and rules extraction, as for its algebraic properties, there has not been discussed systematically. The paper suggests a binary operation between the elements for the set of all concepts in formal context. This turns the concept lattice in general significance into those with operators. We also proved that the concept lattice is a lattice in algebraic significance and studied its algebraic properties.These results provided theoretical foundation and a new method for further study of concept lattice.
[1]
Frank Tip,et al.
Reengineering class hierarchies using concept analysis
,
1998,
SIGSOFT '98/FSE-6.
[2]
Gerd Stumme,et al.
CEM-Visualisation and Discovery in Email
,
2000,
PKDD.
[3]
Peter W. Eklund,et al.
Scalability in Formal Concept Analysis
,
1999,
Comput. Intell..
[4]
Gregor Snelting,et al.
Reengineering of configurations based on mathematical concept analysis
,
1996,
TSEM.
[5]
Peter W. Eklund,et al.
Algorithms for Creating Relational Power Context Families from Conceptual Graphs
,
1999,
ICCS.