Pairwise trust inference by subgraph extraction

Yuan Yao, Hanghang Tong, Feng Xu, Jian Lu

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Inferring pairwise trustworthiness is a core building block behind many real applications, e.g., e-commence, p2p networks, mobile ad hoc network, etc. Most of the existing inference algorithms suffer from the scalability and usability issues due to the large scale of the underlying social networks. In this paper, we propose subgraph extraction to address these challenges. The core of the proposed method consists of two stages: path selection and component induction. The path selection stage is flexible and it admits many of existing top-k path extraction algorithms. We propose two evolutionary algorithms for component induction stage. Our method has two main advantages. First, the outputs of both stages can be used as an intermediate step to speed up a variety of existing trust inference algorithms. Second, it improves the usability of the trust inference result by presenting an intuitive subgraph that concisely summarizes how the trustworthiness score is calculated. The extensive experimental evaluations on real datasets demonstrate the effectiveness and efficiency of the proposed method.

Original languageEnglish (US)
Pages (from-to)953-968
Number of pages16
JournalSocial Network Analysis and Mining
Volume3
Issue number4
DOIs
StatePublished - Jan 1 2013
Externally publishedYes

Fingerprint

trustworthiness
induction
Mobile ad hoc networks
Evolutionary algorithms
Scalability
social network
efficiency
evaluation

Keywords

  • Component induction
  • Pairwise trustworthiness
  • Path selection
  • Social network
  • Subgraph extraction
  • Trust inference

ASJC Scopus subject areas

  • Computer Science Applications
  • Human-Computer Interaction
  • Information Systems
  • Communication
  • Media Technology

Cite this

Pairwise trust inference by subgraph extraction. / Yao, Yuan; Tong, Hanghang; Xu, Feng; Lu, Jian.

In: Social Network Analysis and Mining, Vol. 3, No. 4, 01.01.2013, p. 953-968.

Research output: Contribution to journalArticle

Yao, Yuan ; Tong, Hanghang ; Xu, Feng ; Lu, Jian. / Pairwise trust inference by subgraph extraction. In: Social Network Analysis and Mining. 2013 ; Vol. 3, No. 4. pp. 953-968.
@article{fb582fb19eaf425e9fa714982e8fb7d0,
title = "Pairwise trust inference by subgraph extraction",
abstract = "Inferring pairwise trustworthiness is a core building block behind many real applications, e.g., e-commence, p2p networks, mobile ad hoc network, etc. Most of the existing inference algorithms suffer from the scalability and usability issues due to the large scale of the underlying social networks. In this paper, we propose subgraph extraction to address these challenges. The core of the proposed method consists of two stages: path selection and component induction. The path selection stage is flexible and it admits many of existing top-k path extraction algorithms. We propose two evolutionary algorithms for component induction stage. Our method has two main advantages. First, the outputs of both stages can be used as an intermediate step to speed up a variety of existing trust inference algorithms. Second, it improves the usability of the trust inference result by presenting an intuitive subgraph that concisely summarizes how the trustworthiness score is calculated. The extensive experimental evaluations on real datasets demonstrate the effectiveness and efficiency of the proposed method.",
keywords = "Component induction, Pairwise trustworthiness, Path selection, Social network, Subgraph extraction, Trust inference",
author = "Yuan Yao and Hanghang Tong and Feng Xu and Jian Lu",
year = "2013",
month = "1",
day = "1",
doi = "10.1007/s13278-013-0140-x",
language = "English (US)",
volume = "3",
pages = "953--968",
journal = "Social Network Analysis and Mining",
issn = "1869-5450",
publisher = "Springer Wien",
number = "4",

}

TY - JOUR

T1 - Pairwise trust inference by subgraph extraction

AU - Yao, Yuan

AU - Tong, Hanghang

AU - Xu, Feng

AU - Lu, Jian

PY - 2013/1/1

Y1 - 2013/1/1

N2 - Inferring pairwise trustworthiness is a core building block behind many real applications, e.g., e-commence, p2p networks, mobile ad hoc network, etc. Most of the existing inference algorithms suffer from the scalability and usability issues due to the large scale of the underlying social networks. In this paper, we propose subgraph extraction to address these challenges. The core of the proposed method consists of two stages: path selection and component induction. The path selection stage is flexible and it admits many of existing top-k path extraction algorithms. We propose two evolutionary algorithms for component induction stage. Our method has two main advantages. First, the outputs of both stages can be used as an intermediate step to speed up a variety of existing trust inference algorithms. Second, it improves the usability of the trust inference result by presenting an intuitive subgraph that concisely summarizes how the trustworthiness score is calculated. The extensive experimental evaluations on real datasets demonstrate the effectiveness and efficiency of the proposed method.

AB - Inferring pairwise trustworthiness is a core building block behind many real applications, e.g., e-commence, p2p networks, mobile ad hoc network, etc. Most of the existing inference algorithms suffer from the scalability and usability issues due to the large scale of the underlying social networks. In this paper, we propose subgraph extraction to address these challenges. The core of the proposed method consists of two stages: path selection and component induction. The path selection stage is flexible and it admits many of existing top-k path extraction algorithms. We propose two evolutionary algorithms for component induction stage. Our method has two main advantages. First, the outputs of both stages can be used as an intermediate step to speed up a variety of existing trust inference algorithms. Second, it improves the usability of the trust inference result by presenting an intuitive subgraph that concisely summarizes how the trustworthiness score is calculated. The extensive experimental evaluations on real datasets demonstrate the effectiveness and efficiency of the proposed method.

KW - Component induction

KW - Pairwise trustworthiness

KW - Path selection

KW - Social network

KW - Subgraph extraction

KW - Trust inference

UR - http://www.scopus.com/inward/record.url?scp=84947267773&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947267773&partnerID=8YFLogxK

U2 - 10.1007/s13278-013-0140-x

DO - 10.1007/s13278-013-0140-x

M3 - Article

AN - SCOPUS:84947267773

VL - 3

SP - 953

EP - 968

JO - Social Network Analysis and Mining

JF - Social Network Analysis and Mining

SN - 1869-5450

IS - 4

ER -