Sciweavers

922 search results - page 85 / 185
» A data mining approach to database compression
Sort
View
DAWAK
2004
Springer
15 years 7 months ago
PROWL: An Efficient Frequent continuity Mining Algorithm on Event Sequences
Mining association rule in event sequences is an important data mining problem with many applications. Most of previous studies on association rules are on mining intra-transaction...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 7 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
KDD
1995
ACM
85views Data Mining» more  KDD 1995»
15 years 7 months ago
Estimating the Robustness of Discovered Knowledge
This paper introduces a new measurement, robustness, to measure the quality of machine-discovered knowledge from real-world databases that change over time. A piece of knowledge i...
Chun-Nan Hsu, Craig A. Knoblock
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
16 years 4 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
16 years 4 months ago
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Christian Böhm, Bernhard Braunmüller, Fl...