Your browser doesn't support javascript.
loading
Show: 20 | 50 | 100
Results 1 - 7 de 7
Filter
Add more filters










Publication year range
1.
Phys Rev Lett ; 96(11): 118701, 2006 Mar 24.
Article in English | MEDLINE | ID: mdl-16605880

ABSTRACT

We propose a general overembedding method for modeling and prediction of nonstationary systems. It basically enlarges the standard time-delay-embedding space by inclusion of the (unknown) slow driving signal, which is estimated simultaneously with the intrinsic stationary dynamics. Our method can be implemented with any modeling tool. Using, in particular, artificial neural networks, its application to both synthetic and real-world time series shows that it is highly efficient, leading to much more accurate results and longer prediction horizons than other existing overembedding methods in the literature.


Subject(s)
Algorithms , Computer Simulation , Models, Theoretical , Nonlinear Dynamics , Neural Networks, Computer
2.
Phys Rev Lett ; 87(12): 124101, 2001 Sep 17.
Article in English | MEDLINE | ID: mdl-11580515

ABSTRACT

We propose a simple method for the accurate reconstruction of slowly changing external forces acting on nonlinear dynamical systems. The method traces the evolution of the external force by locally linearizing the map dependency with the shifting parameter. Application of our algorithm to synthetic data corresponding to discrete models of evolving ecosystems shows an accuracy that outperforms those of previous methods in the literature. In addition, an application to the real-world sunspot time series recovers recently reported changes in solar activity during the last century.

3.
Int J Neural Syst ; 11(3): 305-10, 2001 Jun.
Article in English | MEDLINE | ID: mdl-11574967

ABSTRACT

Ensembles of artificial neural networks have been used in the last years as classification/regression machines, showing improved generalization capabilities that outperform those of single networks. However, it has been recognized that for aggregation to be effective the individual networks must be as accurate and diverse as possible. An important problem is, then, how to tune the aggregate members in order to have an optimal compromise between these two conflicting conditions. We propose here a simple method for constructing regression/classification ensembles of neural networks that leads to overtrained aggregate members with an adequate balance between accuracy and diversity. The algorithm is favorably tested against other methods recently proposed in the literature, producing an improvement in performance on the standard statistical databases used as benchmarks. In addition, and as a concrete application, we apply our method to the sunspot time series and predict the remainder of the current cycle 23 of solar activity.


Subject(s)
Data Collection/methods , Neural Networks, Computer
4.
Inform. med ; 8: 5-8, mar. 2001. ilus
Article in Spanish | LILACS | ID: lil-320277

ABSTRACT

Las microcalcificaciones agrupadas en mamografias son un signo temprano de una lesion maligna en casi la mitad de los canceres de mama. La caracterizacion de las lesiones benignas y malignas representa un problema sumamente complejo aun para un radiologo con experiencia. Esto se refleja en el alto porcentaje de biopsias innecesarias que se llevan a cabo. La deteccion y clasificacion automatica pueden ayudar al radiologo en la evaluacion de las microcalcificaciones agrupadas. Desarrollamos un esquema de diagnostico asistido por computadora, utilizando hardware de PC, que automaticamente detecta, segmenta y clasifica las microcalcificaciones. El proceso de deteccion esta basado en una combinacion de filtros Gaussiano y morfologico. Dos clasificadores estadisticos fueron usados para la diferenciacion entre los casos malignos y los benignos, los cuales se basan en un conjunto seleccionado de caracteristicas cuantitativas. Para una tasa de falsos positivos del 10 por ciento, una tasa de verdaderos positivos del 87 por ciento fue alcanzada con el clasificador que utiliza el metodo de los K vecinos mas proximos


Subject(s)
Breast Neoplasms , Diagnosis, Computer-Assisted , Mammography , Statistics
5.
Inform. med ; 8: 5-8, mar. 2001. ilus
Article in Spanish | BINACIS | ID: bin-7363

ABSTRACT

Las microcalcificaciones agrupadas en mamografias son un signo temprano de una lesion maligna en casi la mitad de los canceres de mama. La caracterizacion de las lesiones benignas y malignas representa un problema sumamente complejo aun para un radiologo con experiencia. Esto se refleja en el alto porcentaje de biopsias innecesarias que se llevan a cabo. La deteccion y clasificacion automatica pueden ayudar al radiologo en la evaluacion de las microcalcificaciones agrupadas. Desarrollamos un esquema de diagnostico asistido por computadora, utilizando hardware de PC, que automaticamente detecta, segmenta y clasifica las microcalcificaciones. El proceso de deteccion esta basado en una combinacion de filtros Gaussiano y morfologico. Dos clasificadores estadisticos fueron usados para la diferenciacion entre los casos malignos y los benignos, los cuales se basan en un conjunto seleccionado de caracteristicas cuantitativas. Para una tasa de falsos positivos del 10 por ciento, una tasa de verdaderos positivos del 87 por ciento fue alcanzada con el clasificador que utiliza el metodo de los K vecinos mas proximos (AU)


Subject(s)
Breast Neoplasms/diagnosis , Diagnosis, Computer-Assisted , Mammography , Statistics
6.
Neural Netw ; 11(1): 145-151, 1998 Jan.
Article in English | MEDLINE | ID: mdl-12662854

ABSTRACT

Persistence is one of the most common characteristics of real-world time series. In this work we investigate the process of learning persistent dynamics by neural networks. We show that for chaotic times series the network can get stuck for long training periods in a trivial minimum of the error function related to the long-term autocorrelation in the series. Remarkably, in these cases the transition to the trained phase is quite abrupt. For noisy dynamics the training process is smooth. We also consider the effectiveness of two of the most frequently used decorrelation methods in avoiding the problems related to persistence. Copyright 1997 Elsevier Science Ltd.

7.
Proc Natl Acad Sci U S A ; 86(10): 3443-6, 1989 May.
Article in English | MEDLINE | ID: mdl-16594037

ABSTRACT

Metastable configurations in open computational systems with local minima in their optimality functions are shown to be very long lived, which makes them effectively stable. When rare transitions to the global optimum do occur, they happen extremely fast, in analogy to models of punctuated evolution in biology. These results are obtained by introducing a thermodynamic-like formalism that allows for a simple analysis of nonlinear game dynamics in computational ecosystems.

SELECTION OF CITATIONS
SEARCH DETAIL
...