Show simple item record

dc.contributor.authorMoshkov, Mikhail
dc.contributor.authorPiliszczu, Marcin
dc.contributor.authorZielosko, Beata Marta
dc.date.accessioned2015-08-02T09:10:54Z
dc.date.available2015-08-02T09:10:54Z
dc.date.issued2009-09-10
dc.identifier.issn01692968
dc.identifier.doi10.3233/FI-2009-119
dc.identifier.urihttp://hdl.handle.net/10754/561424
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.
dc.publisherIOS Press
dc.subjectAssociation rules
dc.subjectGreedy algorithms
dc.subjectInformation systems
dc.subjectRough sets
dc.subjectWeights
dc.titleGreedy algorithms withweights for construction of partial association rules
dc.typeArticle
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentApplied Mathematics and Computational Science Program
dc.contributor.departmentExtensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
dc.identifier.journalFundamenta Informaticae
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ȩdzínska St., Sosnowiec 41-200, Poland
kaust.personMoshkov, Mikhail


This item appears in the following Collection(s)

Show simple item record