Comparison of concept lattice reduction based on discernbility matrixes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Attribute reduction is an important issue in formal concept analysis, and its efficient reduction algorithm is accordingly important. For two existing lattice reduction methods based on different discernbility matrixes, we give their algorithms and compare their runtime. The experiments show the great difference about these two methods, which reveals that it will be more efficient from the viewpoint of parent-child relation when study the lattice reduction of formal contexts and other relative problems.

Original languageEnglish
Title of host publicationProceedings of 2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011
Pages1118-1123
Number of pages6
DOIs
StatePublished - 2011
Event2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011 - Guilin, Guangxi, China
Duration: 10 Jul 201113 Jul 2011

Publication series

NameProceedings - International Conference on Machine Learning and Cybernetics
Volume3
ISSN (Print)2160-133X
ISSN (Electronic)2160-1348

Conference

Conference2011 International Conference on Machine Learning and Cybernetics, ICMLC 2011
Country/TerritoryChina
CityGuilin, Guangxi
Period10/07/1113/07/11

Keywords

  • Concept lattice
  • Discernbility matrix
  • Formal context
  • Reduction

Fingerprint

Dive into the research topics of 'Comparison of concept lattice reduction based on discernbility matrixes'. Together they form a unique fingerprint.

Cite this