Efficient dynamic mining of constrained frequent sets
ACM Transactions on Database Systems (TODS)
Agents and Stream Data Mining: A New Perspective
IEEE Intelligent Systems
CanTree: A Tree Structure for Efficient Incremental Mining of Frequent Patterns
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Distributed Mining of Constrained Patterns from Wireless Sensor Data
WI-IATW '06 Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology
CanTree: a canonical-order tree for incremental frequent-pattern mining
Knowledge and Information Systems
A data mining proxy approach for efficient frequent itemset mining
The VLDB Journal — The International Journal on Very Large Data Bases
Trends Analysis of Topics Based on Temporal Segmentation
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
FpVAT: a visual analytic tool for supporting frequent pattern mining
ACM SIGKDD Explorations Newsletter
CloseViz: visualizing useful patterns
Proceedings of the ACM SIGKDD Workshop on Useful Patterns
Hi-index | 0.00 |
Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting satisfying the monotonicity condition. Our method, the optimized segment support map (OSSM), is a light-weight structure which partitions the collection of transactions into m segments, so as to reduce the number of candidate patterns that require frequency counting. We study the following problems: (1) What is the optimal number of segments to be used; and (2) Given a user-determined m, what is the best segmentation/composition of the m segments? For Problem 1, we provide a thorough analysis and a theorem establishing the minimum value of m for which there is no accuracy lost in using the OSSM. For Problem 2, we develop various algorithms and heuristics, which efficiently generate OSSMs that are compact and effective, to help facilitate segmentation.