RP-Tree: rare pattern tree mining
DaWaK'11 Proceedings of the 13th international conference on Data warehousing and knowledge discovery
Finding top-n colossal patterns based on clique search with dynamic update of graph
ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
Rare pattern mining on data streams
DaWaK'12 Proceedings of the 14th international conference on Data Warehousing and Knowledge Discovery
Mining frequent itemsets in data streams within a time horizon
Data & Knowledge Engineering
A time-efficient breadth-first level-wise lattice-traversal algorithm to discover rare itemsets
Data Mining and Knowledge Discovery
| Hi-index | 0.01 |
Mining patterns in large databases is a challenging task facing NP-hard problems. Research focused attention on the most occurrent patterns, although less frequent patterns still offer interesting insights. In this paper we propose a new algorithm for discovering infrequent patterns and compare it to other solutions.