Skip to main content

Resultados relacionados

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

Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Neighborhood-based stopping criterion for contrastive divergence

  • Romero Merino, Enrique
  • Mazzanti Castrillejo, Fernando Pablo
  • Delgado Pin, Jordi
Restricted Boltzmann Machines (RBMs) are general unsupervised learning devices to ascertain generative models of data distributions. RBMs are often trained using the Contrastive Divergence (CD) learning algorithm, an approximation to the gradient of the data log-likelihood (logL). A simple reconstruction error is often used as a stopping criterion for CD, although several authors have raised doubts concerning the feasibility of this procedure. In many cases, the evolution curve of the reconstruction error is monotonic, while the logL is not, thus indicating that the former is not a good estimator of the optimal stopping point for learning. However, not many alternatives to the reconstruction error have been discussed in the literature. An estimation of the logL of the training data based on annealed importance sampling is feasible but computationally very expensive. In this manuscript, we present a simple and cheap alternative, based on the inclusion of information contained in neighboring states to the training set, as a stopping criterion for CD learning., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Relative entailment among probabilistic implications

  • Atserias, Albert
  • Balcázar Navarro, José Luis
  • Piceno Cabrera, Marie Ely
We study a natural variant of the implicational fragment of propositional logic. Its formulas are pairs of conjunctions of positive literals, related together by an implicational-like connective; the semantics of this sort of implication is defined in terms of a threshold on a conditional probability of the consequent, given the antecedent: we are dealing with what the data analysis community calls confidence of partial implications or association rules. Existing studies of redundancy among these partial implications have characterized so far only entailment from one premise and entailment from two premises, both in the stand-alone case and in the case of presence of additional classical implications (this is what we call "relative entailment"). By exploiting a previously noted alternative view of the entailment in terms of linear programming duality, we characterize exactly the cases of entailment from arbitrary numbers of premises, again both in the stand-alone case and in the case of presence of additional classical implications. As a result, we obtain decision algorithms of better complexity; additionally, for each potential case of entailment, we identify a critical confidence threshold and show that it is, actually, intrinsic to each set of premises and antecedent of the conclusion., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Closed-set-based discovery of representative association rules

  • Tîrnauca, Cristina
  • Balcázar Navarro, José Luis
  • Gómez Pérez, Domingo
The output of an association rule miner is often huge in practice. This is why several concise lossless representations have been proposed, such as the “essential” or “representative” rules. A previously known algorithm for mining representative rules relies on an incorrect mathematical claim, and can be seen to miss part of its intended output; in previous work, two of the authors of the present paper have offered a complete but, often, somewhat slower alternative. Here, we extend this alternative to the case of closure-based redundancy. The empirical validation shows that, in this way, we can improve on the original time efficiency, without sacrificing completeness., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication

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
Publication Artículo científico (JournalArticle)

A dependency look at the reality of constituency

  • Chen, Xinying
  • Gómez Rodríguez, Carlos
  • Ferrer Cancho, Ramon
A comment on “Neurophysiological dynamics of phrase-structure building during sentence processing” by Nelson et al (2017), Proceedings of the National Academy of Sciences USA 114(18), E3669-E3678., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

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

  • Sierra Santibáñez, Josefina
This paper presents an agent-based model of the emergence and evolution of a language system for Boolean coordination. The model assumes the agents have cognitive capacities for invention, adoption, abstraction, repair and adaptation, a common lexicon for basic concepts, and the ability to construct complex concepts using recursive combinations of basic concepts and logical operations such as negation, conjunction or disjunction. It also supposes the agents initially have neither a lexicon for logical operations nor the ability to express logical combinations of basic concepts through language. The results of the experiments we have performed show that a language system for Boolean coordination emerges as a result of a process of self-organisation of the agents' linguistic interactions when these agents adapt their preferences for vocabulary, syntactic categories and word order to those they observe are used more often by other agents. Such a language system allows the unambiguous communication of higher-order logic terms representing logical combinations of basic properties with non-trivial recursive structure, and it can be reliably transmitted across generations according to the results of our experiments. Furthermore, the conceptual and linguistic systems, and simplification and repair operations of the agent-based model proposed are more general than those defined in previous works, because they not only allow the simulation of the emergence and evolution of a language system for the Boolean coordination of basic properties, but also for the Boolean coordination of higher-order logic terms of any Boolean type which can represent the meaning of nouns, sentences, verbs, adjectives, adverbs, prepositions, prepositional phrases and subexpressions not traditionally analysed as forming constituents, using linguistic devices such as syntactic categories, word order and function words., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication 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
Publication Contribución de congreso (ConferenceOutput)

Characterization of order-like dependencies with formal concept analysis

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

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

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

Rehabilitation Profiles of Older Adult Stroke Survivors Admitted to Intermediate Care Units: A Multi-Centre Study

  • Pérez, Laura Mónica|||0000-0003-3152-9882
  • Inzitari, Marco|||0000-0002-3796-0625
  • Quinn, Terence J.
  • Montaner, Joan|||0000-0003-4845-2279
  • Gavaldà, Ricard
  • Duarte Oller, Esther|||0000-0002-4058-1802
  • Coll-Planas, Laura|||0000-0001-5204-8717
  • Cerdà, Mercè
  • Santaeugenia, Sebastià
  • Closa, Conxita
  • Gallofré López, Miquel
Background: Stroke is a major cause of disability in older adults, but the evidence around post-acute treatment is limited and heterogeneous. We aimed to identify profiles of older adult stroke survivors admitted to intermediate care geriatric rehabilitation units. Methods: We performed a cohort study, enrolling stroke survivors aged 65 years or older, admitted to 9 intermediate care units in Catalonia-Spain. To identify potential profiles, we included age, caregiver presence, comorbidity, pre-stroke and post-stroke disability, cognitive impairment and stroke severity in a cluster analysis. We also proposed a practical decision tree for patient's classification in clinical practice. We analyzed differences between profiles in functional improvement (Barthel index), relative functional gain (Montebello index), length of hospital stay (LOS), rehabilitation efficiency (functional improvement by LOS), and new institutionalization using multivariable regression models (for continuous and dichotomous outcomes). Results: Among 384 patients (79.1±7.9 years, 50.8% women), we identified 3 complexity profiles: a) Lower Complexity with Caregiver (LCC), b) Moderate Complexity without Caregiver (MCN), and c) Higher Complexity with Caregiver (HCC). The decision tree showed high agreement with cluster analysis (96.6%). Using either linear (continuous outcomes) or logistic regression, both LCC and MCN, compared to HCC, showed statistically significant higher chances of functional improvement (OR = 4.68, 95%CI = 2.54-8.63 and OR = 3.0, 95%CI = 1.52-5.87, respectively, for Barthel index improvement ≥20), relative functional gain (OR = 4.41, 95%CI = 1.81-10.75 and OR = 3.45, 95%CI = 1.31-9.04, respectively, for top Vs lower tertiles), and rehabilitation efficiency (OR = 7.88, 95%CI = 3.65-17.03 and OR = 3.87, 95%CI = 1.69-8.89, respectively, for top Vs lower tertiles). In relation to LOS, MCN cluster had lower chance of shorter LOS than LCC (OR = 0.41, 95%CI = 0.23-0.75) and HCC (OR = 0.37, 95%CI = 0.19-0.73), for LOS lower Vs higher tertiles. Conclusion: Our data suggest that post-stroke rehabilitation profiles could be identified using routine assessment tools and showed differential recovery. If confirmed, these findings might help to develop tailored interventions to optimize recovery of older stroke patients.