Constraint-Based Rule Mining in Large, Dense Databases.

@inproceedings{DBLP:conf/icde/BayardoAG99,
  author    = {Roberto J. Bayardo Jr. and
               Rakesh Agrawal and
               Dimitrios Gunopulos},
  title     = {Constraint-Based Rule Mining in Large, Dense Databases},
  booktitle = {Proceedings of the 15th International Conference on Data Engineering,
               23-26 March 1999, Sydney, Austrialia},
  publisher = {IEEE Computer Society},
  year      = {1999},
  pages     = {188-197},
  ee        = {db/conf/icde/BayardoAG99.html},
  crossref  = {DBLP:conf/icde/99},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1999 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

ACM SIGMOD DiSC

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/DISC001 or /cdrom

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Online Edition: IEEE Computer Society DL

Printed Edition

References

[1]

Rakesh Agrawal, Tomasz Imielinski, Arun N. Swami: Mining Association Rules between Sets of Items in Large Databases. SIGMOD Conference 1993: 207-216 BibTeX

[2]

Rakesh Agrawal, Heikki Mannila, Ramakrishnan Srikant, Hannu Toivonen, A. Inkeri Verkamo: Fast Discovery of Association Rules. Advances in Knowledge Discovery and Data Mining 1996: 307-328 BibTeX

[3]

Kamal Ali, Stefanos Manganaris, Ramakrishnan Srikant: Partial Classification Using Association Rules. KDD 1997: 115-118 BibTeX

[4]

Roberto J. Bayardo Jr.: Efficiently Mining Long Patterns from Databases. SIGMOD Conference 1998: 85-93 BibTeX

[5]

...

[6]

Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman, Shalom Tsur: Dynamic Itemset Counting and Implication Rules for Market Basket Data. SIGMOD Conference 1997: 255-264 BibTeX

[7]

William W. Cohen: Fast Effective Rule Induction. ICML 1995: 115-123 BibTeX

[8]

...

[9]

Mika Klemettinen, Heikki Mannila, Pirjo Ronkainen, Hannu Toivonen, A. Inkeri Verkamo: Finding Interesting Rules from Large Sets of Discovered Association Rules. CIKM 1994: 401-407 BibTeX

[10]

Raymond T. Ng, Laks V. S. Lakshmanan, Jiawei Han, Alex Pang: Exploratory Mining and Pruning Optimizations of Constrained Association Rules. SIGMOD Conference 1998: 13-24 BibTeX

[11]

Ron Rymon: Search through Systematic Set Enumeration. KR 1992: 539-550 BibTeX

[12]

John C. Shafer, Rakesh Agrawal, Manish Mehta: SPRINT: A Scalable Parallel Classifier for Data Mining. VLDB 1996: 544-555 BibTeX

[13]

Padhraic Smyth, Rodney M. Goodman: An Information Theoretic Approach to Rule Induction from Databases. IEEE Trans. Knowl. Data Eng. 4(4): 301-316(1992) BibTeX

[14]

Ramakrishnan Srikant, Quoc Vu, Rakesh Agrawal: Mining Association Rules with Item Constraints. KDD 1997: 67-73 BibTeX

[15]

Geoffrey I. Webb: OPUS: An Efficient Admissible Algorithm for Unordered Search. J. Artif. Intell. Res. (JAIR) 3: 431-465(1995) BibTeX

Referenced by

1. Giovanni Giuffrida, Wesley W. Chu, Dominique M. Hanssens: Mining Classification Rules from Datasets with Large Number of Many-Valued Attributes. EDBT 2000: 335-349