2008•Journal of Guangxi Normal UniversityRequires access

Structure of Attribute Reduction Set of Concept Lattices

LI Hai-long

Open publisher page 0 citations

Abstract

Formal concept analysis is a powerful tool for data analysis in machine learning,data mining,knowledge discovery and information retrieval.The attribute reduction of concept lattices is a kind of methods which reveals the elementary character of concept lattices attribute.This paper proved that the equivalent relative necessary attribute are not in the same attribute reduction.The intersection of attribute reduction and any relative necessary attribute equivalence class is nonempty.The attribute reduction consists of the core attributes and the relative necessary attributes which are from every relative necessary attribute equivalence class,and thus thoroughly revealed the structure of attribute reduction.

About this research paper

What this paper is about

Formal concept analysis is a powerful tool for data analysis in machine learning,data mining,knowledge discovery and information retrieval.The attribute reduction of concept lattices is a kind of methods which reveals the elementary character of concept lattices attribute.This paper proved that the equivalent relative necessary attribute are not in the same attribute reduction.The intersection of attribute reduction and any relative necessary attribute equivalence class is nonempty.The attribute reduction consists of the core attributes and the relative necessary attributes which are from every relative necessary attribute equivalence class,and thus thoroughly revealed the structure of attribute reduction.

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

Formal concept analysis is a powerful tool for data analysis in machine learning,data mining,knowledge discovery and information retrieval.The attribute reduction of concept lattices is a kind of methods which reveals the elementary character of concept lattices attribute.This paper proved that the equivalent relative necessary attribute are not in the same attribute reduction.The intersection of attribute reduction and any relative necessary attribute equivalence class is nonempty.The attribute reduction consists of the core attributes and the relative necessary attributes which are from every relative necessary attribute equivalence class,and thus thoroughly revealed the structure of attribute reduction.

Key concepts: Attribute domain, Intersection (aeronautics), Rough set, Reduction (mathematics), Equivalence (formal languages), Class (philosophy), Formal concept analysis, Variable and attribute

Related papers

Back to paper searchBrowse research topicsOriginal source
Structure of Attribute Reduction Set of Concept Lattices — Research Paper | ScholarLens