Sciweavers

81 search results - page 2 / 17
» Unsupervised learning on k-partite graphs
Sort
View
ICML
2006
IEEE
16 years 13 days ago
Higher order learning with graphs
Recently there has been considerable interest in learning with higher order relations (i.e., three-way or higher) in the unsupervised and semi-supervised settings. Hypergraphs and...
Sameer Agarwal, Kristin Branson, Serge Belongie
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
16 years 1 days ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...
JMLR
2010
144views more  JMLR 2010»
14 years 6 months ago
Maximum Margin Learning with Incomplete Data: Learning Networks instead of Tables
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
Sándor Szedmák, Yizhao Ni, Steve R. ...
COLING
2010
14 years 6 months ago
Sentiment Translation through Multi-Edge Graphs
Sentiment analysis systems can benefit from the translation of sentiment information. We present a novel, graph-based approach using SimRank, a well-established graph-theoretic al...
Christian Scheible, Florian Laws, Lukas Michelbach...
TIT
2008
224views more  TIT 2008»
14 years 11 months ago
Graph-Based Semi-Supervised Learning and Spectral Kernel Design
We consider a framework for semi-supervised learning using spectral decomposition-based unsupervised kernel design. We relate this approach to previously proposed semi-supervised l...
Rie Johnson, Tong Zhang