Sciweavers

95 search results - page 6 / 19
» Graph summarization with bounded error
Sort
View
COLT
2004
Springer
14 years 26 days ago
Regularization and Semi-supervised Learning on Large Graphs
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
Mikhail Belkin, Irina Matveeva, Partha Niyogi
NAACL
2007
13 years 9 months ago
Randomized Decoding for Selection-and-Ordering Problems
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
Pawan Deshpande, Regina Barzilay, David R. Karger
INFOVIS
2002
IEEE
14 years 11 days ago
Visualizing Data with Bounded Uncertainty
Visualization is a powerful way to facilitate data analysis, but it is crucial that visualization systems explicitly convey the presence, nature, and degree of uncertainty to user...
Chris Olston, Jock D. Mackinlay
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
14 years 7 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira
JMLR
2010
159views more  JMLR 2010»
13 years 2 months ago
Semi-Supervised Learning with Max-Margin Graph Cuts
This paper proposes a novel algorithm for semisupervised learning. This algorithm learns graph cuts that maximize the margin with respect to the labels induced by the harmonic fun...
Branislav Kveton, Michal Valko, Ali Rahimi, Ling H...