An Information-Theoretic Analysis of Hard and Soft Assignment Methods for Clustering-Reference-Cited by-同舟云学术

An Information-Theoretic Analysis of Hard and Soft Assignment Methods for Clustering

Published:1998 Issue: Volume: Page:495-520
ISSN:
Container-title:Learning in Graphical Models
language:
Short-container-title:

Author:

Kearns Michael,Mansour Yishay,Ng Andrew Y.

Publisher

Springer Netherlands

Link

http://link.springer.com/content/pdf/10.1007/978-94-011-5014-9_18

Reference8 articles.

1. T.M. Cover and J.A. Thomas. Elements of Information Theory. Wiley-Interscience, 1991.

2. A.P. Dempster, N.M. Laird, and D.B. Rubin. Maximum-likelihood from incomplete data ia the em algorithm. Journal of the Royal Statistical Society B, 39: 1–39, 1977.

3. R.O. Duda and P.E. Hart. Pattern Classification and Scene Analysis. John Wiley andSons, 1973.

4. A. Gersho. On the structure of vector quantizers. IEEE Transactions on Information Theory, 28 (2): 157–166, 1982.

5. J. Hertz, A. Krogh, and R.G. Palmer. Introduction to the Theory of Neural Computation. Addison-Wesley, 1991.

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improvement and generalization of ABCD method with Bayesian inference;SciPost Physics Core;2024-07-15

2. Hardness and Approximability of Dimension Reduction on the Probability Simplex;Algorithms;2024-07-06

3. Exploring automated Feature Selection for Model-based and Density-based clustering with application to NCI 60 data;2024-04-26

4. Do we really need dice? The hidden region-size biases of segmentation losses;Medical Image Analysis;2024-01

5. Fuzzy Granular-Balls Based Spectral Clustering;Lecture Notes in Computer Science;2024