Seeing red

Locating people of interest in networks

Pivithuru Wijegunawardana, Vatsal Ojha, Ralucca Gera, Sucheta Soundarajan

Research output: Chapter in Book/Report/Conference proceedingChapter

4 Citations (Scopus)

Abstract

The focus of the current research is to identify people of interest in social networks. We are especially interested in studying dark networks, which represent illegal or covert activity. In such networks, people are unlikely to disclose accurate information when queried. We present RedLearn, an algorithm for sampling dark networks with the goal of identifying as many nodes of interest as possible. We consider two realistic lying scenarios, which describe how individuals in a dark network may attempt to conceal their connections. We test and present our results on several real-world multilayered networks, and show that RedLearn achieves up to a 340% improvement over the next best strategy.

Original languageEnglish (US)
Title of host publicationSpringer Proceedings in Complexity
PublisherSpringer
Pages141-150
Number of pages10
VolumePart F2
DOIs
StatePublished - Jan 1 2017

Fingerprint

Sampling
Social Networks
Scenarios
Vertex of a graph

Keywords

  • Lying scenarios
  • Multilayered networks
  • Nodes of interest
  • Sampling

ASJC Scopus subject areas

  • Applied Mathematics
  • Modeling and Simulation
  • Computer Science Applications

Cite this

Wijegunawardana, P., Ojha, V., Gera, R., & Soundarajan, S. (2017). Seeing red: Locating people of interest in networks. In Springer Proceedings in Complexity (Vol. Part F2, pp. 141-150). Springer. https://doi.org/10.1007/978-3-319-54241-6_12

Seeing red : Locating people of interest in networks. / Wijegunawardana, Pivithuru; Ojha, Vatsal; Gera, Ralucca; Soundarajan, Sucheta.

Springer Proceedings in Complexity. Vol. Part F2 Springer, 2017. p. 141-150.

Research output: Chapter in Book/Report/Conference proceedingChapter

Wijegunawardana, P, Ojha, V, Gera, R & Soundarajan, S 2017, Seeing red: Locating people of interest in networks. in Springer Proceedings in Complexity. vol. Part F2, Springer, pp. 141-150. https://doi.org/10.1007/978-3-319-54241-6_12
Wijegunawardana P, Ojha V, Gera R, Soundarajan S. Seeing red: Locating people of interest in networks. In Springer Proceedings in Complexity. Vol. Part F2. Springer. 2017. p. 141-150 https://doi.org/10.1007/978-3-319-54241-6_12
Wijegunawardana, Pivithuru ; Ojha, Vatsal ; Gera, Ralucca ; Soundarajan, Sucheta. / Seeing red : Locating people of interest in networks. Springer Proceedings in Complexity. Vol. Part F2 Springer, 2017. pp. 141-150
@inbook{228e1371f09b4fc4a07f9fdf46777db9,
title = "Seeing red: Locating people of interest in networks",
abstract = "The focus of the current research is to identify people of interest in social networks. We are especially interested in studying dark networks, which represent illegal or covert activity. In such networks, people are unlikely to disclose accurate information when queried. We present RedLearn, an algorithm for sampling dark networks with the goal of identifying as many nodes of interest as possible. We consider two realistic lying scenarios, which describe how individuals in a dark network may attempt to conceal their connections. We test and present our results on several real-world multilayered networks, and show that RedLearn achieves up to a 340{\%} improvement over the next best strategy.",
keywords = "Lying scenarios, Multilayered networks, Nodes of interest, Sampling",
author = "Pivithuru Wijegunawardana and Vatsal Ojha and Ralucca Gera and Sucheta Soundarajan",
year = "2017",
month = "1",
day = "1",
doi = "10.1007/978-3-319-54241-6_12",
language = "English (US)",
volume = "Part F2",
pages = "141--150",
booktitle = "Springer Proceedings in Complexity",
publisher = "Springer",

}

TY - CHAP

T1 - Seeing red

T2 - Locating people of interest in networks

AU - Wijegunawardana, Pivithuru

AU - Ojha, Vatsal

AU - Gera, Ralucca

AU - Soundarajan, Sucheta

PY - 2017/1/1

Y1 - 2017/1/1

N2 - The focus of the current research is to identify people of interest in social networks. We are especially interested in studying dark networks, which represent illegal or covert activity. In such networks, people are unlikely to disclose accurate information when queried. We present RedLearn, an algorithm for sampling dark networks with the goal of identifying as many nodes of interest as possible. We consider two realistic lying scenarios, which describe how individuals in a dark network may attempt to conceal their connections. We test and present our results on several real-world multilayered networks, and show that RedLearn achieves up to a 340% improvement over the next best strategy.

AB - The focus of the current research is to identify people of interest in social networks. We are especially interested in studying dark networks, which represent illegal or covert activity. In such networks, people are unlikely to disclose accurate information when queried. We present RedLearn, an algorithm for sampling dark networks with the goal of identifying as many nodes of interest as possible. We consider two realistic lying scenarios, which describe how individuals in a dark network may attempt to conceal their connections. We test and present our results on several real-world multilayered networks, and show that RedLearn achieves up to a 340% improvement over the next best strategy.

KW - Lying scenarios

KW - Multilayered networks

KW - Nodes of interest

KW - Sampling

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

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

U2 - 10.1007/978-3-319-54241-6_12

DO - 10.1007/978-3-319-54241-6_12

M3 - Chapter

VL - Part F2

SP - 141

EP - 150

BT - Springer Proceedings in Complexity

PB - Springer

ER -