Graphic summary
  • Show / hide key
  • Information


Scientific and technological production
  •  

1 to 50 of 191 results
  • Formal and computational properties of the confidence boost of association rules

     Balcazar Navarro, Jose Luis
    ACM transactions on knowledge discovery from data
    Vol. 7, num. 4, p. 19-1-19-41
    DOI: 10.1145/2541268.2541272
    Date of publication: 2013-11
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Some existing notions of redundancy among association rules allow for a logical-style characterization and lead to irredundant bases of absolutely minimum size. We push the intuition of redundancy further to find an intuitive notion of novelty of an association rule, with respect to other rules. Namely, an irredundant rule is so because its confidence is higher than what the rest of the rules would suggest; then, one can ask: how much higher? We propose to measure such a sort of novelty through the confidence boost of a rule. Acting as a complement to confidence and support, the confidence boost helps to obtain small and crisp sets of mined association rules and solves the well-known problem that, in certain cases, rules of negative correlation may pass the confidence bound. We analyze the properties of two versions of the notion of confidence boost, one of them a natural generalization of the other. We develop algorithms to filter rules according to their confidence boost, compare the concept to some similar notions in the literature, and describe the results of some experimentation employing the new notions on standard benchmark datasets. We describe an open source association mining tool that embodies one of our variants of confidence boost in such a way that the data mining process does not require the user to select any value for any parameter.

  • Evaluation of association rule quality measures through feature extraction

     Balcazar Navarro, Jose Luis; Dogbey, Francis
    International Symposium on Intelligent Data Analysis
    p. 68-79
    DOI: 10.1007/978-3-642-41398-8_7
    Presentation's date: 2013-10
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    The practical success of association rule mining depends heavily on the criterion to choose among the many rules often mined. Many rule quality measures exist in the literature. We propose a protocol to evaluate the evaluation measures themselves. For each association rule, we measure the improvement in accuracy that a commonly used predictor can obtain from an additional feature, constructed according to the exceptions to the rule. We select a reference set of rules that are helpful in this sense. Then, our evaluation method takes into account both how many of these helpful rules are found near the top rules for a given quality measure, and how near the top they are. We focus on seven association rule quality measures. Our experiments indicate that multiplicative improvement and (to a lesser extent) support and leverage (a.k.a. weighted relative accuracy) tend to obtain better results than the other measures.

  • Access to the full text
    Iterator-based algorithms in self-tuning discovery of partial implications  Open access

     Balcazar Navarro, Jose Luis; García Sáiz, Diego; de la Dehesa, Javier
    International Conference on Formal Concept Analysis
    p. 14-28
    Presentation's date: 2012-05-07
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    We describe the internal algorithmics of our recent implementation of a closure-based self-tuning associator: yacaree. This system is designed so as not to request the user to specify any threshold. In order to avoid the need of a support threshold, we introduce an algorithm that constructs closed sets in order of decreasing support; we are not aware of any similar previous algorithm. In order not to overwhelm the user with large quantities of partial implications, our system filters the output according to a recently studied lattice-closure-based notion of con fidence boost, and self-adjusts the threshold for that rule quality measure as well. As a consequence, the necessary algorithmics interact in complicated ways. In order to control this interaction, we have resorted to a well-known, powerful conceptual tool, called Iterators: this notion allows us to distribute control among the various algorithms at play in a relatively simple manner, leading to a fully operative, open-source, effi cient system for discovery of partial implications in relational data.

  • Access to the full text
    Closures and partial implications in educational data mining  Open access

     García Sáiz, Diego; Zorrilla Pantaleón, Marta Elena; Balcazar Navarro, Jose Luis
    International Conference on Formal Concept Analysis
    p. 98-113
    Presentation's date: 2012-05-07
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Educational Data Mining (EDM) is a growing field of use of data analysis techniques. Speci fically, we consider partial implications. The main problems are, fi rst, that a support threshold is absolutely necessary but setting it "right" is extremely di fficult; and, second, that, very often, large amounts of partial implications are found, beyond what an EDM user would be able to manually inspect. Our program yacaree, recently developed, is an associator that tackles both problems. In an EDM context, our program has demonstrated to be competitive with respect to the amount of partial implications output. But "fi nding few rules" is not the same as "fi nding the right rules". We extend the evaluation with a deeper quantitative analysis and a subjective evaluation on EDM datasets, eliciting the opinion of the instructors of the courses under analysis to assess the pertinence of the rules found by diff erent association miners.

  • Construction and learnability of canonical Horn formulas

     Arias Vicente, Marta; Balcazar Navarro, Jose Luis
    Machine learning
    Vol. 85, num. 3, p. 273-297
    DOI: 10.1007/s10994-011-5248-5
    Date of publication: 2011-12
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Parameter-free association rule mining with Yacaree

     Balcazar Navarro, Jose Luis
    Conférence Internationale Francophone sur l'Extraction et la Gestion des Connaissances
    p. 251-254
    Presentation's date: 2011-01-26
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Towards parameter-free data mining: mining educational data with Yacaree

     Zorrilla Pantaleón, Marta Elena; García Sáiz, Diego; Balcazar Navarro, Jose Luis
    International Conference on Educational Data Mining
    p. 363-364
    Presentation's date: 2011-07-07
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Access to the full text
    Closed-set-based discovery of representative association rules revisited  Open access

     Balcazar Navarro, Jose Luis; Tirnauca, Cristina
    Conférence Internationale Francophone sur l'Extraction et la Gestion des Connaissances
    p. 635-646
    Presentation's date: 2011-01-28
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    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. We revisit the algorithm given by Kryszkiewicz (Int. Symp. Intelligent Data Analysis 2001, Springer-Verlag LNCS 2189, 350–359) for mining representative rules. We show that its output is sometimes incomplete, due to an oversight in its mathematical validation, and we propose an alternative complete generator that works within only slightly larger running times.

    Postprint (author’s final draft)

  • Border algorithms for computing Hasse diagrams of arbitrary lattices

     Balcazar Navarro, Jose Luis; Tirnauca, Cristina
    International Conference on Formal Concept Analysis
    p. 49-64
    DOI: 10.1007/978-3-642-20514-9_6
    Presentation's date: 2011-05-04
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Lattices are mathematical structures with many applications in computer science; among these, we are interested in fields like data mining, machine learning, or knowledge discovery in databases. One well-established use of lattice theory is in formal concept analysis (FCA), where the concept lattice with its diagram graph allows the visualization and summarization of data in a more concise representation. In the Data Mining community, the same mathematical notions (often under additional “frequency” constraints that bound from below the size of the support set) are studied under the banner of Closed-Set Mining. In these applications, each dataset consists of transactions, also called objects, each of which, besides having received a unique identifier, consists of a set of items or attributes taken from a previously agreed finite set. A concept is a pair formed by a set of transactions —the extent set or support set of the concept— and a set of attributes —the intent set of the concept— defined as the set of all those attributes that are shared by all the transactions present in the extent. Some data analysis processes are based on the family of all intents (the “closures” stemming from the dataset); but others require to determine also their order relation, which is a finite lattice, in the form of a line graph (the Hasse diagram).

  • Redundancy, deduction schemes, and minimum-size bases for association rules

     Balcazar Navarro, Jose Luis
    Logical methods in computer science
    Vol. 6, num. 2:3
    DOI: 10.2168/LMCS-6(2:4)2010
    Date of publication: 2010-06-27
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

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

     Balcazar Navarro, Jose Luis; Bonchi, Francesco; Gionis, Aristides; Sebag, Michéle
    Data mining and knowledge discovery
    Vol. 21, num. 2, p. 221-223
    DOI: 10.1007/s10618-010-0192-8
    Date of publication: 2010-09-20
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Special issue for ECML PKDD 2010: guest editors' introduction

     Balcazar Navarro, Jose Luis; Bonchi, Francesco; Gionis, Aristides; Sebag, Michéle
    Machine learning
    Vol. 81, num. 1, p. 1-4
    DOI: 10.1007/s10994-010-5200-0
    Date of publication: 2010-09-20
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Access to the full text
    Mining frequent closed rooted trees  Open access

     Balcazar Navarro, Jose Luis; Bifet Figuerol, Albert Carles; Lozano Bojados, Antoni
    Machine learning
    Vol. 78, num. 1-2, p. 1-33
    DOI: 10.1007/s10994-009-5123-9
    Date of publication: 2010-01
    Journal article

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There exists a well-studied process of closure-based data mining in the itemset framework: we consider the extension of this process into trees. We focus mostly on the case where labels on the nodes are nonexistent or unreliable, and discuss algorithms for closurebased mining that only rely on the root of the tree and the link structure. We provide a notion of intersection that leads to a deeper understanding of the notion of support-based closure, in terms of an actual closure operator. We describe combinatorial characterizations and some properties of ordered trees, discuss their applicability to unordered trees, and rely on them to design efficient algorithms for mining frequent closed subtrees both in the ordered and the unordered settings. Empirical validations and comparisons with alternative algorithms are provided.

    Postprint (author’s final draft)

  • European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases 2010

     Arias Vicente, Marta; Berral Garcia, Josep Lluis; Quattoni, Ariadna Julieta; De Balle Pigem, Borja; Casas Fernandez, Bernardino; Bifet Figuerol, Albert Carles; Balcazar Navarro, Jose Luis; Gavaldà Mestre, Ricard
    Competitive project

     Share

  • Organización de los congresos ECML/PKDD'10

     Bifet Figuerol, Albert Carles; Quattoni, Ariadna Julieta; De Balle Pigem, Borja; Berral Garcia, Josep Lluis; Casas Fernandez, Bernardino; Balcazar Navarro, Jose Luis; Gavaldà Mestre, Ricard; Carreras Perez, Xavier; Arias Vicente, Marta
    Competitive project

     Share

  • Mining educational data for patterns with negations and high confidence boost

     Balcazar Navarro, Jose Luis; Tirnauca, Cristina; Zorrilla Pantaleón, Marta Elena
    Simposio de Teoría y Aplicaciones de Minería de Datos
    p. 329-338
    Presentation's date: 2010-09-08
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Objective novelty of association rules: measuring the confidence boost

     Balcazar Navarro, Jose Luis
    Conférence Internationale Francophone sur l'Extraction et la Gestion des Connaissances
    p. 297-302
    Presentation's date: 2010-01-28
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Closure-based confidence boost in association rules

     Balcazar Navarro, Jose Luis
    Workshop on Applications of Pattern Analysis
    p. 74-80
    Presentation's date: 2010-09-01
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Filtering association rules with negations on the basis of their confidence boost

     Balcazar Navarro, Jose Luis; Tirnauca, Cristina; Zorrilla Pantaleón, Marta Elena
    International Conference on Knowledge Discovery and Information Retrieval
    p. 263-268
    Presentation's date: 2010-10-27
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Canonical horn representations and query learning

     Arias Vicente, Marta; Balcazar Navarro, Jose Luis
    Lecture notes in computer science
    Vol. 5809, p. 156-170
    DOI: 10.1007/978-3-642-04414-4_16
    Date of publication: 2009
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • LARCA

     Sierra Santibañez, Maria Josefina; Delgado Pin, Jordi; Castro Rabal, Jorge; Baixeries i Juvillà, Jaume; Morrill, Glyn Verden; Balcazar Navarro, Jose Luis; Bifet Figuerol, Albert Carles; Lopez Herrera, Josefina; Arias Vicente, Marta; Berral Garcia, Josep Lluis; Quattoni, Ariadna Julieta; Arratia Quesada, Argimiro Alejandro; De Balle Pigem, Borja; Gavaldà Mestre, Ricard
    Competitive project

     Share

  • Access to the full text
    Competencias profesionales para el Grado en Ingeniería Informática  Open access

     Sanchez Carracedo, Fermin; Sancho Samsó, Maria Ribera; Botella Lopez, Pere; Garcia Almiñana, Jordi; Aluja Banet, Tomas; Navarro Guerrero, Juan Jose; Balcazar Navarro, Jose Luis
    Date of publication: 2009
    Book chapter

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Degrees in the EHEA (European Higher Education Area) must be designed based on professional skills, so that when the students finish their studies they become competent professionals in the labour market. In this paper we propose a weighted list of skills for a undergraduate degree in Informatics Engineering, classified into two groups: technical and generic. Technical skills are divided into five different itineraries:computer engineering, computer science, information systems, information technologies and software engineering. Los planes de Estudios del EEES (Espacio Europeo de Educación Superior) deben ser diseñados a partir de competencias profesionales, de forma que al final de sus estudios el egresado se convierta en un profesional competente en el mercado laboral. En este artículo se propone una lista de competencias ponderada para un título de Grado en Ingeniería Informática clasificadas en dos grupos: transversales y técnicas. Dentro de las técnicas se definen cinco itinerarios distintos: computación, ingeniería de computadores, ingeniería del software, sistemas de información y tecnologías de la Información.

  • Adaptive Learning and Mining for Data Streams and Frequent Patterns.

     Bifet Figuerol, Albert Carles
    Department of Computer Science, Universitat Politècnica de Catalunya
    Theses

     Share Reference managers Reference managers Open in new window

  • Access to the full text
    Two measures of objective novelty in association rule mining  Open access

     Balcazar Navarro, Jose Luis
    Pacific-Asia Conference on Knowledge Discovery and Data Mining
    p. 76-98
    DOI: 10.1007/978-3-642-14640-4_6
    Presentation's date: 2009-04-27
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Association rule mining is well-known to depend heavily on a support threshold parameter, and on one or more thresholds for intensity of implication; among these measures, confidence is most often used and, sometimes, related alternatives such as lift, leverage, improvement, or all-confidence are employed, either separately or jointly with confidence. We remain within the support-and-confidence framework in an attempt at studying complementary notions, which have the goal of measuring relative forms of objective novelty or surprisingness of each individual rule with respect to other rules that hold in the same dataset. We measure novelty through the extent to which the confidence value is robust, taken relative to the confidences of related (for instance, logically stronger) rules, as opposed to the absolute consideration of the single rule at hand. We consider two variants of this idea and analyze their logical and algorithmic properties. Since this approach has the drawback of requiring further parameters, we also propose a framework in which the user sets a single parameter, of quite clear intuitive semantics, from which the corresponding thresholds for confidence and novelty are computed.

    Postprint (author’s final draft)

  • Provably fast training algorithms for support vector machines

     Balcazar Navarro, Jose Luis; Dai, Y; Tanaka, J; Watanabe, O
    Theory of computing systems
    Vol. 42, num. 4, p. 568-595
    DOI: 10.1007/s00224-007-9094-6
    Date of publication: 2008-05
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Deduction schemes for association rules

     Balcazar Navarro, Jose Luis
    Lecture notes in computer science
    Vol. 5255, p. 124-135
    DOI: 10.1007/978-3-540-88411-8_14
    Date of publication: 2008-10
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Minimum-Size Bases of Association Rules

     Balcazar Navarro, Jose Luis
    Lecture notes in computer science
    Vol. 5211, p. 86-101
    DOI: 10.1007/978-3-540-87479-9_24
    Date of publication: 2008-09
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Competencias profesionales del Grado en Ingeniería Informática

     Sanchez Carracedo, Fermin; Sancho Samsó, Maria Ribera; Botella Lopez, Pere; Balcazar Navarro, Jose Luis; Garcia Almiñana, Jordi; Navarro Guerrero, Juan Jose; Aluja Banet, Tomas
    Jornadas de Enseñanza Universitaria de la Informática
    p. 123-130
    Presentation's date: 2008-07-09
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Query Learning and Certificates in Lattices

     Arias Vicente, Marta; Balcazar Navarro, Jose Luis
    19th International Conference on Algorithmic Learning Theory
    p. 303-315
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Mining Implications from Lattices of Closed Trees

     Balcazar Navarro, Jose Luis; Bifet Figuerol, Albert Carles; Lozano Bojados, Antoni
    Extraction et gestion des connaissances
    p. 373-384
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • A General Dimension for Query Learning

     Balcazar Navarro, Jose Luis; Castro Rabal, Jorge; Guijarro, David; Johannes, Köbler; Wolfgang, Lindner
    Journal of computer and system sciences
    Vol. 73, num. 6, p. 924-940
    Date of publication: 2007-09
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Horn axiomatizations for sequential data

     Balcazar Navarro, Jose Luis; Garriga, Gc
    Theoretical computer science
    Vol. 371, num. 3, p. 247-264
    Date of publication: 2007-03
    Journal article

     Share Reference managers Reference managers Open in new window

  • A general dimension for query learning

     Balcazar Navarro, Jose Luis; Castro Rabal, Jorge; Guijarro, D; Kobler, J; Lindner, W
    Journal of computer and system sciences
    Vol. 73, num. 6, p. 924-940
    Date of publication: 2007-09
    Journal article

     Share Reference managers Reference managers Open in new window

  • Subtree Testing and Closed Tree Mining Through Natural Representation

     Balcazar Navarro, Jose Luis; Bifet Figuerol, Albert Carles; Lozano Bojados, Antoni
    18th International Workshop on Database and Expert Systems Applications
    p. 499-503
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Subtree Testing and Closed Tree Mining Through Natural Representation

     Balcazar Navarro, Jose Luis
    18th International Workshop on Database and Expert Systems Applications
    Presentation's date: 2007-09-07
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Mining Frequent Closed Unordered Trees Through Natural Representations

     Balcazar Navarro, Jose Luis; Bifet Figuerol, Albert Carles; Lozano Bojados, Antoni
    International Conference on Conceptual Structures
    p. 347-359
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Lattice Characterization of Armstrong and Symmetric Dependencies  awarded activity

     Baixeries i Juvillà, Jaume
    Department of Computer Science, Universitat Politècnica de Catalunya
    Theses

     Share Reference managers Reference managers Open in new window

  • FORMAL METHODS FOR MINING STRUCTURED OBJECTS

     Casas Garriga, Gemma
    Department of Computer Science, Universitat Politècnica de Catalunya
    Theses

     Share Reference managers Reference managers Open in new window

  • Unified characterization of symmetric dependencies with lattices

     Baixeries i Juvillà, Jaume; Balcazar Navarro, Jose Luis
    International Conference on Formal Concept Analysis
    p. 57-72
    Presentation's date: 2006-02-14
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Symmetric dependencies, or MultiValued Dependencies-like, are those dependencies that follow the deduction rules of MultiValued Dependencies (MVD’s). These are MVD-clauses, Degenerate MultiValued Dependencies (DMVD’s), and MVD’s, being the latter ones relevant to the 4th normal form in the relational database model. Previous results have explained how to characterize these dependencies with lattices. However, these characterizations were ad-hoc, and no unified characterization has been provided yet. The purpose of this paper is to present such a common characterization for all these kind of dependencies providing the same framework for all of them, and to extend this generalization to the construction of Armstrong relations.

  • ANALISI TRANSDUCTIU EN MÈTODES BASATS EN GRAFS (TIN2004-07925-C03-02)

     Balcazar Navarro, Jose Luis
    Competitive project

     Share

  • On Horn Axiomatizations for Sequential Data

     Balcazar Navarro, Jose Luis; Casas Garriga, Gemma
    International Conference on Database Theroy
    p. 215-229
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • A lattice-based method for structural analysis

     Casas Garriga, Gemma; Balcazar Navarro, Jose Luis
    Date: 2005-09
    Report

     Share Reference managers Reference managers Open in new window

  • Horn Axiomatizations for Sequential Data

     Balcazar Navarro, Jose Luis; Casas Garriga, Gemma
    Date: 2005-09
    Report

     Share Reference managers Reference managers Open in new window

  • A Lattice Representation of Relations, Multivalued Dependencies and Armstrong Relations

     Baixeries i Juvillà, Jaume; Balcazar Navarro, Jose Luis
    International Conference on Conceptual Structures
    p. 13-26
    Presentation's date: 2005-07
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    We present a lattice-base formalism to relate, in a novel way, different representation methods for relational data. Specifically, relations given extensionally by tuples, multivalued dependencies, and Armstrong relations for multivalued dependencies. The semantics of this formalism is based on a closure operator used to calculated the lattice. We prove that this representation yields the set of multivalued dependencies that hold in a set of tuples as well as Armstrong relation.

  • Access to the full text
    New Closure Operators and Lattice Representations for Multivalued Dependencies and Related Expressions  Open access

     Baixeries i Juvillà, Jaume; Balcazar Navarro, Jose Luis
    Concept Lattices and Their Applications
    p. 22-33
    Presentation's date: 2005-09
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    In Database Theory, Multivalued Dependencies are the main tool to define the Fourth Normal Form and, as such, their inference problem has been deeply studied; two related notions appearing in that study are a syntactical analog in propositional logic and a restriction that maintains to this logic the same relationship as Functional Dependencies do to Horn logic. We present semantic, lattice-theoretic characterizations of such multivalued dependencies that hold in a given relation, as well as similar results for the related notions just mentioned. Our characterizations explain better some previously known facts by providing a unifying framework that is also consistent with the studies of Functional Dependencies.

  • Characterization and Armstrong relations for Degenerated Multivalued Dependencies using Formal Concept Analysis

     Baixeries i Juvillà, Jaume; Balcazar Navarro, Jose Luis
    International Conference on Formal Concept Analysis
    p. 162-175
    Presentation's date: 2005-02-15
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Functional dependencies, a notion originated in Relational Database Theory, are known to admit interesting characterizations in terms of Formal Concept Analysis. In database terms, two successive, natural extensions of the notion of functional dependency are the socalled degenerate multivalued dependencies, and multivalued dependencies proper. We propose here a new Galois connection, based on any given relation, which gives rise to a formal concept lattice corresponding precisely to the degenerate multivalued dependencies that hold in the relation given. The general form of the construction departs significantly from the most usual way of handling functional dependencies. Then, we extend our approach so as to extract Armstrong relations for the degenerate multivalued dependencies from the concept lattice obtained; the proof of the correctness of this construction is nontrivial.

  • TIN2004-07925-C03-02 ANALISIS TRANSDUCTIVO EN METODOS BASADOS EN GRAFOS

     Balcazar Navarro, Jose Luis
    Competitive project

     Share

  • Galois connections for mining structured objects

     Casas Garriga, Gemma; Balcazar Navarro, Jose Luis
    International Conference on Learning 2004
    p. 1-10
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window