Name
Abstract | ||
|---|---|---|
High-utility itemset (HUI) mining is a popular data mining task, consisting of enumerating all groups of items that yield a high profit in a customer transaction database. However, an important issue with traditional HUI mining algorithms is that they tend to find itemsets having many items. But those itemsets are often rare, and thus may be less interesting than smaller itemsets for users. In this paper, we address this issue by presenting a novel algorithm named FHM+ for mining HUIs, while considering length constraints. To discover HUIs efficiently with length constraints, FHM+ introduces the concept of Length Upper-Bound Reduction (LUR), and two novel upper-bounds on the utility of itemsets. An extensive experimental evaluation shows that length constraints are effective at reducing the number of patterns, and the novel upper-bounds can greatly decrease the execution time, and memory usage for HUI mining. © Springer International Publishing Switzerland 2016. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-42007-3_11 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Keywords | Field | DocType |
Pattern mining,High-utility itemsets,Length constraints | Data mining,Upper and lower bounds,Computer science,Execution time,Database transaction | Conference |
Volume | ISSN | ISBN |
9799 | 0302-9743 | 978-3-319-42007-3; 978-3-319-42006-6 |
Citations | PageRank | References |
4 | 0.39 | 12 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Philippe Fournier-Viger | 1 | 1587 | 110.19 |
| Chun-Wei Lin | 2 | 1484 | 154.11 |
| Q.-H. Duong | 3 | 76 | 7.00 |
| Dam Thu-Lan | 4 | 74 | 5.24 |