Sciweavers

KDD
1998
ACM
164views Data Mining» more  KDD 1998»
14 years 25 days ago
A Data Mining Support Environment and its Application on Insurance Data
Huge masses of digital data about products, customers and competitors have become available for companies in the services sector. In order to exploit its inherent (and often hidde...
Martin Staudt, Jörg-Uwe Kietz, Ulrich Reimer
KDD
1998
ACM
159views Data Mining» more  KDD 1998»
14 years 25 days ago
A Robust System Architecture for Mining Semi-Structured Data
The value of extracting knowledge from semi-structured data is readily apparent with the explosion of the WWW and the advent of digital libraries. This paper proposes a versatile ...
Lisa Singh, Bin Chen, Rebecca Haight, Peter Scheue...
KDD
1998
ACM
190views Data Mining» more  KDD 1998»
14 years 25 days ago
Time Series Forecasting from High-Dimensional Data with Multiple Adaptive Layers
This paper describes our work in learning online models that forecast real-valued variables in a high-dimensional space. A 3GB database was collected by sampling 421 real-valued s...
R. Bharat Rao, Scott Rickard, Frans Coetzee
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
14 years 25 days ago
Ranking - Methods for Flexible Evaluation and Efficient Comparison of Classification Performance
We present the notion of Ranking for evaluation of two-class classifiers. Ranking is based on using the ordering information contained in the output of a scoring model, rather tha...
Saharon Rosset
KDD
1998
ACM
193views Data Mining» more  KDD 1998»
14 years 25 days ago
Methods for Linking and Mining Massive Heterogeneous Databases
Manyreal-world KDDexpeditions involve investigation of relationships betweenvariables in different, heterogeneousdatabases. Wepresent a dynamic programmingtechnique for linking re...
José C. Pinheiro, Don X. Sun
KDD
1998
ACM
122views Data Mining» more  KDD 1998»
14 years 25 days ago
Memory Placement Techniques for Parallel Association Mining
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
Srinivasan Parthasarathy, Mohammed Javeed Zaki, We...
KDD
1998
ACM
118views Data Mining» more  KDD 1998»
14 years 25 days ago
A Belief-Driven Method for Discovering Unexpected Patterns
Several pattern discovery methods proposed in the data mining literature have the drawbacks that they discover too many obvious or irrelevant patterns and that they do not leverag...
Balaji Padmanabhan, Alexander Tuzhilin
KDD
1998
ACM
106views Data Mining» more  KDD 1998»
14 years 25 days ago
Analysing Rock Samples for the Mars Lander
In the near future NASAintends to explore various regions of our solar systemusing robotic devices such as rovers, spacecraft, airplanes, and/or balloons. Such platforms will carr...
Jonathan J. Oliver, Ted Roush, Paul Gazis, Wray L....
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
14 years 25 days ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen
KDD
1998
ACM
112views Data Mining» more  KDD 1998»
14 years 25 days ago
Evaluating Usefulness for Dynamic Classification
This paper develops the concept of usefulness in the context of supervised learning. We argue that usefulness can be used to improve the performance of classification rules (as me...
Gholamreza Nakhaeizadeh, Charles Taylor, Carsten L...