Sciweavers

2463 search results - page 29 / 493
» Rankings of Directed Graphs
Sort
View
AAAI
2006
13 years 9 months ago
Improved Bounds for Computing Kemeny Rankings
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
11 years 10 months ago
Fast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
U. Kang, Hanghang Tong, Jimeng Sun
CVPR
2012
IEEE
11 years 10 months ago
Non-negative low rank and sparse graph for semi-supervised learning
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
Liansheng Zhuang, Haoyuan Gao, Zhouchen Lin, Yi Ma...

Book
1197views
15 years 5 months ago
Graph Theory with Applications
A classic book on graph theory.
J.A. Bondy and U.S.R. Murty
IWOCA
2009
Springer
152views Algorithms» more  IWOCA 2009»
14 years 2 months ago
Better Polynomial Algorithms on Graphs of Bounded Rank-Width
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
Robert Ganian, Petr Hlinený