The k-means clustering architecture in the multi-stage data mining process

Authors:
Bobby D. Gerardo;Jae-Wan Lee;Yeon-Sung Choi;Malrey Lee
Affiliations:
School of Electronic and Information Engineering, Kunsan National University, Chonbuk, South Korea;School of Electronic and Information Engineering, Kunsan National University, Chonbuk, South Korea;School of Electronic and Information Engineering, Kunsan National University, Chonbuk, South Korea;School of Electronic and Information Engineering, Chonbuk National University, Chonbuk, South Korea
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
Year:
2005

Citing 3
Cited 2

Data mining: concepts and techniques

Data mining: concepts and techniques
Software Engineering: A Practitioner's Approach

Software Engineering: A Practitioner's Approach
A new two-phase sampling based algorithm for discovering association rules

Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining

An intelligent multi-criteria optimization method for quick and market-oriented textile material design

Journal of Global Optimization
Use of data mining in system development life cycle

Data Mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we used software engineering principles for the development of models and proposed the K-Means clustering architecture implemented on the multi-stage data mining process. We developed a modified architecture and expanded it by showing refinements on every process of the clustering and knowledge discovery stages. We used the mentioned hierarchical clustering model to partition the data into smaller groups of attributes so that we would determine the data structure before applying the data mining tools. The experiment shows that the model using the clustering resulted to an isolated but imperative association rules based on clustered data, which in return could be practically explained for decision making purposes. Shorter processing time had been observed in computing for smaller clusters implying faster and ideal processing period than dealing with the entire dataset.