Discovering All Most Specific Sentences by Randomized Algorithms.

@inproceedings{DBLP:conf/icdt/GunopoulosMS97,
  author    = {Dimitrios Gunopulos and
               Heikki Mannila and
               Sanjeev Saluja},
  editor    = {Foto N. Afrati and
               Phokion G. Kolaitis},
  title     = {Discovering All Most Specific Sentences by Randomized Algorithms},
  booktitle = {Database Theory - ICDT '97, 6th International Conference, Delphi,
               Greece, January 8-10, 1997, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1186},
  year      = {1997},
  isbn      = {3-540-62222-5},
  pages     = {215-229},
  ee        = {db/conf/icdt/GunopoulosMS97.html},
  crossref  = {DBLP:conf/icdt/97},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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 CD and click on the path of your mount point:
  /Anthology/An2-2 or /cdrom

• 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

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]

Rakesh Agrawal, Ramakrishnan Srikant: Mining Sequential Patterns. ICDE 1995: 3-14 BibTeX

[4]

...

[5]

Siegfried Bell, Peter Brockhausen: Discovery of Constraints and Data Dependencies in Databases (Extended Abstract). ECML 1995: 267-270 BibTeX

[6]

...

[7]

...

[8]

Luc De Raedt, Maurice Bruynooghe: A Theory of Clausal Discovery. IJCAI 1993: 1058-1063 BibTeX

[9]

Luc De Raedt, Saso Dzeroski: First-Order jk-Clausal Theories are PAC-Learnable. Artif. Intell. 70(1-2): 375-392(1994) BibTeX

[10]

Thomas Eiter, Georg Gottlob: Identifying the Minimal Transversals of a Hypergraph and Related Problems. SIAM J. Comput. 24(6): 1278-1304(1995) BibTeX

[11]

Usama M. Fayyad, Gregory Piatetsky-Shapiro, Padhraic Smyth, Ramasamy Uthurusamy (Eds.): Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press 1996, ISBN 0-262-56097-6
Contents BibTeX

[12]

M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
BibTeX

[13]

Jiawei Han, Yongjian Fu: Discovery of Multiple-Level Association Rules from Large Databases. VLDB 1995: 420-431 BibTeX

[14]

Maurice A. W. Houtsma, Arun N. Swami: Set-Oriented Mining for Association Rules in Relational Databases. ICDE 1995: 25-33 BibTeX

[15]

David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis: On Generating All Maximal Independent Sets. Inf. Process. Lett. 27(3): 119-123(1988) BibTeX

[16]

...

[17]

Willi Klösgen: Efficient Discovery of Interesting Statements in Databases. J. Intell. Inf. Syst. 4(1): 53-69(1995) BibTeX

[18]

...

[19]

...

[20]

Heikki Mannila: Data Mining: Machine Learning, Statistics, and Databases. SSDBM 1996: 2-9 BibTeX

[21]

Heikki Mannila, Kari-Jouko Räihä: Design by Example: An Application of Armstrong Relations. J. Comput. Syst. Sci. 33(2): 126-141(1986) BibTeX

[22]

Heikki Mannila, Kari-Jouko Räihä: Algorithms for Inferring Functional Dependencies from Relations. Data Knowl. Eng. 12(1): 83-99(1994) BibTeX

[23]

...

[24]

Heikki Mannila, Hannu Toivonen, A. Inkeri Verkamo: Discovering Frequent Episodes in Sequences. KDD 1995: 210-215 BibTeX

[25]

Ashok Savasere, Edward Omiecinski, Shamkant B. Navathe: An Efficient Algorithm for Mining Association Rules in Large Databases. VLDB 1995: 432-444 BibTeX

[26]

...

[27]

Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press 1988, ISBN 0-7167-8158-1
Contents BibTeX

[28]

Leslie G. Valiant: The Complexity of Enumeration and Reliability Problems. SIAM J. Comput. 8(3): 410-421(1979) BibTeX

Referenced by

1. Roberto J. Bayardo Jr.: Efficiently Mining Long Patterns from Databases. SIGMOD Conference 1998: 85-93
2. Dao-I Lin, Zvi M. Kedem: Pincer Search: A New Algorithm for Discovering the Maximum Frequent Set. EDBT 1998: 105-119
3. Sergey Brin, Rajeev Motwani, Craig Silverstein: Beyond Market Baskets: Generalizing Association Rules to Correlations. SIGMOD Conference 1997: 265-276
4. Dimitrios Gunopulos, Roni Khardon, Heikki Mannila, Hannu Toivonen: Data mining, Hypergraph Transversals, and Machine Learning. PODS 1997: 209-216