×

Clustering optimization in mixture of local expert models. (English) Zbl 1161.62378

Summary: Estimation of real-valued functions from a finite set of samples is a central problem in applied statistics. Many different approaches to deal with this problem were proposed as the least-squares method by Gauss, the least-modulus method by Laplace, and more recently the usage of neural networks, support vector machines, mixture of local expert models, amongst others.
We addressed the issues mixture of local expert models (MLEM) and clustering optimization, which congregates exploratory analysis, data mining and mathematical modeling in the same technique, used, for example, in the development of predictive models. The basic idea of MLEM is clustering the points from the entry data set, and then different modeling techniques are applied in order to select the best model for each cluster. We proposed a clustering optimization procedure as a way to improve the performance on both the fitting of the models and their usage in forecasting.

MSC:

62H30 Classification and discrimination; cluster analysis (statistical aspects)
68T99 Artificial intelligence
Full Text: DOI

References:

[1] Bazaraa M.S., Nonlinear programming: theory and applications, 2. ed. (1993)
[2] Claumann C.A., Modelagem dinâmica e controle de processos não lineares: uma aplicação de algoritmos genéticos para treinamento de redes neurais recorrentes (1999)
[3] Cooper B., Modelling research and development: How do firms solve design problems?, Journal of Evolutionary Economics 10 pp 395– (2000) · doi:10.1007/s001910000040
[4] Davidon W.C., Variable metric method for minimization: AEC Research Development Report, ANL-5990 (1959)
[5] Duda R.O., Pattern Classification, 2. ed. (2001) · Zbl 0968.68140
[6] Fletcher R., A rapidly convergent descent method for minimization, Computer Journal 6 pp 163– (1963) · Zbl 0132.11603 · doi:10.1093/comjnl/6.2.163
[7] Goldberg D.E., Genetic Algorithms in Search, Optimization and Machine Learning (1989) · Zbl 0721.68056
[8] Holland J.H., Adaptation in natural and artificial systems (1975)
[9] Huber P., Robust estimation of a location parameter, Annals on Mathematical Statistics 35 pp 73– (1964) · Zbl 0136.39805 · doi:10.1214/aoms/1177703732
[10] Iwamatsu M., Global geometry optimization of silicon clusters using the space-fixed genetic algorithm, Journal of Chemical Physics 112 (24) pp 10976– (2000) · doi:10.1063/1.481737
[11] Jacobs R.A., Adaptive mixture of local experts, Neural Computation 3 (1) pp 79– (1991) · doi:10.1162/neco.1991.3.1.79
[12] Konzen P.H.A., Otimização de métodos de controle de qualidade de fármacos usando algoritmo genético e busca tabu, Pesquisa Operacional 23 (1) pp 189– (2003) · doi:10.1590/S0101-74382003000100014
[13] Liu J. (1995)
[14] Mangasarian O.L., Mathematical Programming in Data Mining, Data Mining and Knowledge Discovery 1 (2) pp 183– (1997) · doi:10.1023/A:1009735908398
[15] Melo B. (2003)
[16] Niesse J., Global geometry optimization of atomic clusters using a modified genetic algorithm in space-fixed coordinates, Journal of Chemical Physics 105 (11) pp 4700– (1996) · doi:10.1063/1.472311
[17] Pinto D.B.T., MLEM on cross section data (2003)
[18] Pinto D.B.T., Choices and pitfalls concerning mixture-of-experts modeling (2005)
[19] Saito Jr. P.A., Treinamento de redes neurais utilizando time assíncrono (1999)
[20] Vapnik V.N., The nature of statistical learning theory (1995) · Zbl 0833.62008
[21] Vapnik V.N., An overview of Statistical learning theory, IEEE transactions on neural networks 10 (5) pp 988– (1999) · Zbl 0928.68093 · doi:10.1109/72.788640
[22] Webb A., Statistical Pattern Recognition, 2. ed. (2002) · Zbl 1102.68639
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.