Sciweavers

94 search results - page 15 / 19
» kdd 2003
Sort
View
64
Voted
KDD
2003
ACM
130views Data Mining» more  KDD 2003»
15 years 10 months ago
Towards systematic design of distance functions for data mining applications
Distance function computation is a key subtask in many data mining algorithms and applications. The most effective form of the distance function can only be expressed in the conte...
Charu C. Aggarwal
KDD
2003
ACM
205views Data Mining» more  KDD 2003»
15 years 10 months ago
The data mining approach to automated software testing
In today's industry, the design of software tests is mostly based on the testers' expertise, while test automation tools are limited to execution of pre-planned tests on...
Mark Last, Menahem Friedman, Abraham Kandel
KDD
2003
ACM
194views Data Mining» more  KDD 2003»
15 years 10 months ago
Finding recent frequent itemsets adaptively over online data streams
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be c...
Joong Hyuk Chang, Won Suk Lee
83
Voted
KDD
2003
ACM
99views Data Mining» more  KDD 2003»
15 years 10 months ago
Fragments of order
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
Aristides Gionis, Teija Kujala, Heikki Mannila
KDD
2003
ACM
191views Data Mining» more  KDD 2003»
15 years 10 months ago
Assessment and pruning of hierarchical model based clustering
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
Jeremy Tantrum, Alejandro Murua, Werner Stuetzle