Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Fast Algorithms for Mining Emerging Patterns
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
CoMine: Efficient Mining of Correlated Patterns
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Efficient dynamic mining of constrained frequent sets
ACM Transactions on Database Systems (TODS)
Data Mining and Knowledge Discovery
Mining itemset utilities from transaction databases
Data & Knowledge Engineering - Special issue: ER 2003
Mining periodic patterns with gap requirement from sequences
ACM Transactions on Knowledge Discovery from Data (TKDD)
Mining of Frequent Itemsets from Streams of Uncertain Data
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Re-examination of interestingness measures in pattern mining: a unified framework
Data Mining and Knowledge Discovery
Efficient Periodicity Mining in Time Series Databases Using Suffix Trees
IEEE Transactions on Knowledge and Data Engineering
Frequent pattern mining from time-fading streams of uncertain data
DaWaK'11 Proceedings of the 13th international conference on Data warehousing and knowledge discovery
Finding Strong Groups of Friends among Friends in Social Networks
DASC '11 Proceedings of the 2011 IEEE Ninth International Conference on Dependable, Autonomic and Secure Computing
A new class of constraints for constrained frequent pattern mining
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Efficient mining regularly frequent patterns in transactional databases
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Fast tree-based mining of frequent itemsets from uncertain data
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Mining social networks for significant friend groups
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications
A constrained frequent pattern mining system for handling aggregate constraints
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Mining probabilistic datasets vertically
Proceedings of the 16th International Database Engineering & Applications Sysmposium
| Hi-index | 0.00 |
Since the introduction of the frequent pattern mining problem, researchers have extended frequent patterns to different useful patterns such as cyclic, emerging, periodic and regular patterns. In this paper, we introduce popular patterns, which captures the popularity of individuals, items, or events among their peers or groups. Moreover, we also propose (i) the Pop-tree structure to capture the essential information for the mining of popular patterns and (ii) the Pop-growth algorithm for mining popular patterns. Experimental results showed that our proposed tree structure is compact and space efficient and our proposed algorithm is time efficient.