Information bottleneck method: Difference between revisions

Content deleted Content added

Inline

Revision as of 23:00, 5 June 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.

This article is a stub. You can help Wikipedia by expanding it.

Revision as of 04:04, 31 March 2004 edit VladShchogolev (talk \| contribs) 23 edits mNo edit summary ← Previous edit		Revision as of 23:00, 5 June 2004 edit undo Hike395 (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers, Template editors 98,241 edits m dab clustering Next edit →
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. [[data clustering\|clustering]]) a [[random variable]] '''X''' when given a joint [[probability distribution]] between '''X''' and an observed variable '''Y'''.

	==See Also==		==See Also==