The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Parallel Data Mining
|
|
Author(s): David Taniar (Monash University, Australia)and J. Wenny Rahayu (La Trobe University, Australia)
Copyright: 2002
Pages: 29
Source title:
Data Mining: A Heuristic Approach
Source Author(s)/Editor(s): Hussein A. Abbass (University of New South Wales, Australia), Ruhul Sarker (University of New South Wales, Australia)and Charles S. Newton (University of New South Wales, Australia)
DOI: 10.4018/978-1-930708-25-9.ch013
Purchase
|
Abstract
Data mining refers to a process on nontrivial extraction of implicit, previously unknown and potential useful information (such as knowledge rules, constraints, regularities) from data in databases. With the availability of inexpensive storage and the progress in data capture technology, many organizations have created ultra-large databases of business and scientific data, and this trend is expected to grow. Since the databases to be mined are likely to be very large (measured in terabytes and even petabytes), there is a critical need to investigate methods for parallel data mining techniques. Without parallelism, it is generally difficult for a single processor system to provide reasonable response time. In this chapter, we present a comprehensive survey of parallelism techniques for data mining. Parallel data mining offers new complexity as it incorporates techniques from parallel databases and parallel programming. Challenges that remain open for future research will also be presented.
Related Content
|
.
© 2023.
34 pages.
|
|
.
© 2023.
15 pages.
|
|
.
© 2023.
15 pages.
|
|
.
© 2023.
18 pages.
|
|
.
© 2023.
24 pages.
|
|
.
© 2023.
32 pages.
|
|
.
© 2023.
21 pages.
|
|
|