Adaptive text mining: Inferring structure from sequences

Journal of Discrete Algorithms

Volumn 2, Issue 2 SPEC. ISS., 2004, Pages 137-159

  Witten, I H ^a  

^a UNIVERSITY OF WAIKATO   (New Zealand)

Author keywords

Acronym extraction; Adaptive techniques; Compression algorithms; Generic entity extraction; Keyphrase extraction; Phrase hierarchies; Text categorization; Text mining; Word segmentation

Indexed keywords

DATA COMPRESSION; DATA MINING; FORMAL LANGUAGES; HEURISTIC METHODS; INFORMATION THEORY; METADATA; PATTERN RECOGNITION; TEXT PROCESSING;

ACRONYM EXTRACTION; ADAPTIVE TECHNIQUES; COMPRESSION ALGORITHM; GENERIC ENTRY EXTRACTION; HEYPHRASE EXTRATION; PHASE HIERARCHIES; TEXT CATEGORIZATION; TEXT MINING; WORD SEGMENTATION;

ADAPTIVE ALGORITHMS;

EID: 10644223670     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1570-8667(03)00084-4     Document Type: Article

References (38)

1. T.C. Bell, J.G. Cleary, I.H. Witten, Text Compression, Prentice Hall, Englewood Cliffs, NJ, 1990.
2. J. Bentley, D. McIlroy, Data compression using long common strings, in: Proc. Data Compression Conference, IEEE Press, Los Alamitos, CA, 1999, pp. 287-295.
3. R. Brandow, K. Mitze, L.F. Rau, Automatic condensation of electronic publications by sentence selection, Information Processing and Management 31 (5) (1995) 675-685.
4. L. Breiman, Bagging predictors, Machine Learning 24 (2) (1996) 123-140.
5. N.A. Chinchor, Overview of MUC-7/MET-2, in: Proc. Message Understanding Conference MUC-7, 1999.
6. J.G. Cleary, I.H. Witten, Data compression using adaptive coding and partial string matching, IEEE Trans. Comm. 32 (4) (1984) 396-402.
7. S.T. Dumais, J. Platt, D. Heckerman, M. Sahami, Inductive learning algorithms and representations for text categorization, in: Proceedings of the 7th International Conference on Information and Knowledge Management, 1998.
8. U.M. Fayyad, K.B. Irani, Multi-interval discretization of continuousvalued attributes for classification learning, in: Proc. Internat. Joint Conference on Artifical Intelligence, 1993, pp. 1022-1027.
9. E. Frank, G.W. Paynter, I.H. Witten, C. Gutwin, C. Nevill-Manning, Domain-specific keyphrase extraction, in: Proc. Internat. Joint Conference on Artificial Intelligence, Stockholm, Sweden, 1999, pp. 668-673.
10. E. Frank, C. Chiu, I.H. Witten, Text categorization using compression models, in: Proc. Data Compression Conference (Poster paper), IEEE Press, Los Alamitos, CA, 2000. Full version available as Working Paper 00/2, Department of Computer Science, University of Waikato.
11. E. Frank, C. Chiu, I.H. Witten, Text categorization using compression models, in: Proc. Data Compression Conference (Poster paper), IEEE Press, Los Alamitos, CA, 2000. Full version available as Working Paper 00/2, Department of Computer Science, University of Waikato.
12. C. Grover, C. Matheson, A. Mikheev, TTT: Text Tokenization Tool, 1999, http://www.ltg.ed.ac.uk/.
13. D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge University Press, Cambridge, UK, 1997.
14. P.G. Howard, The design and analysis of efficient lossless data compression systems, PhD Thesis, Brown University, 1993.
15. F.C. Johnson, C.D. Paice, W. Black, A. Neal, The application of linguistic processing to automatic abstract generation, J. Document and Text Management 1 (1993) 215-241.
16. J.M. Kupiec, J. Pedersen, F. Chen, A trainable document summarizer, in: Proc. ACM SIGIR Conference on Research and Development in Information Retrieval, ACM Press, 1995, pp. 68-73.
17. N.J. Larsson, A. Moffat, Offline dictionary-based compression, in: Proc. Data Compression Conference, IEEE Press, Los Alamitos, CA, 1999, pp. 296-305.
18. J.R. Larus, Whole program paths, in: Proc. SIGPLAN 99 Conf. on Programming Languages Design and Implementation, 1999.
19. J. Lovins, Development of a stemming algorithm, Mech. Transl. Comput. Linguistics 11 (1968) 22-31.
20. A.R. Martin, Intelligent speech synthesis using the sequitur algorithm and graphical training: server software, M.S. Thesis, Engineering Science, University of Toronto, 1999.
21. B.A. Nardi, J.R. Miller, D.J. Wright, Collaborative, programmable intelligent agents, Comm. ACM 41 (3) (1998) 96-104.
22. C.G. Nevill-Manning, I.H. Witten, Identifying hierarchical structure in sequences: a linear-time algorithm, J. Artificial Intelligence Res. 7 (1997) 67-82.
23. C.G. Nevill-Manning, I.H. Witten, Phrase hierarchy inference and compression in bounded space, in: J.A. Storer, M. Cohn (Eds.), Proc. Data Compression Conference, IEEE Press, Los Alamitos, CA, 1998, pp. 179-188.
24. C.G. Nevill-Manning, I.H. Witten, G.W. Paynter, Lexically-generated subject hierarchies for browsing large collections, Internat. J. Digital Libraries 2 (2-3) (1999) 111-123.
25. C.G. Nevill-Manning, I.H. Witten. Online and offline heuristics for inferring hierarchies of repetitions in sequences, Proc. IEEE 88 (11) (2000) 1745-1755.
26. J.M. Ponte, W.B. Croft, Useg: a retargetable word segmentation procedure for information retrieval, in: Proc. on Document Analysis and Information Retrieval, Las Vegas, Nevada, 1996.
27. W.J. Teahan, Modelling English text, PhD Thesis, University of Waikato, NZ, 1997.
28. W.J. Teahan, Y. Wen, R. McNab, I.H. Witten, A compression-based algorithm for Chinese word segmentation, Comput. Linguistics 26 (3) (2000) 375-393.
29. D. Tkach, Text mining technology: Turning information into knowledge, IBM White paper, 1997.
30. P. Turney, Learning algorithms for keyphrase extraction, Information Retrieval 2 (4) (2000) 303-336.
31. A.J. Viterbi, Error bounds for convolutional codes and an asymptotically optimum decoding algorithm, IEEE Trans. Inform. Theory (1967) 260-269.
32. I.H. Witten, Z. Bray, M. Mahoui, W.J. Teahan, Text mining: a new frontier for lossless compression, in: Proc. Data Compression Conference, IEEE Press, Los Alamitos, CA, 1999, pp. 198-207.
33. I.H. Witten, A. Moffat, T.C. Bell, Managing Gigabytes: Compressing and Indexing Documents and Images, second ed., Morgan Kaufmann, San Francisco, CA, 1999.
34. J.G. Wolff, An algorithm for the segmentation of an artificial language analogue, British J. Psychol. 66 (1975) 79-90.
35. S. Yeates, D. Bainbridge, I.H. Witten, Using compression to identify acronyms in text, in: Proc. Data Compression Conference (Poster paper), IEEE Press, Los Alamitos, CA, 2000. Full version available as Working Paper 00/1, Department of Computer Science, University of Waikato.
36. S. Yeates, D. Bainbridge, I.H. Witten, Using compression to identify acronyms in text, in: Proc. Data Compression Conference (Poster paper), IEEE Press, Los Alamitos, CA, 2000. Full version available as Working Paper 00/1, Department of Computer Science, University of Waikato.
37. J. Ziv, A. Lempel, A universal algorithm for sequential data compression, IEEE Trans. Inform. Theory IT-23 (3) (1977) 337-343.
38. J. Ziv, A. Lempel, Compression of individual sequences via variable-rate coding, IEEE Trans. Inform. Theory IT-24 (5) (1978) 530-536.