Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
OHSUMED: an interactive retrieval evaluation and new large test collection for research
SIGIR '94 Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval
Beyond market baskets: generalizing association rules to correlations
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Knowledge Discovery and Measures of Interest
Knowledge Discovery and Measures of Interest
Alternative Interest Measures for Mining Associations in Databases
IEEE Transactions on Knowledge and Data Engineering
Selecting the right interestingness measure for association patterns
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Cluster ensembles --- a knowledge reuse framework for combining multiple partitions
The Journal of Machine Learning Research
CoMine: Efficient Mining of Correlated Patterns
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Pattern-growth methods for frequent pattern mining
Pattern-growth methods for frequent pattern mining
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Frequent Itemsets without Support Threshold: With and without Item Constraints
IEEE Transactions on Knowledge and Data Engineering
Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
Introduction to Data Mining, (First Edition)
Introduction to Data Mining, (First Edition)
Using Information-Theoretic Measures to Assess Association Rule Interestingness
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Interestingness measures for data mining: A survey
ACM Computing Surveys (CSUR)
Data Mining and Knowledge Discovery
Mining maximal hyperclique pattern: A hybrid search strategy
Information Sciences: an International Journal
Frequent pattern mining: current status and future directions
Data Mining and Knowledge Discovery
Image categorization: Graph edit distance+edge direction histogram
Pattern Recognition
Association Mining in Large Databases: A Re-examination of Its Measures
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
Information Sciences: an International Journal
Modeling term proximity for probabilistic information retrieval models
Information Sciences: an International Journal
Cosine interesting pattern discovery
Information Sciences: an International Journal
Parallelized Evolutionary Learning for Detection of Biclusters in Gene Expression Data
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A probabilistic model for image representation via multiple patterns
Pattern Recognition
High utility pattern mining using the maximal itemset property and lexicographic tree structures
Information Sciences: an International Journal
Mining frequent patterns in a varying-size sliding window of online transactional data streams
Information Sciences: an International Journal
Information Sciences: an International Journal
| Hi-index | 0.07 |
This paper presents an efficient algorithm called CosMiner"t for interesting pattern discovery. The widely used cosine similarity, found to possess the null-invariance property and the anti-cross-support-pattern property, is adopted as the interestingness measure in CosMiner"t. CosMiner"t is generally an FP-growth-like depth-first traversal algorithm that rests on an important property of the cosine similarity: the conditional anti-monotone property (CAMP). The combined use of CAMP and the depth-first support-ascending traversal strategy enables the pre-pruning of uninteresting patterns during the mining process of CosMiner"t. Extensive experiments demonstrate the high efficiency of CosMiner"t in interesting pattern discovery, in comparison to the breath-first strategy and the post-evaluation strategy. In particular, CosMiner"t shows its capability in suppressing the generation of cross-support patterns and discovering rare but truly interesting patterns. Finally, an interesting case of landmark recognition is presented to illustrate the value of cosine interesting patterns found by CosMiner"t in real-world applications.