LARCA és un grup de recerca de nivell internacional en temes
d'aprenentatge i mineria de dades, anàlisi de dades i lingüística matemàtica. Típicament, abordem els problemes des de principis matemàtics sòlids, usant eines de modelització i tècniques de l'algorísmia, complexitat computacional, teoria d'autòmats, lògica, matemàtica discreta, estadística, i sistemes dinàmics. Estem iniciant
col·laboracions amb empreses i altres institucions per tal d'aplicar les nostres solucions al problemes del món real.

http://futur.upc.edu/LARCA

LARCA es un grupo de investigación de nivel internacional en temas de aprendizaje y minería de datos, análisis de datos y lingüística matemática. Típicamente, abordamos los problemas desde principios matemáticos sólidos, usando técnicas de modelización de la algoritmia, la complejidad computacional, teoría de autómatas, lógica, matemática discreta, estadística y sistemas dinámicos. Estamos iniciando colaboraciones con empresas e instituciones para la aplicación de nuestras soluciones a contextos reales.

http://futur.upc.edu/LARCA

LARCA is an international research group working on data mining, machine learning, data analysis, and mathematical linguistics. We typically approach problems from sound mathematical principles, using modelling tools and techniques from algorithmics, computational complexity, automata theory, logic, discrete mathematics, statistics, and dynamic systems. We are also starting partnerships with companies and other institutions to apply our solutions to real-world problems.

http://futur.upc.edu/LARCA

LARCA is an international research group working on data mining, machine learning, data analysis, and mathematical linguistics. We typically approach problems from sound mathematical principles, using modelling tools and techniques from algorithmics, computational complexity, automata theory, logic, discrete mathematics, statistics, and dynamic systems. We are also starting partnerships with companies and other institutions to apply our solutions to real-world problems.

http://futur.upc.edu/LARCA

Enviaments recents

  • Global optimality in k-means clustering 

    Tîrnauca, Cristina; Gómez Pérez, Domingo; Balcázar Navarro, José Luis; Montaña Arnaiz, José Luis (2018-05-01)
    Article
    Accés restringit per política de l'editorial
    We study the problem of finding an optimum clustering, a problem known to be NP-hard. Existing literature contains algorithms running in time proportional to the number of points raised to a power that depends on the ...
  • Count-invariance including exponentials 

    Kuznetsov, Stepan; Morrill, Glyn; Valentín, Oriol (Association for Computational Linguistics, 2017)
    Comunicació de congrés
    Accés restringit per política de l'editorial
    We define infinitary count-invariance for categorial logic, extending countinvariance for multiplicatives (van Benthem, 1991) and additives and bracket modalities (Valentín et al., 2013) to include exponentials. This ...
  • Identifiability and transportability in dynamic causal networks 

    Blondel, Gilles; Arias Vicente, Marta; Gavaldà Mestre, Ricard (Springer, 2017-03)
    Article
    Accés obert
    In this paper, we propose a causal analog to the purely observational dynamic Bayesian networks, which we call dynamic causal networks. We provide a sound and complete algorithm for the identification of causal effects in ...
  • Clustering patients with tensor decomposition 

    Ruffini, Matteo; Gavaldà Mestre, Ricard; Limón, Esther (2017)
    Comunicació de congrés
    Accés obert
    In this paper we present a method for the unsupervised clustering of high-dimensional binary data, with a special focus on electronic healthcare records. We present a robust and efficient heuristic to face this problem ...
  • Thoughts about disordered thinking: measuring and quantifying the laws of order and disorder 

    Elvevaag, Brita; Foltz, Peter W.; Rosenstein, Mark; Ferrer Cancho, Ramon; Deyne, Simon De; Mizraji, Eduardo; Cohen, Alex (2017-05-01)
    Article
    Accés obert
  • Classifier selection with permutation tests 

    Arias Vicente, Marta; Arratia Quesada, Argimiro Alejandro; Duarte Lopez, Ariel (IOS Press, 2017)
    Text en actes de congrés
    Accés obert
    This work presents a content-based recommender system for machine learning classifier algorithms. Given a new data set, a recommendation of what classifier is likely to perform best is made based on classifier performance ...
  • Adarules: Learning rules for real-time road-traffic prediction 

    Mena Yedra, Rafael; Gavaldà Mestre, Ricard; Casas Vilaró, Jordi (Elsevier, 2017-12-17)
    Text en actes de congrés
    Accés obert
    Traffic management is being more important than ever, especially in overcrowded big cities with over-pollution problems and with new unprecedented mobility changes. In this scenario, road-traffic prediction plays a key ...
  • Parsing logical grammar: CatLog3 

    Morrill, Glyn (Stockholm University, 2017)
    Text en actes de congrés
    Accés obert
    CatLog3 is a Prolog parser/theorem-prover for (type) logical (categorial) grammar. In such logical grammar, grammar is reduced to logic: a string of words is grammatical if and only if an associated logical statement is a ...
  • A polynomial-time algorithm for the Lambek calculus with brackets of bounded order 

    Kanovich, Max; Kuznetsov, Stepan; Morrill, Glyn; Scedrov, Andre (Dagstuhl Publishing, 2017)
    Text en actes de congrés
    Accés obert
    Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as logic and parsing as deduction. Pentus (2010) gave a polynomial-time algorithm for determining provability of bounded depth ...
  • Does like seek like? The formation of working groups in a programming project 

    Sanou Gozalo, Eduard; Hernández Fernández, Antonio; Arias Vicente, Marta; Ferrer Cancho, Ramon (Omnia Publisher SL (OmniaScience), 2017-02)
    Article
    Accés obert
    In a course of the degree of computer science, the programming project has changed from individual to teamed work, tentatively in couples (pair programming). Students have full freedom to team up with minimum intervention ...
  • Scarcity of crossing dependencies: A direct outcome of a specific constraint? 

    Gómez Rodríguez, Carlos; Ferrer Cancho, Ramon (American Chemical Society (ACS), 2017-12-04)
    Article
    Accés obert
    The structure of a sentence can be represented as a network where vertices are words and edges indicate syntactic dependencies. Interestingly, crossing syntactic dependencies have been observed to be infrequent in human ...

Mostra'n més