Horn axiomatizations for sequential data

Theoretical Computer Science

Volumn 371, Issue 3, 2007, Pages 247-264

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

^a Laboratori d'Algorísmica Relacional   (Spain)

Author keywords

Association rules; Closure operators; Propositional Horn theories; Sequential patterns

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; COMPUTER SCIENCE; DATA MINING; FORMAL LOGIC; MATHEMATICAL OPERATORS;

ASSOCIATION RULES; CLOSURE OPERATORS; HORN AXIOMATIZATIONS; PROPOSITIONAL HORN THEORIES; SEQUENTIAL DATA; SEQUENTIAL PATTERNS;

DATA REDUCTION;

EID: 33846782841     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.11.009     Document Type: Article

References (62)

1. R. Agrawal, T. Imielinski, A.N. Swami, Mining association rules between sets of items in large databases, in: P. Buneman, S. Jajodia (Eds.), Proceedings of the 1993 ACM SIGMOD Int. Conference on Management of Data, 1993, pp. 207-216
2. Agrawal R., Mannila H., Srikant R., Toivonen H., and Verkamo A.I. Fast discovery of association rules. Advances in Knowledge Discovery and Data Mining (1996) 307-328
3. Agrawal R., and Srikant R. Mining sequential patterns. Proceedings of the 11th International Conference on Data Engineering (1995), IEEE Computer Society Press 3-14
4. J. Azé, Extraction de Connaissances à partir de Données Numériques et Textuelles, Ph.D. Thesis, Université Paris Sud, 2003
5. Baixeries J., and Garriga G.C. Sampling strategies for finding frequent sets. Revue des sciences et technologies de l'information (RTSI) 17 1 (2003) 159-170
6. Baixeries J., Garriga G.C., and Balcázar J.L. Best-first strategies for mining frequent sets. Journal d'Extraction des connaissances et apprentissage 1 4 (2002) 100-106
7. J.L. Balcázar, J. Baixeries, Discrete deterministic datamining as knowledge compilation, in: SIAM Int. Workshop on Discrete Mathematics and Data Mining, 2003
8. J.L. Balcázar, G.C. Garriga, On Horn axiomatizations for sequential data, in: Proceedings of the 10th Int. Conference on Database Theory, 2005, pp. 215-229
9. Bastide Y., Pasquier N., Taouil R., Stumme G., and Lakhal L. Mining minimal non-redundant association rules using frequent closed itemsets. Lecture Notes in Computer Science 1861 (2000) 972-986
10. Bayardo R. Efficiently mining long patterns from databases. SIGMOD Record 27 2 (1998) 85-93
11. R. Bayardo, R. Agrawal, Mining the most interesting rules, in: ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, 1999, pp. 145-154
12. Berzal F., Blanco I., Sánchez D., and Vila M.A. Measuring the accuracy and interest of association rules: A new framework. Journal Intelligent Data Analysis 6 (2002) 221-235
13. S. Brin, R. Motwani, C. Silverstein, Beyond market baskets: Generalizing association rules to correlations, in: Proceedings of the ACM SIGMOD Int. Conference on the Management of Data, 1997, pp. 265-276
14. S. Brin, R. Motwani, J.D. Ullman, S. Tsur, Dynamic itemset counting and implication rules for market basket data, in: Proceedings ACM SIGMOD Int. Conference on Management of Data, 1997, pp. 255-264
15. M. Cadoli, Knowledge compilation and approximation: Terminology, questions, references, in: AI/MATH-96, 4th. Int. Symposium on Artificial Intelligence and Mathematics, 1996
16. Carpineto C., and Romano G. Concept Data Analysis. Theory and Applications (2004), Wiley
17. Chang C., and Keisler J. Model Theory (1990), Elsevier, Amsterdam, Holland
18. L. Cristofor, D. Simovici, Generating an informative cover for association rules, in: Proceedings of the IEEE Int. Conference on Data Mining, 2002, pp. 597-600
19. Davey B.A., and Priestly H.A. Introduction to Lattices and Order (2002) Cambridge
20. Day A. The lattice theory of functional dependencies and normal decompositions. International Journal of Algebra and Computation 2 4 (1992) 409-431
21. Demetrovics J., Libkin L., and Muchnik I.B. Functional dependencies in relational databases: A lattice point of view. Discrete Applied Mathematics 40 2 (1992) 155-185
22. Duquenne V., and Guigues J.-L. Famille minimale d'implication informatives résultant d'un tableau de données binaires. Mathématiques et Sciences Humaines 24 95 (1986) 5-18
23. Eiter T., and Gottlob G. Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing 24 6 (1995) 1278-1304
24. J. Fürnkranz, P.A. Flach, An analysis of rule evaluation metrics, in: Proceedings of the 20th Int. Conference on Machine Learning, 2003, pp. 202-209
25. Ganter B., and Wille R. Formal Concept Analysis. Mathematical Foundations (1998), Springer
26. G.C. Garriga, Formal methods for mining structured objects, Ph.D. Dissertation, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya (in preparation)
27. G.C. Garriga, Towards a formal framework for mining general patterns from structured data, in: Int. KDD Workshop on Multirelational Datamining, 2003, pp. 215-229
28. G.C. Garriga, Statistical strategies to remove all the uniteresting association rules, in: Proceedings of 16th European Conference on Artificial Intelligence, 2004, pp. 430-435
29. G.C. Garriga, Summarizing sequential data with closed partial orders, in: Proceedings of the SIAM Int. Conference on Data Mining, 2005, pp. 380-391
30. Goethals B., and Zaki M. Advances in frequent itemset mining implementations: report on fimi'03. SIGKDD Explor. Newsl. 6 1 (2004) 109-117
31. Gunopulos D., Khardon R., Mannila H., Saluja S., Toivonen H., and Sharma R.S. Discovering all most specific sentences. ACM Transactions on Database Systems 28 2 (2003)
32. Han J., Pei J., and Yin Y. Mining frequent patterns without candidate generation. Proceedings of the ACM SIGMOD Intl. Conference on Management of Data (2000), ACM Press 1-12
33. R. Hilderman, H. Hamilton, Evaluation of interestingness measures for ranking discovered knowledge, in: Proceedings of 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2001, pp. 247-259
34. Hipp J., Güntzer U., and Nakhaeizadeh G. Algorithms for association rule mining: A general survey and comparison. SIGKDD Explor. Newsl. 2 1 (2000) 58-64
35. Kautz H., Kearns M., and Selman B. Horn approximations of empirical data. Artificial Intelligence 74 1 (1995) 129-145
36. Kavvadias D., Papadimitriou C.H., and Sideri M. On horn envelopes and hypergraph transversals. ISAAC'93: Proceedings of the 4th International Symposium on Algorithms and Computation (1993), Springer-Verlag, London, UK 399-405
37. T. Lane, C.E. Brodley, Sequence matching and learning in anomaly detection for computer security, in: Proceedings AAAI-97 Workshop on AI Approaches to Fraud Detection and Risk Management, 1997, pp. 43-49
38. W. Lee, S.J. Stolfo, P.K. Chan, Learning patterns from unix process execution traces for intrusion detection, in: Proceedings AAAI-97 Workshop on AI Approaches to Fraud Detection and Risk Management, 1997, pp. 50-56
39. W. Lee, S.J. Stolfo, K. Mok, A data mining framework for building intrusion detection models, in: Proceedings of the IEEE Symposium on Security and Privacy, 1999, pp. 120-132
40. D. Lin, Z.M. Kedem, Pincer search: A new algorithm for discovering the maximum frequent set, in: Proceedings of the Int. Conference on Extending Database Technology (EDBT), 1998, pp. 105-119
41. Lin J.L., and Dunham M.H. Mining association rules: Anti-skew algorithms. Proceedings of the 14th Int. Conference on Data Engineering. 23-27 February, 1998, Orlando, FL, USA (1998), IEEE Computer Society 486-493
42. M. Liquiere, J. Sallantin, Structural machine learning with galois lattice and graphs, in: Proceedings of the 15th Int. Conference on Machine Learning, 1998, pp. 305-313
43. Luxenburger M. Implications partielles dans un contexte. Math. Inf. Sci. Hum. 29 113 (1991) 35-55
44. H. Mannila, C. Meek, Global partial orders from sequential data, in: Proceedings of the 6th Int. Conference on Knowledge Discovery in Databases, 2000, pp. 161-168
45. Mannila H., Toivonen H., and Verkamo A.I. Discovering frequent episodes in sequences. Data Mining and Knowledge Discovery 1 3 (1997) 259-289
46. C. Martins-Antunes, A.L. Oliveira, Sequential pattern mining algorithms: Trade-offs between speed and memory, in: PKDD'04 Workshop on Mining Graphs, Trees and Sequences, 2004
47. N. Pasquier, Y. Bastide, R. Taouil, L. Lakhal, Closed set based discovery of small covers for association rules, in: Proceedings of the 15th Int. Conference on Advanced Databases, 1999, pp. 361-381
48. J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, M. Hsu, PrefixSpan: Mining sequential patterns by prefixprojected growth, in: Proceedings of the 17th Int. Conference on Data Engineering, 2001, pp. 215-224
49. J.L. Pfaltz, C.M. Taylor, Scientific knowledge discovery through iterative transformations of concept lattices, in: SIAM Int. Workshop on Discrete Mathematics and Data Mining, 2002, pp. 65-74
50. A. Silberschatz, A. Tuzhilin, On subjective measures of interestingness in knowledge discovery, in: Proceedings of the 1st Int. Conf. on Knowledge Discovery and Data Mining, 1995, pp. 275-281
51. R. Srikant, R. Agrawal, Mining sequential patterns: Generalizations and performance improvements, in: Proceedings of the 5th Int. Conference Extending Database Technology, EDBT'96, vol. 1057, 1996, pp. 3-17
52. P. Tan, V. Kumar, J. Srivastava, Selecting the right interestingness measure for association patterns, in: ACM SIGKDD Int. Conference on Knowledge Discovery and Data Mining, 2002, pp. 32-41
53. Taouil R., Bastide Y., Pasquier N., and Lakhal L. Mining bases for association rules using closed sets. Proceedings of the 16th Int. Conference on Data Engineering. ICDE'00 (2000), IEEE Computer Society 307
54. P. Tzvetkov, X. Yan, J. Han, TSP: Mining top-k closed sequential patterns, in: Proceedings of the 3rd IEEE International Conference on Data Mining, 2003, pp. 347-358
55. B. Vaillant, P. Lenca, S. Lallich, A clustering of interestingness measures, in: Discovery Science, 2004, pp. 290-297
56. J. Wang, J. Han, BIDE: Efficient mining of frequent closed sequences, in: Proceedings of the 19th Int. Conference on Data Engineering, 2003, pp. 79-90
57. X. Yan, J. Han, R. Afshar, CloSpan: Mining closed sequential patterns in large datasets, in: Proceedings of the Int. Conference SIAM Data Mining, 2003, pp. 166-177
58. M. Zaki, Generating non-redundant association rules, in: Proceedings of the 6th Int. Conference on Knowledge Discovery and Data Mining, 2000, pp. 34-43
59. Zaki M. SPADE: An efficient algorithm for mining frequent sequences. Unsupervised Learning. Machine Learning Journal 42 1-2 (2001) 31-60 (special issue)
60. Zaki M. Mining non-redundant association rules. Data Mining and Knowledge Discovery: An International Journal 4 3 (2004) 223-248
61. Zaki M., and Gouda K. Fast vertical mining using diffsets. Proceedings of the 9th ACM SIGKDD Int. Conference on Knowledge Discovery and Data Mining. KDD'03 (2003), ACM Press 326-335
62. M. Zaki, M. Ogihara, Theoretical foundations of association rules, in: SIGMOD-DMKD Int. Workshop on Research Issues in Data Mining and Knowledge Discovery, 1998