Maximum Likelihood and the Information Bottleneck
暂无分享,去创建一个
[1] D. Rubin,et al. Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .
[2] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[3] Ken Lang,et al. NewsWeeder: Learning to Filter Netnews , 1995, ICML.
[4] Thomas Hofmann,et al. Learning from Dyadic Data , 1998, NIPS.
[5] Geoffrey E. Hinton,et al. A View of the Em Algorithm that Justifies Incremental, Sparse, and other Variants , 1998, Learning in Graphical Models.
[6] Emanuele Trucco,et al. Robust motion and correspondence of noisy 3-D point sets with missing data , 1999, Pattern Recognit. Lett..
[7] Joachim M. Buhmann,et al. Histogram clustering for unsupervised segmentation and image retrieval , 1999, Pattern Recognit. Lett..
[8] Naftali Tishby,et al. The information bottleneck method , 2000, ArXiv.
[9] Naftali Tishby,et al. Unsupervised document classification using sequential information maximization , 2002, SIGIR '02.
[10] Joachim M. Buhmann,et al. Parametric Distributional Clustering for Image Segmentation , 2002, ECCV.
[11] A. ADoefaa,et al. ? ? ? ? f ? ? ? ? ? , 2003 .