Computing minimal generators from implications: A logic-guided approach

CEUR Workshop Proceedings

Volumn 972, Issue , 2012, Pages 187-198

  Cordero, P ^a   Enciso, M ^a   Mora, A ^a   Ojeda Aciego, M ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION ANALYSIS; REDUNDANCY;

ATTRIBUTE IMPLICATIONS; DETERMINISTIC APPROACH; MINIMAL GENERATORS; SIMPLIFICATION RULES;

COMPUTATION THEORY;

EID: 84902267578     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. R. Belohlavek and V. Vychodil, Formal Concept Analysis with Constraints by Closure Operators, LNCS, 4068: 131-143, 2006.
2. R. Belohlavek and V. Vychodil, Formal Concept Analysis with Background Knowledge: Attribute Priorities. Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on, 39: 399-409, 2009.
3. P. Cordero, M. Enciso, A. Mora, I.P, de Guzmán: SLFD logic: Elimination of data redundancy in knowledge representation, LNCS 2527: 141-150, 2002.
4. C. Frambourg, P. Valtchev, and R. Godin, Merge-based computation of minimal generators. Discrete Mathematics, LNCS 3596: 181-194, 2005.
5. B. Ganter, Two basic algorithms in concept analysis. Technische Hochschule, Darmstadt, 1984.
6. J.L. Guigues and V. Duquenne, Familles minimales d'implications informatives résultant d'un tableau de données binaires. Math. Sci. Humaines, 95, 5-18, 1986.
7. M. Hermann and B. Sertkaya, On the Complexity of Computing Generators of Closed Sets. ICFCA 2008: 158-168
8. S. O. Kuznetsov and A. Revenko, Attribute Exploration of Properties of Functions on Sets. Fundamenta Informaticae, 115 (4): 377-394, 2012.
9. C. Beeri, and R. Fagin and J.H. Howard, A complete axiomatization for functional and multivalued dependencies in database relations, Proc. ACM SIGMOD Conf., pp. 47-61, 1977.
10. A. Day, The lattice theory of functional dependencies and normal decompositions, International Journal of Algebra and Computation, 2: pp. 209-431, 1990.
11. R. Fagin, Functional dependencies in a relational database and propositional logic, IBM. Journal of research and development, 21 (6), (1977), pp. 534-544.
12. A. Mora, P. Cordero, M. Enciso, I.Fortes, Closure via functional dependence simplification, International Journal of Computer Mathematics, 89(4): 510-526, 2012.
13. G. Stumme, Attribute Exploration with Background Implications and Exceptions. Data Analysis and Information Systems. Statistical and Conceptual approaches. Proc. GfKl'95. Studies in Classification, Data Analysis, and Knowledge Organization 7: 457-469, 1996.
14. L. Szathmary and A. Napoli and S. O. Kuznetsov, ZART: A Multifunctional Itemset Mining Algorithm, Proc. of the 6th Intl. Conf. on Concept Lattices and Their Applications (CLA '08): 47-58, 2008.
15. L. Szathmary and P. Valtchev and A. Napoli and R. Godin, An Efficient Hybrid Algorithm for Mining Frequent Closures and Generators, Proc. of the 5th Intl. Conf. on Concept Lattices and Their Applications (CLA '07): 26-37, 2007.
16. L. Szathmary and P. Valtchev and A. Napoli and R. Godin, Efficient Vertical Mining of Frequent Closures and Generators, LNCS 5772: 393-404, 2009.
17. K. Nehmé, P. Valtchev, M. H. Rouane, R. Godin, On Computing the Minimal Generator Family for Concept Lattices and Icebergs, LNCS 3403: 192-207, 2005.
18. R. Wille, Restructuring lattice theory: an approach based on hierarchies of concepts. In I. Rival (ed.), Ordered sets, pp. 445-470, 1982.