2015
DOI: 10.7838/jsebs.2015.20.2.155
|View full text |Cite
|
Sign up to set email alerts
|

Fast Random Walk with Restart over a Signed Graph

Abstract: RWR (Random Walk with Restart) is frequently used by many graph-based ranking algorithms, but it does not consider a signed graph where edges may have negative weight values. In this paper, we apply the Balance Theory by F. Heider to RWR over a signed graph and propose a novel RWR, Balanced Random Walk (BRW). We apply the proposed technique into the domain of recommendation system, and show by experiments its effectiveness to filter out the items that users may dislike. In order to provide the reasonable perfo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 10 publications
(9 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?