Minimum message length segmentation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1394, Issue , 1998, Pages 222-233

  Oliver, Jonathan J ^a   Baxter, Rohan A ^b   Wallace, Chris S ^a  

^a MONASH UNIVERSITY   (Australia)

^b Ultimode Systems LLC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; FINANCIAL DATA PROCESSING; IMAGE PROCESSING; IMAGE SEGMENTATION; INFORMATION THEORY; TIME SERIES; TREES (MATHEMATICS);

DECISION-TREE ALGORITHM; FINANCIAL TIME SERIES; INFORMATION THEORETIC CRITERION; MINIMUM MESSAGE LENGTHS; SEGMENTATION METHODS;

DATA MINING;

EID: 84958960391     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-64383-4_19     Document Type: Conference Paper

References (18)

1. H. Akaike. Information theory and an extension of the maximum likelihood principle. In B.N. Petrov and F. Csaki, editors, Proc. of the 2nd International Symposium on Information Theory, pages 267-281, 1973.
2. R.A. Baxter and J.J. Oliver. The kindest cut: minimum message length segmentation. In S. Arikawa and A. Sharma, editors, Lecture Notes in Artificial Intelligence 1160, Algorithmic Learning Theory, ALT-96, pages 83-90, 1996.
3. J.H. Conway and N.J.A. Sloane. Sphere Packings, Lattices and Groups. Springer-Verlag, London, 1988.
4. B. Dom. MDL estimation with Small Sample Sizes including an application to the problem of segmenting binary strings using bernoulli models. Technical Report RJ 9997 (89085) 12/15/95, IBM Research Division, Almaden Research Center, 650 Harry Rd, San Jose, CA, 95120-6099, 1995.
5. G. Koop and S.M. Potter. Bayes Factors and nonlinearity: Evidence from economic time series. UCLA Working Paper, August 1995, submitted to Journal of Econometrics.
6. Mengxiang Li. Minimum description length based 2-D shape description. In IEEE 4th Int. Gonf. on Computer Vision, pages 512-517, May 1992.
7. Z. Liang, R.J. Jaszczak, and R.E. Coleman. Parameter estimation of finite mixtures using the EM algorithm and information criteria with applications to medical image processing. IEEE Trans. on Nuclear Science, 39(4):1126-1133, 1992.
8. J.J. Oliver and D.J. Hand. Introduction to minimum encoding inference. Technical report TR 4-94, Dept, of Statistics, Open University, Walton Hall, Milton Keynes, MK7 6AA, UK, 1994. Available on the WWW from http://www.cs.monash.edu.au/-jono.
9. J.J. Oliver, Baxter R.A., and Wallace C.S. Unsupervised Learning using MML. In Machine Learning: Proc. of the Thirteenth International Conference (ICML 96), pages 364-372. Morgan Kaufmann Publishers, San Francisco, CA, 1996. Available on the WWW from http://www.cs.monash.edu.au/-jono.
10. B. Pfahringer. Compression-based discretization of continuous attributes. In Machine Learning: Proc. of the Twelfth International Workshop, pages 456-463, 1995.
11. J.R. Quinlan. Improved use of continuous attributes in C4.5. Journal of Artificial Intelligence, 4:77-90, 1996.
12. J. Rissanen. Modeling by shortest data description. Automation, 14:465-471, 1978.
13. G. Schwarz. Estimating dimension of a model. Ann. Stat., 6:461-464, 1978.
14. S.L. Sclove. On segmentation of time series. In S. Karlin, T. Amemiya, and L. Goodman, editors, Studies in econometrics, time series, and multivariate statistics, pages 311-330. Academic Press, 1983.
15. C.W. Therrien. Decision, estimation, and classification: an introduction to pattern recognition and related topics. Wiley, New York, 1989.
16. H. Tong. Non-linear time series: a dynamical system approach. Clarendon Press, Oxford, 1990.
17. C.S. Wallace and D.M. Boulton. An information measure for classification. Computer Journal, 11:185-194, 1968.
18. C.S. Wallace and P.R. Freeman. Estimation and inference by compact coding. Journal of the Royal Statistical Society (Series B), 49:240-252, 1987.