Paper Info
Title
Generation of Exhaustive Rule Sets Using a Reduct Generating Algorithm
Abstract
The paper addresses the problem of computing exhaustive sets of decision rules in information/decision tables. Rule sets, including exhaustive ones, may have useful applications in descriptive and prescriptive analyses of the data sets, but the problem of searching for interesting rules is, in general, very time consuming. This is a direct consequence of the fact that the computational complexity of the exhaustive rule set generation problem is non-polynomial. Practical experiments demonstrate, however, that decision rules may be successfully computed for many real life data sets using some advanced algorithms. This paper introduces and experimentally evaluates an algorithm that is based on the notion of the discernibility list and that may be used for generating decision rules as well as attribute reducts. All the results of the experiments reported in this paper have been obtained for real-life data sets.
Year
DOI
Venue
2000
10.1007/978-3-7908-1846-8_7
Intelligent Information Systems
Keywords
Field
DocType
reduct generating algorithm,exhaustive rule,generic algorithm
Decision rule,Data mining,Data set,Reduct,Decision table,Computer science,Algorithm,FSA-Red Algorithm,Non polynomial,Computational complexity theory
Conference
ISSN
ISBN
Citations 
1615-3871
3-7908-1309-5
1
PageRank 
References 
Authors
0.47
9
1
Name
Order
Citations
PageRank
Robert Susmaga137033.32