Rough set theory based reduction algorithm for decision table

With the purpose to reduce the surplus information on decision table and extract the determinative rules, an autonomous clustering algorithm based on graded datum subtraction (ACGDS) is proposed to reduce the data area and an attribute reduction algorithm based on ant colony optimization (ARACO) is...

Full description

Saved in:
Bibliographic Details
Published in2009 International Conference on Machine Learning and Cybernetics Vol. 4; pp. 2318 - 2323
Main Authors Xiao-Yu Song, Chun-Guang Chang, Feng Liu
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2009
Subjects
Ant colony optimization
Clustering
Clustering algorithms
Control engineering
Convergence
Cybernetics
Information systems
Machine learning
Machine learning algorithms
Partitioning algorithms
Reduction
Rough set theory
Set theory
Online AccessGet full text

Cover

More Information
Summary:With the purpose to reduce the surplus information on decision table and extract the determinative rules, an autonomous clustering algorithm based on graded datum subtraction (ACGDS) is proposed to reduce the data area and an attribute reduction algorithm based on ant colony optimization (ARACO) is presented to reduce the surplus attributes. ACGDS uses the quick sort method and subtraction to every row of the similarity matrix only depending on data attributes. ARACO directly imports the core into the distributing of initial pheromone, and reduces the problem scale, and solves the low convergence speed problem in the conventional ant colony algorithm. The experiments illustrates that ACGDS increases the accuracy and efficiency and ARACO could find the minimal reduction with less time. It is worth to use rough set theory to deal with the problem of decision table reduction.
ISBN:9781424437023
1424437024
ISSN:2160-133X
DOI:10.1109/ICMLC.2009.5212161