Discovery of first-order regularities in a relational database using ofine candidate determination

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

Volumn 1297, Issue , 1997, Pages 288-295

  Weber, Irene ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957893504     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3540635149_57     Document Type: Conference Paper

References (4)

1. L. De Raedt and M. Braynooghe. A theory of clausal discovery. In Proc. of IJCAI-9S, Chambéry, 1993.
2. U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy. Advances in Knowledge Discovery and Data Mining. MIT Press, Cambridge, MA, 1995.
3. G. Lindner and K. Morik. Coupling a relational learning algorithm with a database system. In Y. Kodratoff, G. Nakhaeizadeh, and C. Taylor, editors, Workshop Notes of the ECML-95 Workshop Statistics, Machine Learning and Knowledge Discovery in Databases, 1995.
4. H. Mannila, H. Toivonen, and I. Verkamo. Efficient algorithms for discovering association rules. In AAAI-94 Workshop on Knowledge Discovery in Databases, 1994.