2009•Journal of Taiyuan University of Science and TechnologyRequires access

An Updating Algorithm of Concept Lattice Based on Concept Promoting

Sulan Zhang

Open publisher page 0 citations

Abstract

Concept lattice is an effective tool for data mining since its structure reflects the vivid simplicity of the relationship between generalization and specialization among concept lattices.But the efficiency is lower when the concept lattice generates directly from the formal context.For the merging of many attributes in the formal context,an updating algorithm UCP of concept lattice based on concept promoting is presented in order to improve the construction efficiency.The algorithm makes full use of the concept lattice before the attributes merge.Some parts of nodes are updated,therefore the updating efficiency is improved.Finally,experiment results show the validity of the algorithm by using VC++6.0 and Oracle9i as development tools and taking the celestial spectrum data as the formal context.

About this research paper

What this paper is about

Concept lattice is an effective tool for data mining since its structure reflects the vivid simplicity of the relationship between generalization and specialization among concept lattices.But the efficiency is lower when the concept lattice generates directly from the formal context.For the merging of many attributes in the formal context,an updating algorithm UCP of concept lattice based on concept promoting is presented in order to improve the construction efficiency.The algorithm makes full use of the concept lattice before the attributes merge.Some parts of nodes are updated,therefore the updating efficiency is improved.Finally,experiment results show the validity of the algorithm by using VC++6.0 and Oracle9i as development tools and taking the celestial spectrum data as the formal context.

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 lattice is an effective tool for data mining since its structure reflects the vivid simplicity of the relationship between generalization and specialization among concept lattices.But the efficiency is lower when the concept lattice generates directly from the formal context.For the merging of many attributes in the formal context,an updating algorithm UCP of concept lattice based on concept promoting is presented in order to improve the construction efficiency.The algorithm makes full use of the concept lattice before the attributes merge.Some parts of nodes are updated,therefore the updating efficiency is improved.Finally,experiment results show the validity of the algorithm by using VC++6.0 and Oracle9i as development tools and taking the celestial spectrum data as the formal context.

Key concepts: Lattice Miner, Merge (version control), Lattice (music), Formal concept analysis, Algorithm, Computer science, Theoretical computer science, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
An Updating Algorithm of Concept Lattice Based on Concept Promoting — Research Paper | ScholarLens