Sciweavers

737 search results - page 93 / 148
» A General Model for Multiple View Unsupervised Learning
Sort
View
UAI
2003
13 years 10 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
NIPS
2008
13 years 10 months ago
Stochastic Relational Models for Large-scale Dyadic Data using MCMC
Stochastic relational models (SRMs) [15] provide a rich family of choices for learning and predicting dyadic data between two sets of entities. The models generalize matrix factor...
Shenghuo Zhu, Kai Yu, Yihong Gong
KDD
2008
ACM
121views Data Mining» more  KDD 2008»
14 years 9 months ago
Mining multi-faceted overviews of arbitrary topics in a text collection
A common task in many text mining applications is to generate a multi-faceted overview of a topic in a text collection. Such an overview not only directly serves as an informative...
Xu Ling, Qiaozhu Mei, ChengXiang Zhai, Bruce R. Sc...
GECCO
2007
Springer
214views Optimization» more  GECCO 2007»
14 years 3 months ago
Portfolio allocation using XCS experts in technical analysis, market conditions and options market
Schulenburg [15] first proposed the idea to model different trader types by supplying different input information sets to a group of homogenous LCS agent. Gershoff [12] investigat...
Sor Ying (Byron) Wong, Sonia Schulenburg
NIPS
2004
13 years 10 months ago
The Power of Selective Memory: Self-Bounded Learning of Prediction Suffix Trees
Prediction suffix trees (PST) provide a popular and effective tool for tasks such as compression, classification, and language modeling. In this paper we take a decision theoretic...
Ofer Dekel, Shai Shalev-Shwartz, Yoram Singer