Abstract
In this paper, in order to address the well-known ‘sensitivity’ problems associated with K-means clustering, a real-coded Genetic Algorithms (GA) is incorporated into K-means clustering. The result of the hybridisation is an enhanced search algorithm obtained by incorporating the local search capability rendered by the hill-climbing optimisation with the global search ability provided by GAs. The proposed algorithm has been compared with other clustering algorithms under the same category using an artificial data set and a benchmark problem. Results show, in all cases, that the proposed algorithm outperforms its counterparts in terms of global search capability. Moreover, the scalability of the proposed algorithm to high-dimensional problems featuring a large number of data points has been validated using an application to compress field data sets from sub-15MW industry gas turbines, during commissioning. Such compressed field data is expected to result in more efficient and more accurate sensor fault detection.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Murthy, C.A., Chowdhury, N.: In Search of Optimal Clusters Using Genetic Algorithms. Pattern Recognition Letters 17, 825–832 (1996)
Bezdek, J.C., Hathaway, R.J.: Optimization of Fuzzy Clustering Criteria Using Genetic Algorithms. In: The 1st IEEE Conference on Evolutionary Computation, vol. 2(2), pp. 589–594 (1994)
Chen, J.: Biologically Inspired Optimisation Algorithms for Transparent Knowledge Extraction Allied to Engineering Materials Processing. PhD. Thesis, University of Sheffield (2009)
Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms. Wiley, Chichester (2001)
Deb, K., Anand, A., Joshi, D.: A Computationally Efficient Evolutionary Algorithm for Real-Parameter Optimization. In: Evolutionary Computation, vol. 10 (4), pp. 371–395. MIT Press (2002)
Krishna, K., Narasimha Murty, M.: Genetic K-Means Algorithm. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics 29(3), 433–439 (1999)
Hall, L.O., Özyurt, I.B., Bezdek, J.C.: Clustering with a Genetically Optimized Approach. IEEE Transactions on Evolutionary Computation 3(2), 103–112 (1999)
Fisher, R.A.: The Use of Multiple Measurements in Taxonomic Problems. Ann. Eugen. 7(2), 179–188 (1936)
Bandyopadhyay, S., Maulik, U.: An Evolutionary Technique Based on K-Means Algorithm for Optimal Clustering in ℝN. Information Sciences 146, 221–237 (2002)
Chiu, S.L.: Fuzzy Model Identification Based on Cluster Estimation. J. of Intelligent & Fuzzy Systems 2(3) (1994)
Sheng, W., Liu, X.: A Genetic K-medoids Clustering Algorithm. Journal of Heuristics 12, 447–466 (2006)
Zhang, Y., Bingham, C.M., Yang, Z., Gallimore, M., Ling, W.K.: Sensor Fault Detection for Industrial Gas Turbine System by Using Principal Component Analysis Based Y-distance Indexes. In: Proceeding on 8th IEEE, IET International Symposium on Communication Systems, Networks and Digital Signal Processing (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, J., Mahfouf, M., Bingham, C., Zhang, Y., Yang, Z., Gallimore, M. (2012). An Evolutionary Based Clustering Algorithm Applied to Dada Compression for Industrial Systems. In: Hollmén, J., Klawonn, F., Tucker, A. (eds) Advances in Intelligent Data Analysis XI. IDA 2012. Lecture Notes in Computer Science, vol 7619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34156-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-34156-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34155-7
Online ISBN: 978-3-642-34156-4
eBook Packages: Computer ScienceComputer Science (R0)