Finding Top‐k Answers in Node Proximity Search Using Distribution State Transition Graph. Issue 4 (1st August 2016)

• Record Type: Journal Article
• Authors: Park, Jaehui; Lee, Sang‐Goo
• Is Part Of: ETRI journal. Volume 38:Issue 4(2016)
• Page Start: 714
• Page End: 723
• Publication Date: 2016-08-01
• Subjects: Personalized PageRank -- Top‐k Node Proximity Search -- Path Selection Algorithm -- Distribution State Transition Graph -- Graph Search; Telecommunication -- Periodicals; Electronics -- Periodicals; Electronics; Telecommunication; Periodicals; Periodicals; 621.38205
• DOI: 10.4218/etrij.16.0115.0229
• Languages: English
• ISSNs: 1225-6463

Abstract

Abstract : Considerable attention has been given to processing graph data in recent years. An efficient method for computing the node proximity is one of the most challenging problems for many applications such as recommendation systems and social networks. Regarding large‐scale, mutable datasets and user queries, top‐ k query processing has gained significant interest. This paper presents a novel method to find top‐ k answers in a node proximity search based on the well‐known measure, Personalized PageRank (PPR). First, we introduce a distribution state transition graph (DSTG) to depict iterative steps for solving the PPR equation. Second, we propose a weight distribution model of a DSTG to capture the states of intermediate PPR scores and their distribution. Using a DSTG, we can selectively follow and compare multiple random paths with different lengths to find the most promising nodes. Moreover, we prove that the results of our method are equivalent to the PPR results. Comparative performance studies using two real datasets clearly show that our method is practical and accurate.