Name
Abstract | ||
|---|---|---|
The output of an association rule miner is often huge in practice. This is
why several concise lossless representations have been proposed, such as the
"essential" or "representative" rules. We revisit the algorithm given by
Kryszkiewicz (Int. Symp. Intelligent Data Analysis 2001, Springer-Verlag LNCS
2189, 350-359) for mining representative rules. We show that its output is
sometimes incomplete, due to an oversight in its mathematical validation, and
we propose an alternative complete generator that works within only slightly
larger running times. |
Year | Venue | Keywords |
|---|---|---|
2010 | Clinical Orthopaedics and Related Research | association rule |
Field | DocType | Volume |
Data mining,Computer science,Closed set,Association rule learning,Lossless compression | Journal | abs/1012.0 |
Citations | PageRank | References |
1 | 0.35 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| José L. Balcázar | 1 | 701 | 62.06 |
| Cristina Tîrnauca | 2 | 12 | 3.26 |