IEEE Transactions on Knowledge and Data Engineering · 2013 · 83 citations · 20 references
ComputingData ScienceBig Data AnalyticsData AnalyticsData MiningFrequent Pattern MiningPattern EvaluationFrequent Itemset MiningRare Itemset Mining
Frequent weighted itemsets represent correlations frequently holding in data in which items may weight differently. However, in some contexts, e.g., when the need is to minimize a certain cost function, discovering rare data correlations is more interesting than mining frequent ones. This paper tackles the issue of discovering rare and weighted itemsets, i.e., the infrequent weighted itemset (IWI) mining problem. Two novel quality measures are proposed to drive the IWI mining process. Furthermore, two algorithms that perform IWI and Minimal IWI mining efficiently, driven by the proposed measures, are presented. Experimental results show efficiency and effectiveness of the proposed approach.
20
Mining association rules between sets of items in large databases
Rakesh Agrawal, Tomasz Imieliński, Arun Swami · 1993 · 14.8K citations · Full text
Authoritative sources in a hyperlinked environment
Jon Kleinberg · Journal of the ACM · 1999 · 9.1K citations · Full text
Mining frequent patterns without candidate generation
Jiawei Han, Jian Pei, Yiwen Yin · ACM SIGMOD Record · 2000 · 6.4K citations
Mining frequent patterns without candidate generation
Jiawei Han, Jian Pei, Yiwen Yin · 2000 · 3.2K citations · Full text