2008•Caai Transactions on Intelligent SystemsRequires access

An improved algorithm based on concept specialization for constructing concept lattices

Sulan Zhang

Open publisher page 0 citations

Abstract

Concept lattices are the core data structures in formal concept analysis.The widespread application of concept analysis is limited by the difficulty of constructing a concept lattice.An incrementally updating construction algorithm based on concept spcialization was developed after it was realized that the attributes in the formal context can be decomposed into several new attributes,or more specialized concepts.The algorithm,with decomposed attributes and a corresponding formal context,compares the concept lattice formed with the new attributes and one of the sub-lattices of the original concept lattice,then upgrades the concept lattice according to results from the comparisons.In this way the number of comparisons is reduced and the efficiency of constructing the concept lattice is improved.Experiment results,with celestial spectrum data as the formal context,verified the validity of the algorithm.

About this research paper

What this paper is about

Concept lattices are the core data structures in formal concept analysis.The widespread application of concept analysis is limited by the difficulty of constructing a concept lattice.An incrementally updating construction algorithm based on concept spcialization was developed after it was realized that the attributes in the formal context can be decomposed into several new attributes,or more specialized concepts.The algorithm,with decomposed attributes and a corresponding formal context,compares the concept lattice formed with the new attributes and one of the sub-lattices of the original concept lattice,then upgrades the concept lattice according to results from the comparisons.In this way the number of comparisons is reduced and the efficiency of constructing the concept lattice is improved.Experiment results,with celestial spectrum data as the formal context,verified the validity of the algorithm.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Concept lattices are the core data structures in formal concept analysis.The widespread application of concept analysis is limited by the difficulty of constructing a concept lattice.An incrementally updating construction algorithm based on concept spcialization was developed after it was realized that the attributes in the formal context can be decomposed into several new attributes,or more specialized concepts.The algorithm,with decomposed attributes and a corresponding formal context,compares the concept lattice formed with the new attributes and one of the sub-lattices of the original concept lattice,then upgrades the concept lattice according to results from the comparisons.In this way the number of comparisons is reduced and the efficiency of constructing the concept lattice is improved.Experiment results,with celestial spectrum data as the formal context,verified the validity of the algorithm.

Key concepts: Lattice Miner, Formal concept analysis, Lattice (music), Computer science, Algorithm, Theoretical computer science, Physics, Acoustics

Related papers

Back to paper searchBrowse research topicsOriginal source
An improved algorithm based on concept specialization for constructing concept lattices — Research Paper | ScholarLens