28 search results - page 2 / 6 » Local Graph Partitions for Approximation and Testing |
JMLR
2012
11 years 8 months ago
2012
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
ICTAI
2010
IEEE
13 years 3 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
KDD
2007
ACM
14 years 6 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
EVOW
2004
Springer
13 years 11 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
INFOCOM
2008
IEEE
14 years 1 days ago
2008
IEEE
—The problem of minimum cost in-network fusion of measurements, collected from distributed sensors via multihop routing is considered. A designated fusion center performs an opti...