Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Information bottleneck method

The information bottleneck method is a technique in information theory introduced by Naftali Tishby, Fernando C. Pereira, and William Bialek. for… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We explore the visual recognition problem from a main data view when an auxiliary data view is available during training. This is… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2015
2015
We utilize the Information Bottleneck method in a discrete density evolution scheme that was introduced by Brian M. Kurkoski et… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
This paper synthesizes a recent line of work on automated predictive model making inspired by Rate-Distortion theory, in… Expand
Is this relevant?
Highly Cited
2010
Highly Cited
2010
The Information Bottleneck is an information theoretic framework that finds concise representations for an 'input' random… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
It is well-known that the information bottleneck method and rate distortion theory are related. Here it is described how the… Expand
Is this relevant?
2003
2003
We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We present a novel implementation of the recently introduced information bottleneck method for unsupervised document clustering… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We introduce a new, non-parametric and principled, distance based clustering method. This method combines a pairwise based… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We define the relevant information in a signal $x\in X$ as being the information that this signal provides about another signal… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We introduce a novel distributional clustering algorithm that maximizes the mutual information per cluster between data and given… Expand
  • figure 1
  • figure 2
Is this relevant?