Discovering all most specific sentences by randomized algorithms extended abstract

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

Volumn 1186, Issue , 1997, Pages 215-229

  Gunopulos, Dimitrios ^a   Mannila, Heikki ^b   Saluja, Sanjeev ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS;

EXTENDED ABSTRACTS; FREQUENT SETS; HYPERGRAPH TRANSVERSALS; RANDOMIZED ALGORITHMS;

DATA MINING;

EID: 84948968508     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62222-5_47     Document Type: Conference Paper

References (28)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD'93), pages 207-216, May 1993.
2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Feist discovery of association rules. In U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining, pages 307-328. AAAI Press, Menlo Park, CA, 1996.
3. R. Agrawal and R. Srikant. Mining sequential patterns. In International Conference on Data Engineering, Mar. 1995.
4. S. Bell. Deciding distinctness of query results by discovered constraints. Manuscript.
5. S. Bell and P. Brockhausen. Discovery of data dependencies in relational databases. Technical Report LS-8 14, Universität Dortmund, Fachbereich Informatik, Lehrstuhl VIII, Künstliche InteUigenz, 1995.
6. C. Berge. Hypergraphs. Combinatorics of Finite Sets. North-Holland Publishing Company, Amsterdam, 1989.
7. C. C. Chang and H. J. Keisler. Model Theory. North-Holland, Amsterdam, 1973. 3rd ed., 1990.
8. L. De Raedt and M. Bruynooghe. A theory of claused discovery. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93), pages 1058-1053, Chambéry, France, 1993. Morgan Kaufmann.
9. L. De Raedt and S. Džeroski. First-order jfc-clausal theories are PAC-learnable. Artificial Intelligence, 70:375-392, 1994.
10. T. Eiter and G. Gottlob. Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing, 24(6):1278-1304, Dec. 1995.
11. U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors. Advances in Knowledge Discovery and Data Mining. AAAI Press, Menlo Park, CA, 1996.
12. M. Garey and D. Johnson. Computers and Intractability-A Guide to the Theory of NP-Completeness. W.H. Freeman, New York, 1979.
13. J. Hem and Y. Fu. Discovery of multiple-level association rules from large databases. In Proceedings of the 21st International Conference on Very Large Data Bases (VLDB'95), pages 420-431, Zurich, Swizerland, 1995.
14. M. Houtsma and A. Swami. Set-oriented mining of association rules. Research Report RJ 9567, IBM Almaden Research Center, San Jose, California, October 1993.
15. D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou. On generating all maximal independent sets. Information Processing Letters, 27:119-123, 1988.
16. J.-U. Kietz and S. Wrobel. Controlling the complexity of learning in logic through syntactic and task-oriented models. In S. Muggleton, editor, Inductive Logic Programming, pages 335-359. Academic Press, London, 1992.
17. W. Kłoesgen. Efficient discovery of interesting statements in databases. Journal of Intelligent Information Systems, 4(1):53-69, 1995.
18. A. J. Knobbe and P. W. Adriaans. Discovering foreign key relations in relational databases. In Workshop Notes of the ECML-95 Workshop on Statistics, Machine Learning, and Knowledge Discovery in Databases, pages 94-99, Heraklion, Crete, Greece, Apr. 1995.
19. H. Mannila. Aspects of data mining. In Workshop Notes of the ECML-95 Workshop on Statistics, Machine Learning, and Knowledge Discovery in Databases, pages 1-6, Heraklion, Crete, Greece, Apr. 1995.
20. H. Mannila. Data mining: machine learning, statistics, and databases. In Proceedings of the 8th International Conference on Scientific and Statistical Database Management, Stockholm, 1996. To appear.
21. H. Mannila and K.-J. Räihä. Design by example: An application of Armstrong relations. Journal of Computer and System Sciences, 33(2):126-141, 1986.
22. H. Mannila and K.-J. Räihä. Algorithms for inferring functional dependencies. Data & Knowledge Engineering, 12(1):83-99, Feb. 1994.
23. H. Mannila and H. Toivonen. On an algorithm for finding all interesting sentences. In Cybernetics and Systems Research '96, Vienna, Austria, Apr. 1996. To appear.
24. H. Mannila, H. Toivonen, and A. I. Verkamo. Discovering frequent episodes in sequences. In Proceedings of the First International Conference on Knowledge Discovery and Data Mining (KDD'95), pages 210-215, Montreal, Canada, Aug. 1995.
25. A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In Proceedings of the 21st International Conference on Very Large Data Bases (VLDB'95), pages 432-444, Zurich, Swizerland, 1995.
26. J. Schlimmer. Using learned dependencies to automatically construct sufficient and sensible editing views. In Knowledge Discovery in Databases, Papers from the 1993 AAAI Workshop (KDD'93), pages 186-196, Washington, Ð.C., 1993.
27. J. D. Ullman. Principles of Database and Knowledge-Base Systems, volume I. Computer Science Press, Rockville, MD, 1988.
28. L. G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410-421, 1979.