Jump to content

Information bottleneck method

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Commander Keane bot (talk | contribs) at 08:40, 8 April 2006 (Robot-assisted disambiguation link repair (you can help!): Compression). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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