Pasar al contenido principal

GESTION Y ANALISIS DE DATOS COMPLEJOS

TIN2017-89244-R

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2017
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSITAT POLITECNICA DE CATALUNYA

Resultados relacionados

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

RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Ordocoordinación: Cómo Organizar 700 Estudiantes en un Nuevo Campus (y no Morir en el Intento)

  • Castro, Jorge
  • Farreres, Xavier
  • Gabarro, Joaquim
  • Nivela, Pilar
  • Perez-Poch, Antoni
  • Pino, Elvira
  • Rivero, Jose Miguel
A partir del Q1 de 2017 el Departamento de CS de la UPC se ocupa de la docencia de Informática I en el nuevo campus de la EEBE. Dicha docencia ha sido singular en dos aspectos. Primero, hubo que organizarla al mismo tiempo que se impartía. Segundo, todos los números son grandes. En el Q1 de 2017, hubo 686 estudiantes matriculados, 18 docentes y se prepararon 108 exámenes de laboratorio. Para tratar con estas singularidades hemos adoptado una forma de coordinación a la que hemos llamado ordocoordinación. Es una coordinación flexible y rápida en la que los docentes generan y consensúan un conjunto mínimo de reglas. Es de abajo a arriba y requiere una toma de decisiones ágil, por lo que el número de emails ha sido importante. En Q1 de 2017: 350 x 18 = 6300 emails. Creemos que esta aproximación merece ser explicada y que puede ser aplicada a otras asignaturas.
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Optimality of syntactic dependency distances

  • Ferrer-i-Cancho, Ramon
  • Gómez-Rodríguez, Carlos
  • Esteban, Juan Luis
  • Alemany-Puig, Lluís
[Abstract]: It is often stated that human languages, as other biological systems, are shaped by cost-cutting pressures but, to what extent? Attempts to quantify the degree of optimality of languages by means of an optimality score have been scarce and focused mostly on English. Here we recast the problem of the optimality of the word order of a sentence as an optimization problem on a spatial network where the vertices are words, arcs indicate syntactic dependencies, and the space is defined by the linear order of the words in the sentence. We introduce a score to quantify the cognitive pressure to reduce the distance between linked words in a sentence. The analysis of sentences from 93 languages representing 19 linguistic families reveals that half of languages are optimized to a 70 % or more. The score indicates that distances are not significantly reduced in a few languages and confirms two theoretical predictions: that longer sentences are more optimized and that distances are more likely to be longer than expected by chance in short sentences. We present a hierarchical ranking of languages by their degree of optimization. The score has implications for various fields of language research (dependency linguistics, typology, historical linguistics, clinical linguistics, and cognitive science). Finally, the principles behind the design of the score have implications for network science., We are grateful to C. Bentz, N. Català, M. H. Christiansen, M. Gustison, and A. Hernández-Fernández for helpful comments. R.F.C. and L.A.P. are supported by Grant No. TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad). R.F.C. is also supported by the recognition No. 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). L.A.P. is also supported by Secretaria d’Universitats i Recerca de la Generalitat de Catalunya and the Social European Fund. C.G.R. is supported by the European Research Council (ERC), under the European Union’s Horizon 2020 research and innovation program (FASTPARSE, Grant No. 714150), the ANSWER-ASAP project (No. TIN2017-85160-C2-1-R) and SCANNER-UDC project (No. PID2020-113230RB-C21) from ERDF/MICINN-AEI, and Xunta de Galicia (ED431C 2020/11 and an Oportunius program grant to complement ERC grants); the CITIC research center is funded by ERDF and Xunta de Galicia (ERDFGalicia 2014-2020 program, Grant No. ED431G 2019/01). J.L.E. is funded by Grants No. TIN2016-76573-C2-1-P and No. PID2019-109137GB-C22 from MINECO. R.F.C. designed the research; R.F.C and C.G.R. wrote the paper; C.G.R. collected and preprocessed data; C.G.R. and R.F.C. analyzed the data; R.F.C, C.G.R., and J.L.E developed the mathematical arguments; C.G.R., J.L.E., and L.A.P. wrote the core code; all authors verified the mathematical arguments., Xunta de Galicia; ED431C 2020/11, Xunta de Galicia; ED431G 2019/01, Agència de Gestió d'Ajuts Universitaris i de Recerca; 2017SGR-856
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Web apps and imprecise probabilities

  • Castro Rabal, Jorge|||0000-0002-1390-1313
  • Gabarró Vallès, Joaquim|||0000-0003-3771-2813
  • Serna Iglesias, María José|||0000-0001-9729-8648
We propose a model for the behaviour of Web apps in the unreliable WWW. Web apps are described by orchestrations. An orchestration mimics the personal use of the Web by defining the way in which Web services are invoked. The WWW is unreliable as poorly maintained Web sites are prone to fail. We model this source of unreliability trough a probabilistic approach. We assume that each site has a probability to fail. Another source of uncertainty is the traffic congestion. This can be observed as a non-deterministic behaviour induced by the variability in the response times. We model non-determinism by imprecise probabilities. We develop here an ex-ante normal to characterize the behaviour of finite orchestrations in the unreliable Web. We show the existence of a normal form under such semantics for orchestrations using asymmetric parallelism., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Characterizing transactional databases for frequent itemset mining

  • Lezcano Ríos, Christian Gerardo
  • Arias Vicente, Marta|||0000-0001-7359-1815
This paper presents a study of the characteristics of transactional databases used in frequent itemset mining. Such characterizations have typically been used to benchmark and understand the data mining algorithms working on these databases. The aim of our study is to give a picture of how diverse and representative these benchmarking databases are, both in general but also in the context of particular empirical studies found in the literature. Our proposed list of metrics contains many of the existing metrics found in the literature, as well as new ones. Our study shows that our list of metrics is able to capture much of the datasets’ inner complexity and thus provides a good basis for the characterization of transactional datasets. Finally, we provide a set of representative datasets based on our characterization that may be used as a benchmark safely., Both authors have been partially supported by TIN2017-89244-R from MINECO (Spain’s Ministerio de Economia, Industria y Competitividad) and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). Christian Lezcano is supported by Paraguay’s Foreign Postgraduate Scholarship Programme Don Carlos Antonio López (BECAL)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Capítulo o parte de un libro (BookPart)

The Greedy Algorithm and the Cohen-Macaulay property of rings, graphs and toric projective curves

  • Arratia Quesada, Argimiro Alejandro|||0000-0003-1551-420X
It is shown in this paper how a solution for a combinatorial problem obtained from applying the greedy algorithm is guaranteed to be optimal for those instances of the problem that, under an appropriate algebraic representation, satisfy the Cohen-Macaulay property known for rings and modules in Commutative Algebra. The choice of representation for the instances of a given combinatorial problem is fundamental for recognizing the Cohen-Macaulay property. Departing from an exposition of the general framework of simplicial complexes and their associated Stanley-Reisner ideals, wherein the Cohen-Macaulay property is formally defined, a review of other equivalent frameworks more suitable for graphs or arithmetical problems will follow. In the case of graph problems a better framework to use is the edge ideal of Rafael Villarreal. For arithmetic problems it is appropriate to work within the semigroup viewpoint of toric geometry developed by Antonio Campillo and collaborators.
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Speech pause distribution as an early marker for Alzheimer’s disease

  • Pastoriza-Domínguez, Patricia
  • González Torre, Ivan
  • Diéguez-Vide, Faustino
  • Gómez Ruiz, María Isabel
  • Geladó Muñoz, Sandra
  • Bello-López, Joan
  • Ávila-Rivera, Asunción
  • Matías-Guiu, Jordi
  • Pytel Córdoba, Vanesa
  • Hernández Fernández, Antonio|||0000-0002-9466-2704
Background: Pause duration analysis is a common feature in the study of discourse in Alzheimer’s disease (AD) since this patient group has shown a consistent trend for longer pauses in comparison to healthy controls. This speech feature may also be helpful for early detection; however, studies involving patients at the pre-clinical, high-risk phase of amnestic mild cognitive impairment (aMCI) have yielded varying results. Objective: To characterize the probability density distribution of speech pause durations in 26 patients with AD, 57 amnestic multi-domain amnestic MCI patients (29 with memory encoding deficits, a-mdMCI-E, and 28 with retrieval impairment only, a-mdMCI-R) and 29 healthy controls (HC) in order assess whether there are significant differences between them. To explore the potential differences in pause production between patients with a-mdMCI-E and a-mdMCI-R, as the former are considered to be at higher risk of progressing to dementia. Methods: The 112 picture-based oral narratives obtained were manually transcribed and annotated for the automatic extraction and analysis of pause durations. Different probability distributions were tested for the fitting of pause durations while truncating shorter ranges. Recent findings in the field of Statistics were considered in order to avoid the inherent methodological uncertainty that this type of analysis entails by addressing the question of temporal thresholding and its potential repercussions on inter-annotator reliability in manual transcriptions. Results: A lognormal distribution (LND) explained the distribution of pause duration for all groups. Its fitted parameters (, ) followed a gradation from the group with shorter durations and a higher tendency to produce short pauses (HC) to the group with longer pause durations and a considerably higher tendency to produce long pauses with greater variance (AD). Importantly, a-mdMCI-E produced significantly longer pauses and with greater variability than their a-mdMCI-R counterparts (alpha=0.05). Conclusion: We report significant differences at the group level in pause distribution across all groups of study that could be used in future diagnostic tools and discuss the clinical implications of these findings, particularly regarding the characterization of a-mdMCI., This work is supported through a PhD grant awarded to P.P-D. by the banking Foundation ‘‘La Caixa’’ (ID 100010434, code: LCF/BQ/ES15/10360020). F.D-V. was supported by a grant awarded to project no. PID2019-107042GB-I00 (Ministerio de Ciencia e Innovación). A.H-F. and I.G.T. were supported by the grant no. TIN2017- 89244-R (MACDA) (Ministerio de Economia, Industria y Competitivi- dad, Gobierno de España) and the project PRO2020-S03 (RCO03080 Lingüística Quantitativa) of l’Institut d’Estudis Catalans., Peer Reviewed, Objectius de Desenvolupament Sostenible::3 - Salut i Benestar
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Can Menzerath’s law be a criterion of complexity in communication?

  • González Torre, Ivan
  • Debowski, Lukasz
  • Hernández Fernández, Antonio|||0000-0002-9466-2704
Menzerath’s law is a quantitative linguistic law which states that, on average, the longer is a linguistic construct, the shorter are its constituents. In contrast, Menzerath-Altmann’s law (MAL) is a precise mathematical power-law-exponential formula which expresses the expected length of the linguistic construct conditioned on the number of its constituents. In this paper, we investigate the anatomy of MAL for constructs being word tokens and constituents being syllables, measuring its length in graphemes. First, we derive the exact form of MAL for texts generated by the memoryless source with three emitted symbols, which can be interpreted as a "monkey typing" model or a null model. We show that this null model complies with Menzerath’s law, revealing that Menzerath’s law itself can hardly be a criterion of complexity in communication. This observation does not apply to the more precise Menzerath-Altmann’s law, which predicts an inverted regime for sufficiently range constructs, i.e., the longer is a word, the longer are its syllables. To support this claim, we analyze MAL on data from 21 languages, consisting of texts from the Standardized Project Gutenberg. We show the presence of the inverted regime, not exhibited by the null model, and we demonstrate robustness of our results. We also report the complicated distribution of syllable sizes with respect to their position in the word, which might be related with the emerging MAL. Altogether, our results indicate that Menzerath’s law—in terms of correlations—is a spurious observation, while complex patterns and efficiency dynamics should be rather attributed to specific forms of Menzerath-Altmann’s law., This work has been funded by the project PRO2021-S03-HERNANDEZ (Institut d’Estudis Catalans), where AHF is the principal investigator. URL: https://futur.upc.edu/30546321 AHF is also funded by the grant TIN2017-89244-R from Ministerio de Economia, Industria y Competitividad (Gobierno de España) and supported by the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). URL: https://futur.upc. edu/2202438, Peer Reviewed, Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Refining the imprecise meaning of non-determinism in the Web by strategic games

  • Castro Rabal, Jorge|||0000-0002-1390-1313
  • Gabarró Vallès, Joaquim|||0000-0003-3771-2813
  • Serna Iglesias, María José|||0000-0001-9729-8648
Nowadays interactions with the World Wide Web are ubiquitous. Users interact through a number of steps consisting of site calls and handling results that can be automatized as orchestrations. Orchestration results have an inherent degree of uncertainty due to incomplete Web knowledge and orchestration semantics are characterized in terms of imprecise probabilistic choices. We consider two aspects in this imprecise semantic characterization. First, when local knowledge (even imprecise) of some part of the Web increases, this knowledge goes smoothly through the whole orchestration. We deal formally with this aspect introducing orchestration refinements. Second, we analyze refinement under uncertainty in the case of parallel composition. Uncertain knowledge is modeled by an uncertainty profile. Such profiles allow us to look at the uncertainty through a zero-sum game, called angel/daemon-game. We propose to use the structure of the Nash equilibria to refine uncertainty. In this case the information improves not through cooperation but through the angel and daemon competition., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Capítulo o parte de un libro (BookPart)

Predicciones financieras basadas en análisis de sentimiento de textos y minería de opiniones

  • Arratia Quesada, Argimiro Alejandro|||0000-0003-1551-420X
En este capítulo se describe la mecánica básica para construir un modelo de predicción que utiliza indicadores de sentimiento derivados de datos textuales. Enfocamos nuestro objetivo de predicciones en series de tiempo financieras y presentamos un conjunto de hechos empíricos que describen las propiedades estadísticas de los indicadores de sentimiento, con particular atención en aquellos indicadores extraídos de noticias sobre mercados financieros y cuya categorización de sentimientos se basa en diccionarios. El objetivo general es proporcionar pautas para los profesionales en el mundo de las finan-zas para la adecuada construcción e interpretación de su propia información numérica dependiente del tiempo y que representa la percepción del público hacia las empresas, los precios de las acciones y los mercados financieros en general.
UPCommons. Portal del coneixement obert de la UPC
Publicación Capítulo o parte de un libro (BookPart)

Sentiment analysis of financial news: mechanics and statistics

  • Arratia Quesada, Argimiro Alejandro|||0000-0003-1551-420X
  • Ávalos Villaseñor, Gustavo Eduardo
  • Cabaña Nigro, Ana Alejandra
  • Duarte López, Ariel|||0000-0002-7432-0344
  • Renedo Mirambell, Martí
This chapter describes the basic mechanics for building a forecasting model that uses as input sentiment indicators derived from textual data. In addition, as we focus our target of predictions on financial time series, we present a set of stylized empirical facts describing the statistical properties of lexicon-based sentiment indicators extracted from news on financial markets. Examples of these modeling methods and statistical hypothesis tests are provided on real data. The general goal is to provide guidelines for financial practitioners for the proper construction and interpretation of their own time-dependent numerical information representing public perception toward companies, stocks’ prices, and financial markets in general, The research of A. Arratia, G. Avalos, and M. Renedo-Mirambell is supported by grant TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad) and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya), Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Weighted contrastive divergence

  • Romero Merino, Enrique|||0000-0003-2404-5716
  • Mazzanti Castrillejo, Fernando Pablo|||0000-0001-6641-0609
  • Delgado Pin, Jordi|||0000-0003-4546-8355
  • Buchaca Prats, David
Learning algorithms for energy based Boltzmann architectures that rely on gradient descent are in general computationally prohibitive, typically due to the exponential number of terms involved in computing the partition function. In this way one has to resort to approximation schemes for the evaluation of the gradient. This is the case of Restricted Boltzmann Machines (RBM) and its learning algorithm Contrastive Divergence (CD). It is well-known that CD has a number of shortcomings, and its approximation to the gradient has several drawbacks. Overcoming these defects has been the basis of much research and new algorithms have been devised, such as persistent CD. In this manuscript we propose a new algorithm that we call Weighted CD (WCD), built from small modifications of the negative phase in standard CD. However small these modifications may be, experimental work reported in this paper suggests that WCD provides a significant improvement over standard CD and persistent CD at a small additional computational cost., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Distinct flavors of Zipf's law and its maximum likelihood fitting: Rank-size and size-distribution representations

  • Corral Cano, Álvaro
  • Serra Mochales, Isabel
  • Ferrer Cancho, Ramon|||0000-0002-7820-923X
In recent years, researchers have realized the difficulties of fitting power-law distributions properly. These difficulties are higher in Zipfian systems, due to the discreteness of the variables and to the existence of two representations for these systems, i.e., two versions depending on the random variable to fit: rank or size. The discreteness implies that a power law in one of the representations is not a power law in the other, and vice versa. We generate synthetic power laws in both representations and apply a state-of-the-art fitting method to each of the two random variables. The method (based on maximum likelihood plus a goodness-of-fit test) does not fit the whole distribution but the tail, understood as the part of a distribution above a cutoff that separates non-power-law behavior from power-law behavior. We find that, no matter which random variable is power-law distributed, using the rank as the random variable is problematic for fitting, in general (although it may work in some limit cases). One of the difficulties comes from recovering the “hidden” true ranks from the empirical ranks. On the contrary, the representation in terms of the distribution of sizes allows one to recover the true exponent (with some small bias when the underlying size distribution is a power law only asymptotically)., Support from projects FIS2012-31324, FIS2015-71851-P, TIN2017-89244-R, PGC-FIS2018-099629-B-I00, María de Maeztu Program MDM-2014-0445, from Spanish MINECO; 2014SGR-1307, 2017SGR-856 (MACDA) from AGAUR; and the Collaborative Mathematics Project from Fundación La Caixa (I.S.) is acknowledged., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Linear-time calculation of the expected sum of edge lengths in random projective linearizations of trees

  • Alemany Puig, Lluís|||0000-0002-3874-991X
  • Ferrer Cancho, Ramon|||0000-0002-7820-923X
The syntactic structure of a sentence is often represented using syntactic dependency trees. The sum of the distances between syntactically related words has been in the limelight for the past decades. Research on dependency distances led to the formulation of the principle of dependency distance minimization whereby words in sentences are ordered so as to minimize that sum. Numerous random baselines have been defined to carry out related quantitative studies on languages. The simplest random baseline is the expected value of the sum in unconstrained random permutations of the words in the sentence, namely, when all the shufflings of the words of a sentence are allowed and equally likely. Here we focus on a popular baseline: random projective permutations of the words of the sentence, that is, permutations where the syntactic dependency structure is projective, a formal constraint that sentences satisfy often in languages. Thus far, the expectation of the sum of dependency distances in random projective shufflings of a sentence has been estimated approximately with a Monte Carlo procedure whose cost is of the order of Rn, where n is the number of words of the sentence and R is the number of samples; it is well known that the larger R is, the lower the error of the estimation but the larger the time cost. Here we present formulae to compute that expectation without error in time of the order of n. Furthermore, we show that star trees maximize it, and provide an algorithm to retrieve the trees that minimize it., LAP is supported by Secretaria d’Universitats i Recerca de la Generalitat de Catalunya and the Social European Fund. RFC is also supported by the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). RFC and LAP are supported by the grant TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Linguistic laws in chimpanzee gestural communication

  • Heesen, Raphaela
  • Hobaiter, Catherine
  • Ferrer Cancho, Ramon|||0000-0002-7820-923X
  • Semple, Stuart
Studies testing linguistic laws outside language have provided important insights into the organization of biological systems. For example, patterns consistent with Zipf's law of abbreviation (which predicts a negative relationship between word length and frequency of use) have been found in the vocal and non-vocal behaviour of a range of animals, and patterns consistent with Menzerath's law (according to which longer sequences are made up of shorter constituents) have been found in primate vocal sequences, and in genes, proteins and genomes. Both laws have been linked to compression—the information theoretic principle of minimizing code length. Here, we present the first test of these laws in animal gestural communication. We initially did not find the negative relationship between gesture duration and frequency of use predicted by Zipf's law of abbreviation, but this relationship was seen in specific subsets of the repertoire. Furthermore, a pattern opposite to that predicted was seen in one subset of gestures—whole body signals. We found a negative correlation between number and mean duration of gestures in sequences, in line with Menzerath's law. These results provide the first evidence that compression underpins animal gestural communication, and highlight an important commonality between primate gesturing and language., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

A note on movement in logical grammar

  • Morrill, Glyn|||0000-0002-5528-4384
In this article, we make some brief remarks on overt and covert movement in logical grammar. With respect to covert movement (e.g. quantification), we observe how a treatment in terms of displacement calculus interacts with normal modalities for intensionality to allow a coding in logical grammar of the distinction between weak and strong quantifiers (i.e. those that may or may not scope nonlocally such as a and every respectively). With respect to overt movement (e.g. relativisation), we observe how displacement calculus can support a coding of a linear filler-gap dependency similar to that employed in lambda grammars, but we argue that this general approach does not extend to either the multiplicity nor the island-sensitivity of parasitic gaps, for which we advocate instead treatment in terms of a bracket-conditioned contraction subexponential., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Recurrent autoencoder with skip connections and exogenous variables for traffic forecasting

  • Herruzo Sánchez, Pedro
  • Larriba Pey, Josep|||0000-0002-7070-9256
The increasing complexity of mobility plus the growing population in cities, together with the importance of privacy when sharing data from vehicles or any device, makes traffic forecasting that uses data from infrastructure and citizens an open and challenging task. In this paper, we introduce a novel approach to deal with predictions of volume, speed and main traffic direction, in a new aggregated way of traffic data presented as videos. Our approach leverages the continuity in a sequence of frames, learning to embed them into a low dimensional space with an encoder and making predictions there using recurrent layers, ensuring good performance through an embedded loss, and then, recovering back spatial dimensions with a decoder using a second loss at a pixel level. Exogenous variables like weather, time and calendar are also added in the model. Furthermore, we introduce a novel sampling approach for sequences that ensures diversity when creating batches, running in parallel to the optimization process., This work is supported by SEAT, S.A., and the Secretariat of Universities and Research of the Department of Economy and Knowledge of the Generalitat de Catalunya, under the Industrial Doctorate Grant 2017 DI 52. This research is also supported by the grant TIN2017-89244-R from MINECO (Ministerio de Economia, Industria y Competitividad) and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Spurious ambiguity and focalization

  • Morrill, Glyn|||0000-0002-5528-4384
  • Valentín Fernández Gallart, José Oriol
Spurious ambiguity is the phenomenon whereby distinct derivations in grammar may assign the same structural reading, resulting in redundancy in the parse search space and inefficiency in parsing. Understanding the problem depends on identifying the essential mathematical structure of derivations. This is trivial in the case of context free grammar, where the parse structures are ordered trees; in the case of type logical categorial grammar, the parse structures are proof nets. However, with respect to multiplicatives, intrinsic proof nets have not yet been given for displacement calculus, and proof nets for additives, which have applications to polymorphism, are not easy to characterize. In this context we approach here multiplicative-additive spurious ambiguity by means of the proof-theoretic technique of focalization., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Co-occurrence patterns in diagnostic data

  • Piceno Cabrera, Marie Ely
  • Rodríguez Navas, Laura
  • Balcázar Navarro, José Luis|||0000-0003-4248-4528
We demonstrate how graph decomposition techniques can be employed for the visualization of hierarchical co-occurrence patterns between medical data items. Our research is based on Gaifman graphs (a mathematical concept introduced in Logic), on specific variants of this concept, and on existing graph decomposition notions, specifically, graph modules and the clan decomposition of so-called 2-structures. The construction of the Gaifman graphs from a dataset is based on co-occurrence, or lack of it, of items in the dataset. We may select a discretization on the edge labels to aim at one among several Gaifman graph variants. Then, the decomposition of the graph may provide us with visual information about the data co-occurrences, after which one can proceed to more traditional statistical analysis., Partially supported by European Research Council (ERC) under the European Union's Horizon2020 research and innovation programme, grant agreement ERC-2014-CoG 648276 (AUTAR);by grant TIN2017-89244-R from Ministerio de Economia, Industria y Competitividad, and byConacyt (México). We acknowledge unfunded recognition 2017SGR-856 (MACDA) from AGAUR(Generalitat de Catalunya)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

What does a zero mean? understanding false, random and structural zeros in ecology

  • Blasco Moreno, Anabel
  • Pérez Casany, Marta|||0000-0003-3675-6902
  • Puig, Pedro
  • Morante, Maria
  • Castells, Eva
1. Zeros (i.e. events that do not happen) are the source of two common phenomena in count data: overdispersion and zero-inflation. Zeros have multiple origins in a dataset: false zeros occur due to errors in the experimental design or the observer; structural zeros are related to the ecological or evolutionary restrictions of the system under study; and random zeros are the result of the sampling variability. Identifying the type of zeros and their relation with overdispersion and/or zero inflation is key to select the most appropriate statistical model. 2. We first introduce the dispersion and zero inflation indeces and review the theory of the Zero-inflated (ZI) models and the use of the score tests to assess overdispersion and zero inflation over a model. Then, we present the following protocol to assist with the analysis of count data: Step 1) classify the zeros and minimize the presence of false zeros; Step 2) identify suitable covariates; Step 3) test the data for overdispersion and zero-inflation; and Step 4) choose the most adequate model based on the results of step 3 and use score tests to determine whether more complex models should be implemented. 3. We applied the recommended protocol on a real dataset on plant-herbivore interactions to evaluate the suitability of six different models (Poisson, NB and their zero-inflated versions –ZIP, ZINB–) in the light of overdispersion and zero inflation. Finally, we discuss the consequences of adjusting suboptimal models. 4. Our data was overdispersed and zero-inflated, and the ZINB was the model with the best fit, as predicted. Ignoring overdispersion and/or zero inflation during data analyses caused biased estimates of the statistical parameters and serious errors in the interpretation of the results. Our results are a clear example on how the conclusions of an ecological hypothesis can change depending on the model applied. Understanding of how zeros arise in count data, for example identifying the potential sources of structural zeros, is essential to select the best statistical design. A good model not only fits the data correctly but also takes into account the idiosyncrasies of the biological system under study., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Synthetic dataset generation with itemset-based generative models

  • Lezcano Ríos, Christian Gerardo
  • Arias Vicente, Marta|||0000-0001-7359-1815
This paper proposes three different data generators, tailored to transactional datasets, based on existing itemset-based generative models. All these generators are intuitive and easy to implement and show satisfactory performance. The quality of each generator is assessed by means of three different methods that capture how well the original dataset structure is preserved., Both authors have been partially supported by TIN2017-89244-R from MINECO (Spain’s Ministerio de Economia, Industria y Competitividad) and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). Christian Lezcano is supported by Paraguay’s Foreign Postgraduate Scholarship Programme Don Carlos Antonio López (BECAL)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Minimum projective linearizations of trees in linear time

  • Alemany Puig, Lluís|||0000-0002-3874-991X
  • Esteban Ángeles, Juan Luis|||0000-0003-0072-6576
  • Ferrer Cancho, Ramon|||0000-0002-7820-923X
The Minimum Linear Arrangement problem (MLA) consists of finding a mapping π from vertices of a graph to distinct integers that minimizes {u,v}∈E |π(u) − π(v)|. In that setting, vertices are often assumed to lie on a horizontal line and edges are drawn as semicircles above said line. For trees, various algorithms are available to solve the problem in polynomial time in n = |V |. There exist variants of the MLA in which the arrangements are constrained. Iordanskii, and later Hochberg and Stallmann (HS), put forward O(n)-time algorithms that solve the problem when arrangements are constrained to be planar (also known as one-page book embeddings). We also consider linear arrangements of rooted trees that are constrained to be projective (planar embeddings where the root is not covered by any edge). Gildea and Temperley (GT) sketched an algorithm for projective arrangements which they claimed runs in O(n) but did not provide any justification of its cost. In contrast, Park and Levy claimed that GT’s algorithm runs in O(n logdmax) where dmax is the maximum degree but did not provide sufficient detail. Here we correct an error in HS’s algorithm for the planar case, show its relationship with the projective case, and derive simple algorithms for the projective and planar cases that run without a doubt in O(n) time., LAP is supported by Secretaria d’Universitats i Recerca de la Generalitat de Catalunya and the Social European Fund. RFC and LAP are supported by the grant TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad). RFC is also supported by the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). JLE is funded by the grant PID2019- 109137GB-C22 from MINECO., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Cumulated burden of Covid-19 in Spain from a Bayesian perspective

  • Moriña, David
  • Fernandez Fontelo, Amanda
  • Cabaña Nigro, Ana Alejandra
  • Arratia Quesada, Argimiro Alejandro|||0000-0003-1551-420X
  • Ávalos Villaseñor, Gustavo Eduardo
  • Puig, Pedro
Background The main goal of this work is to estimate the actual number of cases of Covid-19 in Spain in the period 01-31-2020/06-01-2020 by Autonomous Communities. Based on these estimates, this work allows us to accurately re-estimate the lethality of the disease in Spain, taking into account unreported cases. Methods A hierarchical Bayesian model recently proposed in the literature has been adapted to model the actual number of Covid-19 cases in Spain. Results The results of this work show that the real load of Covid-19 in Spain in the period considered is well above the data registered by the public health system. Specifically, the model estimates show that, cumulatively until June 1st, 2020, there were 2 425 930 cases of Covid-19 in Spain with characteristics similar to those reported (95% credibility interval: 2 148 261 2 813 864), from which were actually registered only 518 664. Conclusions Considering the results obtained from the second wave of the Spanish seroprevalence study, which estimates 2 350 324 cases of Covid-19 produced in Spain, in the period of time considered, it can be seen that the estimates provided by the model are quite good. This work clearly shows the key importance of having good quality data to optimize decision-making in the critical context of dealing with a pandemic., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Qualitative and quantitative examples of natural and artificial phenomena

  • Hernández Fernández, Antonio|||0000-0002-9466-2704
The dichotomy between the qualitative and the quantitative has been a classic throughout the history of science. As will be seen, this dichotomy permeates all ontological levels of reality. In this work, phenomenological examples potentially related to semiosis are presented at the different levels established by Mario Bunge and Josep Ferrater Mora, contrasting the qualitative categorizations with the quantifiable physical reality. Likewise, the need to continue in the quantification of the biosemiotic and linguistic studies will be presented, while, in contrast, the need to establish a qualitative framework in the little-addressed study of technosemiotics will be raised, of potential interest given the notable advances that are expected in communication systems for inert artifacts in the next years. In short, in the thesis defended here the qualitative precedes the quantitative in the defining path of science., This work has been funded by the project PRO2021-S03 HERNANDEZ of Institut d’Estudis Catalans. AHF is also funded by the grant TIN2017-89244-R from Ministerio de Economía, Industria y Competitividad (Gobierno de España) and the recognition 2017 SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya)., Peer Reviewed, Objectius de Desenvolupament Sostenible::14 - Vida Submarina, Objectius de Desenvolupament Sostenible::15 - Vida d'Ecosistemes Terrestres
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

American and exotic options in a market with frictions

  • Junike, Gero
  • Arratia Quesada, Argimiro Alejandro|||0000-0003-1551-420X
  • Cabaña Nigro, Ana Alejandra
  • Schoutens, Wim
In a market with frictions, bid and ask prices are described by sublinear pricing functionals, which can be defined recursively using coherent risk measures. We prove the convergence of bid and ask prices for various European and American possible path-dependent options, in particular plain vanilla, Asian, lookback and barrier options in a binomial model with transaction costs. We perform several numerical experiments to confirm the theoretical findings. We apply the results to real market data of American options and compute an implied liquidity to describe the bidask spread. This method describes liquidity over time very well, compared to the classical approach of describing bid and ask prices by quoting bid and ask implied volatilities., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Linguistic laws in biology

  • Semple, Stuart
  • Ferrer Cancho, Ramon|||0000-0002-7820-923X
  • Gustison, Morgan L.
Linguistic laws, the common statistical patterns of human language, have been investigated by quantitative linguists for nearly a century. Recently, biologists from a range of disciplines have started to explore the prevalence of these laws beyond language, finding patterns consistent with linguistic laws across multiple levels of biological organisation, from molecular (genomes, genes, and proteins) to organismal (animal behaviour) to ecological (populations and ecosystems). We propose a new conceptual framework for the study of linguistic laws in biology, comprising and integrating distinct levels of analysis, from description to prediction to theory building. Adopting this framework will provide critical new insights into the fundamental rules of organisation underpinning natural systems, unifying linguistic laws and core theory in biology., M.L.G. is supported by the grant K99MH126164 from NIH (National Institutes of Health). R.F.C. is supported by the grant TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad) and by the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Capítulo o parte de un libro (BookPart)

Linguistic laws in Catalan

  • Hernández Fernández, Antonio|||0000-0002-9466-2704
  • Garrido Almiñana, Juan María
  • Luque Serrano, Bartolome
  • González Torre, Iván
In this work, we explore and review linguistic laws, in the case of Catalan, going from prelinguistic to higher linguistic levels and addressing both speech and writing. We show evidence supporting the theory that linguistic laws are universal patterns in human language that are more robust in the oral corpus than in writing. This reinforces the “physical hypothesis,” which argues that linguistic laws could have a physiological and biophysical origin, and they are reflected in written texts as a consequence of speech symbolization. However, future work is necessary to increase empirical evidence by deeply analyzing other language corpora, propose new cognitive and physical models that clarify the mathematical formulation of some statistical patterns, find more evidence to explain the relationship between prelinguistic and higher linguistic levels, and understand the results reported up to date from a global interdisciplinary perspective of language theory., I.G.T. and A.H.-F. were supported by the project PRO2020-S03 (RCO03080 Lingüística Quantitativa) and PRO2021-S03HERNANDEZ by Institut d’Estudis Catalans. A.H-F. was also supported by the grant TIN2017-89244-R (MACDA) (Ministerio de Economía, Industria y Competitividad, Gobierno de España)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Bounds of the sum of edge lengths in linear arrangements of trees

  • Ferrer Cancho, Ramon|||0000-0002-7820-923X
  • Gómez Rodríguez, Carlos
  • Esteban Ángeles, Juan Luis|||0000-0003-0072-6576
A fundamental problem in network science is the normalization of the topological or physical distance between vertices, which requires understanding the range of variation of the unnormalized distances. Here we investigate the limits of the variation of the physical distance in linear arrangements of the vertices of trees. In particular, we investigate various problems of the sum of edge lengths in trees of a fixed size: the minimum and the maximum value of the sum for specific trees, the minimum and the maximum in classes of trees (bistar trees and caterpillar trees) and finally the minimum and the maximum for any tree. We establish some foundations for research on optimality scores for spatial networks in one dimension., RFC is supported by the grant TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad) and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). CGR is funded by the European Research Council (ERC), under the European Union’s Horizon 2020 research and innovation programme (FASTPARSE, grant agreement No 714150), the ANSWER-ASAP project (TIN2017-85160-C2-1-R) from MINECO and Xunta de Galicia (ED431C 2020/11, ED431G2019/01, and an Oportunius program grant to complement ERC grants). JLE is funded by the grants TIN2016-76573-C2-1-P and PID2019-109137GB-C22 from MINECO., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Convolutional Neural Networks, image recognition and financial time series forecasting

  • Arratia Quesada, Argimiro Alejandro|||0000-0003-1551-420X
  • Sepúlveda, Eduardo
Convolutional Neural Networks (CNN) are best known as good image classifiers. This model is recently been used for financial forecasting. The purpose of this work is to show that by converting financial information into images and feeding these financial-image representation to the CNN, it results in an improvement in classification., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Polysemy and brevity versus frequency in language

  • Casas Fernández, Bernardino|||0000-0003-2948-0370
  • Hernández Fernández, Antonio|||0000-0002-9466-2704
  • Catala Roig, Neus|||0000-0002-6184-0367
  • Ferrer Cancho, Ramon|||0000-0002-7820-923X
  • Baixeries i Juvillà, Jaume|||0000-0003-2896-2247
The pioneering research of G. K. Zipf on the relationship between word frequency and other word features led to the formulation of various linguistic laws. The most popular is Zipf’s law for word frequencies. Here we focus on two laws that have been studied less intensively: the meaning-frequency law, i.e. the tendency of more frequent words to be more polysemous, and the law of abbreviation, i.e. the tendency of more frequent words to be shorter. In a previous work, we tested the robustness of these Zipfian laws for English, roughly measuring word length in number of characters and distinguishing adult from child speech. In the present article, we extend our study to other languages (Dutch and Spanish) and introduce two additional measures of length: syllabic length and phonemic length. Our correlation analysis indicates that both the meaning-frequency law and the law of abbreviation hold overall in all the analyzed languages., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

The sum of edge lengths in random linear arrangements

  • Ferrer Cancho, Ramon|||0000-0002-7820-923X
Spatial networks are networks where nodes are located in a space equipped with a metric. Typically, the space is two-dimensional and until recently and traditionally, the metric that was usually considered was the Euclidean distance. In spatial networks, the cost of a link depends on the edge length, i.e. the distance between the nodes that define the edge. Hypothesizing that there is pressure to reduce the length of the edges of a network requires a null model, e.g. a random layout of the vertices of the network. Here we investigate the properties of the distribution of the sum of edge lengths in random linear arrangement of vertices, that has many applications in different fields. A random linear arrangement consists of an ordering of the elements of the nodes of a network being all possible orderings equally likely. The distance between two vertices is one plus the number of intermediate vertices in the ordering. Compact formulae for the 1st and 2nd moments about zero as well as the variance of the sum of edge lengths are obtained for arbitrary graphs and trees. We also analyze the evolution of that variance in Erdos–Rényi graphs and its scaling in uniformly random trees. Various developments and applications for future research are suggested., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Knowledge-based segmentation to improve accuracy and explainability in non-technical losses detection

  • Calvo Ibáñez, Albert|||0000-0002-3761-9478
  • Coma Puig, Bernat|||0000-0003-3944-797X
  • Carmona Vargas, Josep|||0000-0001-9656-254X
  • Arias Vicente, Marta|||0000-0001-7359-1815
Utility companies have a great interest in identifying energy losses. Here, we focus on Non-Technical Losses (NTL), which refer to losses caused by utility theft or meter errors. Typically, utility companies resort to machine learning solutions to automate and optimise the identification of such losses. This paper extends an existing NTL-detection framework: by including knowledge-based NTL segmentation, we have detected some opportunities for improving the accuracy and the explanations provided to the utility company. Our improved models focus on specific types of NTL and therefore, the explanations provided are easier to interpret, allowing stakeholders to make more informed decisions. The improvements and results presented in the article may benefit other industrial frameworks., This work has been supported by MINECO and FEDER funds under grants TIN2017-86727-C2-1-R and TIN2017-89244-R, the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya)., Peer Reviewed, Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Anti dependency distance minimization in short sequences: A graph theoretic approach

  • Ferrer Cancho, Ramon|||0000-0002-7820-923X
  • Gómez Rodríguez, Carlos
Dependency distance minimization (DDm) is a word order principle favouring the placement of syntactically related words close to each other in sentences. Massive evidence of the principle has been reported for more than a decade with the help of syntactic dependency treebanks where long sentences abound. However, it has been predicted theoretically that the principle is more likely to be beaten in short sequences by the principle of surprisal minimization (predictability maximization). Here we introduce a simple binomial test to verify such a hypothesis. In short sentences, we find anti-DDm for some languages from different families. Our analysis of the syntactic dependency structures suggests that anti-DDm is produced by star trees., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

An evaluation of equity premium prediction using multiple kernel learning with financial features

  • Arratia Quesada, Argimiro Alejandro|||0000-0003-1551-420X
  • Belanche Muñoz, Luis Antonio|||0000-0002-7577-1964
  • Fábregues de los Santos, Luis
This paper introduces and extensively explores a forecasting procedure based on multivariate dynamic kernels to re-examine –under a non-linearframework– the experimental tests reported by Welch and Goyal (Review of Financial Studies 21(4),1455-1508, 2008) showing that several variables proposed in the finance literature are of no use as exogenous information to predict the equity premium under linear regressions. For this non-linear approach to equity premium forecasting, kernel functions for time series are used with multiple kernel learning(MKL) in order to represent the relative importance of each of the variables. We find that, in general, the predictive capabilities of the MKL models do not improve consistently with the use of some or all of the variables, nor does the predictability by single kernels, as determined by different resampling procedures that we implement and compare. This fact tends to corroborate the instability already observed by Welch and Goyal for the predictive power of exogenous variables, now in a non-linear modelling framework, Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Do Google Trends forecast bitcoins? Stylized facts and statistical evidence

  • Arratia Quesada, Argimiro Alejandro|||0000-0003-1551-420X
  • López Barrantes, Albert
In early 2018 Bitcoin prices peaked at US$ 20,000 and, almost two years later, we still continue debating if cryptocurrencies can actually become a currency for the everyday life or not. From the economic point of view, and playing in the field of behavioral finance, this paper analyses the relation between Bitcoin price and the search interest on Bitcoin since 2014. We questioned the forecasting ability of Google Bitcoin Trends for the behavior of Bitcoin price by performing linear and nonlinear dependency tests, and exploring performance of ARIMA and Neural Network models enhanced with this social sentiment indicator. Our analyses and models are founded upon a set of statistical properties common to financial returns that we establish for Bitcoin, Ethereum, Ripple and Litecoin., Research supported by Grant TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad) and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Refining indeterministic choice: Imprecise probabilities and strategic thinking

  • Castro Rabal, Jorge|||0000-0002-1390-1313
  • Gabarró Vallès, Joaquim|||0000-0003-3771-2813
  • Serna Iglesias, María José|||0000-0001-9729-8648
Often, uncertainty is present in processes that are part of our routines. Having tools to understand the consequences of unpredictability is convenient. We introduce a general framework to deal with uncertainty in the realm of distribution sets that are descriptions of imprecise probabilities. We propose several non-biased refinement strategies to obtain sensible forecasts about results of uncertain processes. Initially, uncertainty on a system is modeled as the non-deterministic choice of its possible behaviors. Our refinement hypothesis translates non-determinism into imprecise probabilistic choices. Imprecise probabilities allow us to propose a notion of uncertainty refinement in terms of set inclusions. Later on, unpredictability is tackled through a strategic approach using uncertainty profiles and angel/daemon games ([Formula: see text]-games). Here, imprecise probabilities form the set of mixed strategies and Nash equilibria corresponds to natural uncertainty refinements. We use this approach to study the performance of Web applications — in terms of response times — under stress conditions., J. Castro was partially supported by MINECO and EU FEDER funds grant TIN2017-89244-R and AGAUR grant 2017 SGR-856.J. Gabarro and M. Serna were partially supported by MINECO and EU FEDER funds grant TIN2017-86727-C2-1-R and AGAUR 2017 SGR 786., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Pipeline design to identify key features and classify the chemotherapy response on lung cancer patients using large-scale genetic data

  • Valdés, María Gabriela
  • Galván Femenía, Iván
  • Ribas Ripoll, Vicent
  • Duran Albareda, Xavier
  • Yokota, Jun
  • Gavaldà Mestre, Ricard|||0000-0003-4736-7179
  • Rafael-Palou, Xavier
  • de Cid, Rafael
Background: During the last decade, the interest to apply machine learning algorithms to genomic data has increased in many bioinformatics applications. Analyzing this type of data entails difficulties for managing high-dimensional data, class imbalance for knowledge extraction, identifying important features and classifying individuals. In this study, we propose a general framework to tackle these challenges with different machine learning algorithms and techniques. We apply the configuration of this framework on lung cancer patients, identifying genetic signatures for classifying response to drug treatment response. We intersect these relevant SNPs with the GWAS Catalog of the National Human Genome Research Institute and explore the Regulomedb, GTEx databases for functional analysis purposes. Results: The machine learning based solution proposed in this study is a scalable and flexible alternative to the classical uni-variate regression approach to analyze large-scale data. From 36 experiments executed using the machine learning framework design, we obtain good classification performance from the top 5 models with the highest cross-validation score and the smallest standard deviation. One thousand two hundred twenty four SNPs corresponding to the key features from the top 20 models (cross validation F1 mean >= 0.65) were compared with the GWAS Catalog finding no intersection with genome-wide significant reported hits. From these, new genetic signatures in MAE, CEP104, PRKCZ and ADRB2 show relevant biological regulatory functionality related to lung physiology. Conclusions: We have defined a machine learning framework using data with an unbalanced large data-set of SNP-arrays and imputed genotyping data from a pharmacogenomics study in lung cancer patients subjected to first-line platinum-based treatment. This approach found genome signals with no genome-wide significance in the uni-variate regression approach (GWAS Catalog) that are valuable for classifying patients, only few of them with related biological function. The effect results of these variants can be explained by the recently proposed omnigenic model hypothesis, which states that complex traits can be influenced mostly by genes outside not only by the “core genes”, mainly found by the genome-wide significant SNPs, but also by the rest of genes outside of the “core pathways” with apparent unrelated biological functionality., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

The linear arrangement library: A new tool for research on syntactic dependency structures

  • Alemany Puig, Lluís|||0000-0002-3874-991X
  • Esteban Ángeles, Juan Luis|||0000-0003-0072-6576
  • Ferrer Cancho, Ramon|||0000-0002-7820-923X
The new and growing field of Quantitative Dependency Syntax has emerged at the crossroads between Dependency Syntax and Quantitative Linguistics. One of the main concerns in this field is the statistical patterns of syntactic dependency structures. These structures, grouped in treebanks, are the source for statistical analyses in these and related areas; dozens of scores devised over the years are the tools of a new industry to search for patterns and perform other sorts of analyses. The plethora of such metrics and their increasing complexity require sharing the source code of the programs used to perform such analyses. However, such code is not often shared with the scientific community or is tested following unknown standards. Here we present a new open-source tool, the Linear Arrangement Library (LAL), which caters to the needs of, especially, inexperienced programmers. This tool enables the calculation of these metrics on single syntactic dependency structures, treebanks, and collection of treebanks, grounded on ease of use and yet with great flexibility. LAL has been designed to be efficient, easy to use (while satisfying the needs of all levels of programming expertise), reliable (thanks to thorough testing), and to unite research from different traditions, geographic areas, and research fields., LAP is supported by Secretaria d’Universitats i Recerca de la Generalitat de Catalunya and the Social European Fund. RFC and LAP are supported by the grant TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad). RFC is also supported by the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). JLE is funded by the grant PID2019-109137GB-C22 from MINECO., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Optimal coding and the origins of Zipfian laws

  • Ferrer Cancho, Ramon|||0000-0002-7820-923X
  • Bentz, Christian
  • Seguin, Caio
The problem of compression in standard information theory consists of assigning codes as short as possible to numbers. Here we consider the problem of optimal coding – under an arbitrary coding scheme – and show that it predicts Zipf’s law of abbreviation, namely a tendency in natural languages for more frequent words to be shorter. We apply this result to investigate optimal coding also under so-called non-singular coding, a scheme where unique segmentation is not warranted but codes stand for a distinct number. Optimal non-singular coding predicts that the length of a word should grow approximately as the logarithm of its frequency rank, which is again consistent with Zipf’s law of abbreviation. Optimal non-singular coding in combination with the maximum entropy principle also predicts Zipf’s rank-frequency distribution. Furthermore, our findings on optimal non-singular coding challenge common beliefs about random typing. It turns out that random typing is in fact an optimal coding process, in stark contrast with the common assumption that it is detached from cost cutting considerations. Finally, we discuss the implications of optimal coding for the construction of a compact theory of Zipfian laws more generally as well as other linguistic laws., RFC is supported by the grant TIN2017-89244-R from MINECO (Ministerio de Economia, Industria y Competitividad) and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). CB is supported by the DFG Center for Advanced Studies Words, Bones, Genes, Tools at the University of Tübingen, and by the Swiss National Foundation Grant on “Non-randomness in Morphological Diversity: A Computational Approach Based on Multilingual Corpora” (SNF 176305) at the University of Zürich. CS is funded by a Melbourne Research Scholarship., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Capítulo o parte de un libro (BookPart)

Linguistic laws in speech: The case of Catalan and Spanish

  • Hernández Fernández, Antonio|||0000-0002-9466-2704
  • González Torre, Iván
  • Garrido Almiñana, Juan Maria
  • Lacasa, Lucas
This is a reprint of articles from the Special Issue published online in the open access journal Entropy (ISSN 1099-4300) from 2019 to 2020 (available at: https://www.mdpi.com/journal/entropy/specialissues/inf theory Lang)., In this work we consider Glissando Corpus—an oral corpus of Catalan and Spanish—and empirically analyze the presence of the four classical linguistic laws (Zipf’s law, Herdan’s law, Brevity law, and Menzerath–Altmann’s law) in oral communication, and further complement this with the analysis of two recently formulated laws: lognormality law and size-rank law. By aligning the acoustic signal of speech production with the speech transcriptions, we are able to measure and compare the agreement of each of these laws when measured in both physical and symbolic units. Our results show that these six laws are recovered in both languages but considerably more emphatically so when these are examined in physical units, hence reinforcing the so-called ‘physical hypothesis’ according to which linguistic laws might indeed have a physical origin and the patterns recovered in written texts would, therefore, be just a byproduct of the regularities already present in the acoustic signals of oral communication., I.G.T. was supported by the grant FIS2017-84151-P (Ministerio de Economia, Industria y Competitividad, Gobierno de España). A.H.-F. was supported by the grant TIN2017-89244-R (MACDA) (Ministerio de Economia, Industria y Competitividad, Gobierno de España). I.G.T. and A.H.-F. were supported by the project PRO2019-S03 (RCO03080 Lingüística Quantitativa) de l’Institut d’Estudis Catalans. The development of the Glissando corpus was supported by projects FFI2008-04982-C03-01 and FFI2011-29559-C02-01 of the Ministerio de Ciencia e Innovación (Gobierno de España). L.L. was supported by EPSRC Early Career Fellowship EP/P01660X/1., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Clustering assessment in weighted networks

  • Arratia Quesada, Argimiro Alejandro|||0000-0003-1551-420X
  • Renedo Mirambell, Martí
We provide a systematic approach to validate the results of clustering methods on weighted networks, in particular for the cases where the existence of a community structure is unknown. Our validation of clustering comprises a set of criteria for assessing their significance and stability. To test for cluster significance, we introduce a set of community scoring functions adapted to weighted networks, and systematically compare their values to those of a suitable null model. For this we propose a switching model to produce randomized graphs with weighted edges while maintaining the degree distribution constant. To test for cluster stability, we introduce a non parametric bootstrap method combined with similarity metrics derived from information theory and combinatorics. In order to assess the effectiveness of our clustering quality evaluation methods, we test them on synthetically generated weighted networks with a ground truth community structure of varying strength based on the stochastic block model construction. When applying the proposed methods to these synthetic ground truth networks’ clusters, as well as to other weighted networks with known community structure, these correctly identify the best performing algorithms, which suggests their adequacy for cases where the clustering structure is not known. We test our clustering validation methods on a varied collection of well known clustering algorithms applied to the synthetically generated networks and to several real world weighted networks. All our clustering validation methods are implemented in R, and will be released in the upcoming package clustAnalytics., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

On the efficacy of stop-loss rules in the presence of overnight gaps

  • Arratia Quesada, Argimiro Alejandro|||0000-0003-1551-420X
  • Dorador Chalar, Albert
A stop-loss rule is a risk management tool whereby the investor predefines some condition that, upon being triggered by market dynamics, implies the liquidation of her outstanding position. Such a tool is widely used by practitioners in financial markets with the hope of improving their investment performance by cutting losses and consolidating gains. We analyze in this work the performance of four popular implementations of stop-loss rules applied to asset prices whose returns are modeled with consideration of overnight gaps, that is, jumps from the closing price of one day to the opening price of the next trading day. In addition, our models include acute momentary price drops (flash crashes), which are often believed to erode the performance gains that might be derived from stop-loss rules. For this analysis we consider different models of asset returns: random walk, autoregressive and regime-switching models. In addition, we test the performance of the considered stop-loss rules in a non-parametric, data-driven framework based on the stationary bootstrap. As a general conclusion we find that, even when including overnight gaps and flash crashes in our price models, in rising markets stop-loss rules improve the expected risk-adjusted return according to most metrics, while improving absolute expected return in falling markets. Furthermore, we find that in general the simple fixed percentage stop-loss rule may be, in risk-adjusted terms, the most powerful among the popular rules that this work considers, Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Estimating the real burden of disease under a pandemic situation: the SARS-CoV2 case

  • Fernandez Fontelo, Amanda
  • Moriña, David
  • Cabaña Nigro, Ana Alejandra
  • Arratia Quesada, Argimiro Alejandro|||0000-0003-1551-420X
  • Puig, Pedro
The present paper introduces a new model used to study and analyse the severe acute respiratory syndrome coronavirus 2 (SARS-CoV2) epidemic-reported-data from Spain. This is a Hidden Markov Model whose hidden layer is a regeneration process with Poisson immigration, Po-INAR(1), together with a mechanism that allows the estimation of the under-reporting in non-stationary count time series. A novelty of the model is that the expectation of the unobserved process’s innovations is a time-dependent function defined in such a way that information about the spread of an epidemic, as modelled through a Susceptible-Infectious-Removed dynamical system, is incorporated into the model. In addition, the parameter controlling the intensity of the under-reporting is also made to vary with time to adjust to possible seasonality or trend in the data. Maximum likelihood methods are used to estimate the parameters of the mode, A. Arratia acknowledges support by grant TIN2017-89244-R from MINECO (Ministerio de Economa, Industria y Competitividad) and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya), Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Memory limitations are hidden in grammar

  • Gómez Rodríguez, Carlos
  • Christiansen, Morten H.
  • Ferrer Cancho, Ramon|||0000-0002-7820-923X
The ability to produce and understand an unlimited number of different sentences is a hallmark of human language. Linguists have sought to define the essence of this generative capacity using formal grammars that describe the syntactic dependencies between constituents, independent of the computational limitations of the human brain. Here, we evaluate this independence assumption by sampling sentences uniformly from the space of possible syntactic structures. We find that the average dependency distance between syntactically related words, a proxy for memory limitations, is less than expected by chance in a collection of state-of-the-art classes of dependency grammars. Our findings indicate that memory limitations have permeated grammatical descriptions, suggesting that it may be impossible to build a parsimonious theory of human linguistic productivity independent of non-linguistic cognitive constraints., CGR has received funding from the European Research Council (ERC), under the European Union’s Horizon 2020 research and innovation programme (FASTPARSE, grant agreement No 714150), from ERDF/MICINN-AEI (ANSWER-ASAP, TIN2017-85160-C2-1-R; SCANNER-UDC, PID2020-113230RB-C21), from Xunta de Galicia (ED431C 2020/11), and from Centro de Investigación de Galicia “CITIC”, funded by Xunta de Galicia and the European Union (ERDF - Galicia 2014-2020 Program), by grant ED431G 2019/01. RFC is supported by the grant TIN2017-89244-R from MINECO and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Parsing/theorem-proving for logical grammar CatLog3

  • Morrill, Glyn|||0000-0002-5528-4384
CatLog3 is a 7000 line Prolog parser/theorem-prover for logical categorial grammar. In such logical categorial grammar syntax is universal and grammar is reduced to logic: an expression is grammatical if and only if an associated logical statement is a theorem of a fixed calculus. Since the syntactic component is invariant, being the logic of the calculus, logical categorial grammar is purely lexicalist and a particular language model is defined by just a lexical dictionary. The foundational logic of continuity was established by Lambek (Am Math Mon 65:154–170, 1958) (the Lambek calculus) while a corresponding extension including also logic of discontinuity was established by Morrill and Valentín (Linguist Anal 36(1–4):167–192, 2010) (the displacement calculus). CatLog3 implements a logic including as primitive connectives the continuous (concatenation) and discontinuous (intercalation) connectives of the displacement calculus, additives, 1st order quantifiers, normal modalities, bracket modalities, and universal and existential subexponentials. In this paper we review the rules of inference for these primitive connectives and their linguistic applications, and we survey the principles of Andreoli’s focusing, and of a generalisation of van Benthem’s count-invariance, on the basis of which CatLog3 is implemented., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Portfolio optimization in incomplete markets and price constraints determined by maximum entropy in the mean

  • Arratia Quesada, Argimiro Alejandro|||0000-0003-1551-420X
  • Gzyl, Henryk
A solution to a portfolio optimization problem is always conditioned by constraints on the initial capital and the price of the available market assets. If a risk neutral measure is known, then the price of each asset is the discounted expected value of the asset's price under this measure. But if the market is incomplete, the risk neutral measure is not unique, and there is a range of possible prices for each asset, which can be identified with bid-ask ranges. We present in this paper an effective method to determine the current prices of a collection of assets in incomplete markets, and such that these prices comply with the cost constraints for a portfolio optimization problem. Our workhorse is the method of maximum entropy in the mean to adjust a distortion function from bid-ask market data. This distortion function plays the role of a risk neutral measure, which is used to price the assets, and the distorted probability that it determines reproduces bid-ask market values. We carry out numerical examples to study the effect on portfolio returns of the computation of prices of the assets conforming the portfolio with the proposed methodology, Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Deep and wide neural networks covariance estimation

  • Arratia Quesada, Argimiro Alejandro|||0000-0003-1551-420X
  • Cabaña Nigro, Ana Alejandra
  • León, José Rafael
It has been recently shown that a deep neural network with i.i.d. random parameters is equivalent to a Gaussian process in the limit of infinite network width. The Gaussian process associated to the neural network is fully described by a recursive covariance kernel determined by the architecture of the network, and which is expressed in terms of expectation. We give a numerically workable analytic expression of the neural network recursive covariance based on Hermite polynomials. We give explicit forms of this recursive covariance for the cases of neural networks with activation function the Heaviside, ReLU and sigmoid., "A. Arratia—Supported by grant TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad) and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya).", Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Power to invest

  • Castro Rabal, Jorge|||0000-0002-1390-1313
  • Gabarró Vallès, Joaquim|||0000-0003-3771-2813
  • Serna Iglesias, María José|||0000-0001-9729-8648
In this post recession time it is important to measure the possibilities offered by a society in relation to investments. To do that, we consider an investment schema I= (R;R_1,...,R_n) where R is a lower bound on the desired return and the R_i's are the return of the assets (to invest in). We introduce, Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Measuring investment opportunities under uncertainty

  • Castro Rabal, Jorge|||0000-0002-1390-1313
  • Gabarró Vallès, Joaquim|||0000-0003-3771-2813
  • Serna Iglesias, María José|||0000-0001-9729-8648
In order to make sound economic decisions it is important to measure the possibilities offered by a market in relation to investments. Provided an investment scheme S = (r; R1, . . . , Rn), where r is a lower bound on the desired investment return and the Ri’s are the asset yields, the power to invest measures the capability of the scheme to fulfill requirement r. The power to invest is inspired in the Coleman’s power of a collectivity to act. We exemplify this approach considering subsets of companies from stock indexes IBEX35 and DAX. We extend the power to invest to investment schemata with imprecise yields. We prove basic relations with the precise yields case and we also show that good monotonicity properties hold. Finally, we propose an analysis, through integrals of the power function, for the case of an unspecific desired return r., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

The advent and fall of a vocabulary learning bias from communicative efficiency

  • Carrera Casado, David
  • Ferrer Cancho, Ramon|||0000-0002-7820-923X
Biosemiosis is a process of choice-making between simultaneously alternative options. It is well-known that, when sufficiently young children encounter a new word, they tend to interpret it as pointing to a meaning that does not have a word yet in their lexicon rather than to a meaning that already has a word attached. In previous research, the strategy was shown to be optimal from an information theoretic standpoint. In that framework, interpretation is hypothesized to be driven by the minimization of a cost function: the option of least communication cost is chosen. However, the information theoretic model employed in that research neither explains the weakening of that vocabulary learning bias in older children or polylinguals nor reproduces Zipf’s meaning-frequency law, namely the non-linear relationship between the number of meanings of a word and its frequency. Here we consider a generalization of the model that is channeled to reproduce that law. The analysis of the new model reveals regions of the phase space where the bias disappears consistently with the weakening or loss of the bias in older children or polylinguals. The model is abstract enough to support future research on other levels of life that are relevant to biosemiotics. In the deep learning era, the model is a transparent low-dimensional tool for future experimental research and illustrates the predictive power of a theoretical framework originally designed to shed light on the origins of Zipf’s rank-frequency law., DCC and RFC are supported by the grant TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad). RFC is also supported by the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A note on movement in logical grammar

  • Morrill, Glyn
In this article, we make some brief remarks on overt and covert movement in logical grammar. With respect to covert movement (e.g. quantification), we observe how a treatment in terms of displacement calculus interacts with normal modalities for intensionality to allow a coding in logical grammar of the distinction between weak and strong quantifiers (i.e. those that may or may not scope nonlocally such as a and every respectively). With respect to overt movement (e.g. relativisation), we observe how displacement calculus can support a coding of a linear filler-gap dependency similar to that employed in lambda grammars, but we argue that this general approach does not extend to either the multiplicity nor the island-sensitivity of parasitic gaps, for which we advocate instead treatment in terms of a bracket-conditioned contraction subexponential., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Recurrent autoencoder with skip connections and exogenous variables for traffic forecasting

  • Herruzo Sánchez, Pedro
  • Larriba Pey, Josep
The increasing complexity of mobility plus the growing population in cities, together with the importance of privacy when sharing data from vehicles or any device, makes traffic forecasting that uses data from infrastructure and citizens an open and challenging task. In this paper, we introduce a novel approach to deal with predictions of volume, speed and main traffic direction, in a new aggregated way of traffic data presented as videos. Our approach leverages the continuity in a sequence of frames, learning to embed them into a low dimensional space with an encoder and making predictions there using recurrent layers, ensuring good performance through an embedded loss, and then, recovering back spatial dimensions with a decoder using a second loss at a pixel level. Exogenous variables like weather, time and calendar are also added in the model. Furthermore, we introduce a novel sampling approach for sequences that ensures diversity when creating batches, running in parallel to the optimization process., This work is supported by SEAT, S.A., and the Secretariat of Universities and Research of the Department of Economy and Knowledge of the Generalitat de Catalunya, under the Industrial Doctorate Grant 2017 DI 52. This research is also supported by the grant TIN2017-89244-R from MINECO (Ministerio de Economia, Industria y Competitividad) and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Refining indeterministic choice: Imprecise probabilities and strategic thinking

  • Castro Rabal, Jorge
  • Gabarró Vallès, Joaquim
  • Serna Iglesias, María José
Often, uncertainty is present in processes that are part of our routines. Having tools to understand the consequences of unpredictability is convenient. We introduce a general framework to deal with uncertainty in the realm of distribution sets that are descriptions of imprecise probabilities. We propose several non-biased refinement strategies to obtain sensible forecasts about results of uncertain processes. Initially, uncertainty on a system is modeled as the non-deterministic choice of its possible behaviors. Our refinement hypothesis translates non-determinism into imprecise probabilistic choices. Imprecise probabilities allow us to propose a notion of uncertainty refinement in terms of set inclusions. Later on, unpredictability is tackled through a strategic approach using uncertainty profiles and angel/daemon games ([Formula: see text]-games). Here, imprecise probabilities form the set of mixed strategies and Nash equilibria corresponds to natural uncertainty refinements. We use this approach to study the performance of Web applications — in terms of response times — under stress conditions., J. Castro was partially supported by MINECO and EU FEDER funds grant TIN2017-89244-R and AGAUR grant 2017 SGR-856.J. Gabarro and M. Serna were partially supported by MINECO and EU FEDER funds grant TIN2017-86727-C2-1-R and AGAUR 2017 SGR 786., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

The advent and fall of a vocabulary learning bias from communicative efficiency

  • Carrera Casado, David
  • Ferrer Cancho, Ramon
Biosemiosis is a process of choice-making between simultaneously alternative options. It is well-known that, when sufficiently young children encounter a new word, they tend to interpret it as pointing to a meaning that does not have a word yet in their lexicon rather than to a meaning that already has a word attached. In previous research, the strategy was shown to be optimal from an information theoretic standpoint. In that framework, interpretation is hypothesized to be driven by the minimization of a cost function: the option of least communication cost is chosen. However, the information theoretic model employed in that research neither explains the weakening of that vocabulary learning bias in older children or polylinguals nor reproduces Zipf’s meaning-frequency law, namely the non-linear relationship between the number of meanings of a word and its frequency. Here we consider a generalization of the model that is channeled to reproduce that law. The analysis of the new model reveals regions of the phase space where the bias disappears consistently with the weakening or loss of the bias in older children or polylinguals. The model is abstract enough to support future research on other levels of life that are relevant to biosemiotics. In the deep learning era, the model is a transparent low-dimensional tool for future experimental research and illustrates the predictive power of a theoretical framework originally designed to shed light on the origins of Zipf’s rank-frequency law., DCC and RFC are supported by the grant TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad). RFC is also supported by the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

The sum of edge lengths in random linear arrangements

  • Ferrer Cancho, Ramon
Spatial networks are networks where nodes are located in a space equipped with a metric. Typically, the space is two-dimensional and until recently and traditionally, the metric that was usually considered was the Euclidean distance. In spatial networks, the cost of a link depends on the edge length, i.e. the distance between the nodes that define the edge. Hypothesizing that there is pressure to reduce the length of the edges of a network requires a null model, e.g. a random layout of the vertices of the network. Here we investigate the properties of the distribution of the sum of edge lengths in random linear arrangement of vertices, that has many applications in different fields. A random linear arrangement consists of an ordering of the elements of the nodes of a network being all possible orderings equally likely. The distance between two vertices is one plus the number of intermediate vertices in the ordering. Compact formulae for the 1st and 2nd moments about zero as well as the variance of the sum of edge lengths are obtained for arbitrary graphs and trees. We also analyze the evolution of that variance in Erdos–Rényi graphs and its scaling in uniformly random trees. Various developments and applications for future research are suggested., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Knowledge-based segmentation to improve accuracy and explainability in non-technical losses detection

  • Calvo Ibáñez, Albert
  • Coma Puig, Bernat
  • Carmona Vargas, Josep
  • Arias Vicente, Marta
Utility companies have a great interest in identifying energy losses. Here, we focus on Non-Technical Losses (NTL), which refer to losses caused by utility theft or meter errors. Typically, utility companies resort to machine learning solutions to automate and optimise the identification of such losses. This paper extends an existing NTL-detection framework: by including knowledge-based NTL segmentation, we have detected some opportunities for improving the accuracy and the explanations provided to the utility company. Our improved models focus on specific types of NTL and therefore, the explanations provided are easier to interpret, allowing stakeholders to make more informed decisions. The improvements and results presented in the article may benefit other industrial frameworks., This work has been supported by MINECO and FEDER funds under grants TIN2017-86727-C2-1-R and TIN2017-89244-R, the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya)., Peer Reviewed, Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Qualitative and quantitative examples of natural and artificial phenomena

  • Hernández Fernández, Antonio
The dichotomy between the qualitative and the quantitative has been a classic throughout the history of science. As will be seen, this dichotomy permeates all ontological levels of reality. In this work, phenomenological examples potentially related to semiosis are presented at the different levels established by Mario Bunge and Josep Ferrater Mora, contrasting the qualitative categorizations with the quantifiable physical reality. Likewise, the need to continue in the quantification of the biosemiotic and linguistic studies will be presented, while, in contrast, the need to establish a qualitative framework in the little-addressed study of technosemiotics will be raised, of potential interest given the notable advances that are expected in communication systems for inert artifacts in the next years. In short, in the thesis defended here the qualitative precedes the quantitative in the defining path of science., This work has been funded by the project PRO2021-S03 HERNANDEZ of Institut d’Estudis Catalans. AHF is also funded by the grant TIN2017-89244-R from Ministerio de Economía, Industria y Competitividad (Gobierno de España) and the recognition 2017 SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya)., Peer Reviewed, Objectius de Desenvolupament Sostenible::14 - Vida Submarina, Objectius de Desenvolupament Sostenible::15 - Vida d'Ecosistemes Terrestres, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Linear-time calculation of the expected sum of edge lengths in random projective linearizations of trees

  • Alemany Puig, Lluís
  • Ferrer Cancho, Ramon
The syntactic structure of a sentence is often represented using syntactic dependency trees. The sum of the distances between syntactically related words has been in the limelight for the past decades. Research on dependency distances led to the formulation of the principle of dependency distance minimization whereby words in sentences are ordered so as to minimize that sum. Numerous random baselines have been defined to carry out related quantitative studies on languages. The simplest random baseline is the expected value of the sum in unconstrained random permutations of the words in the sentence, namely, when all the shufflings of the words of a sentence are allowed and equally likely. Here we focus on a popular baseline: random projective permutations of the words of the sentence, that is, permutations where the syntactic dependency structure is projective, a formal constraint that sentences satisfy often in languages. Thus far, the expectation of the sum of dependency distances in random projective shufflings of a sentence has been estimated approximately with a Monte Carlo procedure whose cost is of the order of Rn, where n is the number of words of the sentence and R is the number of samples; it is well known that the larger R is, the lower the error of the estimation but the larger the time cost. Here we present formulae to compute that expectation without error in time of the order of n. Furthermore, we show that star trees maximize it, and provide an algorithm to retrieve the trees that minimize it., LAP is supported by Secretaria d’Universitats i Recerca de la Generalitat de Catalunya and the Social European Fund. RFC is also supported by the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). RFC and LAP are supported by the grant TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación

Predicciones financieras basadas en análisis de sentimiento de textos y minería de opiniones

  • Arratia Quesada, Argimiro Alejandro
En este capítulo se describe la mecánica básica para construir un modelo de predicción que utiliza indicadores de sentimiento derivados de datos textuales. Enfocamos nuestro objetivo de predicciones en series de tiempo financieras y presentamos un conjunto de hechos empíricos que describen las propiedades estadísticas de los indicadores de sentimiento, con particular atención en aquellos indicadores extraídos de noticias sobre mercados financieros y cuya categorización de sentimientos se basa en diccionarios. El objetivo general es proporcionar pautas para los profesionales en el mundo de las finan-zas para la adecuada construcción e interpretación de su propia información numérica dependiente del tiempo y que representa la percepción del público hacia las empresas, los precios de las acciones y los mercados financieros en general., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Spurious ambiguity and focalization

  • Morrill, Glyn
  • Valentín Fernández Gallart, José Oriol
Spurious ambiguity is the phenomenon whereby distinct derivations in grammar may assign the same structural reading, resulting in redundancy in the parse search space and inefficiency in parsing. Understanding the problem depends on identifying the essential mathematical structure of derivations. This is trivial in the case of context free grammar, where the parse structures are ordered trees; in the case of type logical categorial grammar, the parse structures are proof nets. However, with respect to multiplicatives, intrinsic proof nets have not yet been given for displacement calculus, and proof nets for additives, which have applications to polymorphism, are not easy to characterize. In this context we approach here multiplicative-additive spurious ambiguity by means of the proof-theoretic technique of focalization., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Refining the imprecise meaning of non-determinism in the Web by strategic games

  • Castro Rabal, Jorge
  • Gabarró Vallès, Joaquim
  • Serna Iglesias, María José
Nowadays interactions with the World Wide Web are ubiquitous. Users interact through a number of steps consisting of site calls and handling results that can be automatized as orchestrations. Orchestration results have an inherent degree of uncertainty due to incomplete Web knowledge and orchestration semantics are characterized in terms of imprecise probabilistic choices. We consider two aspects in this imprecise semantic characterization. First, when local knowledge (even imprecise) of some part of the Web increases, this knowledge goes smoothly through the whole orchestration. We deal formally with this aspect introducing orchestration refinements. Second, we analyze refinement under uncertainty in the case of parallel composition. Uncertain knowledge is modeled by an uncertainty profile. Such profiles allow us to look at the uncertainty through a zero-sum game, called angel/daemon-game. We propose to use the structure of the Nash equilibria to refine uncertainty. In this case the information improves not through cooperation but through the angel and daemon competition., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Convolutional Neural Networks, image recognition and financial time series forecasting

  • Arratia Quesada, Argimiro Alejandro
  • Sepúlveda, Eduardo
Convolutional Neural Networks (CNN) are best known as good image classifiers. This model is recently been used for financial forecasting. The purpose of this work is to show that by converting financial information into images and feeding these financial-image representation to the CNN, it results in an improvement in classification., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Memory limitations are hidden in grammar

  • Gómez Rodríguez, Carlos
  • Christiansen, Morten H.
  • Ferrer Cancho, Ramon
The ability to produce and understand an unlimited number of different sentences is a hallmark of human language. Linguists have sought to define the essence of this generative capacity using formal grammars that describe the syntactic dependencies between constituents, independent of the computational limitations of the human brain. Here, we evaluate this independence assumption by sampling sentences uniformly from the space of possible syntactic structures. We find that the average dependency distance between syntactically related words, a proxy for memory limitations, is less than expected by chance in a collection of state-of-the-art classes of dependency grammars. Our findings indicate that memory limitations have permeated grammatical descriptions, suggesting that it may be impossible to build a parsimonious theory of human linguistic productivity independent of non-linguistic cognitive constraints., CGR has received funding from the European Research Council (ERC), under the European Union’s Horizon 2020 research and innovation programme (FASTPARSE, grant agreement No 714150), from ERDF/MICINN-AEI (ANSWER-ASAP, TIN2017-85160-C2-1-R; SCANNER-UDC, PID2020-113230RB-C21), from Xunta de Galicia (ED431C 2020/11), and from Centro de Investigación de Galicia “CITIC”, funded by Xunta de Galicia and the European Union (ERDF - Galicia 2014-2020 Program), by grant ED431G 2019/01. RFC is supported by the grant TIN2017-89244-R from MINECO and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Power to invest

  • Castro Rabal, Jorge
  • Gabarró Vallès, Joaquim
  • Serna Iglesias, María José
In this post recession time it is important to measure the possibilities offered by a society in relation to investments. To do that, we consider an investment schema I= (R;R_1,...,R_n) where R is a lower bound on the desired return and the R_i's are the return of the assets (to invest in). We introduce, Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

The linear arrangement library: A new tool for research on syntactic dependency structures

  • Alemany Puig, Lluís
  • Esteban Ángeles, Juan Luis
  • Ferrer Cancho, Ramon
The new and growing field of Quantitative Dependency Syntax has emerged at the crossroads between Dependency Syntax and Quantitative Linguistics. One of the main concerns in this field is the statistical patterns of syntactic dependency structures. These structures, grouped in treebanks, are the source for statistical analyses in these and related areas; dozens of scores devised over the years are the tools of a new industry to search for patterns and perform other sorts of analyses. The plethora of such metrics and their increasing complexity require sharing the source code of the programs used to perform such analyses. However, such code is not often shared with the scientific community or is tested following unknown standards. Here we present a new open-source tool, the Linear Arrangement Library (LAL), which caters to the needs of, especially, inexperienced programmers. This tool enables the calculation of these metrics on single syntactic dependency structures, treebanks, and collection of treebanks, grounded on ease of use and yet with great flexibility. LAL has been designed to be efficient, easy to use (while satisfying the needs of all levels of programming expertise), reliable (thanks to thorough testing), and to unite research from different traditions, geographic areas, and research fields., LAP is supported by Secretaria d’Universitats i Recerca de la Generalitat de Catalunya and the Social European Fund. RFC and LAP are supported by the grant TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad). RFC is also supported by the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). JLE is funded by the grant PID2019-109137GB-C22 from MINECO., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación

Linguistic laws in Catalan

  • Hernández Fernández, Antonio
  • Garrido Almiñana, Juan María
  • Luque Serrano, Bartolome
  • González Torre, Iván
In this work, we explore and review linguistic laws, in the case of Catalan, going from prelinguistic to higher linguistic levels and addressing both speech and writing. We show evidence supporting the theory that linguistic laws are universal patterns in human language that are more robust in the oral corpus than in writing. This reinforces the “physical hypothesis,” which argues that linguistic laws could have a physiological and biophysical origin, and they are reflected in written texts as a consequence of speech symbolization. However, future work is necessary to increase empirical evidence by deeply analyzing other language corpora, propose new cognitive and physical models that clarify the mathematical formulation of some statistical patterns, find more evidence to explain the relationship between prelinguistic and higher linguistic levels, and understand the results reported up to date from a global interdisciplinary perspective of language theory., I.G.T. and A.H.-F. were supported by the project PRO2020-S03 (RCO03080 Lingüística Quantitativa) and PRO2021-S03HERNANDEZ by Institut d’Estudis Catalans. A.H-F. was also supported by the grant TIN2017-89244-R (MACDA) (Ministerio de Economía, Industria y Competitividad, Gobierno de España)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Minimum projective linearizations of trees in linear time

  • Alemany Puig, Lluís
  • Esteban Ángeles, Juan Luis
  • Ferrer Cancho, Ramon
The Minimum Linear Arrangement problem (MLA) consists of finding a mapping π from vertices of a graph to distinct integers that minimizes {u,v}∈E |π(u) − π(v)|. In that setting, vertices are often assumed to lie on a horizontal line and edges are drawn as semicircles above said line. For trees, various algorithms are available to solve the problem in polynomial time in n = |V |. There exist variants of the MLA in which the arrangements are constrained. Iordanskii, and later Hochberg and Stallmann (HS), put forward O(n)-time algorithms that solve the problem when arrangements are constrained to be planar (also known as one-page book embeddings). We also consider linear arrangements of rooted trees that are constrained to be projective (planar embeddings where the root is not covered by any edge). Gildea and Temperley (GT) sketched an algorithm for projective arrangements which they claimed runs in O(n) but did not provide any justification of its cost. In contrast, Park and Levy claimed that GT’s algorithm runs in O(n logdmax) where dmax is the maximum degree but did not provide sufficient detail. Here we correct an error in HS’s algorithm for the planar case, show its relationship with the projective case, and derive simple algorithms for the projective and planar cases that run without a doubt in O(n) time., LAP is supported by Secretaria d’Universitats i Recerca de la Generalitat de Catalunya and the Social European Fund. RFC and LAP are supported by the grant TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad). RFC is also supported by the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). JLE is funded by the grant PID2019- 109137GB-C22 from MINECO., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación

Linguistic laws in speech: The case of Catalan and Spanish

  • Hernández Fernández, Antonio
  • González Torre, Iván
  • Garrido Almiñana, Juan Maria
  • Lacasa, Lucas
This is a reprint of articles from the Special Issue published online in the open access journal Entropy (ISSN 1099-4300) from 2019 to 2020 (available at: https://www.mdpi.com/journal/entropy/specialissues/inf theory Lang)., In this work we consider Glissando Corpus—an oral corpus of Catalan and Spanish—and empirically analyze the presence of the four classical linguistic laws (Zipf’s law, Herdan’s law, Brevity law, and Menzerath–Altmann’s law) in oral communication, and further complement this with the analysis of two recently formulated laws: lognormality law and size-rank law. By aligning the acoustic signal of speech production with the speech transcriptions, we are able to measure and compare the agreement of each of these laws when measured in both physical and symbolic units. Our results show that these six laws are recovered in both languages but considerably more emphatically so when these are examined in physical units, hence reinforcing the so-called ‘physical hypothesis’ according to which linguistic laws might indeed have a physical origin and the patterns recovered in written texts would, therefore, be just a byproduct of the regularities already present in the acoustic signals of oral communication., I.G.T. was supported by the grant FIS2017-84151-P (Ministerio de Economia, Industria y Competitividad, Gobierno de España). A.H.-F. was supported by the grant TIN2017-89244-R (MACDA) (Ministerio de Economia, Industria y Competitividad, Gobierno de España). I.G.T. and A.H.-F. were supported by the project PRO2019-S03 (RCO03080 Lingüística Quantitativa) de l’Institut d’Estudis Catalans. The development of the Glissando corpus was supported by projects FFI2008-04982-C03-01 and FFI2011-29559-C02-01 of the Ministerio de Ciencia e Innovación (Gobierno de España). L.L. was supported by EPSRC Early Career Fellowship EP/P01660X/1., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Measuring investment opportunities under uncertainty

  • Castro Rabal, Jorge
  • Gabarró Vallès, Joaquim
  • Serna Iglesias, María José
In order to make sound economic decisions it is important to measure the possibilities offered by a market in relation to investments. Provided an investment scheme S = (r; R1, . . . , Rn), where r is a lower bound on the desired investment return and the Ri’s are the asset yields, the power to invest measures the capability of the scheme to fulfill requirement r. The power to invest is inspired in the Coleman’s power of a collectivity to act. We exemplify this approach considering subsets of companies from stock indexes IBEX35 and DAX. We extend the power to invest to investment schemata with imprecise yields. We prove basic relations with the precise yields case and we also show that good monotonicity properties hold. Finally, we propose an analysis, through integrals of the power function, for the case of an unspecific desired return r., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

American and exotic options in a market with frictions

  • Junike, Gero
  • Arratia Quesada, Argimiro Alejandro
  • Cabaña Nigro, Ana Alejandra
  • Schoutens, Wim
In a market with frictions, bid and ask prices are described by sublinear pricing functionals, which can be defined recursively using coherent risk measures. We prove the convergence of bid and ask prices for various European and American possible path-dependent options, in particular plain vanilla, Asian, lookback and barrier options in a binomial model with transaction costs. We perform several numerical experiments to confirm the theoretical findings. We apply the results to real market data of American options and compute an implied liquidity to describe the bidask spread. This method describes liquidity over time very well, compared to the classical approach of describing bid and ask prices by quoting bid and ask implied volatilities., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Parsing/theorem-proving for logical grammar CatLog3

  • Morrill, Glyn
CatLog3 is a 7000 line Prolog parser/theorem-prover for logical categorial grammar. In such logical categorial grammar syntax is universal and grammar is reduced to logic: an expression is grammatical if and only if an associated logical statement is a theorem of a fixed calculus. Since the syntactic component is invariant, being the logic of the calculus, logical categorial grammar is purely lexicalist and a particular language model is defined by just a lexical dictionary. The foundational logic of continuity was established by Lambek (Am Math Mon 65:154–170, 1958) (the Lambek calculus) while a corresponding extension including also logic of discontinuity was established by Morrill and Valentín (Linguist Anal 36(1–4):167–192, 2010) (the displacement calculus). CatLog3 implements a logic including as primitive connectives the continuous (concatenation) and discontinuous (intercalation) connectives of the displacement calculus, additives, 1st order quantifiers, normal modalities, bracket modalities, and universal and existential subexponentials. In this paper we review the rules of inference for these primitive connectives and their linguistic applications, and we survey the principles of Andreoli’s focusing, and of a generalisation of van Benthem’s count-invariance, on the basis of which CatLog3 is implemented., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Pipeline design to identify key features and classify the chemotherapy response on lung cancer patients using large-scale genetic data

  • Valdés, María Gabriela
  • Galván Femenía, Iván
  • Ribas Ripoll, Vicent
  • Duran Albareda, Xavier
  • Yokota, Jun
  • Gavaldà Mestre, Ricard
  • Rafael-Palou, Xavier
  • de Cid, Rafael
Background: During the last decade, the interest to apply machine learning algorithms to genomic data has increased in many bioinformatics applications. Analyzing this type of data entails difficulties for managing high-dimensional data, class imbalance for knowledge extraction, identifying important features and classifying individuals. In this study, we propose a general framework to tackle these challenges with different machine learning algorithms and techniques. We apply the configuration of this framework on lung cancer patients, identifying genetic signatures for classifying response to drug treatment response. We intersect these relevant SNPs with the GWAS Catalog of the National Human Genome Research Institute and explore the Regulomedb, GTEx databases for functional analysis purposes. Results: The machine learning based solution proposed in this study is a scalable and flexible alternative to the classical uni-variate regression approach to analyze large-scale data. From 36 experiments executed using the machine learning framework design, we obtain good classification performance from the top 5 models with the highest cross-validation score and the smallest standard deviation. One thousand two hundred twenty four SNPs corresponding to the key features from the top 20 models (cross validation F1 mean >= 0.65) were compared with the GWAS Catalog finding no intersection with genome-wide significant reported hits. From these, new genetic signatures in MAE, CEP104, PRKCZ and ADRB2 show relevant biological regulatory functionality related to lung physiology. Conclusions: We have defined a machine learning framework using data with an unbalanced large data-set of SNP-arrays and imputed genotyping data from a pharmacogenomics study in lung cancer patients subjected to first-line platinum-based treatment. This approach found genome signals with no genome-wide significance in the uni-variate regression approach (GWAS Catalog) that are valuable for classifying patients, only few of them with related biological function. The effect results of these variants can be explained by the recently proposed omnigenic model hypothesis, which states that complex traits can be influenced mostly by genes outside not only by the “core genes”, mainly found by the genome-wide significant SNPs, but also by the rest of genes outside of the “core pathways” with apparent unrelated biological functionality., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Bounds of the sum of edge lengths in linear arrangements of trees

  • Ferrer Cancho, Ramon
  • Gómez Rodríguez, Carlos
  • Esteban Ángeles, Juan Luis
A fundamental problem in network science is the normalization of the topological or physical distance between vertices, which requires understanding the range of variation of the unnormalized distances. Here we investigate the limits of the variation of the physical distance in linear arrangements of the vertices of trees. In particular, we investigate various problems of the sum of edge lengths in trees of a fixed size: the minimum and the maximum value of the sum for specific trees, the minimum and the maximum in classes of trees (bistar trees and caterpillar trees) and finally the minimum and the maximum for any tree. We establish some foundations for research on optimality scores for spatial networks in one dimension., RFC is supported by the grant TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad) and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). CGR is funded by the European Research Council (ERC), under the European Union’s Horizon 2020 research and innovation programme (FASTPARSE, grant agreement No 714150), the ANSWER-ASAP project (TIN2017-85160-C2-1-R) from MINECO and Xunta de Galicia (ED431C 2020/11, ED431G2019/01, and an Oportunius program grant to complement ERC grants). JLE is funded by the grants TIN2016-76573-C2-1-P and PID2019-109137GB-C22 from MINECO., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación

The Greedy Algorithm and the Cohen-Macaulay property of rings, graphs and toric projective curves

  • Arratia Quesada, Argimiro Alejandro
It is shown in this paper how a solution for a combinatorial problem obtained from applying the greedy algorithm is guaranteed to be optimal for those instances of the problem that, under an appropriate algebraic representation, satisfy the Cohen-Macaulay property known for rings and modules in Commutative Algebra. The choice of representation for the instances of a given combinatorial problem is fundamental for recognizing the Cohen-Macaulay property. Departing from an exposition of the general framework of simplicial complexes and their associated Stanley-Reisner ideals, wherein the Cohen-Macaulay property is formally defined, a review of other equivalent frameworks more suitable for graphs or arithmetical problems will follow. In the case of graph problems a better framework to use is the edge ideal of Rafael Villarreal. For arithmetic problems it is appropriate to work within the semigroup viewpoint of toric geometry developed by Antonio Campillo and collaborators., Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Linguistic laws in biology

  • Semple, Stuart
  • Ferrer Cancho, Ramon
  • Gustison, Morgan L.
Linguistic laws, the common statistical patterns of human language, have been investigated by quantitative linguists for nearly a century. Recently, biologists from a range of disciplines have started to explore the prevalence of these laws beyond language, finding patterns consistent with linguistic laws across multiple levels of biological organisation, from molecular (genomes, genes, and proteins) to organismal (animal behaviour) to ecological (populations and ecosystems). We propose a new conceptual framework for the study of linguistic laws in biology, comprising and integrating distinct levels of analysis, from description to prediction to theory building. Adopting this framework will provide critical new insights into the fundamental rules of organisation underpinning natural systems, unifying linguistic laws and core theory in biology., M.L.G. is supported by the grant K99MH126164 from NIH (National Institutes of Health). R.F.C. is supported by the grant TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad) and by the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Clustering assessment in weighted networks

  • Arratia Quesada, Argimiro Alejandro
  • Renedo Mirambell, Martí
We provide a systematic approach to validate the results of clustering methods on weighted networks, in particular for the cases where the existence of a community structure is unknown. Our validation of clustering comprises a set of criteria for assessing their significance and stability. To test for cluster significance, we introduce a set of community scoring functions adapted to weighted networks, and systematically compare their values to those of a suitable null model. For this we propose a switching model to produce randomized graphs with weighted edges while maintaining the degree distribution constant. To test for cluster stability, we introduce a non parametric bootstrap method combined with similarity metrics derived from information theory and combinatorics. In order to assess the effectiveness of our clustering quality evaluation methods, we test them on synthetically generated weighted networks with a ground truth community structure of varying strength based on the stochastic block model construction. When applying the proposed methods to these synthetic ground truth networks’ clusters, as well as to other weighted networks with known community structure, these correctly identify the best performing algorithms, which suggests their adequacy for cases where the clustering structure is not known. We test our clustering validation methods on a varied collection of well known clustering algorithms applied to the synthetically generated networks and to several real world weighted networks. All our clustering validation methods are implemented in R, and will be released in the upcoming package clustAnalytics., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Can Menzerath’s law be a criterion of complexity in communication?

  • González Torre, Ivan
  • Debowski, Lukasz
  • Hernández Fernández, Antonio
Menzerath’s law is a quantitative linguistic law which states that, on average, the longer is a linguistic construct, the shorter are its constituents. In contrast, Menzerath-Altmann’s law (MAL) is a precise mathematical power-law-exponential formula which expresses the expected length of the linguistic construct conditioned on the number of its constituents. In this paper, we investigate the anatomy of MAL for constructs being word tokens and constituents being syllables, measuring its length in graphemes. First, we derive the exact form of MAL for texts generated by the memoryless source with three emitted symbols, which can be interpreted as a "monkey typing" model or a null model. We show that this null model complies with Menzerath’s law, revealing that Menzerath’s law itself can hardly be a criterion of complexity in communication. This observation does not apply to the more precise Menzerath-Altmann’s law, which predicts an inverted regime for sufficiently range constructs, i.e., the longer is a word, the longer are its syllables. To support this claim, we analyze MAL on data from 21 languages, consisting of texts from the Standardized Project Gutenberg. We show the presence of the inverted regime, not exhibited by the null model, and we demonstrate robustness of our results. We also report the complicated distribution of syllable sizes with respect to their position in the word, which might be related with the emerging MAL. Altogether, our results indicate that Menzerath’s law—in terms of correlations—is a spurious observation, while complex patterns and efficiency dynamics should be rather attributed to specific forms of Menzerath-Altmann’s law., This work has been funded by the project PRO2021-S03-HERNANDEZ (Institut d’Estudis Catalans), where AHF is the principal investigator. URL: https://futur.upc.edu/30546321 AHF is also funded by the grant TIN2017-89244-R from Ministerio de Economia, Industria y Competitividad (Gobierno de España) and supported by the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). URL: https://futur.upc. edu/2202438, Peer Reviewed, Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Synthetic dataset generation with itemset-based generative models

  • Lezcano Ríos, Christian Gerardo
  • Arias Vicente, Marta
This paper proposes three different data generators, tailored to transactional datasets, based on existing itemset-based generative models. All these generators are intuitive and easy to implement and show satisfactory performance. The quality of each generator is assessed by means of three different methods that capture how well the original dataset structure is preserved., Both authors have been partially supported by TIN2017-89244-R from MINECO (Spain’s Ministerio de Economia, Industria y Competitividad) and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). Christian Lezcano is supported by Paraguay’s Foreign Postgraduate Scholarship Programme Don Carlos Antonio López (BECAL)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Deep and wide neural networks covariance estimation

  • Arratia Quesada, Argimiro Alejandro
  • Cabaña Nigro, Ana Alejandra
  • León, José Rafael
It has been recently shown that a deep neural network with i.i.d. random parameters is equivalent to a Gaussian process in the limit of infinite network width. The Gaussian process associated to the neural network is fully described by a recursive covariance kernel determined by the architecture of the network, and which is expressed in terms of expectation. We give a numerically workable analytic expression of the neural network recursive covariance based on Hermite polynomials. We give explicit forms of this recursive covariance for the cases of neural networks with activation function the Heaviside, ReLU and sigmoid., "A. Arratia—Supported by grant TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad) and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya).", Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

An evaluation of equity premium prediction using multiple kernel learning with financial features

  • Arratia Quesada, Argimiro Alejandro
  • Belanche Muñoz, Luis Antonio
  • Fábregues de los Santos, Luis
This paper introduces and extensively explores a forecasting procedure based on multivariate dynamic kernels to re-examine –under a non-linearframework– the experimental tests reported by Welch and Goyal (Review of Financial Studies 21(4),1455-1508, 2008) showing that several variables proposed in the finance literature are of no use as exogenous information to predict the equity premium under linear regressions. For this non-linear approach to equity premium forecasting, kernel functions for time series are used with multiple kernel learning(MKL) in order to represent the relative importance of each of the variables. We find that, in general, the predictive capabilities of the MKL models do not improve consistently with the use of some or all of the variables, nor does the predictability by single kernels, as determined by different resampling procedures that we implement and compare. This fact tends to corroborate the instability already observed by Welch and Goyal for the predictive power of exogenous variables, now in a non-linear modelling framework, Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Weighted contrastive divergence

  • Romero Merino, Enrique
  • Mazzanti Castrillejo, Fernando Pablo
  • Delgado Pin, Jordi
  • Buchaca Prats, David
Learning algorithms for energy based Boltzmann architectures that rely on gradient descent are in general computationally prohibitive, typically due to the exponential number of terms involved in computing the partition function. In this way one has to resort to approximation schemes for the evaluation of the gradient. This is the case of Restricted Boltzmann Machines (RBM) and its learning algorithm Contrastive Divergence (CD). It is well-known that CD has a number of shortcomings, and its approximation to the gradient has several drawbacks. Overcoming these defects has been the basis of much research and new algorithms have been devised, such as persistent CD. In this manuscript we propose a new algorithm that we call Weighted CD (WCD), built from small modifications of the negative phase in standard CD. However small these modifications may be, experimental work reported in this paper suggests that WCD provides a significant improvement over standard CD and persistent CD at a small additional computational cost., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Co-occurrence patterns in diagnostic data

  • Piceno Cabrera, Marie Ely
  • Rodríguez Navas, Laura
  • Balcázar Navarro, José Luis
We demonstrate how graph decomposition techniques can be employed for the visualization of hierarchical co-occurrence patterns between medical data items. Our research is based on Gaifman graphs (a mathematical concept introduced in Logic), on specific variants of this concept, and on existing graph decomposition notions, specifically, graph modules and the clan decomposition of so-called 2-structures. The construction of the Gaifman graphs from a dataset is based on co-occurrence, or lack of it, of items in the dataset. We may select a discretization on the edge labels to aim at one among several Gaifman graph variants. Then, the decomposition of the graph may provide us with visual information about the data co-occurrences, after which one can proceed to more traditional statistical analysis., Partially supported by European Research Council (ERC) under the European Union's Horizon2020 research and innovation programme, grant agreement ERC-2014-CoG 648276 (AUTAR);by grant TIN2017-89244-R from Ministerio de Economia, Industria y Competitividad, and byConacyt (México). We acknowledge unfunded recognition 2017SGR-856 (MACDA) from AGAUR(Generalitat de Catalunya)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Anti dependency distance minimization in short sequences: A graph theoretic approach

  • Ferrer Cancho, Ramon
  • Gómez Rodríguez, Carlos
Dependency distance minimization (DDm) is a word order principle favouring the placement of syntactically related words close to each other in sentences. Massive evidence of the principle has been reported for more than a decade with the help of syntactic dependency treebanks where long sentences abound. However, it has been predicted theoretically that the principle is more likely to be beaten in short sequences by the principle of surprisal minimization (predictability maximization). Here we introduce a simple binomial test to verify such a hypothesis. In short sentences, we find anti-DDm for some languages from different families. Our analysis of the syntactic dependency structures suggests that anti-DDm is produced by star trees., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Characterizing transactional databases for frequent itemset mining

  • Lezcano Ríos, Christian Gerardo
  • Arias Vicente, Marta
This paper presents a study of the characteristics of transactional databases used in frequent itemset mining. Such characterizations have typically been used to benchmark and understand the data mining algorithms working on these databases. The aim of our study is to give a picture of how diverse and representative these benchmarking databases are, both in general but also in the context of particular empirical studies found in the literature. Our proposed list of metrics contains many of the existing metrics found in the literature, as well as new ones. Our study shows that our list of metrics is able to capture much of the datasets’ inner complexity and thus provides a good basis for the characterization of transactional datasets. Finally, we provide a set of representative datasets based on our characterization that may be used as a benchmark safely., Both authors have been partially supported by TIN2017-89244-R from MINECO (Spain’s Ministerio de Economia, Industria y Competitividad) and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). Christian Lezcano is supported by Paraguay’s Foreign Postgraduate Scholarship Programme Don Carlos Antonio López (BECAL)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Polysemy and brevity versus frequency in language

  • Casas Fernández, Bernardino
  • Hernández Fernández, Antonio
  • Catala Roig, Neus
  • Ferrer Cancho, Ramon
  • Baixeries i Juvillà, Jaume
The pioneering research of G. K. Zipf on the relationship between word frequency and other word features led to the formulation of various linguistic laws. The most popular is Zipf’s law for word frequencies. Here we focus on two laws that have been studied less intensively: the meaning-frequency law, i.e. the tendency of more frequent words to be more polysemous, and the law of abbreviation, i.e. the tendency of more frequent words to be shorter. In a previous work, we tested the robustness of these Zipfian laws for English, roughly measuring word length in number of characters and distinguishing adult from child speech. In the present article, we extend our study to other languages (Dutch and Spanish) and introduce two additional measures of length: syllabic length and phonemic length. Our correlation analysis indicates that both the meaning-frequency law and the law of abbreviation hold overall in all the analyzed languages., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Do Google Trends forecast bitcoins? Stylized facts and statistical evidence

  • Arratia Quesada, Argimiro Alejandro
  • López Barrantes, Albert
In early 2018 Bitcoin prices peaked at US$ 20,000 and, almost two years later, we still continue debating if cryptocurrencies can actually become a currency for the everyday life or not. From the economic point of view, and playing in the field of behavioral finance, this paper analyses the relation between Bitcoin price and the search interest on Bitcoin since 2014. We questioned the forecasting ability of Google Bitcoin Trends for the behavior of Bitcoin price by performing linear and nonlinear dependency tests, and exploring performance of ARIMA and Neural Network models enhanced with this social sentiment indicator. Our analyses and models are founded upon a set of statistical properties common to financial returns that we establish for Bitcoin, Ethereum, Ripple and Litecoin., Research supported by Grant TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad) and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Linguistic laws in chimpanzee gestural communication

  • Heesen, Raphaela
  • Hobaiter, Catherine
  • Ferrer Cancho, Ramon
  • Semple, Stuart
Studies testing linguistic laws outside language have provided important insights into the organization of biological systems. For example, patterns consistent with Zipf's law of abbreviation (which predicts a negative relationship between word length and frequency of use) have been found in the vocal and non-vocal behaviour of a range of animals, and patterns consistent with Menzerath's law (according to which longer sequences are made up of shorter constituents) have been found in primate vocal sequences, and in genes, proteins and genomes. Both laws have been linked to compression—the information theoretic principle of minimizing code length. Here, we present the first test of these laws in animal gestural communication. We initially did not find the negative relationship between gesture duration and frequency of use predicted by Zipf's law of abbreviation, but this relationship was seen in specific subsets of the repertoire. Furthermore, a pattern opposite to that predicted was seen in one subset of gestures—whole body signals. We found a negative correlation between number and mean duration of gestures in sequences, in line with Menzerath's law. These results provide the first evidence that compression underpins animal gestural communication, and highlight an important commonality between primate gesturing and language., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Distinct flavors of Zipf's law and its maximum likelihood fitting: Rank-size and size-distribution representations

  • Corral Cano, Álvaro
  • Serra Mochales, Isabel
  • Ferrer Cancho, Ramon
In recent years, researchers have realized the difficulties of fitting power-law distributions properly. These difficulties are higher in Zipfian systems, due to the discreteness of the variables and to the existence of two representations for these systems, i.e., two versions depending on the random variable to fit: rank or size. The discreteness implies that a power law in one of the representations is not a power law in the other, and vice versa. We generate synthetic power laws in both representations and apply a state-of-the-art fitting method to each of the two random variables. The method (based on maximum likelihood plus a goodness-of-fit test) does not fit the whole distribution but the tail, understood as the part of a distribution above a cutoff that separates non-power-law behavior from power-law behavior. We find that, no matter which random variable is power-law distributed, using the rank as the random variable is problematic for fitting, in general (although it may work in some limit cases). One of the difficulties comes from recovering the “hidden” true ranks from the empirical ranks. On the contrary, the representation in terms of the distribution of sizes allows one to recover the true exponent (with some small bias when the underlying size distribution is a power law only asymptotically)., Support from projects FIS2012-31324, FIS2015-71851-P, TIN2017-89244-R, PGC-FIS2018-099629-B-I00, María de Maeztu Program MDM-2014-0445, from Spanish MINECO; 2014SGR-1307, 2017SGR-856 (MACDA) from AGAUR; and the Collaborative Mathematics Project from Fundación La Caixa (I.S.) is acknowledged., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

What does a zero mean? understanding false, random and structural zeros in ecology

  • Blasco Moreno, Anabel
  • Pérez Casany, Marta
  • Puig, Pedro
  • Morante, Maria
  • Castells, Eva
1. Zeros (i.e. events that do not happen) are the source of two common phenomena in count data: overdispersion and zero-inflation. Zeros have multiple origins in a dataset: false zeros occur due to errors in the experimental design or the observer; structural zeros are related to the ecological or evolutionary restrictions of the system under study; and random zeros are the result of the sampling variability. Identifying the type of zeros and their relation with overdispersion and/or zero inflation is key to select the most appropriate statistical model. 2. We first introduce the dispersion and zero inflation indeces and review the theory of the Zero-inflated (ZI) models and the use of the score tests to assess overdispersion and zero inflation over a model. Then, we present the following protocol to assist with the analysis of count data: Step 1) classify the zeros and minimize the presence of false zeros; Step 2) identify suitable covariates; Step 3) test the data for overdispersion and zero-inflation; and Step 4) choose the most adequate model based on the results of step 3 and use score tests to determine whether more complex models should be implemented. 3. We applied the recommended protocol on a real dataset on plant-herbivore interactions to evaluate the suitability of six different models (Poisson, NB and their zero-inflated versions –ZIP, ZINB–) in the light of overdispersion and zero inflation. Finally, we discuss the consequences of adjusting suboptimal models. 4. Our data was overdispersed and zero-inflated, and the ZINB was the model with the best fit, as predicted. Ignoring overdispersion and/or zero inflation during data analyses caused biased estimates of the statistical parameters and serious errors in the interpretation of the results. Our results are a clear example on how the conclusions of an ecological hypothesis can change depending on the model applied. Understanding of how zeros arise in count data, for example identifying the potential sources of structural zeros, is essential to select the best statistical design. A good model not only fits the data correctly but also takes into account the idiosyncrasies of the biological system under study., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Portfolio optimization in incomplete markets and price constraints determined by maximum entropy in the mean

  • Arratia Quesada, Argimiro Alejandro
  • Gzyl, Henryk
A solution to a portfolio optimization problem is always conditioned by constraints on the initial capital and the price of the available market assets. If a risk neutral measure is known, then the price of each asset is the discounted expected value of the asset's price under this measure. But if the market is incomplete, the risk neutral measure is not unique, and there is a range of possible prices for each asset, which can be identified with bid-ask ranges. We present in this paper an effective method to determine the current prices of a collection of assets in incomplete markets, and such that these prices comply with the cost constraints for a portfolio optimization problem. Our workhorse is the method of maximum entropy in the mean to adjust a distortion function from bid-ask market data. This distortion function plays the role of a risk neutral measure, which is used to price the assets, and the distorted probability that it determines reproduces bid-ask market values. We carry out numerical examples to study the effect on portfolio returns of the computation of prices of the assets conforming the portfolio with the proposed methodology, Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Optimal coding and the origins of Zipfian laws

  • Ferrer Cancho, Ramon
  • Bentz, Christian
  • Seguin, Caio
The problem of compression in standard information theory consists of assigning codes as short as possible to numbers. Here we consider the problem of optimal coding – under an arbitrary coding scheme – and show that it predicts Zipf’s law of abbreviation, namely a tendency in natural languages for more frequent words to be shorter. We apply this result to investigate optimal coding also under so-called non-singular coding, a scheme where unique segmentation is not warranted but codes stand for a distinct number. Optimal non-singular coding predicts that the length of a word should grow approximately as the logarithm of its frequency rank, which is again consistent with Zipf’s law of abbreviation. Optimal non-singular coding in combination with the maximum entropy principle also predicts Zipf’s rank-frequency distribution. Furthermore, our findings on optimal non-singular coding challenge common beliefs about random typing. It turns out that random typing is in fact an optimal coding process, in stark contrast with the common assumption that it is detached from cost cutting considerations. Finally, we discuss the implications of optimal coding for the construction of a compact theory of Zipfian laws more generally as well as other linguistic laws., RFC is supported by the grant TIN2017-89244-R from MINECO (Ministerio de Economia, Industria y Competitividad) and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). CB is supported by the DFG Center for Advanced Studies Words, Bones, Genes, Tools at the University of Tübingen, and by the Swiss National Foundation Grant on “Non-randomness in Morphological Diversity: A Computational Approach Based on Multilingual Corpora” (SNF 176305) at the University of Zürich. CS is funded by a Melbourne Research Scholarship., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Speech pause distribution as an early marker for Alzheimer’s disease

  • Pastoriza-Domínguez, Patricia
  • González Torre, Ivan
  • Diéguez-Vide, Faustino
  • Gómez Ruiz, María Isabel
  • Geladó Muñoz, Sandra
  • Bello-López, Joan
  • Ávila-Rivera, Asunción
  • Matías-Guiu, Jordi
  • Pytel Córdoba, Vanesa
  • Hernández Fernández, Antonio
Background: Pause duration analysis is a common feature in the study of discourse in Alzheimer’s disease (AD) since this patient group has shown a consistent trend for longer pauses in comparison to healthy controls. This speech feature may also be helpful for early detection; however, studies involving patients at the pre-clinical, high-risk phase of amnestic mild cognitive impairment (aMCI) have yielded varying results. Objective: To characterize the probability density distribution of speech pause durations in 26 patients with AD, 57 amnestic multi-domain amnestic MCI patients (29 with memory encoding deficits, a-mdMCI-E, and 28 with retrieval impairment only, a-mdMCI-R) and 29 healthy controls (HC) in order assess whether there are significant differences between them. To explore the potential differences in pause production between patients with a-mdMCI-E and a-mdMCI-R, as the former are considered to be at higher risk of progressing to dementia. Methods: The 112 picture-based oral narratives obtained were manually transcribed and annotated for the automatic extraction and analysis of pause durations. Different probability distributions were tested for the fitting of pause durations while truncating shorter ranges. Recent findings in the field of Statistics were considered in order to avoid the inherent methodological uncertainty that this type of analysis entails by addressing the question of temporal thresholding and its potential repercussions on inter-annotator reliability in manual transcriptions. Results: A lognormal distribution (LND) explained the distribution of pause duration for all groups. Its fitted parameters (, ) followed a gradation from the group with shorter durations and a higher tendency to produce short pauses (HC) to the group with longer pause durations and a considerably higher tendency to produce long pauses with greater variance (AD). Importantly, a-mdMCI-E produced significantly longer pauses and with greater variability than their a-mdMCI-R counterparts (alpha=0.05). Conclusion: We report significant differences at the group level in pause distribution across all groups of study that could be used in future diagnostic tools and discuss the clinical implications of these findings, particularly regarding the characterization of a-mdMCI., This work is supported through a PhD grant awarded to P.P-D. by the banking Foundation ‘‘La Caixa’’ (ID 100010434, code: LCF/BQ/ES15/10360020). F.D-V. was supported by a grant awarded to project no. PID2019-107042GB-I00 (Ministerio de Ciencia e Innovación). A.H-F. and I.G.T. were supported by the grant no. TIN2017- 89244-R (MACDA) (Ministerio de Economia, Industria y Competitivi- dad, Gobierno de España) and the project PRO2020-S03 (RCO03080 Lingüística Quantitativa) of l’Institut d’Estudis Catalans., Peer Reviewed, Objectius de Desenvolupament Sostenible::3 - Salut i Benestar, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

On the efficacy of stop-loss rules in the presence of overnight gaps

  • Arratia Quesada, Argimiro Alejandro
  • Dorador Chalar, Albert
A stop-loss rule is a risk management tool whereby the investor predefines some condition that, upon being triggered by market dynamics, implies the liquidation of her outstanding position. Such a tool is widely used by practitioners in financial markets with the hope of improving their investment performance by cutting losses and consolidating gains. We analyze in this work the performance of four popular implementations of stop-loss rules applied to asset prices whose returns are modeled with consideration of overnight gaps, that is, jumps from the closing price of one day to the opening price of the next trading day. In addition, our models include acute momentary price drops (flash crashes), which are often believed to erode the performance gains that might be derived from stop-loss rules. For this analysis we consider different models of asset returns: random walk, autoregressive and regime-switching models. In addition, we test the performance of the considered stop-loss rules in a non-parametric, data-driven framework based on the stationary bootstrap. As a general conclusion we find that, even when including overnight gaps and flash crashes in our price models, in rising markets stop-loss rules improve the expected risk-adjusted return according to most metrics, while improving absolute expected return in falling markets. Furthermore, we find that in general the simple fixed percentage stop-loss rule may be, in risk-adjusted terms, the most powerful among the popular rules that this work considers, Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación

Sentiment analysis of financial news: mechanics and statistics

  • Arratia Quesada, Argimiro Alejandro
  • Ávalos Villaseñor, Gustavo Eduardo
  • Cabaña Nigro, Ana Alejandra
  • Duarte López, Ariel
  • Renedo Mirambell, Martí
This chapter describes the basic mechanics for building a forecasting model that uses as input sentiment indicators derived from textual data. In addition, as we focus our target of predictions on financial time series, we present a set of stylized empirical facts describing the statistical properties of lexicon-based sentiment indicators extracted from news on financial markets. Examples of these modeling methods and statistical hypothesis tests are provided on real data. The general goal is to provide guidelines for financial practitioners for the proper construction and interpretation of their own time-dependent numerical information representing public perception toward companies, stocks’ prices, and financial markets in general, The research of A. Arratia, G. Avalos, and M. Renedo-Mirambell is supported by grant TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad) and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya), Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Estimating the real burden of disease under a pandemic situation: the SARS-CoV2 case

  • Fernandez Fontelo, Amanda
  • Moriña, David
  • Cabaña Nigro, Ana Alejandra
  • Arratia Quesada, Argimiro Alejandro
  • Puig, Pedro
The present paper introduces a new model used to study and analyse the severe acute respiratory syndrome coronavirus 2 (SARS-CoV2) epidemic-reported-data from Spain. This is a Hidden Markov Model whose hidden layer is a regeneration process with Poisson immigration, Po-INAR(1), together with a mechanism that allows the estimation of the under-reporting in non-stationary count time series. A novelty of the model is that the expectation of the unobserved process’s innovations is a time-dependent function defined in such a way that information about the spread of an epidemic, as modelled through a Susceptible-Infectious-Removed dynamical system, is incorporated into the model. In addition, the parameter controlling the intensity of the under-reporting is also made to vary with time to adjust to possible seasonality or trend in the data. Maximum likelihood methods are used to estimate the parameters of the mode, A. Arratia acknowledges support by grant TIN2017-89244-R from MINECO (Ministerio de Economa, Industria y Competitividad) and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya), Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Cumulated burden of Covid-19 in Spain from a Bayesian perspective

  • Moriña, David
  • Fernandez Fontelo, Amanda
  • Cabaña Nigro, Ana Alejandra
  • Arratia Quesada, Argimiro Alejandro
  • Ávalos Villaseñor, Gustavo Eduardo
  • Puig, Pedro
Background The main goal of this work is to estimate the actual number of cases of Covid-19 in Spain in the period 01-31-2020/06-01-2020 by Autonomous Communities. Based on these estimates, this work allows us to accurately re-estimate the lethality of the disease in Spain, taking into account unreported cases. Methods A hierarchical Bayesian model recently proposed in the literature has been adapted to model the actual number of Covid-19 cases in Spain. Results The results of this work show that the real load of Covid-19 in Spain in the period considered is well above the data registered by the public health system. Specifically, the model estimates show that, cumulatively until June 1st, 2020, there were 2 425 930 cases of Covid-19 in Spain with characteristics similar to those reported (95% credibility interval: 2 148 261 2 813 864), from which were actually registered only 518 664. Conclusions Considering the results obtained from the second wave of the Spanish seroprevalence study, which estimates 2 350 324 cases of Covid-19 produced in Spain, in the period of time considered, it can be seen that the estimates provided by the model are quite good. This work clearly shows the key importance of having good quality data to optimize decision-making in the critical context of dealing with a pandemic., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Web apps and imprecise probabilities

  • Castro Rabal, Jorge
  • Gabarró Vallès, Joaquim
  • Serna Iglesias, María José
We propose a model for the behaviour of Web apps in the unreliable WWW. Web apps are described by orchestrations. An orchestration mimics the personal use of the Web by defining the way in which Web services are invoked. The WWW is unreliable as poorly maintained Web sites are prone to fail. We model this source of unreliability trough a probabilistic approach. We assume that each site has a probability to fail. Another source of uncertainty is the traffic congestion. This can be observed as a non-deterministic behaviour induced by the variability in the response times. We model non-determinism by imprecise probabilities. We develop here an ex-ante normal to characterize the behaviour of finite orchestrations in the unreliable Web. We show the existence of a normal form under such semantics for orchestrations using asymmetric parallelism., Peer Reviewed, Postprint (author's final draft)
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Estimating the real burden of disease under a pandemic situation, The SARS-CoV2 case

  • Fernández-Fontelo, Amanda|||0000-0002-0822-6915
  • Moriña, David|||0000-0001-5949-7443
  • Cabaña, Alejandra|||0000-0002-1289-967X
  • Arratia, Argimiro|||0000-0003-1551-420X
  • Puig, Pedro|||0000-0002-6607-9642
The present paper introduces a new model used to study and analyse the severe acute respiratory syndrome coronavirus 2 (SARS-CoV2) epidemic-reported-data from Spain. This is a Hidden Markov Model whose hidden layer is a regeneration process with Poisson immigration, Po-INAR(1), together with a mechanism that allows the estimation of the under-reporting in non-stationary count time series. A novelty of the model is that the expectation of the unobserved process's innovations is a time-dependent function defined in such a way that information about the spread of an epidemic, as modelled through a Susceptible-Infectious-Removed dynamical system, is incorporated into the model. In addition, the parameter controlling the intensity of the under-reporting is also made to vary with time to adjust to possible seasonality or trend in the data. Maximum likelihood methods are used to estimate the parameters of the model.