Discovering all most specific sentences by randomized algorithms extended abstract
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 215-229
- https://doi.org/10.1007/3-540-62222-5_47
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Data mining: machine learning, statistics, and databasesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Mining sequential patternsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Identifying the Minimal Transversals of a Hypergraph and Related ProblemsSIAM Journal on Computing, 1995
- Efficient discovery of interesting statements in databasesJournal of Intelligent Information Systems, 1995
- First-order jk-clausal theories are PAC-learnableArtificial Intelligence, 1994
- Algorithms for inferring functional dependencies from relationsData & Knowledge Engineering, 1994
- Mining association rules between sets of items in large databasesPublished by Association for Computing Machinery (ACM) ,1993
- On generating all maximal independent setsInformation Processing Letters, 1988
- Design by example: An application of Armstrong relationsJournal of Computer and System Sciences, 1986
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979