Sciweavers

1492 search results - page 2 / 299
» Geometric Clustering Using the Information Bottleneck Method
Sort
View
MM
2006
ACM
108views Multimedia» more  MM 2006»
13 years 11 months ago
Video search reranking via information bottleneck principle
We propose a novel and generic video/image reranking algorithm, IB reranking, which reorders results from text-only searches by discovering the salient visual patterns of relevant...
Winston H. Hsu, Lyndon S. Kennedy, Shih-Fu Chang
ICPR
2006
IEEE
14 years 6 months ago
ICA-Based Clustering for Resolving Permutation Ambiguity in Frequency-Domain Convolutive Source Separation
Permutation ambiguity is an inherent limitation in independent component analysis, which is a bottleneck in frequency-domain methods of convolutive source separation. In this pape...
Minje Kim, Seungjin Choi
SIGIR
2002
ACM
13 years 4 months ago
Unsupervised document classification using sequential information maximization
We present a novel sequential clustering algorithm which is motivated by the Information Bottleneck (IB) method. In contrast to the agglomerative IB algorithm, the new sequential ...
Noam Slonim, Nir Friedman, Naftali Tishby
BMCBI
2006
95views more  BMCBI 2006»
13 years 5 months ago
Discrete profile comparison using information bottleneck
Sequence homologs are an important source of information about proteins. Amino acid profiles, representing the position-specific mutation probabilities found in profiles, are a ri...
Sean O'Rourke, Gal Chechik, Robin Friedman, Eleaza...
KAIS
2007
75views more  KAIS 2007»
13 years 5 months ago
Non-redundant data clustering
Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. In practice this discovery process should avoid redundancies with existi...
David Gondek, Thomas Hofmann