José L. Balcázar
According to our database1,
José L. Balcázar
authored at least 117 papers
between 1982 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:
-
at orcid.org
On csauthors.net:
Bibliography
2019
Relative Entailment Among Probabilistic Implications.
Logical Methods in Computer Science, 2019
2018
Global optimality in k-means clustering.
Inf. Sci., 2018
Decomposition of quantitative Gaifman graphs as a data analysis tool.
CoRR, 2018
Decomposition of Quantitative Gaifman Graphs as a Data Analysis Tool.
Proceedings of the Advances in Intelligent Data Analysis XVII, 2018
2017
Learning definite Horn formulas from closure queries.
Theor. Comput. Sci., 2017
2015
Quantitative Redundancy in Partial Implications.
CoRR, 2015
Entailment among probabilistic implications.
CoRR, 2015
Learning Propositional Horn Formulas from Closure Queries.
CoRR, 2015
Entailment among Probabilistic Implications.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015
Quantitative Redundancy in Partial Implications.
Proceedings of the Formal Concept Analysis - 13th International Conference, 2015
2013
Formal and computational properties of the confidence boost of association rules.
TKDD, 2013
Evaluation of Association Rule Quality Measures through Feature Extraction.
Proceedings of the Advances in Intelligent Data Analysis XII, 2013
2011
Construction and learnability of canonical Horn formulas.
Machine Learning, 2011
Preface.
Proceedings of the Second Workshop on Applications of Pattern Analysis, 2011
Formal and Computational Properties of the Confidence Boost of Association Rules
CoRR, 2011
Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices.
Proceedings of the Formal Concept Analysis - 9th International Conference, 2011
Closed-set-based Discovery of Representative Association Rules Revisited.
Proceedings of the Extraction et gestion des connaissances (EGC'2011), 2011
Parameter-free Association Rule Mining with Yacaree.
Proceedings of the Extraction et gestion des connaissances (EGC'2011), 2011
Towards Parameter-free Data Mining: Mining Educational Data with Yacaree.
Proceedings of the 4th International Conference on Educational Data Mining, 2011
2010
Mining frequent closed rooted trees.
Machine Learning, 2010
Special issue for ECML PKDD 2010: Guest editors' introduction.
Machine Learning, 2010
Closure-Based Confidence Boost in Association Rules.
Proceedings of the First Workshop on Applications of Pattern Analysis, 2010
Guest editors' introduction: special issue of selected papers from ECML PKDD 2010.
Data Min. Knowl. Discov., 2010
Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices
CoRR, 2010
Closed-set-based Discovery of Representative Association Rules Revisited
CoRR, 2010
Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules
Logical Methods in Computer Science, 2010
Filtering Association Rules with Negations on the Basis of Their Confidence Boost.
Proceedings of the KDIR 2010, 2010
Objective Novelty of Association Rules : Measuring the Confidence Boost.
Proceedings of the Extraction et gestion des connaissances (EGC'2010), 2010
2009
Two Measures of Objective Novelty in Association Rule Mining.
Proceedings of the New Frontiers in Applied Data Mining, 2009
Canonical Horn Representations and Query Learning.
Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009
2008
Provably Fast Training Algorithms for Support Vector Machines.
Theory Comput. Syst., 2008
Minimum-Size Bases of Association Rules.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2008
Mining Implications from Lattices of Closed Trees.
Proceedings of the Extraction et gestion des connaissances (EGC'2008), 2008
Deduction Schemes for Association Rules.
Proceedings of the Discovery Science, 11th International Conference, 2008
Query Learning and Certificates in Lattices.
Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008
2007
Horn axiomatizations for sequential data.
Theor. Comput. Sci., 2007
A general dimension for query learning.
J. Comput. Syst. Sci., 2007
Characterizing Implications of Injective Partial Orders.
Proceedings of the Conceptual Structures: Knowledge Architectures for Smart Applications, 2007
Mining Frequent Closed Unordered Trees Through Natural Representations.
Proceedings of the Conceptual Structures: Knowledge Architectures for Smart Applications, 2007
Subtree Testing and Closed Tree Mining Through Natural Representations.
Proceedings of the 18th International Workshop on Database and Expert Systems Applications (DEXA 2007), 2007
2006
Editors' Introduction.
Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006
2005
Characterization and Armstrong Relations for Degenerate Multivalued Dependencies Using Formal Concept Analysis.
Proceedings of the Formal Concept Analysis, Third International Conference, 2005
On Horn Axiomatizations for Sequential Data.
Proceedings of the Database Theory, 2005
2004
Coproduct Transformations on Lattices of Closed Partial Orders.
Proceedings of the Graph Transformations, Second International Conference, 2004
Characterizations of Multivalued Dependencies and Related Expressions.
Proceedings of the Discovery Science, 7th International Conference, 2004
2002
The consistency dimension and distribution-dependent learning from queries.
Theor. Comput. Sci., 2002
A New Abstract Combinatorial Dimension for Exact Learning via Queries.
J. Comput. Syst. Sci., 2002
A Best-First Strategy for Finding Frequent Sets.
Proceedings of the Extraction et gestion des connaissances (EGC'2002), 2002
2001
Provably Fast Training Algorithms for Support Vector Machines.
Proceedings of the 2001 IEEE International Conference on Data Mining, 29 November, 2001
Bounding Negative Information in Frequent Sets Algorithms.
Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001
A General Dimension for Exact Learning.
Proceedings of the Computational Learning Theory, 2001
A Random Sampling Technique for Training Support Vector Machines.
Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001
2000
Editor's Foreword.
J. Comput. Syst. Sci., 2000
Abstract Combinatorial Characterizations of Exact Learning via Queries.
Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000
1999
The Consistency Dimension, Compactness, and Query Learning.
Proceedings of the Computer Science Logic, 13th International Workshop, 1999
The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract).
Proceedings of the Algorithmic Learning Theory, 10th International Conference, 1999
1998
The Structure of Logarithmic Advice Complexity Classes.
Theor. Comput. Sci., 1998
1997
Computational power of neural networks: a characterization in terms of Kolmogorov complexity.
IEEE Trans. Information Theory, 1997
A First-Order Isomorphism Theorem.
SIAM J. Comput., 1997
Coding Complexity: The Computational Complexity of Succinct Descriptions.
Proceedings of the Advances in Algorithms, Languages, and Complexity, 1997
Algorithms for Learning Finite Automata from Queries: A Unified View.
Proceedings of the Advances in Algorithms, Languages, and Complexity, 1997
1996
An Optimal Parallel Algorithm for Learning DFA.
J. UCS, 1996
The Complexity of Searching Implicit Graphs.
ICGA Journal, 1996
The Complexity of Searching Implicit Graphs.
Artif. Intell., 1996
1995
Structural Complexity I, Second Edition
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 354058384X, 1995
Adaptive Logspace Reducibility and Parallel Time.
Mathematical Systems Theory, 1995
The Complexity of Searching Succinctly Represented Graphs.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995
Learnability of Kolmogorov-easy circuit expressions via queries.
Proceedings of the Computational Learning Theory, Second European Conference, 1995
A Note on Genericity and Bi-Immunity.
Proceedings of the Tenth Annual Structure in Complexity Theory Conference, 1995
Simple PAC Learning of Simple Decision Lists.
Proceedings of the Algorithmic Learning Theory, 6th International Conference, 1995
1994
The Query Complexity of Learning DFA.
New Generation Comput., 1994
An Optimal Parallel Algorithm for Learning DFA.
Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994
1993
A First-Order Isomorphism Theorem.
Proceedings of the STACS 93, 1993
Some Structural Complexity Aspects of Neural Computation.
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993
Programacion metodica.
McGraw-Hill, ISBN: 978-84-481-1957-7, 1993
1992
Logarithmic Advice Classes.
Theor. Comput. Sci., 1992
Deciding Bisimilarity is P-Complete.
Formal Asp. Comput., 1992
Characterizations of Logarithmic Advice Complexity Classes.
Proceedings of the Algorithms, Software, Architecture, 1992
A Note on the Query Complexity of Learning DFA (Extended Abstract).
Proceedings of the Algorithmic Learning Theory, Third Workshop, 1992
1991
Strong and Robustly Strong Polynomial-Time Reducibilities to Sparse Sets.
Theor. Comput. Sci., 1991
Optimal Distance Networks of Low Degree for Parallel Computers.
IEEE Trans. Computers, 1991
Functional Oracle Queries as a Measure of Parallel Time.
Proceedings of the STACS 91, 1991
Parallel Complexity in the Design and Analysis on Conurrent Systems.
Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991
Adaptive Logspace and Depth-Bounded Reducibilities.
Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991
1990
Structural Complexity II
EATCS Monographs on Theoretical Computer Science 22, Springer, ISBN: 0387520791, 1990
Structural Complexity I
EATCS Monographs on Theoretical Computer Science 11, Springer, ISBN: 978-3-642-97062-7, 1990
Self-Reducibility.
J. Comput. Syst. Sci., 1990
Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990
1989
Deriving Specifications of Embeddings in Recursive Program Design.
Structured Programming, 1989
Nonuniform Complexity Classes Specified by Lower and Upper Bounds.
ITA, 1989
The Complexity of Graph Problems fore Succinctly Represented Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989
Nondeterministic Witnesses and Nonuniform Advice.
Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989
1988
Immunity and Simplicity in Relativizations of Probabilistic Complexity Classes.
ITA, 1988
Strong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988
Logspace self-reducibility.
Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988
Structural complexity, 1st Edition.
EATCS monographs on theoretical computer science 11, Springer, ISBN: 0387186220, 1988
1987
On Characterizations of the Class PSPACE/POLY.
Theor. Comput. Sci., 1987
Self-Reducibility.
Proceedings of the STACS 87, 1987
Optimized Mesh-Connected Networks for SIMD and MIMD Architectures.
Proceedings of the 14th Annual International Symposium on Computer Architecture. Pittsburgh, 1987
1986
Sparse Sets, Lowness and Highness.
SIAM J. Comput., 1986
The polynomial-time hierarchy and sparse oracles.
J. ACM, 1986
On (Greek D)D_P²-Immunity.
Inf. Process. Lett., 1986
Some comments about notations of orders of manitude.
Bulletin of the EATCS, 1986
Sets with Small Generalized Kolmogorov Complexity.
Acta Inf., 1986
On Generalized Kolmogorov Complexity.
Proceedings of the STACS 86, 1986
On Non- uniform Polynomial Space.
Proceedings of the Structure in Complexity Theory, 1986
1985
On Bounded Query Machines.
Theor. Comput. Sci., 1985
Simplicity, Relativizations and Nondeterminism.
SIAM J. Comput., 1985
Bi-Immune Sets for Complexity Classes.
Mathematical Systems Theory, 1985
Uniform Characterizations of Non-Uniform Complexity Measures
Information and Control, 1985
Examples of CFI-BI-immune and CF-levelable sets in logspace.
Bulletin of the EATCS, 1985
On some "non-uniform" complexity measures.
Proceedings of the Fundamentals of Computation Theory, 1985
1984
Some results about Logspace complexity measures.
Bulletin of the EATCS, 1984
Sparse Oracles, Lowness, and Highness.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984
Separating, Strongly Separating, and Collapsing Relativized Complexity Classes.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984
Sparse Oracles and Uniform Complexity Classes
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984
1982
A Note on a Theorem by Ladner.
Inf. Process. Lett., 1982