Online algorithms for finding profile association rules

International Conference on Information and Knowledge Management, Proceedings

Volumn 1998-January, Issue , 1998, Pages 86-95

  Aggarwal, Charu C ^a   Sun, Zheng ^b   Yu, Philip S ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS;

COMPUTATION TIME; EMPIRICAL COMPARISON; ON-LINE ALGORITHMS; PROFILE ASSOCIATION; QUANTITATIVE ASSOCIATION RULES;

ASSOCIATION RULES;

EID: 78149299589     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/288627.288644     Document Type: Conference Paper

References (17)

1. Aggarwal C. C, Wolf J. L., Yu P. S., and Epelman M. The S-Tree: An efficient index for multi-dimensional objects. Proceedings of the International Symposium on Spatial Databases. pages 350-370, Berlin, Germany, July 1997.
2. Aggarwal C. C, Sun Z., and Yu P. S. Online Generation of Profile Association Rules. Proceedings of the International Conference on Knowledge Discovery and Data Mining, August 1998.
3. Agrawal R., Imielinski T., and Swami A. Mining association rules between sets of items in very large databases. Proceedings of the ACM SIGMOD Conference on Management of data, pages 207-216, Washington D. C., May 1993.
4. Agrawal R., and Srikant R. Fast Algorithms for Mining Association Rules in Large Databases. Proceedings of the 20th International Conference on Very Large Data Bases, pages 478-499, September 1994.
5. Agrawal R., and Srikant R. Mining Sequential Patterns. Proceedings of the 11th International Conference on Data Engineering, pages 3-14, March 1995.
6. Guttman A. R-Trees: A Dynamic Index Structure for Spatial Searching. Proceedings of the ACM SIGMOD Conference, 1984 47-57.
7. Han J. and Fu Y. Discovery of Multiple-Level Association Rules from Large Databases. Proceedings of the 21st International Conference on Very Large Data Bases. Zurich, Switzerland, 1995, pages 420-431.
8. Houtsma M., and Swami A. Set-oriented Mining for Association Rules in Relational Databases. Proceedings of the 11th International Conference on Data Engineering. March 1995, pages 25-33.
9. Klementtinen M., Mannila H., Ronkainen P., Toivonen H., and Verkamo A. I. Finding interesting rules from large sets of discovered association rules. Proceedings of the Conference on Information and Knowledge Managements. Gaithersburg, MD, USA 28 Nov. 2 Dec. 1994.
10. Lent B., Swami A., and Widom J. Clustering Association Rules. Proceedings of the Thirteenth International Conference on Data Engineering. pages 220-231, Birmingham, UK, April 1997.
11. Mannila H., Toivonen H., and Verkamo A. I. Efficient algorithms for discovering association rules. AAAI Workshop on Knowledge Discovery in Databases, pages 181-192, Seattle, Washington, July 1994.
12. Ng R. T., and Han J. Efficient and Effective Clustering Methods for Spatial Data Mining. Proceedings of the 20th International Conference on Very Large Data Bases. Santiago, Chile, 1994, pages 144-155.
13. Park J. S., Chen M. S., and Yu P. S. An Effective Hash Based Algorithm for Mining Association Rules. Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data. pages 175-186, May 1995.
14. Savasere A., Omiecinski E., and Navathe S. An Efficient Algorithm for Mining Association Rules in Large Data Bases. Proceedings of the 21st International Conference on Very Large Data Bases. Zurich, Switzerland, 1995, pages 432-444.
15. Srikant R., and Agrawal R. Mining Generalized Association Rules. Proceedings of the 21st International Conference on Very Large Data Bases, pages 407-419, September 1995.
16. Srikant R., and Agrawal R. Mining quantitative association rules in large relational tables. Proceedings of the 1996 ACM SIGMOD Conference on Management of Data. Montreal, Canada, June 1996.
17. Toivonen H. Sampling Large Databases for Association Rules. Proceedings of the 22nd International Conference on Very Large Databases. pages 134-145, Mumbai, India, 1996.