The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
A Taxonomy of Data Mining Problems
Abstract
Much of the research in data mining and knowledge discovery has focused on the development of efficient data mining algorithms. Researchers and practitioners have developed data mining techniques to solve diverse real-world data mining problems. But there is no single source that identifies which techniques solve what problems and how, the advantages and limitations, and real-life use-cases. Lately, identifying data mining techniques and corresponding problems that they solve has drawn significant attention. In this paper, the author describes the progress made in developing data mining techniques and then classify them in terms of data mining problems taxonomy to help assist practitioners in using appropriate data mining techniques that solve business problems. This will allow researchers to expand the body of knowledge in this discipline. This article proposes a data mining problems taxonomy based on data mining techniques being used. Prominent data mining problems include classification, optimization, prediction, partitioning, relationship, pattern matching, recommendation, ranking, sequential patterns and anomaly detection. The data mining techniques that are used to solve these data mining problems in general fall under top 10 data mining algorithms.
Related Content
|
Jaime Salvador, Zoila Ruiz, Jose Garcia-Rodriguez.
© 2020.
12 pages.
|
|
Stavros Pitoglou.
© 2020.
11 pages.
|
|
Mette L. Baran.
© 2020.
13 pages.
|
|
Yingxu Wang, Victor Raskin, Julia M. Rayz, George Baciu, Aladdin Ayesh, Fumio Mizoguchi, Shusaku Tsumoto, Dilip Patel, Newton Howard.
© 2020.
15 pages.
|
|
Yingxu Wang, Lotfi A. Zadeh, Bernard Widrow, Newton Howard, Françoise Beaufays, George Baciu, D. Frank Hsu, Guiming Luo, Fumio Mizoguchi, Shushma Patel, Victor Raskin, Shusaku Tsumoto, Wei Wei, Du Zhang.
© 2020.
18 pages.
|
|
Nayem Rahman.
© 2020.
24 pages.
|
|
Amir Manzoor.
© 2020.
27 pages.
|
|
|