Algorithms for mining share frequent itemsets containing infrequent subsets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1910, Issue , 2000, Pages 316-324

  Barber, Brock ^a   Hamilton, Howard J ^a  

^a UNIVERSITY OF REGINA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; INFORMATION USE;

DOWNWARD CLOSURE; ITEM SETS; ITEMSET; NUMERICAL VALUES; PROCESSING COSTS; SUPPORT MEASURE;

HEURISTIC ALGORITHMS;

EID: 84974693372     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45372-5_31     Document Type: Conference Paper

References (11)

1. Agrawal A., Imielinksi T., Swami A. 1993. Mining Association Rules between Sets of Items in Large Databases. Proceedings of the ACM SIGMOD International Conference on the Management of Data. Washington D.C., pp.207-216.
2. Agrawal A., Mannila H., Srikant R., Toivonen H. and Verkamo, A.I. 1996. Fast Discovery of Association Rules. Advances in Knowledge Discovery and Data Mining, Menlo Park, California, pp.307-328.
3. Agrawal A., Srikant R. 1994. Fast Algorithms for Mining Association Rules. Proceedings of the 20th International Conference on Very Large Databases. Santiago, Chile, pp.487-499.
4. Carter C.L., Hamilton H.J., Cercone N. 1997. Share Based Measures for Itemsets. Proceedings of the First European Conference on the Principles of Data Mining and Knowledge Discovery. Trondheim, Norway, pp.14-24.
5. Hilderman R.J., Carter C., Hamilton H.J., Cercone N. 1998. Mining Association Rules from Market Basket Data using Share Measures and Characterized Itemsets. International Journal of Artificial Intelligence Tools. 7(2):189-220.
6. Mannila H., Toivonen H., Verkamo A.I. 1994. Efficient Algorithms for Discovering Association Rules. Proceedings of the 1994 AAAI Workshop on Knowledge Discovery in Databases. Seattle, Washington, pp.144-155.
7. Masland B., Piatetsky-Shapiro G. 1995. A Comparison of Approaches for Maximizing Business Payoff of Predictive Models. Proceedings of the Second International Conference on Knowledge Discovery and Data Mining. Portland, Oregon, pp.195-201.
8. Ng R.T., Lakshmanan L.V.S., Han J., Pang A. 1998. Exploratory Mining and Pruning Optimizations of Constrained Association Rules. Proceedings ACM SIGMOD International Conference on Management of Data. Seattle, Washington, pp.13-24.
9. Silverstein C., Brin S., Motwani R. 1998. Beyond Market Baskets: Generalizing Association Rules to Dependence Rules. Data Mining and Knowledge Discovery, 2(1):39-68.
10. Srikant R., Agrawal R. 1996. Mining Quantitative Association Rules in Large Relational Tables. Proceedings of the ACM SIGMOD Conference on the Management of Data. Montreal, Canada, pp.1-12.
11. Zaki M.J., Parthasarathy, M., Ogihara M., Li W. 1997. New Algorithms for Fast Discovery of Association Rules. Proceedings of the Third International Conference on Knowledge Discovery & Data Mining. Newport Beach, California, pp.283-286.