On monotone data mining languages

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

Volumn 2397, Issue , 2002, Pages 119-132

  Calders, Toon ^a   Wijsen, Jef ^b  

^a UNIVERSITY OF ANTWERP   (Belgium)

^b UNIVERSITY OF MONS   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BOOLEAN ASSOCIATION RULES; COMMON DATUM; FINITE MODEL; FIRST ORDER; INCLUSION DEPENDENCIES; SEARCH STRATEGIES;

DATA MINING;

EID: 84943599495     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46093-4_7     Document Type: Conference Paper

References (16)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD Int. Conf. Management of Data, pages 207–216, Washington, D.C., 1993.
2. M. Ajtai and Y. Gurevich. Monotone versus positive. Journal of the ACM, 34(4):1004–1015, 1987.
3. T. Calders and J. Wijsen. On monotone data mining languages. Technical Report 2001-08, Universitaire Instelling Antwerpen, Department of Mathematics and Computer Science, 2001.
4. J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann, 2000.
5. T. Imielinski and H. Mannila. A database perspective on knowledge discovery. Comm. of the ACM, 39(11):58–64, 1996.
6. M. Kantola, H. Mannila, K.-J. Raiha, and H. Siirtola. Discovering functional and inclusion dependencies in relational databases. Internat. Journal of Intelligent Systems, 7:591–607, 1992.
7. L. V. S. Lakshmanan, R. Ng, J. Han, and A. Pang. Optimization of constrained frequent set queries with 2-variable constraints. In Proc. ACM SIGMOD Int. Conf. Management of Data, pages 157–168, 1999.
8. L. V. S. Lakshmanan, F. Sadri, and S. N. Subramanian. SchemaSQL—An extension to SQL for multi-database interoperability. To appear in ACM Trans. On Database Systems.
9. S. Lopes, J.-M. Petit, and L. Lakhal. Efficient discovery of functional dependencies and Armstrong relations. In Proc. 7th Int. Conf. on Extending Database Technology (EDBT 2000), LNCS 1777, pages 350–364. Springer, 2000.
10. H. Mannila. Methods and problems in data mining. In Proc. Int. Conf. On Database Theory, Delphi, Greece, 1997.
11. H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241–258, 1997.
12. R. T. Ng, L. V. S. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. ACM SIGMOD Int. Conf. Management of Data, pages 13–24. ACM Press, 1998.
13. K. A. Ross. Relations with relation names as arguments: Algebra and calculus. In Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 346–353. ACM Press, 1992.
14. A. Stolboushkin. Finitely monotone properties. In Proc. 10th IEEE Symp. On Logic in Comp. Sci., pages 324–330, 1995.
15. D. Tsur, J. D. Ullman, S. Abiteboul, C. Clifton, R. Motwani, S. Nestorov, and A. Rosenthal. Query flocks: a generalization of association-rule mining. In Proc. ACM SIGMOD Int. Conf. Management of Data, pages 1–12, 1998.
16. J. Wijsen, R. Ng, and T. Calders. Discovering roll-up dependencies. In Proc. ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, pages 213–222, San Diego, CA, 1999.