2004 search results - page 66 / 401 » Sampling from large graphs |
125
click to vote
IJON
2010
15 years 5 days ago
2010
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
124
click to vote
RSFDGRC
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, a new variant of Bagging named DepenBag is proposed. This algorithm obtains bootstrap samples at first. Then, it employs a causal discoverer to induce from each sam...
128
click to vote
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
125
click to vote
WWW
2008
ACM
16 years 3 months ago
2008
ACM
A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its member...
138
click to vote
SIGIR
2008
ACM
15 years 2 months ago
2008
ACM
This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a ...