An efficient optimization method for revealing local optima of projection pursuit indices

11Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Marie-Sainte, S. L., Berro, A., & Ruiz-Gazen, A. (2010). An efficient optimization method for revealing local optima of projection pursuit indices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6234 LNCS, pp. 60–71). https://doi.org/10.1007/978-3-642-15461-4_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free