BiRank: Towards Ranking on Bipartite Graphs.

IEEE Transactions on Knowledge and Data Engineering(2017)

引用 183|浏览121
暂无评分
摘要
The bipartite graph is a ubiquitous data structure that can model the relationship between two entity types: for instance, users and items, queries and webpages. In this paper, we study the problem of ranking vertices of a bipartite graph, based on the graph's link structure as well as prior information about vertices (which we term a query vector). We present a new solution, BiRank, which iterati...
更多
查看译文
关键词
Bipartite graph,Bayes methods,Electronic mail,Kernel,Data models,Bridges,Probabilistic logic
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要