Formal concept analysis with constraints by closure operators

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4068 LNAI, Issue , 2006, Pages 131-143

  Bělohlávek, Radim ^a   Vychodil, Vilém ^a  

^a PALACKÝ UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTER SETS; CONSTRAINT THEORY; DATA REDUCTION; MATHEMATICAL OPERATORS; MOTIVATION;

DELAY ALGORITHM; FORMAL CONCEPT ANALYSIS; INPUT DATA TABLE; TABULAR DATA;

FORMAL LOGIC;

EID: 33746588337     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11787181_10     Document Type: Conference Paper

References (13)

1. Bělohlávek R., Sklenář V., Zacpal J.: Formal concept analysis with hierarchically ordered attributes. Int. J. General Systems 33(4) (2004), 283-294.
2. Bělohlávek R., Sklenář V.: Formal concept analysis constrained by attribute-dependency formulas. In: B. Ganter and R. Godin (Eds.): ICFCA 2005, Lect. Notes Comp. Sci. 3403, pp. 176-191, Springer-Verlag, Berlin/Heidelberg, 2005.
3. Boulicaut J.-F., Jeudy B.: Constraint-based data mining. In: Maimon O., Rokach L. (Eds.): The Data Mining and Knowledge Discovery Handbook, Springer, 2005. pp. 399-416.
4. Carpineto C., Romano G.: Concept Data Analysis. Theory and Applications. J. Wiley, 2004.
5. Dekel U., Gill Y.: Visualizing class interfaces with formal concept analysis. In OOPSLA '03, pages 288-289, Anaheim, CA, October 2003.
6. Ganter B., Wille R.: Formal Concept Analysis. Mathematical Foundations. Springer, Berlin, 1999.
7. Guignes J.-L., Duquenne V.: Familles minimales d'implications informatives resultant d'un tableau de données binaires. Math. Sci. Humaines 95(1986), 5-18.
8. Maier D.: The Theory of Relational Databases. Computer Science Press, Rockville, 1983.
9. Norris E. M.: An algorithm for computing the maximal rectangles of a binary relation. Journal of ACM 21:356-266, 1974.
10. Pasquier N., Bastide Y., Taouil R., Lakhal L.: Efficient Mining of Association Rules Using Closed Itemset Lattices. Information Systems 24(1)(1999), 25-46.
11. Snelting G., Tip F.: Understanding class hierarchies using concept analysis. ACM Trans. Program. Lang. Syst. 22(3):540-582, May 2000.
12. Zaki M. J.: Mining non-redundant association rules. Data Mining and Knowledge Discovery 9(2004), 223-248.
13. Zhang C., Zhang S.: Association Rule Mining. Models and Algorithms. Springer, Berlin, 2002.