Dynamic Programming Approach for Construction of Association Rule Systems

被引：1

作者：

Alsolami, Fawaz ^{[1
]}

Amin, Talha ^{[1
]}

Chikalov, Igor ^{[1
]}

Moshkov, Mikhail ^{[1
]}

Zielosko, Beata ^{[2
]}

机构：

[1] King Abdullah Univ Sci & Technol, Comp Elect & Math Sci & Engn Div, Thuwal 239556900, Saudi Arabia

[2] Univ Silesia, Inst Comp Sci, 39 Bedzinska St, PL-41200 Sosnowiec, Poland

来源：

FUNDAMENTA INFORMATICAE | 2016年 / 147卷 / 2-3期

关键词：

association rules; decision rules; dynamic programming; set cover problem; rough sets; DECISION RULES; SET;

D O I：

10.3233/FI-2016-1402

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

In the paper, an application of dynamic programming approach for optimization of association rules from the point of view of knowledge representation is considered. The association rule set is optimized in two stages, first for minimum cardinality and then for minimum length of rules. Experimental results present cardinality of the set of association rules constructed for information system and lower bound on minimum possible cardinality of rule set based on the information obtained during algorithm work as well as obtained results for length.

引用

页码：159 / 171

页数：13

共 26 条

[1]

Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072

[2]

Agrawal R., 1996, ADV KNOWLEDGE DISCOV, V12, P307, DOI DOI 10.1007/978-3-319-31750-2.

[3]

Alkhalid A., 2011, COMPUTATIONAL INFORM, P29

[4]

Alsolami F, 2015, P 24 INT WORKSH CONC, V1492, P12

[5]

Alsolami F, 2015, INFORM SCI UNPUB, DOI [10.1007/978-3-319-18422-7_24, DOI 10.1007/978-3-319-18422-7_24]

[6]

[Anonymous], 1994, P INT C VERY LARGE D

[7]

[Anonymous], NEW ALGORITHMS FAST

[8] Maximum patterns in datasets [J].

Bonates, T. O. ;

Hammer, Peter L. ;

Kogan, A. .

DISCRETE APPLIED MATHEMATICS, 2008, 156 (06) :846-861

[9]

Borgelt C, 2002, COMPSTAT 2002: PROCEEDINGS IN COMPUTATIONAL STATISTICS, P395

[10]

Borgelt C, 2010, STUD COMPUT INTELL, V263, P351

← 1 2 3 →