A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 247-261
- https://doi.org/10.1007/3-540-49730-7_19
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Learning unions of tree patterns using queriesTheoretical Computer Science, 1997
- Querying semi-structured dataPublished by Springer Nature ,1997
- Data mining using two-dimensional optimized association rulesPublished by Association for Computing Machinery (ACM) ,1996
- Challenges in machine learning for text classificationPublished by Association for Computing Machinery (ACM) ,1996
- Efficient agnostic PAC-learning with simple hypothesisPublished by Association for Computing Machinery (ACM) ,1994
- Mining association rules between sets of items in large databasesPublished by Association for Computing Machinery (ACM) ,1993
- Decision theoretic generalizations of the PAC model for neural net and other learning applicationsInformation and Computation, 1992
- A Note on the Height of Suffix TreesSIAM Journal on Computing, 1992
- An algorithm for string matching with a sequence of don't caresInformation Processing Letters, 1991
- A simple method for displaying the hydropathic character of a proteinJournal of Molecular Biology, 1982