Paper Info
Title
Computation of Minimal Cost Reducts
Abstract
The paper addresses the problem of computing reducts in decision tables where attributes are assigned costs. Computing reducts has been an interesting issue as the reducts may be successfully applied in further analyses of the decision table. In systems where attribute are assigned costs, the problem of reduct generation may be reformulated to that of finding reducts satisfying some additional constraints, in particular reducts of minimal attribute costs. The constraints allow to incorporate external preference into the system and, additionally, simplify the problem of interpreting the obtained results, since the number of reducts of minimal costs, as opposed to the number of all existing reducts, is usually very small. This paper introduces a new algorithm for generating all reducts of minimal costs, called minimal cost reducts or cheapest reducts. The practical behaviour of this algorithm has been tested in numerous experiments with real-life data sets, the results of which are reported here.
Year
DOI
Venue
1999
10.1007/BFb0095132
ISMIS
Keywords
Field
DocType
minimal cost reducts,satisfiability,decision table
Discrete mathematics,Reduct,Decision table,Computer science,Decision support system,Integer programming,Linear programming,Knowledge acquisition,Computation
Conference
ISBN
Citations 
PageRank 
3-540-65965-X
7
0.52
References 
Authors
10
1
Name
Order
Citations
PageRank
Robert Susmaga137033.32