Mining very large databases
- 1 August 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 32 (8) , 38-45
- https://doi.org/10.1109/2.781633
Abstract
Established companies have had decades to accumulate masses of data about their customers, suppliers, products and services, and employees. Data mining, also known as knowledge discovery in databases, gives organizations the tools to sift through these vast data stores to find the trends, patterns, and correlations that can guide strategic decision making. Traditionally, algorithms for data analysis assume that the input data contains relatively few records. Current databases however, are much too large to be held in main memory. To be efficient, the data mining techniques applied to very large databases must be highly scalable. An algorithm is said to be scalable if (given a fixed amount of main memory), its runtime increases linearly with the number of records in the input database. Recent work has focused on scaling data mining algorithms to very large data sets. The authors describe a broad range of algorithms that address three classical data mining problems: market basket analysis, clustering, and classification.Keywords
This publication has 7 references indexed in Scilit:
- Mining sequential patternsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- CLARANS: a method for clustering objects for spatial data miningIEEE Transactions on Knowledge and Data Engineering, 2002
- Cure: an efficient clustering algorithm for large databasesInformation Systems, 2001
- Clustering large datasets in arbitrary metric spacesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- Dynamic itemset counting and implication rules for market basket dataPublished by Association for Computing Machinery (ACM) ,1997
- BIRCHACM SIGMOD Record, 1996
- An effective hash-based algorithm for mining association rulesACM SIGMOD Record, 1995