Show simple item record

dc.contributor.authorMoshkov, Mikhail
dc.contributor.authorPiliszczuk, Marcin
dc.contributor.authorZielosko, Beata Marta
dc.date.accessioned2015-08-04T06:19:56Z
dc.date.available2015-08-04T06:19:56Z
dc.date.issued2009
dc.identifier.isbn3642029612; 9783642029615
dc.identifier.issn03029743
dc.identifier.doi10.1007/978-3-642-02962-2_22
dc.identifier.urihttp://hdl.handle.net/10754/564233
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.
dc.publisherSpringer Nature
dc.subjectAssociation rules
dc.subjectGreedy algorithm
dc.subjectInformation systems
dc.titleOn construction of partial association rules
dc.typeConference Paper
dc.contributor.departmentApplied Mathematics and Computational Science Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentExtensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
dc.contributor.departmentOffice of the VP
dc.identifier.journalRough Sets and Knowledge Technology
dc.conference.date14 July 2009 through 16 July 2009
dc.conference.name4th International Conference on Rough Sets and Knowledge Technology, RSKT 2009
dc.conference.locationGold Coast, QLD
dc.contributor.institutionING Bank Śla̧ski S.A., 34, Sokolska St., Katowice 40-086, Poland
dc.contributor.institutionInstitute of Computer Science, University of Silesia, 39, Bȩdzińska St., Sosnowiec 41-200, Poland
kaust.personMoshkov, Mikhail


This item appears in the following Collection(s)

Show simple item record