Results 251 to 260 of about 24,894,856 (287)
Some of the next articles are maybe not open access.
Coarsely Quantized Layered Decoding Using the Information Bottleneck Method
ICC 2021 - IEEE International Conference on Communications, 2021In recent years coarsely quantized LDPC decoding using a flooding schedule has been extensively studied. However, there exist few works addressing coarse quantization for a layered schedule, which enables improved convergence speed of the message passing algorithm.
Philipp Mohr +3 more
openaire +1 more source
Polar code construction using the information bottleneck method
2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW), 2018The provably capacity-achieving error-correction capability of polar codes prospered huge interest in academia and industry. The explicit structure of polar codes leads to a different notion of code construction which refers to the assignment of information bits to certain positions in that structure instead of the design of the structure itself. State-
Maximilian Stark +2 more
openaire +1 more source
Determine the Optimal Parameter for Information Bottleneck Method
2006A natural question in Information Bottleneck method is how many "groups" are appropriate. The dependency on prior knowledge restricts the applications of many Information Bottleneck algorithms. In this paper we aim to remove this dependency by formulating the parameter choosing as a model selection problem, and solve it using the minimum message length
Gang Li 0009 +3 more
openaire +2 more sources
Unsupervised Image Clustering Using the Information Bottleneck Method
2002A new method for unsupervised image category clustering is presented, based on a continuous version of a recently introduced information theoretic principle, the information bottleneck (IB). The clustering method is based on hierarchical grouping: Utilizing a Gaussian mixture model, each image in a given archive is first represented as a set of ...
Jacob Goldberger +2 more
openaire +1 more source
Finding the Optimal Cardinality Value for Information Bottleneck Method
2006Information Bottleneck method can be used as a dimensionality reduction approach by grouping “similar” features together [1]. In application, a natural question is how many “features groups” will be appropriate. The dependency on prior knowledge restricts the applications of many Information Bottleneck algorithms.
Gang Li 0009 +3 more
openaire +1 more source
Unsupervised video categorization based on multivariate information bottleneck method
Knowledge-Based Systems, 2015Novel multivariate IB model is proposed for unsupervised video categorization.Effective solution is designed to integrate multiple features simultaneously.Information-theoretic optimization is constructed to alleviate the semantic gap. The integration of multiple features is important for action categorization and object recognition in videos, because ...
Xiaoqiang Yan +2 more
openaire +1 more source
Cross-Modal Clustering With Deep Correlated Information Bottleneck Method
IEEE Transactions on Neural Networks and Learning SystemsCross-modal clustering (CMC) intends to improve the clustering accuracy (ACC) by exploiting the correlations across modalities. Although recent research has made impressive advances, it remains a challenge to sufficiently capture the correlations across modalities due to the high-dimensional nonlinear characteristics of individual modalities and the ...
Xiaoqiang Yan +3 more
openaire +2 more sources
A Novel Approach to Distributed Quantization via Multivariate Information Bottleneck Method
2019 IEEE Global Communications Conference (GLOBECOM), 2019Consider following setup: A number of observations from a data source shall be compressed jointly prior to a forward transmission via several rate- limited links to a central processing unit. To design the respective quantizers, here, Mutual Information is chosen as the fidelity criterion and the broad-ranging structure of Multivariate Information ...
Shayan Hassanpour +2 more
openaire +1 more source
Document clustering using word clusters via the information bottleneck method
Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval, 2000We present a novel implementation of the recently introduced information bottleneck method for unsupervised document clustering. Given a joint empirical distribution of words and documents, p(x, y), we first cluster the words, Y, so that the obtained word clusters, Ytilde;, maximally preserve the information on the documents.
Noam Slonim, Naftali Tishby
openaire +1 more source
Application of the Information Bottleneck method to discover user profiles in a Web store
Journal of Organizational Computing and Electronic Commerce, 2018The paper deals with the problem of discovering groups of Web users with similar behavioral patterns on an e-commerce site.
Jacek Iwanski +2 more
openaire +1 more source