José L. Balcázar

Laura Rodríguez-Navas

Comput. Intell., 2021

2020

Closed-Set-Based Discovery of Representative Association Rules.

[BibT_eX]

[DOI]

Domingo Gómez-Pérez

Int. J. Found. Comput. Sci., 2020

2019

Relative Entailment Among Probabilistic Implications.

[BibT_eX]

[DOI]

Albert Atserias

Log. Methods Comput. Sci., 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

Hierarchical Visualization of Co-Occurrence Patterns on Diagnostic Data.

[BibT_eX]

[DOI]

Laura Rodríguez-Navas

Proceedings of the 32nd IEEE International Symposium on Computer-Based Medical Systems, 2019

2018

Global optimality in <i>k</i>-means clustering.

[BibT_eX]

[DOI]

Inf. Sci., 2018

Decomposition of Quantitative Gaifman Graphs as a Data Analysis Tool.

[BibT_eX]

[DOI]

Laura Rodríguez-Navas

Proceedings of the Advances in Intelligent Data Analysis XVII, 2018

2017

Learning definite Horn formulas from closure queries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

2015

Learning Propositional Horn Formulas from Closure Queries.

[BibT_eX]

[DOI]

CoRR, 2015

Entailment among Probabilistic Implications.

[BibT_eX]

[DOI]

Albert Atserias

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Quantitative Redundancy in Partial Implications.

[BibT_eX]

[DOI]

Proceedings of the Formal Concept Analysis - 13th International Conference, 2015

2013

Formal and computational properties of the confidence boost of association rules.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2013

Evaluation of Association Rule Quality Measures through Feature Extraction.

[BibT_eX]

[DOI]

Francis Dogbey

Proceedings of the Advances in Intelligent Data Analysis XII, 2013

2011

Construction and learnability of canonical Horn formulas.

[BibT_eX]

[DOI]

Mach. Learn., 2011

Preface.

[BibT_eX]

[DOI]

Proceedings of the Second Workshop on Applications of Pattern Analysis, 2011

Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices.

[BibT_eX]

[DOI]

Proceedings of the Formal Concept Analysis - 9th International Conference, 2011

Closed-set-based Discovery of Representative Association Rules Revisited.

[BibT_eX]

[DOI]

Proceedings of the Extraction et gestion des connaissances (EGC'2011), 2011

Parameter-free Association Rule Mining with Yacaree.

[BibT_eX]

[DOI]

Proceedings of the Extraction et gestion des connaissances (EGC'2011), 2011

Towards Parameter-free Data Mining: Mining Educational Data with Yacaree.

[BibT_eX]

[DOI]

Marta E. Zorrilla

Diego García-Saiz

Proceedings of the 4th International Conference on Educational Data Mining, 2011

2010

Mining frequent closed rooted trees.

[BibT_eX]

[DOI]

Mach. Learn., 2010

Special issue for ECML PKDD 2010: Guest editors' introduction.

[BibT_eX]

[DOI]

Mach. Learn., 2010

Closure-Based Confidence Boost in Association Rules.

[BibT_eX]

[DOI]

Proceedings of the First Workshop on Applications of Pattern Analysis, 2010

Guest editors' introduction: special issue of selected papers from ECML PKDD 2010.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2010

Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2010

Filtering Association Rules with Negations on the Basis of Their Confidence Boost.

[BibT_eX]

Marta E. Zorrilla

Proceedings of the KDIR 2010, 2010

Objective Novelty of Association Rules : Measuring the Confidence Boost.

[BibT_eX]

[DOI]

Proceedings of the Extraction et gestion des connaissances (EGC'2010), 2010

2009

Two Measures of Objective Novelty in Association Rule Mining.

[BibT_eX]

[DOI]

Proceedings of the New Frontiers in Applied Data Mining, 2009

Canonical Horn Representations and Query Learning.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008

Provably Fast Training Algorithms for Support Vector Machines.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

Minimum-Size Bases of Association Rules.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2008

Mining Implications from Lattices of Closed Trees.

[BibT_eX]

[DOI]

Proceedings of the Extraction et gestion des connaissances (EGC'2008), 2008

Deduction Schemes for Association Rules.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 11th International Conference, 2008

Query Learning and Certificates in Lattices.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

2007

Horn axiomatizations for sequential data.

[BibT_eX]

[DOI]

Gemma C. Garriga

Theor. Comput. Sci., 2007

A general dimension for query learning.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2007

Characterizing Implications of Injective Partial Orders.

[BibT_eX]

[DOI]

Gemma C. Garriga

Proceedings of the Conceptual Structures: Knowledge Architectures for Smart Applications, 2007

Mining Frequent Closed Unordered Trees Through Natural Representations.

[BibT_eX]

[DOI]

Proceedings of the Conceptual Structures: Knowledge Architectures for Smart Applications, 2007

Subtree Testing and Closed Tree Mining Through Natural Representations.

[BibT_eX]

[DOI]

Proceedings of the 18th International Workshop on Database and Expert Systems Applications (DEXA 2007), 2007

2006

Editors' Introduction.

[BibT_eX]

[DOI]

Philip M. Long

Frank Stephan

Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006

2005

Characterization and Armstrong Relations for Degenerate Multivalued Dependencies Using Formal Concept Analysis.

[BibT_eX]

[DOI]

Proceedings of the Formal Concept Analysis, Third International Conference, 2005

New Closure Operators and Lattice Representations for Multivalued Dependencies and Related Expressions.

[BibT_eX]

[DOI]

Proceedings of the CLA 2005 International Workshop on Concept Lattices and their Applications Olomouc, 2005

2004

Coproduct Transformations on Lattices of Closed Partial Orders.

[BibT_eX]

[DOI]

Gemma Casas-Garriga

Proceedings of the Graph Transformations, Second International Conference, 2004

Characterizations of Multivalued Dependencies and Related Expressions.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 7th International Conference, 2004

2002

The consistency dimension and distribution-dependent learning from queries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

A New Abstract Combinatorial Dimension for Exact Learning via Queries.

[BibT_eX]

[DOI]

David Guijarro

J. Comput. Syst. Sci., 2002

A Best-First Strategy for Finding Frequent Sets.

[BibT_eX]

Gemma Casas-Garriga

Proceedings of the Extraction et gestion des connaissances (EGC'2002), 2002

2001

Provably Fast Training Algorithms for Support Vector Machines.

[BibT_eX]

[DOI]

Yang Dai

Osamu Watanabe

Proceedings of the 2001 IEEE International Conference on Data Mining, 29 November, 2001

Bounding Negative Information in Frequent Sets Algorithms.

[BibT_eX]

[DOI]

Inmaculada Fortes Ruiz

Rafael Morales Bueno

Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

A General Dimension for Exact Learning.

[BibT_eX]

[DOI]

David Guijarro

Proceedings of the Computational Learning Theory, 2001

A Random Sampling Technique for Training Support Vector Machines.

[BibT_eX]

[DOI]

Yang Dai

Osamu Watanabe

Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

2000

Editor's Foreword.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2000

Abstract Combinatorial Characterizations of Exact Learning via Queries.

[BibT_eX]

David Guijarro

Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000

1999

The Consistency Dimension, Compactness, and Query Learning.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 13th International Workshop, 1999

The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 10th International Conference, 1999

1998

The Structure of Logarithmic Advice Complexity Classes.

[BibT_eX]

[DOI]

Montserrat Hermo

Theor. Comput. Sci., 1998

1997

Computational power of neural networks: a characterization in terms of Kolmogorov complexity.

[BibT_eX]

[DOI]

Hava T. Siegelmann

IEEE Trans. Inf. Theory, 1997

A First-Order Isomorphism Theorem.

[BibT_eX]

[DOI]

Eric Allender

Neil Immerman

SIAM J. Comput., 1997

Coding Complexity: The Computational Complexity of Succinct Descriptions.

[BibT_eX]

Osamu Watanabe

Proceedings of the Advances in Algorithms, Languages, and Complexity, 1997

Algorithms for Learning Finite Automata from Queries: A Unified View.

[BibT_eX]

Proceedings of the Advances in Algorithms, Languages, and Complexity, 1997

1996

An Optimal Parallel Algorithm for Learning DFA.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1996

The Complexity of Searching Implicit Graphs.

[BibT_eX]

[DOI]

Artif. Intell., 1996

1995

Structural Complexity I, Second Edition

[BibT_eX]

[DOI]

Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 354058384X, 1995

Adaptive Logspace Reducibility and Parallel Time.

[BibT_eX]

[DOI]

Carme Àlvarez

Birgit Jenner

Math. Syst. Theory, 1995

The Complexity of Searching Succinctly Represented Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Learnability of Kolmogorov-easy circuit expressions via queries.

[BibT_eX]

[DOI]

Harry Buhrman

Montserrat Hermo

Proceedings of the Computational Learning Theory, Second European Conference, 1995

A Note on Genericity and Bi-Immunity.

[BibT_eX]

[DOI]

Elvira Mayordomo

Proceedings of the Tenth Annual Structure in Complexity Theory Conference, 1995

Simple PAC Learning of Simple Decision Lists.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 6th International Conference, 1995

1994

The Query Complexity of Learning DFA.

[BibT_eX]

[DOI]

New Gener. Comput., 1994

1993

Some Structural Complexity Aspects of Neural Computation.

[BibT_eX]

[DOI]

Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

Programacion metodica.

[BibT_eX]

McGraw-Hill, ISBN: 978-84-481-1957-7, 1993

1992

Logarithmic Advice Classes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

Deciding Bisimilarity is P-Complete.

[BibT_eX]

Miklos Santha

Formal Aspects Comput., 1992

Characterizations of Logarithmic Advice Complexity Classes.

[BibT_eX]

Montserrat Hermo

Elvira Mayordomo

Proceedings of the Algorithms, Software, Architecture, 1992

A Note on the Query Complexity of Learning DFA (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, Third Workshop, 1992

1991

Strong and Robustly Strong Polynomial-Time Reducibilities to Sparse Sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Optimal Distance Networks of Low Degree for Parallel Computers.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1991

Functional Oracle Queries as a Measure of Parallel Time.

[BibT_eX]

[DOI]

Carme Àlvarez

Birgit Jenner

Proceedings of the STACS 91, 1991

Parallel Complexity in the Design and Analysis on Conurrent Systems.

[BibT_eX]

[DOI]

Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991

Adaptive Logspace and Depth-Bounded Reducibilities.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991

1990

Structural Complexity II

[BibT_eX]

[DOI]

EATCS Monographs on Theoretical Computer Science 22, Springer, ISBN: 0387520791, 1990

Structural Complexity I

[BibT_eX]

[DOI]

EATCS Monographs on Theoretical Computer Science 11, Springer, ISBN: 978-3-642-97062-7, 1990

Self-Reducibility.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1990

Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1989

Deriving Specifications of Embeddings in Recursive Program Design.

[BibT_eX]

Celestí Rosselló

Ricardo Pena

Struct. Program., 1989

Nonuniform Complexity Classes Specified by Lower and Upper Bounds.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1989

The Complexity of Graph Problems fore Succinctly Represented Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

Nondeterministic Witnesses and Nonuniform Advice.

[BibT_eX]

[DOI]

Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

1988

Immunity and Simplicity in Relativizations of Probabilistic Complexity Classes.

[BibT_eX]

[DOI]

David A. Russo

RAIRO Theor. Informatics Appl., 1988

Logspace self-reducibility.

[BibT_eX]

[DOI]

Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988

Structural complexity, 1st Edition.

[BibT_eX]

[DOI]

EATCS monographs on theoretical computer science 11, Springer, ISBN: 0387186220, 1988

1987

On Characterizations of the Class PSPACE/POLY.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

Optimized Mesh-Connected Networks for SIMD and MIMD Architectures.

[BibT_eX]

[DOI]

Proceedings of the 14th Annual International Symposium on Computer Architecture. Pittsburgh, 1987

1986

Sparse Sets, Lowness and Highness.

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

The polynomial-time hierarchy and sparse oracles.

[BibT_eX]

[DOI]

J. ACM, 1986

On (Greek D)D_P²-Immunity.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1986

Some comments about notations of orders of manitude.

[BibT_eX]

Bull. EATCS, 1986

Sets with Small Generalized Kolmogorov Complexity.

[BibT_eX]

[DOI]

Acta Informatica, 1986

On Generalized Kolmogorov Complexity.

[BibT_eX]

[DOI]

Proceedings of the STACS 86, 1986

On Non- uniform Polynomial Space.

[BibT_eX]

[DOI]

Proceedings of the Structure in Complexity Theory, 1986

1985

On Bounded Query Machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

Simplicity, Relativizations and Nondeterminism.

[BibT_eX]

[DOI]

SIAM J. Comput., 1985

Bi-Immune Sets for Complexity Classes.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1985

Uniform Characterizations of Non-Uniform Complexity Measures

[BibT_eX]

[DOI]

Inf. Control., 1985

Examples of CFI-BI-immune and CF-levelable sets in logspace.

[BibT_eX]

Bull. EATCS, 1985

On some "non-uniform" complexity measures.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1985

1984

Some results about Logspace complexity measures.

[BibT_eX]

Bull. EATCS, 1984

Sparse Oracles, Lowness, and Highness.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

Separating, Strongly Separating, and Collapsing Relativized Complexity Classes.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

Sparse Oracles and Uniform Complexity Classes

[BibT_eX]

[DOI]

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1982

A Note on a Theorem by Ladner.

[BibT_eX]

[DOI]