A tutorial introduction to the minimum description length principle

by Peter Grünwald
Venue:in Advances in Minimum Description Length: Theory and Applications. 2005
Citations:58 - 0 self

Documents Related by Co-Citation

1151 Modeling by shortest data description – J Rissanen - 1978
1909 Pattern classification – R O Duda, P E Hart, D G Stork - 2001
122 Towards parameter-free data mining – Eamonn Keogh, Stefano Lonardi, Chotirat Ann Ratanamahatana - 2004
33 An MDL Framework for Data Clustering – Petri Kontkanen, Petri Myllymäki, Wray Buntine, Jorma Rissanen, Henry Tirri - 2004
305 The minimum description length principle in coding and modeling – Andrew Barron, Jorma Rissanen, Senior Member, Bin Yu, Senior Member - 1998
8569 Elements of Information Theory – T M Cover, J A Thomas - 1991
64 Fully automatic cross-associations – Deepayan Chakrabarti, Spiros Papadimitriou, Dharmendra S. Modha, Christos Faloutsos - 2004
32 Kolmogorov’s structure functions and model selection – Nikolai Vereshchagin, Paul Vitányi
9 Langdon Jr. Arithmetic coding – J Rissanen, G G - 1979
249 Information-Theoretic Co-Clustering – Inderjit S. Dhillon, Subramanyam Mallela, Dharmendra S. Modha - 2003
562 CURE: An Efficient Clustering Algorithm for Large Data sets – Sudipto Guha, Rajeev Rastogi, Kyuseok Shim - 1998
141 Chameleon: Hierarchical Clustering Using Dynamic Modeling – G Karypis, E H Han, V Kumar - 1999
434 BIRCH: an efficient data clustering method for very large databases – Tian Zhang, Raghu Ramakrishnan, Miron Livny - 1996
2 DBACL at the TREC 2005 – L A Breyer - 2005
3 A TREC along the spam track with SpamBayes – T A Meyer - 2005
5 CRM114 versus Mr. X: CRM114 notes for the TREC 2005 spam track – Fidelis Assis, William Yerazunis, Christian Siefkes, Shalendra Chhabra - 2005
8 Stopping spam – J Goodman, D Heckerman, R Rounthwaite - 2005
10 Hackers & Painters: Big ideas from the computer age – P Graham - 2004
33 TREC 2005 Spam Track Overview – Gordon Cormack, Thomas Lynam - 2005