Methods and Problems in Data Mining.

@inproceedings{DBLP:conf/icdt/Mannila97,
  author    = {Heikki Mannila},
  editor    = {Foto N. Afrati and
               Phokion G. Kolaitis},
  title     = {Methods and Problems in Data Mining},
  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     = {41-55},
  ee        = {db/conf/icdt/Mannila97.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, Kyuseok Shim: Developing Tightly-Coupled Data Mining Applications on a Relational Database System. KDD 1996: 287-290 BibTeX

[4]

Stefan Berchtold, Daniel A. Keim, Hans-Peter Kriegel: The X-tree : An Index Structure for High-Dimensional Data. VLDB 1996: 28-39 BibTeX

[5]

Peter A. Boncz, Wilko Quak, Martin L. Kersten: Monet And Its Geographic Extensions: A Novel Approach to High Performance GIS Processing. EDBT 1996: 147-166 BibTeX

[6]

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

[7]

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

[8]

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

[9]

Usama M. Fayyad, S. George Djorgovski, Nicholas Weir: Automating the Analysis and Cataloging of Sky Surveys. Advances in Knowledge Discovery and Data Mining 1996: 471-493 BibTeX

[10]

Usama M. Fayyad, Gregory Piatetsky-Shapiro, Padhraic Smyth: From Data Mining to Knowledge Discovery: An Overview. Advances in Knowledge Discovery and Data Mining 1996: 1-34 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]

Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama: Data Mining Using Two-Dimensional Optimized Accociation Rules: Scheme, Algorithms, and Visualization. SIGMOD Conference 1996: 13-23 BibTeX

[13]

Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama: Mining Optimized Association Rules for Numeric Attributes. PODS 1996: 182-191 BibTeX

[14]

Zvi Galil, Esko Ukkonen (Eds.): Combinatorial Pattern Matching, 6th Annual Symposium, CPM 95, Espoo, Finland, July 5-7, 1995, Proceedings. Lecture Notes in Computer Science 937 Springer 1995, ISBN 3-540-60044-2
Contents BibTeX

[15]

Jim Gray, Adam Bosworth, Andrew Layman, Hamid Pirahesh: Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total. ICDE 1996: 152-159 BibTeX

[16]

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

[17]

Kimmo Hätönen, Mika Klemettinen, Heikki Mannila, Pirjo Ronkainen, Hannu Toivonen: Knowledge Discovery from Telecommunication Network Alarm Databases. ICDE 1996: 115-122 BibTeX

[18]

Marcel Holsheimer, Martin L. Kersten, Heikki Mannila, Hannu Toivonen: A Perspective on Databases and Data Mining. KDD 1995: 150-155 BibTeX

[19]

...

[20]

...

[21]

Tomasz Imielinski, Heikki Mannila: A Database Perspective on Knowledge Discovery. Commun. ACM 39(11): 58-64(1996) BibTeX

[22]

...

[23]

...

[24]

...

[25]

Daniel A. Keim, Hans-Peter Kriegel: Visualization Techniques for Mining Large Databases: A Comparison. IEEE Trans. Knowl. Data Eng. 8(6): 923-938(1996) BibTeX

[26]

...

[27]

Jyrki Kivinen, Heikki Mannila: The Power of Sampling in Knowledge Discovery. PODS 1994: 77-85 BibTeX

[28]

Jyrki Kivinen, Heikki Mannila: Approximate Inference of Functional Dependencies from Relations. Theor. Comput. Sci. 149(1): 129-149(1995) BibTeX

[29]

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

[30]

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

[31]

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

[32]

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

[33]

...

[34]

...

[35]

Heikki Mannila, Hannu Toivonen: Discovering Generalized Episodes Using Minimal Occurrences. KDD 1996: 146-151 BibTeX

[36]

Heikki Mannila, Hannu Toivonen: Multiple Uses of Frequent Sets and Condensed Representations (Extended Abstract). KDD 1996: 189-194 BibTeX

[37]

...

[38]

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

[39]

Christopher J. Matheus, Gregory Piatetsky-Shapiro, Dwight McNeill: Selecting and reporting What Is Interesting. Advances in Knowledge Discovery and Data Mining 1996: 495-515 BibTeX

[40]

Rosa Meo, Giuseppe Psaila, Stefano Ceri: A New SQL-like Operator for Mining Association Rules. VLDB 1996: 122-133 BibTeX

[41]

...

[42]

Balaji Padmanabhan, Alexander Tuzhilin: Pattern Discovery in Temporal Databases: A Temporal Logic Approach. KDD 1996: 351-354 BibTeX

[43]

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

[44]

...

[45]

Wei-Min Shen, KayLiang Ong, Bharat G. Mitbander, Carlo Zaniolo: Metaqueries for Data Mining. Advances in Knowledge Discovery and Data Mining 1996: 375-398 BibTeX

[46]

Michael Siegel: Automatic Rule Derivation For Semantic Query Optimization. Expert Database Conf. 1988: 669-698 BibTeX

[47]

Ramakrishnan Srikant, Rakesh Agrawal: Mining Quantitative Association Rules in Large Relational Tables. SIGMOD Conference 1996: 1-12 BibTeX

[48]

Hannu Toivonen: Sampling Large Databases for Association Rules. VLDB 1996: 134-145 BibTeX

[49]

...

Referenced by

1. Luc Boasson, Patrick Cégielski, Irène Guessarian, Yuri Matiyasevich: Window-Accumulated Subsequence Matching Problem is Linear. PODS 1999: 327-336
2. Shalom Tsur, Jeffrey D. Ullman, Serge Abiteboul, Chris Clifton, Rajeev Motwani, Svetlozar Nestorov, Arnon Rosenthal: Query Flocks: A Generalization of Association-Rule Mining. SIGMOD Conference 1998: 1-12