Discovering Patterns from Large and Dynamic Sequential Data

Journal of Intelligent Information Systems

Volumn 9, Issue 1, 1997, Pages 33-56

  Wang, Ke ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Combinatorial pattern matching; Data mining; Sequential pattern; Suffix tree; Update

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA COMPRESSION; DATABASE SYSTEMS; INFORMATION RETRIEVAL; PATTERN RECOGNITION; STATISTICS;

COMBINATORIAL PATTERN MATCHING; DATA MINING; SEQUENTIAL DATA; SEQUENTIAL DATABASES;

DATA STRUCTURES;

EID: 0031188758     PISSN: 09259902     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008689103430     Document Type: Article

References (24)

1. Agrawal, R. and Srikant, R. (1995). Mining sequential patterns. IEEE Conference on Data Engineering (pp. 3-14).
2. Agrawal, R., Lin, K.I., Sawhney, H.S., and Shim, K. (1995). Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases, VLDB, 490-501.
3. Baeza-Yates, R. (1992). Text Retrieval: Theory and Practice, Algorithms, Software, Architecture: Information Processing, 1, 465-476.
4. Baeza-Yates, R. and Gonnet, G.H. (1992). A New Approach to Text Searching, CACM, 35(10), 74-82.
5. Boyer, R.S. and Moore, J.S. (1977). A Fast String Searching Algorithm, CACM, 20(10), 762-772.
6. Cobbs, A.L. (1995). Fast approximate matching using suffix trees. In Proc. Combinatorial Pattern Matching, Lecture Notes in Computer Science (vol. 937, pp. 41-54), Springer-Verlag.
7. Dietterich, T.G. and Michalski, R.S. (1985). Discovering Patterns in Strings of Events, Artificial Intelligence, 25, 187-232.
8. Faloutsos, C. (1985). Access Methods for Text, ACM Computing Surveys, 17, 49-74.
9. Fayyad, U., Shapiro, G.P., and Smyth, P. (1996). Knowledge Discovery and Data Mining: Towards a Unifying Framework, KDD, 82-88.
10. Gonnet, G.H. and Baeza-Yates, R. (1991). Handbook of Algorithms and Data Structures in Pascal and C, second edition.
11. Guttman, A. (1984). R-trees: A Dynamic Index Structure for Spatial Searching, ACM SIGMOD, 47-57.
12. Hui, L.C.K. (1992). Color Set Size Problem with Applications to String Matching. In A. Apostolico et al. (Eds.), Combinatorial Patterns Matching, Lecture Notes in Computer Science, 644, 230-243, Springer-Verlag.
13. Knuth, D.E., Morris, J.H., and Pratt, V.R. (1977). Fast Pattern Matching in Strings, SIAM J. Comput. 6, 323-350.
14. Landau, G.M. and Vishkin, U. (1989). Fast Parallel and Serial Approximate String Matching, Journal of Algorithms, 10(2), 157-169.
15. McCreight, E.M. (1976). A Space-Economical Suffix Tree Construction Algorithm, JACM, 23(2), 262-272.
16. Sellis, T., Roussopoulos, N., and Faloutsos, C. (1987). The R+-tree: A Dynamic Index for Multi-Dimensional Objects, VLDB, 507-518.
17. Stephen, G.A. (1994). String Searching Algorithms, Lectures Notes Series on Computing, World Scientific, 3.
18. Tomasic, A., Garcia-Molina, H., and Shoens, K. (1994). Incremental Updates of Inverted Lists for Text Document Retrievals, ACM SIGMOD.
19. Ukkonen, E. (1992). Constructing Suffix-Trees On-Line in Linear Time, Algorithms, Software, Architecture: Information Processing 92, Amsterdam: Elsevier, 1, 484-492.
20. Ukkonen, E., (1993). Approximate matching over suffix trees. In Proc. Combinatorial Pattern Matching (vol. 4, pp. 228-242), Springer-Verlag.
21. Wang, J.T.L., Chirn, G.W., Marr, T.G., Shapiro, B., Shasha, D., and Zhang, K. (1994). Combinatorial Pattern Discovery for Scientific Sata: Some Preliminary Results, ACM SIGMOD, 115-125.
22. Weiner, P. (1973). Linear pattern matching algorithms, Conf. Record, IEEE 14th Annual Symposium on Switching and Automata Theory (pp. 1-11).
23. Wu, S. and Manber, U. (1992). Fast Text Searching Allowing Errors, CACM, 35(10), 83-91.
24. Zobel, J., Moffat, A., and Sacks-Davis, R. (1993). Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files, VLDB, 290-301.