José L. Balcázar

Tom Diethe, José L. Balcázar, John Shawe-Taylor, Cristina Tîrnauca: Preface. Journal of Machine Learning Research - Proceedings Track 17: 1-4 (2011)

Marta Arias, José L. Balcázar: Construction and learnability of canonical Horn formulas. Machine Learning 85(3): 273-297 (2011)

Marta E. Zorrilla, Diego García-Saiz, José L. Balcázar: Towards Parameter-free Data Mining: Mining Educational Data with Yacaree. EDM 2011: 363-364

José L. Balcázar: Parameter-free Association Rule Mining with Yacaree. EGC 2011: 251-254

José L. Balcázar, Cristina Tîrnauca: Closed-set-based Discovery of Representative Association Rules Revisited. EGC 2011: 635-646

José L. Balcázar, Cristina Tîrnauca: Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices. ICFCA 2011: 49-64

José L. Balcázar: Formal and Computational Properties of the Confidence Boost of Association Rules. CoRR abs/1103.4778 (2011)

José L. Balcázar: Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules. Logical Methods in Computer Science 6(2) (2010)

José L. Balcázar, Francesco Bonchi, Aristides Gionis, Michèle Sebag: Guest editors' introduction: special issue of selected papers from ECML PKDD 2010. Data Min. Knowl. Discov. 21(2): 221-223 (2010)

José L. Balcázar: Closure-Based Confidence Boost in Association Rules. Journal of Machine Learning Research - Proceedings Track 11: 74-80 (2010)

José L. Balcázar, Albert Bifet, Antoni Lozano: Mining frequent closed rooted trees. Machine Learning 78(1-2): 1-33 (2010)

José L. Balcázar, Francesco Bonchi, Aristides Gionis, Michèle Sebag: Special issue for ECML PKDD 2010: Guest editors' introduction. Machine Learning 81(1): 1-4 (2010)

José L. Balcázar: Objective Novelty of Association Rules : Measuring the Confidence Boost. EGC 2010: 297-302

José L. Balcázar, Cristina Tîrnauca, Marta E. Zorrilla: Filtering Association Rules with Negations on the Basis of Their Confidence Boost. KDIR 2010: 263-268

José L. Balcázar, Francesco Bonchi, Aristides Gionis, Michèle Sebag (Eds.): Machine Learning and Knowledge Discovery in Databases, European Conference, ECML PKDD 2010, Barcelona, Spain, September 20-24, 2010, Proceedings, Part I. Lecture Notes in Computer Science 6321, Springer 2010, isbn 978-3-642-15879-7

José L. Balcázar, Francesco Bonchi, Aristides Gionis, Michèle Sebag (Eds.): Machine Learning and Knowledge Discovery in Databases, European Conference, ECML PKDD 2010, Barcelona, Spain, September 20-24, 2010, Proceedings, Part II. Lecture Notes in Computer Science 6322, Springer 2010, isbn 978-3-642-15882-7

José L. Balcázar, Francesco Bonchi, Aristides Gionis, Michèle Sebag (Eds.): Machine Learning and Knowledge Discovery in Databases, European Conference, ECML PKDD 2010, Barcelona, Spain, September 20-24, 2010, Proceedings, Part III. Lecture Notes in Computer Science 6323, Springer 2010, isbn 978-3-642-15938-1

José L. Balcázar, Cristina Tîrnauca: Closed-set-based Discovery of Representative Association Rules Revisited. CoRR abs/1012.0735 (2010)

José L. Balcázar, Cristina Tîrnauca: Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices. CoRR abs/1012.0742 (2010)

Marta Arias, José L. Balcázar: Canonical Horn Representations and Query Learning. ALT 2009: 156-170

José L. Balcázar: Two Measures of Objective Novelty in Association Rule Mining. PAKDD Workshops 2009: 76-98

José L. Balcázar, Yang Dai, Junichi Tanaka, Osamu Watanabe: Provably Fast Training Algorithms for Support Vector Machines. Theory Comput. Syst. 42(4): 568-595 (2008)

Marta Arias, José L. Balcázar: Query Learning and Certificates in Lattices. ALT 2008: 303-315

José L. Balcázar: Deduction Schemes for Association Rules. Discovery Science 2008: 124-135

José L. Balcázar, Albert Bifet, Antoni Lozano: Mining Implications from Lattices of Closed Trees. EGC 2008: 373-384

José L. Balcázar: Minimum-Size Bases of Association Rules. ECML/PKDD (1) 2008: 86-101

José L. Balcázar, Jorge Castro, David Guijarro, Johannes Köbler, Wolfgang Lindner: A general dimension for query learning. J. Comput. Syst. Sci. 73(6): 924-940 (2007)

José L. Balcázar, Gemma C. Garriga: Horn axiomatizations for sequential data. Theor. Comput. Sci. 371(3): 247-264 (2007)

José L. Balcázar, Albert Bifet, Antoni Lozano: Subtree Testing and Closed Tree Mining Through Natural Representations. DEXA Workshops 2007: 499-503

José L. Balcázar, Albert Bifet, Antoni Lozano: Mining Frequent Closed Unordered Trees Through Natural Representations. ICCS 2007: 347-359

José L. Balcázar, Gemma C. Garriga: Characterizing Implications of Injective Partial Orders. ICCS 2007: 492-495

José L. Balcázar, Philip M. Long, Frank Stephan: Editors' Introduction. ALT 2006: 1-9

José L. Balcázar, Philip M. Long, Frank Stephan (Eds.): Algorithmic Learning Theory, 17th International Conference, ALT 2006, Barcelona, Spain, October 7-10, 2006, Proceedings. Lecture Notes in Computer Science 4264, Springer 2006, isbn 3-540-46649-5

José L. Balcázar, Gemma Casas-Garriga: On Horn Axiomatizations for Sequential Data. ICDT 2005: 215-229

Jaume Baixeries, José L. Balcázar: Characterization and Armstrong Relations for Degenerate Multivalued Dependencies Using Formal Concept Analysis. ICFCA 2005: 162-175

José L. Balcázar, Jaume Baixeries: Characterizations of Multivalued Dependencies and Related Expressions. Discovery Science 2004: 306-313

Gemma Casas-Garriga, José L. Balcázar: Coproduct Transformations on Lattices of Closed Partial Orders. ICGT 2004: 336-351

José L. Balcázar, Jorge Castro, David Guijarro: A New Abstract Combinatorial Dimension for Exact Learning via Queries. J. Comput. Syst. Sci. 64(1): 2-21 (2002)

José L. Balcázar, Jorge Castro, David Guijarro, Hans-Ulrich Simon: The consistency dimension and distribution-dependent learning from queries. Theor. Comput. Sci. 288(2): 197-215 (2002)

Jaume Baixeries, Gemma Casas-Garriga, José L. Balcázar: A Best-First Strategy for Finding Frequent Sets. EGC 2002: 101-106

José L. Balcázar, Yang Dai, Osamu Watanabe: A Random Sampling Technique for Training Support Vector Machines. ALT 2001: 119-134

José L. Balcázar, Jorge Castro, David Guijarro: A General Dimension for Exact Learning. COLT/EuroCOLT 2001: 354-367

Inmaculada Fortes Ruiz, José L. Balcázar, Rafael Morales Bueno: Bounding Negative Information in Frequent Sets Algorithms. Discovery Science 2001: 50-58

José L. Balcázar, Yang Dai, Osamu Watanabe: Provably Fast Training Algorithms for Support Vector Machines. ICDM 2001: 43-50

José L. Balcázar: Editor's Foreword. J. Comput. Syst. Sci. 60(2): 336 (2000)

José L. Balcázar, Jorge Castro, David Guijarro: Abstract Combinatorial Characterizations of Exact Learning via Queries. COLT 2000: 248-254

José L. Balcázar, Jorge Castro, David Guijarro, Hans-Ulrich Simon: The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract). ALT 1999: 77-92

José L. Balcázar: The Consistency Dimension, Compactness, and Query Learning. CSL 1999: 2-13

José L. Balcázar, Montserrat Hermo: The Structure of Logarithmic Advice Complexity Classes. Theor. Comput. Sci. 207(1): 217-244 (1998)

Eric Allender, José L. Balcázar, Neil Immerman: A First-Order Isomorphism Theorem. SIAM J. Comput. 26(2): 557-567 (1997)

José L. Balcázar, Ricard Gavaldà, Hava T. Siegelmann: Computational power of neural networks: a characterization in terms of Kolmogorov complexity. IEEE Transactions on Information Theory 43(4): 1175-1183 (1997)

José L. Balcázar, Josep Díaz, Ricard Gavaldà: Algorithms for Learning Finite Automata from Queries: A Unified View. Advances in Algorithms, Languages, and Complexity 1997: 53-72

José L. Balcázar, Ricard Gavaldà, Osamu Watanabe: Coding Complexity: The Computational Complexity of Succinct Descriptions. Advances in Algorithms, Languages, and Complexity 1997: 73-91

José L. Balcázar: The Complexity of Searching Implicit Graphs. Artif. Intell. 86(1): 171-188 (1996)

José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe: An Optimal Parallel Algorithm for Learning DFA. J. UCS 2(3): 97-112 (1996)

Carme Àlvarez, José L. Balcázar, Birgit Jenner: Adaptive Logspace Reducibility and Parallel Time. Mathematical Systems Theory 28(2): 117-140 (1995)

Jorge Castro, José L. Balcázar: Simple PAC Learning of Simple Decision Lists. ALT 1995: 239-248

José L. Balcázar, Elvira Mayordomo: A Note on Genericity and Bi-Immunity. Structure in Complexity Theory Conference 1995: 193-196

José L. Balcázar, Harry Buhrman, Montserrat Hermo: Learnability of Kolmogorov-easy circuit expressions via queries. EuroCOLT 1995: 112-124

José L. Balcázar: The Complexity of Searching Succinctly Represented Graphs. ICALP 1995: 208-219

José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe: The Query Complexity of Learning DFA. New Generation Comput. 12(4): 337-358 (1994)

José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe: An Optimal Parallel Algorithm for Learning DFA. COLT 1994: 208-217

José L. Balcázar: Programacion metodica. McGraw-Hill 1993, isbn 978-84-481-1957-7, pp. I-XVI, 1-416

José L. Balcázar, Ricard Gavaldà, Hava T. Siegelmann, Eduardo D. Sontag: Some Structural Complexity Aspects of Neural Computation. Structure in Complexity Theory Conference 1993: 253-265

Eric Allender, José L. Balcázar, Neil Immerman: A First-Order Isomorphism Theorem. STACS 1993: 163-174

José L. Balcázar, Joaquim Gabarró, Miklos Santha: Deciding Bisimilarity is P-Complete. Formal Asp. Comput. 4(6A): 638-648 (1992)

José L. Balcázar, Uwe Schöning: Logarithmic Advice Classes. Theor. Comput. Sci. 99(2): 279-290 (1992)

José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe: A Note on the Query Complexity of Learning DFA (Extended Abstract). ALT 1992: 53-62

José L. Balcázar, Montserrat Hermo, Elvira Mayordomo: Characterizations of Logarithmic Advice Complexity Classes. IFIP Congress (1) 1992: 315-321

Ramón Beivide, Enrique Herrada, José L. Balcázar, Agustin Arruabarrena: Optimal Distance Networks of Low Degree for Parallel Computers. IEEE Trans. Computers 40(10): 1109-1124 (1991)

Ricard Gavaldà, José L. Balcázar: Strong and Robustly Strong Polynomial-Time Reducibilities to Sparse Sets. Theor. Comput. Sci. 88(1): 1-14 (1991)

José L. Balcázar: Adaptive Logspace and Depth-Bounded Reducibilities. Structure in Complexity Theory Conference 1991: 240-254

Carme Àlvarez, José L. Balcázar, Joaquim Gabarró, Miklos Santha: Parallel Complexity in the Design and Analysis on Conurrent Systems. PARLE (1) 1991: 288-303

Carme Àlvarez, José L. Balcázar, Birgit Jenner: Functional Oracle Queries as a Measure of Parallel Time. STACS 1991: 422-433

José L. Balcázar: Self-Reducibility. J. Comput. Syst. Sci. 41(3): 367-388 (1990)

Ricard Gavaldà, Leen Torenvliet, Osamu Watanabe, José L. Balcázar: Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract). MFCS 1990: 269-276

José L. Balcázar, Joaquim Gabarró: Nonuniform Complexity Classes Specified by Lower and Upper Bounds. ITA 23(2): 177-194 (1989)

Celestí Rosselló, José L. Balcázar, Ricardo Pena: Deriving Specifications of Embeddings in Recursive Program Design. Structured Programming 10(3): 133-145 (1989)

José L. Balcázar: Nondeterministic Witnesses and Nonuniform Advice. Structure in Complexity Theory Conference 1989: 259-269

Antoni Lozano, José L. Balcázar: The Complexity of Graph Problems fore Succinctly Represented Graphs. WG 1989: 277-286

José L. Balcázar, David A. Russo: Immunity and Simplicity in Relativizations of Probabilistic Complexity Classes. ITA 22(2): 227-244 (1988)

José L. Balcázar: Logspace self-reducibility. Structure in Complexity Theory Conference 1988: 40-46

Ricard Gavaldà, José L. Balcázar: Strong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets. MFCS 1988: 300-308

José L. Balcázar, Josep Díaz, Joaquim Gabarró: On Characterizations of the Class PSPACE/POLY. Theor. Comput. Sci. 52: 251-267 (1987)

Ramón Beivide, Enrique Herrada, José L. Balcázar, Jesús Labarta: Optimized Mesh-Connected Networks for SIMD and MIMD Architectures. ISCA 1987: 163-170

José L. Balcázar: Self-Reducibility. STACS 1987: 136-147

José L. Balcázar, Ronald V. Book: Sets with Small Generalized Kolmogorov Complexity. Acta Inf. 23(6): 679-688 (1986)

José L. Balcázar, Joaquim Gabarró: Some comments about notations of orders of manitude. Bulletin of the EATCS 30: 34-42 (1986)

José L. Balcázar: On (Greek D)D_P²-Immunity. Inf. Process. Lett. 23(1): 25-28 (1986)

José L. Balcázar, Ronald V. Book, Uwe Schöning: The polynomial-time hierarchy and sparse oracles. J. ACM 33(3): 603-617 (1986)

José L. Balcázar, Ronald V. Book, Uwe Schöning: Sparse Sets, Lowness and Highness. SIAM J. Comput. 15(3): 739-747 (1986)

José L. Balcázar, Josep Díaz, Joaquim Gabarró: On Non- uniform Polynomial Space. Structure in Complexity Theory Conference 1986: 35-50

José L. Balcázar, Ronald V. Book: On Generalized Kolmogorov Complexity. STACS 1986: 334-340

José L. Balcázar, Josep Díaz, Joaquim Gabarró: Examples of CFI-BI-immune and CF-levelable sets in logspace. Bulletin of the EATCS 25: 11-13 (1985)

José L. Balcázar, Josep Díaz, Joaquim Gabarró: Uniform Characterizations of Non-Uniform Complexity Measures. Information and Control 67(1-3): 53-69 (1985)

José L. Balcázar, Uwe Schöning: Bi-Immune Sets for Complexity Classes. Mathematical Systems Theory 18(1): 1-10 (1985)

José L. Balcázar: Simplicity, Relativizations and Nondeterminism. SIAM J. Comput. 14(1): 148-157 (1985)

José L. Balcázar, Ronald V. Book, Uwe Schöning: On Bounded Query Machines. Theor. Comput. Sci. 40: 237-243 (1985)

José L. Balcázar, Josep Díaz, Joaquim Gabarró: On some "non-uniform" complexity measures. FCT 1985: 18-27

José L. Balcázar, Josep Díaz, Joaquim Gabarró: Some results about Logspace complexity measures. Bulletin of the EATCS 22: 8 (1984)

José L. Balcázar, Ronald V. Book, Timothy J. Long, Uwe Schöning, Alan L. Selman: Sparse Oracles and Uniform Complexity Classes. FOCS 1984: 308-311

José L. Balcázar: Separating, Strongly Separating, and Collapsing Relativized Complexity Classes. MFCS 1984: 1-16

José L. Balcázar, Ronald V. Book, Uwe Schöning: Sparse Oracles, Lowness, and Highness. MFCS 1984: 185-193

José L. Balcázar, Josep Díaz: A Note on a Theorem by Ladner. Inf. Process. Lett. 15(2): 84-86 (1982)