On construction of partial association rules

Handle URI:
http://hdl.handle.net/10754/564233
Title:
On construction of partial association rules
Authors:
Moshkov, Mikhail ( 0000-0003-0085-9483 ) ; Piliszczuk, Marcin; Zielosko, Beata Marta
Abstract:
This paper is devoted to the study of approximate algorithms for minimization of partial association rule length. It is shown that under some natural assumptions on the class NP, a greedy algorithm is close to the best polynomial approximate algorithms for solving of this NP-hard problem. The paper contains various bounds on precision of the greedy algorithm, bounds on minimal length of rules based on an information obtained during greedy algorithm work, and results of the study of association rules for the most part of binary information systems. © 2009 Springer Berlin Heidelberg.
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:
Springer Science + Business Media
Journal:
Rough Sets and Knowledge Technology
Conference/Event name:
4th International Conference on Rough Sets and Knowledge Technology, RSKT 2009
Issue Date:
2009
DOI:
10.1007/978-3-642-02962-2_22
Type:
Conference Paper
ISSN:
03029743
ISBN:
3642029612; 9783642029615
Appears in Collections:
Conference Papers; 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.authorPiliszczuk, Marcinen
dc.contributor.authorZielosko, Beata Martaen
dc.date.accessioned2015-08-04T06:19:56Zen
dc.date.available2015-08-04T06:19:56Zen
dc.date.issued2009en
dc.identifier.isbn3642029612; 9783642029615en
dc.identifier.issn03029743en
dc.identifier.doi10.1007/978-3-642-02962-2_22en
dc.identifier.urihttp://hdl.handle.net/10754/564233en
dc.description.abstractThis paper is devoted to the study of approximate algorithms for minimization of partial association rule length. It is shown that under some natural assumptions on the class NP, a greedy algorithm is close to the best polynomial approximate algorithms for solving of this NP-hard problem. The paper contains various bounds on precision of the greedy algorithm, bounds on minimal length of rules based on an information obtained during greedy algorithm work, and results of the study of association rules for the most part of binary information systems. © 2009 Springer Berlin Heidelberg.en
dc.publisherSpringer Science + Business Mediaen
dc.subjectAssociation rulesen
dc.subjectGreedy algorithmen
dc.subjectInformation systemsen
dc.titleOn construction of partial association rulesen
dc.typeConference Paperen
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.journalRough Sets and Knowledge Technologyen
dc.conference.date14 July 2009 through 16 July 2009en
dc.conference.name4th International Conference on Rough Sets and Knowledge Technology, RSKT 2009en
dc.conference.locationGold Coast, QLDen
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ȩdzińska St., Sosnowiec 41-200, Polanden
kaust.authorMoshkov, Mikhailen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.