Greedy algorithms withweights for construction of partial association rules

Mikhail Moshkov; Marcin Piliszczu; Beata Marta Zielosko

doi:10.3233/FI-2009-119

Greedy algorithms withweights for construction of partial association rules

Mikhail Moshkov, Marcin Piliszczu, Beata Marta Zielosko

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

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.

Original language	English (US)
Pages (from-to)	101-120
Number of pages	20
Journal	Fundamenta Informaticae
Volume	94
Issue number	1
DOIs	https://doi.org/10.3233/FI-2009-119
State	Published - Sep 10 2009

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01

ASJC Scopus subject areas

Computational Theory and Mathematics
Algebra and Number Theory
Theoretical Computer Science
Information Systems

Access to Document

10.3233/FI-2009-119

Cite this

@article{721bc74bc1e6494dadcbb19a90fbe998,

title = "Greedy algorithms withweights for construction of partial association rules",

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.",

author = "Mikhail Moshkov and Marcin Piliszczu and Zielosko, {Beata Marta}",

note = "KAUST Repository Item: Exported on 2020-10-01",

year = "2009",

month = sep,

day = "10",

doi = "10.3233/FI-2009-119",

language = "English (US)",

volume = "94",

pages = "101--120",

journal = "Fundamenta Informaticae",

issn = "0169-2968",

publisher = "IOS Press BV",

number = "1",

}

TY - JOUR

T1 - Greedy algorithms withweights for construction of partial association rules

AU - Moshkov, Mikhail

AU - Piliszczu, Marcin

AU - Zielosko, Beata Marta

N1 - KAUST Repository Item: Exported on 2020-10-01

PY - 2009/9/10

Y1 - 2009/9/10

N2 - 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.

AB - 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.

UR - http://hdl.handle.net/10754/561424

UR - https://www.medra.org/servlet/aliasResolver?alias=iospress&doi=10.3233/FI-2009-119

UR - http://www.scopus.com/inward/record.url?scp=69849115405&partnerID=8YFLogxK

U2 - 10.3233/FI-2009-119

DO - 10.3233/FI-2009-119

M3 - Article

SN - 0169-2968

VL - 94

SP - 101

EP - 120

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

IS - 1

ER -

Greedy algorithms withweights for construction of partial association rules

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this