30 research outputs found

    Clustering stock market companies via chaotic map synchronization

    Full text link
    A pairwise clustering approach is applied to the analysis of the Dow Jones index companies, in order to identify similar temporal behavior of the traded stock prices. To this end, the chaotic map clustering algorithm is used, where a map is associated to each company and the correlation coefficients of the financial time series are associated to the coupling strengths between maps. The simulation of a chaotic map dynamics gives rise to a natural partition of the data, as companies belonging to the same industrial branch are often grouped together. The identification of clusters of companies of a given stock market index can be exploited in the portfolio optimization strategies.Comment: 12 pages, 3 figure

    Hausdorff clustering of financial time series

    Full text link
    A clustering procedure, based on the Hausdorff distance, is introduced and tested on the financial time series of the Dow Jones Industrial Average (DJIA) index.Comment: 9 pages, 3 figure

    Hausdorff clustering

    Full text link
    A clustering algorithm based on the Hausdorff distance is introduced and compared to the single and complete linkage. The three clustering procedures are applied to a toy example and to the time series of financial data. The dendrograms are scrutinized and their features confronted. The Hausdorff linkage relies of firm mathematical grounds and turns out to be very effective when one has to discriminate among complex structures.Comment: 12 pages, 13 figure

    Synchronization in complex networks

    Get PDF
    Synchronization processes in populations of locally interacting elements are in the focus of intense research in physical, biological, chemical, technological and social systems. The many efforts devoted to understand synchronization phenomena in natural systems take now advantage of the recent theory of complex networks. In this review, we report the advances in the comprehension of synchronization phenomena when oscillating elements are constrained to interact in a complex network topology. We also overview the new emergent features coming out from the interplay between the structure and the function of the underlying pattern of connections. Extensive numerical work as well as analytical approaches to the problem are presented. Finally, we review several applications of synchronization in complex networks to different disciplines: biological systems and neuroscience, engineering and computer science, and economy and social sciences.Comment: Final version published in Physics Reports. More information available at http://synchronets.googlepages.com

    La integraci贸n de aplicaciones inform谩ticas y la geometr铆a: una mirada desde la superaci贸n en la universidad pedag贸gica

    No full text
    The university is responsible for ensuring improvement permanent master practitioners and training for fulfillment of the counselor, teacher - methodological and research, which with the introduction of technologies information and communication in the school tend to improved since their impact on the teaching -learning.In the inter-linkages subject, from the relationship Computer Geometry and the second cycle of primary school considered important to implement a course of improvement in which Besides providing teachers with the required update in the use of computer applications, acquire knowledge and practical about the teaching strategy for the integration of computer applications and the geometry of the second cycle.La universidad pedag贸gica es la encargada de garantizar la superaci贸n permanente de los maestros en ejercicio y en formaci贸n para el cumplimiento de las funciones orientadora, docente - metodol贸gica e investigativa, las que con la introducci贸n de las tecnolog铆as de la informaci贸n y las comunicaciones en el contexto escolar tienden a perfeccionarse.Para el establecimiento de v铆nculos inter-asignatura desde la relaci贸n de la Geometr铆a y la Computaci贸n se considera importante la implementaci贸n de un curso de superaci贸n en el que los maestros adquieran conocimientos te贸ricos y pr谩cticos acerca de la estrategia did谩ctica para la integraci贸n de aplicaciones inform谩ticas y la geometr铆a del segundo ciclo

    La integraci贸n de aplicaciones inform谩ticas y la geometr铆a: una mirada desde la superaci贸n en la universidad pedag贸gica

    No full text
    La universidad pedag贸gica es la encargada de garantizar la superaci贸n permanente de los maestros en ejercicio y en formaci贸n para el cumplimiento de las funciones orientadora, docente - metodol贸gica e investigativa, las que con la introducci贸n de las tecnolog铆as de la informaci贸n y las comunicaciones en el contexto escolar tienden a perfeccionarse. Para el establecimiento de v铆nculos inter-asignatura desde la relaci贸n de la Geometr铆a y la Computaci贸n se considera importante la implementaci贸n de un curso de superaci贸n en el que los maestros adquieran conocimientos te贸ricos y pr谩cticos acerca de la estrategia did谩ctica para la integraci贸n de aplicaciones inform谩ticas y la geometr铆a del segundo ciclo

    Hausdorff clustering of financial time series

    No full text
    A clustering procedure, based on the Hausdorff distance, is introduced and tested on the financial time series of the Dow Jones Industrial Average (DJIA) index.

    Clustering stock market companies via chaotic map synchronization

    No full text
    A pairwise clustering approach is applied to the analysis of the Dow Jones index companies, in order to identify similar temporal behavior of the traded stock prices. To this end, the chaotic map clustering algorithm is used, where a map is associated to each company and the correlation coefficients of the financial time series are associated to the coupling strengths between maps. The simulation of a chaotic map dynamics gives rise to a natural partition of the data, as companies belonging to the same industrial branch are often grouped together. The identification of clusters of companies of a given stock market index can be exploited in the portfolio optimization strategies.

    Hausdorff clustering

    No full text
    A clustering algorithm based on the Hausdorff distance is introduced and compared to the single and complete linkage. The three clustering procedures are applied to a toy example and to the time series of financial data. The dendrograms are scrutinized and their features confronted. The Hausdorff linkage relies of firm mathematical grounds and turns out to be very effective when one has to discriminate among complex structures.
    corecore