Voting experts: An unsupervised algorithm for segmenting sequences

Intelligent Data Analysis

Volumn 11, Issue 6, 2007, Pages 607-625

  Cohen, Paul ^a   Adams, Niall ^b   Heeringa, Brent ^c  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

^c WILLIAMS COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 51449100133     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/ida-2007-11603     Document Type: Article

References (39)

1. R.K. Ando and L. Lee, Mostly-unsupervised statistical segmentation of japanese: Application to kanji. In Proceedings of North American Association for Computational Linguistics (NAACL), 2000, 241-248.
2. M.R. Brent, An efficient, probabilistically sound algorithm for segmentation and word discovery, Machine Learning 45(1-3) (1999), 71-105.
3. M.R. Brent and X. Tao, Chinese text segmentation with MBDP-1: Making the most of training corpora. In: Proceedings of the 39th Annual Meeting on Association for Computational Linguistics, Toulouse, France, 2001, 90-97.
4. W.G. Chase and H.A. Simon, The mind's eye in chess, in: Visual Information Processing, W.G. Chase, ed., New York: Academic Press, 1973, pp. 215-281.
5. J. Cheng and M. Mitzenmacher, The Markov Expert for Finding Episodes in Time Series, Unpublished technical report.
6. P. Cohen and N. Adams, An algorithm for segmenting categorical time series into meaningful episodes. In Proceedings of Fourth Symposium on Intelligent Data Analysis, Springer, 2001, 198-207.
7. P.R. Cohen, B. Heeringa, and N. Adams, An unsupervised algorithm for segmenting categorical time series into episodes. In Working Notes of the 2002 ESF Exploratory Workshop on Pattern Detection and Discovery in Data Mining (to appear), 2002.
8. M. Creutz, Unsupervised segmentation of words using prior distributions of morph length and frequency. In Proceedings of ACL-03, the 41st Annual Meeting of the Association of Computational Linguistics, Sapporo, Japan, 7-12 July, 280-287.
9. A.D. de Groot, Thought and Choice in Chess, (1st ed.), The Hague: Mouton Publishers, 1965.
10. C. de Marcken, Unsupervised acquisition of a lexicon from continuous speech. Technical Report AI Memo No. 1558, Massachusetts Institute of Technology, Cambridge, MA, 1995.
11. W. Fitch and M. Hauser, Computational constraints on syntactic processing in a nonhuman primate, Science 303(5656) (2004), 377-380.
12. M.N. Garofalakis, R. Rastogi and K. Shim, SPIRIT: Sequential pattern mining with regular expression constraints, The VLDB Journal (1999), 223-234.
13. F. Gobet and H.A. Simon, The roles of recognition processes and look-ahead search in time-constrained ex-pert problem solving: Evidence from grandmaster level chess, Psychological Science 7 (1996), 52-55.
14. J. Goldsmith, Linguistica: An automatic morphological analyzer. To appear in John Boyle, Jung-Hyuck Lee, and Arika Okrent CLS 36 [Papers from the 36th Meeting of the Chicago Linguistics Society] Volume1: The Main Session. 2000.
15. M.A. Hafer and S.F. Weiss, Word segmentation by letter successsor varieties, Information Storage and Retrieval 10(371385) (1974).
16. Z. Harris, Distributional Structure, Word 10 (1954), 156.
17. M.D. Hauser, E.L. Newport and R.N. Aslin, Segmentation of the speech stream in nonhuman primates: Statistical learning in cotton top tamarins Cognition. 78. 2001.
18. Y. Horman and G.A. Kaminka, Improving Sequence Recognition for Learning the Behavior of Agents. In Proceedings of the Association AAMAS 2004
19. J.L. Hutchens and M.D. Alder, Finding structure via compression, in: Proceedings of the Joint Conference on New Methods in Language Processing and Computational Natural Language Learning: NeMLaP3/CoNLL98 D.M.W. Powers, ed., Association for Computational Linguistics, Somerset, New Jersey, 1998, pp. 79-82.
20. F. Jelinek, J.D. Lafferty and R.L. Mercer, Basic methods of probabilistic context free grammars, in: Speech Recognition and Understanding. Recent Advances, Trends, and Applications, volume F75 of NATO Advanced Sciences Institutes Series, P. Laface and R. De Mori, eds, Springer Ver-lag, Berlin. Proceedings of the NATO Advanced Study Institute, Cetraro, Italy, July 1990, pp. 345-360.
21. A. Kempe, Experiments in unsupervised entropy-based corpus segmentation. In Proc. Workshop on Computational Natural Language Learning (CoNLL) Bergen, Norway, SIGNLL/ACL, June 1999, 7-13.
22. J.E. Laird, P.S. Rosenbloom and A. Newell, Chunking in Soar: The anatomy of a general learning mechanism, Machine Learning 1(1) (1986), 11-46.
23. D. Magerman and M. Marcus, Parsing a natural language using mutual information statistics. In Proceedings, Eighth National Conference on Artificial Intelligence (AAAI 90), 1990, 984-989.
24. H. Mannila, H. Toivonen and A.I. Verkamo, Discovery of frequent episodes in event sequences, Data Mining and Knowledge Discovery 1(3) (1997), 259-289.
25. G.A. Miller, The magical number seven, plus or minus two: Some limits on our capacity for processing information, Psychological Review 63 (1956), 81-97.
26. C.G. Nevill-Manning and I.H. Witten, Identifying hierarchical structure in sequences: A linear-time algorithm, Journal of Artificial Intelligence Research 7(1) (1997), 67-82.
27. J.T. Oates, Grounding Knowledge in Sensors: Unsupervised Learning for Language and Planning, PhD thesis, Department of Computer Science, University of Massachusetts, 2001.
28. J.R. Saffran, R.N. Aslin and E.L. Newport, Statistical learning by 8-month-old infants, Science 274(5294) (1996), 1926-1928.
29. P.K. Sahoo, S. Soltani, A.K.C. Wong and Y.C. Chen, A survey of thresholding techniques, Computer Vision, Graphics, and Image Processing Archive 41(2) (1988), 233-260.
30. C. Shannon, Prediction and the Entropy of Printed English, Bell System Technical Journal (1951).
31. H.A. Simon, How Big is a Chunk? Science 183(4124) (1974), 482-488.
32. A. Stolcke, Bayesian Learning of Probabilistic Language Models, PhD thesis, Division of Computer Science, University of California, Berkeley, 1994.
33. W.J. Teahan, Y. Wen, R.J. McNab and I.H. Witten, A compression-based algorithm for chinese word segmentation, Computational Linguistics 26(3) (2000), 375-393.
34. W.J. Teahan, Text classification and segmentation using minimum crossentropy. In International Conference on Content-Based Multimedia Information Access (RIAO), 2000.
35. C.J. Van Rijsbergen, Information Retrieval, 2nd edition, Dept. of Computer Science, University of Glasgow, 1979.
36. G.M. Weiss and H. Hirsh, Learning to predict rare events in event sequences. In Knowledge Discovery and Data Mining, 1998, 359-363.
37. G. Williams, C. Kelman, R. Baxter, L. Gu, S. Hawkins, H. He, C. Rainsford and D. Vickers, Temporal Event Mining of Linked Medical Claims Data. PaKDD 03.
38. R.A. Peters II, C.L. Campbell, W.J. Bluethmann and E.H. Robonaut, Task Learning through Teleoperation In Proceedings of the IEEE International Conference on Robotics and Automation.
39. A. Venkataraman, A Statistical Model for Word Discovery in Transcribed Speech, Computational Linguistics 27(3) (2001), 351-372.