RoundTripRank: Graph-based Proximity with Importance and Specificity

RoundTripRank: Graph-based Proximity with Importance and Specificity

Graph-based proximity has many applications with different ranking needs. However, most previous works only stress the sense of importance by finding "popular” results for a query. Often times important results are overly general without being well-tailored to the query, lacking a sense of spec...

Full description

Saved in:
Bibliographic Details
Main Authors: FANG, Yuan, CHANG, Kevin Chen-Chuan, LAUW, Hady W.
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2013
Subjects:
Queries
specificity
graphs
random walk
round trip
algorithms
ranking tasks
Databases and Information Systems
Numerical Analysis and Scientific Computing
Online Access:https://ink.library.smu.edu.sg/sis_research/1715
https://ink.library.smu.edu.sg/context/sis_research/article/2714/viewcontent/Lauw2013ICDERoundTripRank.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

https://ink.library.smu.edu.sg/sis_research/1715
https://ink.library.smu.edu.sg/context/sis_research/article/2714/viewcontent/Lauw2013ICDERoundTripRank.pdf

Similar Items