The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Biologically Inspired Techniques for Data Mining: A Brief Overview of Particle Swarm Optimization for KDD
|
|
Author(s): Shafiq Alam (University of Auckland, New Zealand), Gillian Dobbie (University of Auckland, New Zealand), Yun Sing Koh (University of Auckland, New Zealand)and Saeed ur Rehman (Unitec Institute of Technology, New Zealand)
Copyright: 2014
Pages: 10
Source title:
Biologically-Inspired Techniques for Knowledge Discovery and Data Mining
Source Author(s)/Editor(s): Shafiq Alam (University of Auckland, New Zealand), Gillian Dobbie (University of Auckland, New Zealand), Yun Sing Koh (University of Auckland, New Zealand)and Saeed ur Rehman (Unitec Institute of Technology, New Zealand)
DOI: 10.4018/978-1-4666-6078-6.ch001
Purchase
|
Abstract
Knowledge Discovery and Data (KDD) mining helps uncover hidden knowledge in huge amounts of data. However, recently, different researchers have questioned the capability of traditional KDD techniques to tackle the information extraction problem in an efficient way while achieving accurate results when the amount of data grows. One of the ways to overcome this problem is to treat data mining as an optimization problem. Recently, a huge increase in the use of Swarm Intelligence (SI)-based optimization techniques for KDD has been observed due to the flexibility, simplicity, and extendibility of these techniques to be used for different data mining tasks. In this chapter, the authors overview the use of Particle Swarm Optimization (PSO), one of the most cited SI-based techniques in three different application areas of KDD, data clustering, outlier detection, and recommender systems. The chapter shows that there is a tremendous potential in these techniques to revolutionize the process of extracting knowledge from big data using these techniques.
Related Content
|
.
© 2023.
34 pages.
|
|
.
© 2023.
15 pages.
|
|
.
© 2023.
15 pages.
|
|
.
© 2023.
18 pages.
|
|
.
© 2023.
24 pages.
|
|
.
© 2023.
32 pages.
|
|
.
© 2023.
21 pages.
|
|
|