![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
4. DMKD 1999: Philadelphia, PA, USA
- Kyuseok Shim, Ramakrishnan Srikant:
1999 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, Philadelphia, USA, May 30, 1999. 1999
Invited Talk
Applications/Experiences
- Fosca Giannotti, Giuseppe Manco, Dino Pedreschi, Franco Turini:
Experiences with a Logic-based knowledge discovery Support Environment. - Shinichi Morishita, Teruyoshi Hishiki, Kousaku Okubo:
Towards Mining Gene Expression Database.
Associations
- Bart Goethals, Jan Van den Bussche:
A priori versus a posteriori filtering of association rules. - Dimitris Meretakis, Beat Wüthrich:
Classification as Mining and Use of Labeled Itemsets. - Devavrat Shah, Laks V. S. Lakshmanan, Krithi Ramamritham, S. Sudarshan:
Interestingness and Pruning of Mined Patterns.
Invited Industry Talk
Algorithms
- Manoranjan Dash, Huan Liu:
Handling Large Unsupervised Data via Dimensionality Reduction. - Gösta Grahne, Laks V. S. Lakshmanan, Xiaohong Wang:
Interactive Mining of Correlations - A Constraint Perspective. - Jiawei Han, Qiang Yang, Edward Kim:
Plan Mining by Divide-and-Conquer.
Future Directions
- Daniel Barbará:
Chaotic Mining: Knowledge Discovery Using the Fractal Dimension. - Theodore Johnson, Raymond T. Ng, Laks V. S. Lakshmanan:
Towards a Toolkit for Data Analysis and Mining. - Vijayshankar Raman, Andy Chou, Joseph M. Hellerstein:
Scalable Spreadsheets for Interactive Data Analysis. - Haixun Wang, Carlo Zaniolo:
User-Defined Aggregates for Datamining.
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.