12170 search results - page 36 / 2434 » Ranking Information in Networks |
126
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
Ranking a set of retrieved documents according to their relevance to a query is a popular problem in information retrieval. Methods that learn ranking functions are difficult to o...
253
click to vote
SDM
2011
SIAM
14 years 4 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
126
click to vote
IRAL
2003
ACM
15 years 7 months ago
2003
ACM
In business, the retrieval of up-to-date, or fresh, information is very important. It is difficult for conventional search engines based on a centralized architecture to retrieve ...
120
click to vote
NAACL
2010
14 years 11 months ago
2010
Most learning algorithms for undirected graphical models require complete inference over at least one instance before parameter updates can be made. SampleRank is a rankbased lear...
102
click to vote
WAOA
2007
Springer
15 years 8 months ago
2007
Springer
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...