On Construction of Partial Association Rules

被引：0

作者：

Moshkov, Mikhail Ju ^{[1
]}

Piliszczuk, Marcin ^{[2
]}

Zielosko, Beata ^{[3
]}

机构：

[1] King Abdullah Univ Sci & Technol, Div Math & Comp Sci & Engn, POB 55455, Jeddah 21534, Saudi Arabia

[2] ING Bank Slaski SA, Katowice 40086, Poland

[3] Silesian Univ, Inst Comp Sci, Katowice 41200, Poland

来源：

ROUGH SETS AND KNOWLEDGE TECHNOLOGY, PROCEEDINGS | 2009年 / 5589卷

关键词：

Information systems; association rules; greedy algorithm; REDUCTS;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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 oil an information obtained during greedy algorithm work, and results of the study of association rules for the most part of binary information systems.

引用

页码：176 / +

页数：3

共 22 条

[1]

Agarwal R., 1994, VLDB, V487, P499, DOI DOI 10.5555/645920.672836

[2]

BAZAN JG, 1998, LNCS, V1424, P521

[3]

Delimata P, 2009, STUD COMPUT INTELL, V163, P1

[4]

Feige U., 1996, Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, P314, DOI 10.1145/237814.237977

[5]

Moshkov MJ, 2007, FUND INFORM, V80, P247

[6]

Moshkov MJ, 2008, LECT NOTES COMPUT SC, V5084, P251, DOI 10.1007/978-3-540-85064-9_12

[7]

Nguyen HS, 1999, LECT NOTES ARTIF INT, V1711, P137

[8]

Nguyen HS, 2006, LECT NOTES COMPUT SC, V4100, P334

[9]

Pawlak Z., 1998, STUDIES FUZZINESS SO, V18, P10

[10] Rough sets: Some extensions [J].

Pawlak, Zdzislaw ;

Skowron, Andrzej .

INFORMATION SCIENCES, 2007, 177 (01) :28-40

← 1 2 3 →