On horn axiomatizations for sequential data

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

Volumn 3363 LNCS, Issue , 2005, Pages 215-229

  Balcázar, José L ^a   Casas Garriga, Gemma ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSED SEQUENCES; CONCEPT LATTICES; FORMAL CONCEPT ANALYSIS; GENERAL METHOD; LOGICAL CHARACTERIZATION; ORDERED DATA; PROPOSITIONAL THEORIES; SEQUENTIAL DATA;

MINING;

ASSOCIATIVE PROCESSING;

EID: 77049116292     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30570-5_15     Document Type: Conference Paper

References (15)

1. R. Agrawal and R. Srikant. Mining sequential patterns. In Eleventh International Conference on Data Engineering, pp. 3-14. IEEE Computer Society Press, 1995.
2. J.L. Balcázar and J. Baixeries. Discrete deterministic datamining as knowledge compilation. In Workshop on Discrete Mathematics and Data Mining, in SIAM Int. Conf., 2003.
3. M. Cadoli. Knowledge compilation and approximation: Terminology, questions, references. In AI/MATH-96, 4th. Int. Symposium on Artificial Intelligence and Mathematics, 1996.
4. G. Casas-Garriga. Towards a formal framework for mining general patterns from structured data. In Workshop Multi-relational Datamining, in KDD Int. Conf, 2003.
5. G. Casas-Garriga. Statistical strategies to remove all the uniteresting association rules. In Proc. 16th European Conf. on Artificial Intelligence, pp. 430-435, 2004.
6. A. Day. The lattice theory of functional dependencies and normal decompositions. Int. Journal of Algebra and Computation, 2(4):409-431, 1992.
7. B. Ganter and R. Wille. Formal Concept Analysis. Mathematical Foundations. Springer, 1998.
8. H. Kautz, M. Kearns, and B. Selman. Horn approximations of empirical data. Artificial Intelligence, 74(1):129-145, 1995.
9. N. Pasquier, Y. Bastide, R. Taouil L., and Lakhal. Closed set based discovery of small covers for association rules. In Proc. 15th Int. Conf. on Advanced Databases, pp. 361-381, 1999.
10. J.L. Pfaltz and C.M. Taylor. Scientific knowledge discovery through iterative transformations of concept lattices. In Workshop on Discrete Mathematics and Data Mining, in SIAM Int. Conf., pp. 65-74, 2002.
11. B. Selman and H. Kautz. Knowledge compilation and theory approximation. Journal of the ACM, 43(2):193-224, 1996.
12. J. Wang and J. Han. BIDE: Efficient mining of frequent closed sequences. In Proc. 19th Int. Conference on Data Engineering, pp. 79-90, 2003.
13. X. Yan, J. Han, and R. Afshar. Clospan: Mining closed sequential patterns in large datasets. In Proc. Int. Conference SIAM Data Mining, 2003.
14. M. Zaki. Generating non-redundant association rules. In Proc. 6th Int. Conference on Knowledge Discovery and Data Mining, pp. 34-43, 2000.
15. M. Zaki and M. Ogihara. Theoretical foundations of association rules. In Workshop on Research Issues in Data Mining and Knowledge Discovery, in SIGMOD-DMKD Int. Conf., 1998.