Sciweavers

98 search results - page 9 / 20
» Learning Relational Features with Backward Random Walks
Sort
View
CVPR
2012
IEEE
13 years 3 months ago
Submodular dictionary learning for sparse coding
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
Zhuolin Jiang, Guangxiao Zhang, Larry S. Davis
ACL
2012
13 years 3 months ago
Discriminative Pronunciation Modeling: A Large-Margin, Feature-Rich Approach
We address the problem of learning the mapping between words and their possible pronunciations in terms of sub-word units. Most previous approaches have involved generative modeli...
Hao Tang, Joseph Keshet, Karen Livescu
CIKM
2010
Springer
14 years 11 months ago
Discovery of numerous specific topics via term co-occurrence analysis
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...
Omid Madani, Jiye Yu
CIKM
2009
Springer
15 years 8 months ago
A social recommendation framework based on multi-scale continuous conditional random fields
This paper addresses the issue of social recommendation based on collaborative filtering (CF) algorithms. Social recommendation emphasizes utilizing various attributes informatio...
Xin Xin, Irwin King, Hongbo Deng, Michael R. Lyu
KDD
2008
ACM
259views Data Mining» more  KDD 2008»
16 years 1 months ago
Using ghost edges for classification in sparsely labeled networks
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...