Abstract

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 mining problems involving classification, associations, and sequences are described. It is argued that these problems can be uniformly viewed as requiring discovery of rules embedded in massive amounts of data. A model and some basic operations for the process of rule discovery are described. It is shown how the database mining problems considered map to this model, and how they can be solved by using the basic operations proposed. An example is given of an algorithm for classification obtained by combining the basic rule discovery operations. This algorithm is efficient in discovering classification rules and has accuracy comparable to ID3, one of the best current classifiers.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Keywords

Computer sciencePerspective (graphical)Data miningDatabaseKnowledge extractionProcess (computing)Artificial intelligenceInformation retrievalMachine learning

Affiliated Institutions

Related Publications

HIPERLAN, applications and requirements

This paper traces the origins and applications of HIPERLAN, a system for high speed short range radio networks for computers. HIPERLAN, HIgh Performance European Radio LAN, is t...

2003 18 citations

Publication Info

Year
1993
Type
article
Volume
5
Issue
6
Pages
914-925
Citations
1483
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

1483
OpenAlex

Cite This

R. K. Agrawal, Tomasz Imieliński, A. Swami (1993). Database mining: a performance perspective. IEEE Transactions on Knowledge and Data Engineering , 5 (6) , 914-925. https://doi.org/10.1109/69.250074

Identifiers

DOI
10.1109/69.250074