1813 search results - page 69 / 363 » Instance Pruning Techniques |
119
click to vote
ADL
2000
Springer
15 years 4 months ago
2000
Springer
We address the problem of tight XML schemas and propose regular tree automata to model XML data. We show that the tree automata model is more powerful that the XML DTDs and is clo...
KDD
1997
ACM
15 years 4 months ago
1997
ACM
This paper investigates a brute-force technique for mining classification rules from large data sets. We employ an association rule miner enhanced with new pruning strategies to c...
SIGMOD
1993
ACM
15 years 4 months ago
1993
ACM
We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an e cient algorithm that generates all s...
105
click to vote
PPSN
1992
Springer
15 years 4 months ago
1992
Springer
We present an application of arti cial neural networks to machine condition monitoring. Since several signal preprocessing methods produce high dimensional feature vectors there i...
FIMI
2003
15 years 1 months ago
2003
We describe a method for computing closed sets with data-dependent constraints. Especially, we show how the method can be adapted to find frequent closed sets in a given data set...