Skip to main content

APRENDIZAJE COMPUTACIONAL Y COMUNICACION

TIN2014-57226-P

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
Program Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D (Excelencia / Generación de Conocimiento)
Call year 2014
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Management unit Secretaría de Estado de Educación, Formación Profesional y Universidades
Beneficiary centre UNIVERSITAT POLITECNICA DE CATALUNYA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 8
Encontrada(s) 1 página(s)

UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Forecasting financial time series with multiple kernel learning

  • Fábregues de los Santos, Luis
  • Arratia Quesada, Argimiro Alejandro|||0000-0003-1551-420X
  • Belanche Muñoz, Luis Antonio|||0000-0002-7577-1964
This paper introduces a forecasting procedure based on mul-tivariate dynamic kernels to re-examine –under a non linear framework–the experimental tests reported by Welch and Goyal showing that severalvariables proposed in the academic literature are of no use to predict theequity premium under linear regressions. For this approach kernel functions for time series are used with multiple kernel learning in order torepresent the relative importance of each of these variabl, Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

On methods to assess the significance of community structure in networks of financial time series

  • Arratia Quesada, Argimiro Alejandro|||0000-0003-1551-420X
  • Renedo Mirambell, Martí
We consider the problem of determining whether the community structure found by a clustering algorithm applied to nancial time series is statistically signi cant, or is due to pure chance, when no other information than the observed values and a similarity measure among time series are available. As a subsidiary problem we also analyse the in uence of the choice of similarity measure in the accuracy of the clustering method. We propose two raw-data based methods for assessing robustness of clustering algorithms on time-dependent data linked by a relation of similarity: One based on community scoring functions that quantify some topological property that characterises ground-truth communities, and another based on random perturbations and quanti cation of the variation in the community structure. These methodologies are well-established in the realm of unweighted networks; our contribution are versions of these methodologies properly adapted to complete weighted networks., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

An agent-based model of the emergence and evolution of a language system for boolean coordination

  • Sierra Santibáñez, Josefina|||0000-0003-3529-6713
This paper presents an agent-based model for studying the emergence and evolution of a language system for Boolean coordination. The model has been implemented and tested by conducting a series of experiments that show that a language system for Boolean coordination emerges as a result of a process of self-organisation of the agents’ linguistic interactions when these agents adapt their preferences for vocabulary, syntactic categories and word order to those they observe are used more often by other agents, and that such a language system is reliably transmitted across generations., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Characterization of order-like dependencies with formal concept analysis

  • Codocedo, Victor
  • Baixeries i Juvillà, Jaume|||0000-0003-2896-2247
  • Kaytoue, Mehdi
  • Napoli, Amedeo
Functional Dependencies (FDs) play a key role in many fields of the relational database model, one of the most widely used database systems. FDs have also been applied in data analysis, data quality, knowl- edge discovery and the like, but in a very limited scope, because of their fixed semantics. To overcome this limitation, many generalizations have been defined to relax the crisp definition of FDs. FDs and a few of their generalizations have been characterized with Formal Concept Analysis which reveals itself to be an interesting unified framework for charac- terizing dependencies, that is, understanding and computing them in a formal way. In this paper, we extend this work by taking into account order-like dependencies. Such dependencies, well defined in the database field, consider an ordering on the domain of each attribute, and not sim- ply an equality relation as with standard FDs., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Forecasting financial time series with multiple kernel learning

  • Fábregues de los Santos, Luis
  • Arratia Quesada, Argimiro Alejandro
  • Belanche Muñoz, Luis Antonio
This paper introduces a forecasting procedure based on mul-tivariate dynamic kernels to re-examine –under a non linear framework–the experimental tests reported by Welch and Goyal showing that severalvariables proposed in the academic literature are of no use to predict theequity premium under linear regressions. For this approach kernel functions for time series are used with multiple kernel learning in order torepresent the relative importance of each of these variabl, Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Characterization of order-like dependencies with formal concept analysis

  • Codocedo, Victor
  • Baixeries i Juvillà, Jaume
  • Kaytoue, Mehdi
  • Napoli, Amedeo
Functional Dependencies (FDs) play a key role in many fields of the relational database model, one of the most widely used database systems. FDs have also been applied in data analysis, data quality, knowl- edge discovery and the like, but in a very limited scope, because of their fixed semantics. To overcome this limitation, many generalizations have been defined to relax the crisp definition of FDs. FDs and a few of their generalizations have been characterized with Formal Concept Analysis which reveals itself to be an interesting unified framework for charac- terizing dependencies, that is, understanding and computing them in a formal way. In this paper, we extend this work by taking into account order-like dependencies. Such dependencies, well defined in the database field, consider an ordering on the domain of each attribute, and not sim- ply an equality relation as with standard FDs., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

An agent-based model of the emergence and evolution of a language system for boolean coordination

  • Sierra Santibáñez, Josefina
This paper presents an agent-based model for studying the emergence and evolution of a language system for Boolean coordination. The model has been implemented and tested by conducting a series of experiments that show that a language system for Boolean coordination emerges as a result of a process of self-organisation of the agents’ linguistic interactions when these agents adapt their preferences for vocabulary, syntactic categories and word order to those they observe are used more often by other agents, and that such a language system is reliably transmitted across generations., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

On methods to assess the significance of community structure in networks of financial time series

  • Arratia Quesada, Argimiro Alejandro
  • Renedo Mirambell, Martí
We consider the problem of determining whether the community structure found by a clustering algorithm applied to nancial time series is statistically signi cant, or is due to pure chance, when no other information than the observed values and a similarity measure among time series are available. As a subsidiary problem we also analyse the in uence of the choice of similarity measure in the accuracy of the clustering method. We propose two raw-data based methods for assessing robustness of clustering algorithms on time-dependent data linked by a relation of similarity: One based on community scoring functions that quantify some topological property that characterises ground-truth communities, and another based on random perturbations and quanti cation of the variation in the community structure. These methodologies are well-established in the realm of unweighted networks; our contribution are versions of these methodologies properly adapted to complete weighted networks., Peer Reviewed, Postprint (published version)