ScholarLens Back to search
2003•Journal of Jilin University of TechnologyRequires access

Research of Reduced Algorithm Based on Rough Set Theory

Li Xiong

Open publisher page 0 citations

Abstract

In this paper,we present a heuristic reduced algorithm,denoted RedFreSigni,that satisfies the attribute significance and attribute frequency at same time.This algorithm is based on the algorithms of attribute significance and resolution matrix.It takes the attribute′s core and user′s preference set as part of the attribute reduction,and using frequency as the heuristic information of attribute selection,and creating the frequency information of calculation attributes and undistinguishable matrix simultaneously,so the calculating time is reduced.Accordingly,a decision mining algorithm is presented which is based on rulesupport and confidence.Users can extract the useful rules effectively by using this algorithm.

About this research paper

What this paper is about

In this paper,we present a heuristic reduced algorithm,denoted RedFreSigni,that satisfies the attribute significance and attribute frequency at same time.This algorithm is based on the algorithms of attribute significance and resolution matrix.It takes the attribute′s core and user′s preference set as part of the attribute reduction,and using frequency as the heuristic information of attribute selection,and creating the frequency information of calculation attributes and undistinguishable matrix simultaneously,so the calculating time is reduced.Accordingly,a decision mining algorithm is presented which is based on rulesupport and confidence.Users can extract the useful rules effectively by using this 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

In this paper,we present a heuristic reduced algorithm,denoted RedFreSigni,that satisfies the attribute significance and attribute frequency at same time.This algorithm is based on the algorithms of attribute significance and resolution matrix.It takes the attribute′s core and user′s preference set as part of the attribute reduction,and using frequency as the heuristic information of attribute selection,and creating the frequency information of calculation attributes and undistinguishable matrix simultaneously,so the calculating time is reduced.Accordingly,a decision mining algorithm is presented which is based on rulesupport and confidence.Users can extract the useful rules effectively by using this algorithm.

Key concepts: Rough set, Attribute domain, Heuristic, Reduction (mathematics), Algorithm, Set (abstract data type), Computer science, Matrix (chemical analysis)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Research of Reduced Algorithm Based on Rough Set Theory — Research Paper | ScholarLens