Abstract
In order to summarize and represent graphically multidimensional data in statistics, projection pursuit methods look for projection axes which reveal structures, such as possible groups or outliers, by optimizing a function called projection index. To determine these possible interesting structures, it is necessary to choose an optimization method capable to find not only the global optimum of the projection index but also the local optima susceptible to reveal these structures. For this purpose, we suggest a metaheuristic which does not ask for many parameters to settle and which provokes premature convergence to local optima. This method called Tribes is a hybrid Particle Swarm Optimization method (PSO) based on a stochastic optimization technique developed in [2]. The computation is fast even for big volumes of data so that the use of the method in the field of projection pursuit fulfills the statistician expectations.
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
Caussinus, H., Ruiz-Gazen, A.: Exploratory projection pursuit. In: Govaert, G. (ed.) Data Analysis, Digital Signal and Image Processing, pp. 67–92. Wiley, Chichester (2009)
Clerc, M.: Particle swarm optimization. In: International Scientific and Technical Encyclopaedia. Wiley, Hoboken (2006)
Clerc, M., Cooren, Y., Siarry, P.: Optimisation par essaim particulaire améliorée par hybridation avec un algorithme à estimation de distribution. Journées doctorales MACS 5(1), 21–27 (2008)
Cooren, Y., Clerc, M., Siarry, P.: Performance evaluation of TRIBES, an adaptive particle swarm optimization algorithm. Swarm Intelligence 3, 149–178 (2009)
Cook, D., Swayne, D.F.: Interactive and Dynamic Graphics for Data Analysis. Springer, New York (2007)
Cook, D., Caragea, D., Honavar, H.: Visualization in classification problems. In: Antoch, J. (ed.) Computational Statistics (COMPSTAT), pp. 799–806. Springer, Berlin (2004)
Friedman, J.H.: Exploratory Projection Pursuit. J. Amer. Statist. Assoc. 82(1), 249–266 (1987)
Friedman, J.H., Tukey, J.W.: A Projection Pursuit Algorithm for Exploratory Data Analysis. IEEE Trans. Comput. C-23, 881–889 (1974)
Huber, P.J.: Projection pursuit. The Annals of Statistics 13(2), 435–475 (1985)
Jones, M.C., Sibson, R.: What is projection pursuit? (with discussion). J. Roy. Statist. Soc. A. 150, 1–36 (1987)
Kennedy, J., Eberhart, R.C.: Swarm Intelligence. Yuhui Shi. Morgan Kaufmann Publishers, San Francisco (1995)
Martinez, W., Martinez, A.: Computational statistics handbook with Matlab. CRC Press, Taylor and Francis Group (2001)
Nason, G.P.: Three-Dimensional Projection Pursuit. J. Roy. Statist. Soc. C 44, 411–430 (1995)
Peña, D., Prieto, F.: Cluster Identification using projections. J. Amer. Statist. Assoc. 96(456), 1433–1445 (2001)
Sun, J.: Some Practical aspects of exploratory Projection Pursuit. SIAM J. Sci. Comput. 14(1), 68–80 (1993)
Wu, J., Zhou, J., Gao, Y.: Support Vector Regression Based on Particle Swarm Optimization and Projection Pursuit Technology for Rainfall Forecasting. In: Int. Conf. on Computational Intelligence and Security, vol. 1, pp. 227–233 (2009)
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
Marie-Sainte, S.L., Berro, A., Ruiz-Gazen, A. (2010). An Efficient Optimization Method for Revealing Local Optima of Projection Pursuit Indices. In: Dorigo, M., et al. Swarm Intelligence. ANTS 2010. Lecture Notes in Computer Science, vol 6234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15461-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-15461-4_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15460-7
Online ISBN: 978-3-642-15461-4
eBook Packages: Computer ScienceComputer Science (R0)