587 search results - page 96 / 118 » Clustering Improves the Exploration of Graph Mining Results |
114
click to vote
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
132
click to vote
CISS
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract – In this paper, a variational message passing framework is proposed for Markov random fields. Analogous to the traditional belief propagation algorithm, variational mes...
COLING
2010
14 years 8 months ago
2010
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
123
click to vote
ACL
2012
13 years 3 months ago
2012
In this paper, we address the issue for learning better translation consensus in machine translation (MT) research, and explore the search of translation consensus from similar, r...
129
click to vote
KDD
2005
ACM
16 years 1 months ago
2005
ACM
In this paper, we propose a new way to automatically model and predict human behavior of receiving and disseminating information by analyzing the contact and content of personal c...