![](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
Data Mining and Knowledge Discovery, Volume 9
Volume 9, Number 1, July 2004
- Woong-Kee Loh, Sang-Wook Kim, Kyu-Young Whang:
A Subsequence Matching Algorithm that Supports Normalization Transform in Time-Series Databases. 5-28 - Muhammet Mustafa Ozdal, Cevdet Aykanat:
Hypergraph Models and Algorithms for Data-Pattern-Based Clustering. 29-57 - Stefan Schrödl, Kiri Wagstaff
, Seth Rogers, Pat Langley, Christopher Wilson:
Mining GPS Traces for Map Refinement. 59-87 - Jinyan Li, Thomas Manoukian, Guozhu Dong, Kotagiri Ramamohanarao
:
Incremental Maintenance on the Border of the Space of Emerging Patterns. 89-116
Volume 9, Number 2, September 2004
- Charu C. Aggarwal:
On Leveraging User Access Patterns for Topic Specific Crawling. 123-145 - Ayhan Demiriz
:
Enhancing Product Recommender Systems on Sparse Binary Data. 147-170 - Manuel Castejón Limas
, Joaquín B. Ordieres Meré
, Francisco J. Martínez de Pisón Ascacibar, Eliseo P. Vergara González
:
Outlier Detection and Data Cleaning in Multivariate Non-Normal Samples: The PAELLA Algorithm. 171-187 - Jiong Yang, Wei Wang
, Philip S. Yu:
Mining Surprising Periodic Patterns. 189-216
Volume 9, Number 3, November 2004
- Mohammed Javeed Zaki
:
Mining Non-Redundant Association Rules. 223-248 - Guimei Liu, Hongjun Lu, Wenwu Lou, Yabo Xu, Jeffrey Xu Yu:
Efficient Mining of Frequent Patterns Using Ascending Frequency Ordered Prefix-Tree. 249-274 - Wojciech Grohman:
Using Convex Sets for Exploratory Data Analysis and Visualization. 275-295
![](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.