Information bottleneck method: Difference between revisions
Content deleted Content added
No edit summary |
Merovingian (talk | contribs) m wikify |
||
| Line 1: | Line 1: | ||
The information bottleneck method is a technique for finding the best trade-off between accuracy and compression when summarizing (e.g. clustering) a random variable X when given a joint probability distribution between X and an observed variable Y. |
The '''information bottleneck method''' is a technique for finding the best trade-off between [[accuracy]] and [[compression]] when summarizing (e.g. clustering) a random [[variable]] '''X''' when given a joint [[probability distribution]] between '''X''' and an observed variable '''Y'''. |
||
==See Also== |
|||
* [[Information theory]] |
|||
==External Links== |
|||
* [http://citeseer.ist.psu.edu/tishby99information.html Paper by N. Tishby, et. al] |
* [http://citeseer.ist.psu.edu/tishby99information.html Paper by N. Tishby, et. al] |
||
* [[Information_theory]] |
|||
{{msg:stub}} |
{{msg:stub}} |
||
Revision as of 07:49, 28 March 2004
The information bottleneck method is a technique for finding the best trade-off between accuracy and compression when summarizing (e.g. clustering) a random variable X when given a joint probability distribution between X and an observed variable Y.
See Also
External Links