Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-28T02:03:07.497Z Has data issue: false hasContentIssue false

Data mining techniques

Published online by Cambridge University Press:  09 January 2003

Markus Hegland
Affiliation:
Centre for Mathematics and its Applications, School of Mathematical Sciences, Australian National University, Canberra ACT 0200, Australia E-mail:[email protected]

Abstract

Methods for knowledge discovery in data bases (KDD) have been studied for more than a decade. New methods are required owing to the size and complexity of data collections in administration, business and science. They include procedures for data query and extraction, for data cleaning, data analysis, and methods of knowledge representation. The part of KDD dealing with the analysis of the data has been termed data mining. Common data mining tasks include the induction of association rules, the discovery of functional relationships (classification and regression) and the exploration of groups of similar data objects in clustering. This review provides a discussion of and pointers to efficient algorithms for the common data mining tasks in a mathematical framework. Because of the size and complexity of the data sets, efficient algorithms and often crude approximations play an important role.

Type
Research Article
Copyright
© Cambridge University Press 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)