Greedy algorithms withweights for construction of partial association rules
Type
ArticleKAUST Department
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) DivisionApplied Mathematics and Computational Science Program
Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
Date
2009-09-10Permanent link to this record
http://hdl.handle.net/10754/561424
Metadata
Show full item recordAbstract
This paper is devoted to the study of approximate algorithms for minimization of the total weight of attributes occurring in partial association rules. We consider mainly greedy algorithms with weights for construction of rules. The paper contains bounds on precision of these algorithms and bounds on the minimal weight of partial association rules based on an information obtained during the greedy algorithm run.Publisher
IOS PressJournal
Fundamenta Informaticaeae974a485f413a2113503eed53cd6c53
10.3233/FI-2009-119