Information bottleneck method

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

Topic mentions per year

Topic mentions per year

1999-2017
051019992017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Document clustering is a subset of the larger field of data clustering, which borrows concepts from the fields of information… (More)
  • figure 1
  • figure 3
Is this relevant?
2010
2010
We present a novel approach to automatically discover object categories from a collection of unlabeled images. This is achieved… (More)
  • table 2
  • table 1
  • table 3
  • figure 1
Is this relevant?
2009
2009
In image processing, segmentation algorithms constitute one of the main focuses of research. In this paper, new image… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
The theoretical basis for a candidate variational principle for the information bottleneck (IB) method is formulated within the… (More)
Is this relevant?
2005
2005
We propose a novel approach to the design of efficient representations of speech for various recognition tasks. Using a… (More)
  • figure 1
  • figure 3
  • table 1
Is this relevant?
2003
2003
We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general… (More)
  • 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… (More)
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… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We define the relevant information in a signal x ∈ X as being the information that this signal provides about another signal y… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We introduce a novel distributional clustering algorithm that explicitly maximizes the mutual information per cluster between the… (More)
  • figure 1
  • figure 2
Is this relevant?