Sciweavers

19 search results - page 2 / 4
» Minimum Conditional Entropy Clustering: A Discriminative Fra...
Sort
View
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
14 years 5 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
ICCV
2005
IEEE
14 years 6 months ago
Probabilistic Boosting-Tree: Learning Discriminative Models for Classification, Recognition, and Clustering
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
Zhuowen Tu
NIPS
2004
13 years 6 months ago
Semi-supervised Learning by Entropy Minimization
We consider the semi-supervised learning problem, where a decision rule is to be learned from labeled and unlabeled data. In this framework, we motivate minimum entropy regulariza...
Yves Grandvalet, Yoshua Bengio
ICASSP
2008
IEEE
13 years 11 months ago
A GIS-like training algorithm for log-linear models with hidden variables
Conditional Random Fields (CRFs) are often estimated using an entropy based criterion in combination with Generalized Iterative Scaling (GIS). GIS offers, upon others, the immedi...
Georg Heigold, Thomas Deselaers, Ralf Schlüte...
ICASSP
2011
IEEE
12 years 8 months ago
Linear precoding for time-varying MIMO channels with low-complexity receivers
This paper considers linear precoding for time-varying multipleinput multiple-output (MIMO) channels. We show that linear minimum mean-squared error (LMMSE) equalization based on ...
Jun Tong, Peter J. Schreier, Steven R. Weller, Lou...