2010•Journal of Bijie UniversityRequires access

Applying Attribute Exploration Algorithms to Knowledge Discovery

Quan Yu

Open publisher page 0 citations

Abstract

From a artificial intelligence viewpoint,In a specific knowledge domain,all the objects and attributes make up a formal context of itself.If its attribute set is finite,but the cardinality of object set is very large or even is infinite in the formal context of this knowledge domain.In this paper,We design the extending attribute exploration algorithms,which can find out the Duquenne-Guigues base of the specific knowledge domain,and then we show the function of the algorithms by an example.

About this research paper

What this paper is about

From a artificial intelligence viewpoint,In a specific knowledge domain,all the objects and attributes make up a formal context of itself.If its attribute set is finite,but the cardinality of object set is very large or even is infinite in the formal context of this knowledge domain.In this paper,We design the extending attribute exploration algorithms,which can find out the Duquenne-Guigues base of the specific knowledge domain,and then we show the function of the algorithms by an example.

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

From a artificial intelligence viewpoint,In a specific knowledge domain,all the objects and attributes make up a formal context of itself.If its attribute set is finite,but the cardinality of object set is very large or even is infinite in the formal context of this knowledge domain.In this paper,We design the extending attribute exploration algorithms,which can find out the Duquenne-Guigues base of the specific knowledge domain,and then we show the function of the algorithms by an example.

Key concepts: Cardinality (data modeling), Computer science, Domain (mathematical analysis), Knowledge base, Context (archaeology), Attribute domain, Domain knowledge, Set (abstract data type)

Related papers

Back to paper searchBrowse research topicsOriginal source
Applying Attribute Exploration Algorithms to Knowledge Discovery — Research Paper | ScholarLens