Efficient discovery of optimal word-association patterns in large text databases
- 1 March 2000
- journal article
- Published by Springer Nature in New Generation Computing
- Vol. 18 (1) , 49-60
- https://doi.org/10.1007/bf03037568
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- A Fast Algorithm for Discovering Optimal String Patterns in Large Text DatabasesPublished by Springer Nature ,1998
- Computing the Maximum Bichromatic Discrepancy, with Applications to Computer Graphics and Machine LearningJournal of Computer and System Sciences, 1996
- Approximate solution of NP optimization problemsTheoretical Computer Science, 1995
- Combinatorial pattern discovery for scientific dataPublished by Association for Computing Machinery (ACM) ,1994
- Mining association rules between sets of items in large databasesPublished by Association for Computing Machinery (ACM) ,1993
- A Note on the Height of Suffix TreesSIAM Journal on Computing, 1992
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- An algorithm for string matching with a sequence of don't caresInformation Processing Letters, 1991
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976