Database Reference
In-Depth Information
be useful in some situations is the mining of top-K rules with positive and negative
items. This is investigated in [
22
] and [
12
,
13
] which may be of interest to users who
want to investigate and use a limited number of rules.
References
1. Charu C. Aggarwal and Philip S. Yu. Mining large itemsets for association rules.
IEEE Data
Eng. Bull.
, 21(1):23-31, 1998.
2. Charu C. Aggarwal and Philip S. Yu. A new framework for itemset generation. In
Proceedings
of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database
Systems
, PODS '98, pages 18-24, 1998.
3. C. C. Aggarwal and P. S. Yu. Mining associations with the collective strength approach.
IEEE
Trans. on Knowl. and Data Eng.
, 13(6):863-873, November 2001.
4. Rakesh Agrawal, Tomasz Imielinski, and Arun Swami. Mining association rules between sets
of items in large databases. In
Proc. of SIGMOD
, pages 207-216, 1993.
5. M-L Antonie and Osmar R Zaïane. Text document categorization by term association. In
Proc.
of ICDM
, pages 19-26, 2002.
6. M-L Antonie and Osmar R Zaïane. An associative classifier based on positive and negative
rules. In
Proc. of DMKD
, pages 64-69, 2004.
7. Maria-Luiza Antonie and Osmar R Zaïane. Mining positive and negative association rules: An
approach for confined rules. In
Proc. of PKDD
, pages 27-38, 2004.
8. Sergey Brin, Rajeev Motwani, and Craig Silverstein. Beyond market basket: Generalizing
association rules to correlations. In
Proc. SIGMOD
, pages 265-276, 1997.
9. Sergey Brin, Rajeev Motwani, Jeffrey D Ullman, and Shalom Tsur. Dynamic itemset counting
and implication rules for market basket data. In
Proc. of SIGMOD
, pages 255-264, 1997.
10. Chris Cornelis, Peng Yan, Xing Zhang, and Guoqing Chen. Mining positive and negative
association rules from large databases. In
Proc. of CIS
, pages 1-6, 2006.
11. Bart Goethals and Mohammed J Zaki. FIMI 2003: Workshop on frequent itemset mining im-
plementations. In
Third IEEE International Conference on Data Mining Workshop on Frequent
Itemset Mining Implementations
, pages 1-13, 2003.
12. Wilhelmiina Hamalainen. Efficient discovery of the top-k optimal dependency rules with
fisher's exact test of significance. In
Proc. of ICDM
, pages 196-205, 2010.
13. Wilhelmiina Hamalainen. Kingfisher: an efficient algorithm for searching for both positive and
negative dependency rules with statistical significance measures.
Knowl. Inf. Syst.
, 32(2):383-
414, 2012.
14. Jiawei Han, Jian Pei, and Yiwen Yin. Mining frequent patterns without candidate generation.
In
Proc. of SIGMOD
, pages 1-12, 2000.
15. Yun Sing Koh and Russel Pears. Efficiently finding negative association rules without support
threshold. In
Proc. of Australian AI
, pages 710-714, 2007.
16. Wenmin Li, Jiawei Han, and Jian Pei. CMAR: Accurate and efficient classification based on
multiple class-association rules. In
Proc. of ICDM
, pages 369-376, 2001.
17. Bing Liu, Wynne Hsu, and Yiming Ma. Integrating classification and association rule mining.
In
Proc. of SIGKDD
, pages 80-86, 1998.
18. Paul David McNicholas, Thomas Brendan Murphy, and M. O'Regan. Standardising the lift of
an association rule.
Comput. Stat. Data Anal.
, 52(10):4712-4721, 2008.
19. Ashok Savasere, Edward Omiecinski, and Shamkant Navathe. Mining for strong negative
associations in a large database of customer transactions. In
Proc. of ICDE
, pages 494-502,
1998.
20. Wei-Guang Teng, Ming-Jyh Hsieh, and Ming-Syan Chen. On the mining of substitution rules
for statistically dependent items. In
Proc. of ICDM
, pages 442-449, 2002.
