Abstract

A graph neighborhood consists of a set of nodes that are nearby or otherwise related to each other. While existing definitions consider the structure (or topology) of the graph, we note that they fail to take into account the information propagation and diffusion characteristics, such as decay and reinforcement, common in many networks. In this paper, we first define the propagation efficiency of nodes and edges. We use this to introduce the novel concept of zero-erasure (or impact) neighborhood (ZEN) of a given node, n, consisting of the set of nodes that receive information from (or are impacted by) n without any decay. Based on this, we present an impact neighborhood indexing (INI) algorithm that creates data structures to help quickly identify impact neighborhood of any given node. Experiment results confirm the efficiency and effectiveness of the proposed INI algorithms.

Original languageEnglish (US)
Title of host publicationACM International Conference Proceeding Series
Pages2184-2188
Number of pages5
DOIs
StatePublished - 2012
Event21st ACM International Conference on Information and Knowledge Management, CIKM 2012 - Maui, HI, United States
Duration: Oct 29 2012Nov 2 2012

Other

Other21st ACM International Conference on Information and Knowledge Management, CIKM 2012
CountryUnited States
CityMaui, HI
Period10/29/1211/2/12

Fingerprint

Data structures
Reinforcement
Topology
Experiments

Keywords

  • graph neighborhood
  • impact propagation
  • indexing

ASJC Scopus subject areas

  • Human-Computer Interaction
  • Computer Networks and Communications
  • Computer Vision and Pattern Recognition
  • Software

Cite this

Kim, J. H., Candan, K., & Sapino, M. L. (2012). Impact neighborhood indexing (INI) in diffusion graphs. In ACM International Conference Proceeding Series (pp. 2184-2188) https://doi.org/10.1145/2396761.2398598

Impact neighborhood indexing (INI) in diffusion graphs. / Kim, Jung Hyun; Candan, Kasim; Sapino, Maria Luisa.

ACM International Conference Proceeding Series. 2012. p. 2184-2188.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kim, JH, Candan, K & Sapino, ML 2012, Impact neighborhood indexing (INI) in diffusion graphs. in ACM International Conference Proceeding Series. pp. 2184-2188, 21st ACM International Conference on Information and Knowledge Management, CIKM 2012, Maui, HI, United States, 10/29/12. https://doi.org/10.1145/2396761.2398598
Kim JH, Candan K, Sapino ML. Impact neighborhood indexing (INI) in diffusion graphs. In ACM International Conference Proceeding Series. 2012. p. 2184-2188 https://doi.org/10.1145/2396761.2398598
Kim, Jung Hyun ; Candan, Kasim ; Sapino, Maria Luisa. / Impact neighborhood indexing (INI) in diffusion graphs. ACM International Conference Proceeding Series. 2012. pp. 2184-2188
@inproceedings{1e6a40152ed94c758872284f082743b1,
title = "Impact neighborhood indexing (INI) in diffusion graphs",
abstract = "A graph neighborhood consists of a set of nodes that are nearby or otherwise related to each other. While existing definitions consider the structure (or topology) of the graph, we note that they fail to take into account the information propagation and diffusion characteristics, such as decay and reinforcement, common in many networks. In this paper, we first define the propagation efficiency of nodes and edges. We use this to introduce the novel concept of zero-erasure (or impact) neighborhood (ZEN) of a given node, n, consisting of the set of nodes that receive information from (or are impacted by) n without any decay. Based on this, we present an impact neighborhood indexing (INI) algorithm that creates data structures to help quickly identify impact neighborhood of any given node. Experiment results confirm the efficiency and effectiveness of the proposed INI algorithms.",
keywords = "graph neighborhood, impact propagation, indexing",
author = "Kim, {Jung Hyun} and Kasim Candan and Sapino, {Maria Luisa}",
year = "2012",
doi = "10.1145/2396761.2398598",
language = "English (US)",
isbn = "9781450311564",
pages = "2184--2188",
booktitle = "ACM International Conference Proceeding Series",

}

TY - GEN

T1 - Impact neighborhood indexing (INI) in diffusion graphs

AU - Kim, Jung Hyun

AU - Candan, Kasim

AU - Sapino, Maria Luisa

PY - 2012

Y1 - 2012

N2 - A graph neighborhood consists of a set of nodes that are nearby or otherwise related to each other. While existing definitions consider the structure (or topology) of the graph, we note that they fail to take into account the information propagation and diffusion characteristics, such as decay and reinforcement, common in many networks. In this paper, we first define the propagation efficiency of nodes and edges. We use this to introduce the novel concept of zero-erasure (or impact) neighborhood (ZEN) of a given node, n, consisting of the set of nodes that receive information from (or are impacted by) n without any decay. Based on this, we present an impact neighborhood indexing (INI) algorithm that creates data structures to help quickly identify impact neighborhood of any given node. Experiment results confirm the efficiency and effectiveness of the proposed INI algorithms.

AB - A graph neighborhood consists of a set of nodes that are nearby or otherwise related to each other. While existing definitions consider the structure (or topology) of the graph, we note that they fail to take into account the information propagation and diffusion characteristics, such as decay and reinforcement, common in many networks. In this paper, we first define the propagation efficiency of nodes and edges. We use this to introduce the novel concept of zero-erasure (or impact) neighborhood (ZEN) of a given node, n, consisting of the set of nodes that receive information from (or are impacted by) n without any decay. Based on this, we present an impact neighborhood indexing (INI) algorithm that creates data structures to help quickly identify impact neighborhood of any given node. Experiment results confirm the efficiency and effectiveness of the proposed INI algorithms.

KW - graph neighborhood

KW - impact propagation

KW - indexing

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

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

U2 - 10.1145/2396761.2398598

DO - 10.1145/2396761.2398598

M3 - Conference contribution

SN - 9781450311564

SP - 2184

EP - 2188

BT - ACM International Conference Proceeding Series

ER -