Semi-supervised information-maximization clustering

DOI10.1016/j.neunet.2014.05.016zbMath1325.68207arXiv1304.8020OpenAlexW2170667765WikidataQ51072383 ScholiaQ51072383MaRDI QIDQ889291

Daniele Calandriello, Masashi Sugiyama, Gang Niu

Publication date: 6 November 2015

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.8020

zbMATH Keywords

clusteringsemi-supervisedsquared-loss mutual informationinformation maximization

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Related Items

Triply stochastic gradient method for large-scale nonlinear similar unlabeled classification, Semi-supervised cross-entropy clustering with information bottleneck constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Machine learning with squared-loss mutual information
• Density Ratio Estimation in Machine Learning
• Robust and efficient estimation by minimising a density power divergence
• Sufficient Dimension Reduction via Squared-Loss Mutual Information Estimation
• Information-Maximization Clustering Based on Squared-Loss Mutual Information
• On Information and Sufficiency