Sciweavers

2463 search results - page 102 / 493
» Rankings of Directed Graphs
Sort
View
151
Voted
IR
2010
15 years 1 months ago
Learning to rank with (a lot of) word features
In this article we present Supervised Semantic Indexing (SSI) which defines a class of nonlinear (quadratic) models that are discriminatively trained to directly map from the word...
Bing Bai, Jason Weston, David Grangier, Ronan Coll...
PKAW
2010
15 years 1 months ago
Finding Relation between PageRank and Voter Model
Abstract. Estimating influence of a node is an important problem in social network analyses. We address this problem in a particular class of model for opinion propagation in whic...
Takayasu Fushimi, Kazumi Saito, Masahiro Kimura, H...
ECML
2004
Springer
15 years 7 months ago
Naive Bayesian Classifiers for Ranking
It is well-known that naive Bayes performs surprisingly well in classification, but its probability estimation is poor. In many applications, however, a ranking based on class prob...
Harry Zhang, Jiang Su
SIGIR
2008
ACM
15 years 3 months ago
EigenRank: a ranking-oriented approach to collaborative filtering
A recommender system must be able to suggest items that are likely to be preferred by the user. In most systems, the degree of preference is represented by a rating score. Given a...
Nathan Nan Liu, Qiang Yang
DAM
2010
137views more  DAM 2010»
15 years 3 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...