activity
20102019
most citedFormal and Computational Properties of the Confidence Boost of Association Rules

1 citations · 2 across the 7 of their papers we have counts for

collaborators

7 papers

cs.DB2019

Analysis of Co-Occurrence Patterns in Data through Modular and Clan Decompositions of Gaifman Graphs

Marie Ely Piceno, José Luis Balcázar

We argue that the existing knowledge about modular decomposition of graphs and clan decomposition of 2-structures can be put to use advantageously in a context of data analysis. We…

cs.DB2018

Decomposition of quantitative Gaifman graphs as a data analysis tool

José Luis Balcázar, Marie Ely Piceno, Laura Rodríguez-Navas

We argue the usefulness of Gaifman graphs of first-order relational structures as an exploratory data analysis tool. We illustrate our approach with cases where the modular decompo…

cs.LO2015

Quantitative Redundancy in Partial Implications

José L. Balcázar

We survey the different properties of an intuitive notion of redundancy, as a function of the precise semantics given to the notion of partial implication. The final version of thi…

cs.LG2015

Learning Definite Horn Formulas from Closure Queries

Marta Arias, José L. Balcázar, Cristina Tîrnăucă

A definite Horn theory is a set of n-dimensional Boolean vectors whose characteristic function is expressible as a definite Horn formula, that is, as conjunction of definite Horn c…

cs.LO2015★ 1 cited

Relative Entailment Among Probabilistic Implications

Albert Atserias, José L. Balcázar, Marie Ely Piceno

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-l…

cs.DB2011★ 1 cited

Formal and Computational Properties of the Confidence Boost of Association Rules

José L. Balcázar

Some existing notions of redundancy among association rules allow for a logical-style characterization and lead to irredundant bases of absolutely minimum size. One can push the in…