Greedy algorithms withweights for construction of partial association rules

Handle URI:
http://hdl.handle.net/10754/561424
Title:
Greedy algorithms withweights for construction of partial association rules
Authors:
Moshkov, Mikhail ( 0000-0003-0085-9483 ) ; Piliszczu, Marcin; Zielosko, Beata Marta
Abstract:
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.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Applied Mathematics and Computational Science Program; Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
Publisher:
IOS Press
Journal:
Fundamenta Informaticae
Issue Date:
10-Sep-2009
DOI:
10.3233/FI-2009-119
Type:
Article
ISSN:
01692968
Appears in Collections:
Articles; Applied Mathematics and Computational Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorMoshkov, Mikhailen
dc.contributor.authorPiliszczu, Marcinen
dc.contributor.authorZielosko, Beata Martaen
dc.date.accessioned2015-08-02T09:10:54Zen
dc.date.available2015-08-02T09:10:54Zen
dc.date.issued2009-09-10en
dc.identifier.issn01692968en
dc.identifier.doi10.3233/FI-2009-119en
dc.identifier.urihttp://hdl.handle.net/10754/561424en
dc.description.abstractThis 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.en
dc.publisherIOS Pressen
dc.subjectAssociation rulesen
dc.subjectGreedy algorithmsen
dc.subjectInformation systemsen
dc.subjectRough setsen
dc.subjectWeightsen
dc.titleGreedy algorithms withweights for construction of partial association rulesen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentApplied Mathematics and Computational Science Programen
dc.contributor.departmentExtensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Groupen
dc.identifier.journalFundamenta Informaticaeen
dc.contributor.institutionING Bank Śla̧ski S.A., 34, Sokolska St., Katowice 40-086, Polanden
dc.contributor.institutionInstitute of Computer Science, University of Silesia, 39, Bȩdzínska St., Sosnowiec 41-200, Polanden
kaust.authorMoshkov, Mikhailen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.