Fast Query Execution for Retrieval Models Based on Path-Constrained Random Walks thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Fast Query Execution for Retrieval Models Based on Path-Constrained Random Walks

Published on Oct 01, 20103036 Views

Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labeled edges representin

Related categories