Abstract
In order to find an effective method of solving the problem of subjectivity and difficulty in the high-dimension data clustering, a new method—an improved Projection Pursuit based on Ant Colony Optimization algorithm was introduced. The ant colony optimization algorithm was employed to optimize the function of the projected indexes in the PP. The ant colony optimization algorithm has the strong global optimization ability and the PP method is a powerful technique for extracting statistically significant features from high-dimension data for automatic target detection and classification. Application results show that the method can complete the selection more objectivity and rationality with objective weight, high resolving power, and stable result. The study provides a novel algorithm for the high-dimension data clustering.
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
Lovchinov, V., Tsakovski, S.: Multivariate Statistical Approaches as Applied to Environmental Physics Studies. Central European Journal of Physics 4(2), 277–298 (2006)
Bezdek, J.C.: Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum Press, New York (1981)
Sadri, B., Har-Peled, S.: How fast is the K-means Method? Algorithmic 3, 185–202 (2005)
Kanungo, T., Mount, D.M., Netanyahu, N., et al.: A Local Search Approximation Algorithm for K-means Clustering. Computational Geometry: Theory and Applications 28(2), 89–112 (2004)
Mishra, N., Ron, D., Swaminathan, R.: A New Conceptual Clustering Framework. Machine Learning 56(1), 115–151 (2004)
Pinto, M.: A Generalization to Poincarés Theorem for Recurrent Systems. Appl. Anal. 85(4), 373–381 (2006)
Yang, X., Zhao, W., Chen, Y., et al.: Image Segmentation with a Fuzzy Clustering Algorithm based on Ant-tree. Signal Processing 88(10), 2453–2462 (2008)
Huber, P.J.: Projection Pursuit. The Annals of Statistics 13(2), 435–475 (1985)
Jimenez, L., Landgrebe, D.: Hyperspectral Data Analysis and Feature Reduction via Projection Pursuit. IEEE Trans. Geosci. Remote Sensing 37(6), 2653–2667 (1999)
Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Li, Y., Li, W.: Adaptive Ant Colony Optimization Algorithm based on Information Entropy: Foundation and Application. Fundamenta Informaticae 77(3), 229–242 (2007)
Friedman, J.H., Tukey, J.W.: A Projection Pursuit Algorithm for Exploratory Data Analysis. IEEE Trans. Comput. 23(9), 881–889 (1974)
Cheng, P.: Projection Pursuit of the Limit Distribution of the Distribution of Experience. Applied Probability and Statistics 3(1), I8–21 (1987)
Friedman, H.J., Stuetzle, W.: Projection Pursuit Regression. Jamer. Statist. Assoe. 76, 817–823 (1981)
Huber, P.J.: Projection Pursuit with Discussion. Ann. Statist. 13(1), 43–52 (1985)
Fu, Q., Xie, Y., Wei, Z.: Application of Projection Pursuit Evaluation Model Variations in the Sanjiang Plain. China Pedossphere 3, 249–256 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Y., Zhao, L., Zhou, S. (2010). ACO-Based Projection Pursuit: A Novel Clustering Algorithm. In: Zaman, M., Liang, Y., Siddiqui, S.M., Wang, T., Liu, V., Lu, C. (eds) E-business Technology and Strategy. CETS 2010. Communications in Computer and Information Science, vol 113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16397-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-16397-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16396-8
Online ISBN: 978-3-642-16397-5
eBook Packages: Computer ScienceComputer Science (R0)