• Publications
  • Influence
Mining association rules between sets of items in large databases
We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an efficient algorithm that generates all significantExpand
  • 12,056
  • 979
Efficient Similarity Search In Sequence Databases
We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observationExpand
  • 1,963
  • 240
Database Mining: A Performance Perspective
The authors' perspective of database mining as the confluence of machine learning techniques and the performance emphasis of database technology is presented. Three classes of database miningExpand
  • 1,427
  • 77
Optimization of large join queries
We investigate the problem of optimizing Select—Project—Join queries with large numbers of joins. Taking advantage of commonly used heuristics, the problem is reduced to that of determining theExpand
  • 200
  • 16
Clustering association rules
The authors consider the problem of clustering two-dimensional association rules in large databases. They present a geometric-based algorithm, BitOp, for performing the clustering, embedded within anExpand
  • 414
  • 12
An Interval Classifier for Database Mining Applications
We are given a large population database that contains information about population instances. The population is known to comprise of m groups, but the population instances are not labeled with theExpand
  • 284
  • 11
Sequential sampling procedures for query size estimation
We provide a procedure, based on random sampling, for estimation of the size of a query result. The procedure is sequential in that sampling terminates after a random number of steps according to aExpand
  • 171
  • 9
Set-oriented mining for association rules in relational databases
Describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less efficient than special-purpose algorithms. WeExpand
  • 283
  • 8
Optimization of large join queries: combining heuristics and combinatorial techniques
We investigate the use of heuristics in optimizing queries with a large number of joins. Examples of such heuristics are the augmentation and local improvement heuristics described in this paper andExpand
  • 168
  • 8