Large graph analysis in the GMine system

Jose F. Rodrigues, Hanghang Tong, Jia Yu Pan, Agma J M Traina, Caetano Traina, Christos Faloutsos

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

Current applications have produced graphs on the order of hundreds of thousands of nodes and millions of edges. To take advantage of such graphs, one must be able to find patterns, outliers, and communities. These tasks are better performed in an interactive environment, where human expertise can guide the process. For large graphs, though, there are some challenges: the excessive processing requirements are prohibitive, and drawing hundred-thousand nodes results in cluttered images hard to comprehend. To cope with these problems, we propose an innovative framework suited for any kind of tree-like graph visual design. GMine integrates 1) a representation for graphs organized as hierarchies of partitions—the concepts of SuperGraph and Graph-Tree; and 2) a graph summarization methodology—CEPS. Our graph representation deals with the problem of tracing the connection aspects of a graph hierarchy with sub linear complexity, allowing one to grasp the neighborhood of a single node or of a group of nodes in a single click. As a proof of concept, the visual environment of GMine is instantiated as a system in which large graphs can be investigated globally and locally.

Original languageEnglish (US)
Article number6025354
Pages (from-to)106-118
Number of pages13
JournalIEEE Transactions on Knowledge and Data Engineering
Volume25
Issue number1
DOIs
StatePublished - 2013
Externally publishedYes

Fingerprint

Processing

Keywords

  • data structures
  • Graph analysis system
  • graph mining
  • graph representation
  • graph visualization

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems
  • Computer Science Applications

Cite this

Rodrigues, J. F., Tong, H., Pan, J. Y., Traina, A. J. M., Traina, C., & Faloutsos, C. (2013). Large graph analysis in the GMine system. IEEE Transactions on Knowledge and Data Engineering, 25(1), 106-118. [6025354]. https://doi.org/10.1109/TKDE.2011.199

Large graph analysis in the GMine system. / Rodrigues, Jose F.; Tong, Hanghang; Pan, Jia Yu; Traina, Agma J M; Traina, Caetano; Faloutsos, Christos.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 25, No. 1, 6025354, 2013, p. 106-118.

Research output: Contribution to journalArticle

Rodrigues, JF, Tong, H, Pan, JY, Traina, AJM, Traina, C & Faloutsos, C 2013, 'Large graph analysis in the GMine system', IEEE Transactions on Knowledge and Data Engineering, vol. 25, no. 1, 6025354, pp. 106-118. https://doi.org/10.1109/TKDE.2011.199
Rodrigues, Jose F. ; Tong, Hanghang ; Pan, Jia Yu ; Traina, Agma J M ; Traina, Caetano ; Faloutsos, Christos. / Large graph analysis in the GMine system. In: IEEE Transactions on Knowledge and Data Engineering. 2013 ; Vol. 25, No. 1. pp. 106-118.
@article{23ef6d6b06b344ce8869d32ddcba1595,
title = "Large graph analysis in the GMine system",
abstract = "Current applications have produced graphs on the order of hundreds of thousands of nodes and millions of edges. To take advantage of such graphs, one must be able to find patterns, outliers, and communities. These tasks are better performed in an interactive environment, where human expertise can guide the process. For large graphs, though, there are some challenges: the excessive processing requirements are prohibitive, and drawing hundred-thousand nodes results in cluttered images hard to comprehend. To cope with these problems, we propose an innovative framework suited for any kind of tree-like graph visual design. GMine integrates 1) a representation for graphs organized as hierarchies of partitions—the concepts of SuperGraph and Graph-Tree; and 2) a graph summarization methodology—CEPS. Our graph representation deals with the problem of tracing the connection aspects of a graph hierarchy with sub linear complexity, allowing one to grasp the neighborhood of a single node or of a group of nodes in a single click. As a proof of concept, the visual environment of GMine is instantiated as a system in which large graphs can be investigated globally and locally.",
keywords = "data structures, Graph analysis system, graph mining, graph representation, graph visualization",
author = "Rodrigues, {Jose F.} and Hanghang Tong and Pan, {Jia Yu} and Traina, {Agma J M} and Caetano Traina and Christos Faloutsos",
year = "2013",
doi = "10.1109/TKDE.2011.199",
language = "English (US)",
volume = "25",
pages = "106--118",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "1",

}

TY - JOUR

T1 - Large graph analysis in the GMine system

AU - Rodrigues, Jose F.

AU - Tong, Hanghang

AU - Pan, Jia Yu

AU - Traina, Agma J M

AU - Traina, Caetano

AU - Faloutsos, Christos

PY - 2013

Y1 - 2013

N2 - Current applications have produced graphs on the order of hundreds of thousands of nodes and millions of edges. To take advantage of such graphs, one must be able to find patterns, outliers, and communities. These tasks are better performed in an interactive environment, where human expertise can guide the process. For large graphs, though, there are some challenges: the excessive processing requirements are prohibitive, and drawing hundred-thousand nodes results in cluttered images hard to comprehend. To cope with these problems, we propose an innovative framework suited for any kind of tree-like graph visual design. GMine integrates 1) a representation for graphs organized as hierarchies of partitions—the concepts of SuperGraph and Graph-Tree; and 2) a graph summarization methodology—CEPS. Our graph representation deals with the problem of tracing the connection aspects of a graph hierarchy with sub linear complexity, allowing one to grasp the neighborhood of a single node or of a group of nodes in a single click. As a proof of concept, the visual environment of GMine is instantiated as a system in which large graphs can be investigated globally and locally.

AB - Current applications have produced graphs on the order of hundreds of thousands of nodes and millions of edges. To take advantage of such graphs, one must be able to find patterns, outliers, and communities. These tasks are better performed in an interactive environment, where human expertise can guide the process. For large graphs, though, there are some challenges: the excessive processing requirements are prohibitive, and drawing hundred-thousand nodes results in cluttered images hard to comprehend. To cope with these problems, we propose an innovative framework suited for any kind of tree-like graph visual design. GMine integrates 1) a representation for graphs organized as hierarchies of partitions—the concepts of SuperGraph and Graph-Tree; and 2) a graph summarization methodology—CEPS. Our graph representation deals with the problem of tracing the connection aspects of a graph hierarchy with sub linear complexity, allowing one to grasp the neighborhood of a single node or of a group of nodes in a single click. As a proof of concept, the visual environment of GMine is instantiated as a system in which large graphs can be investigated globally and locally.

KW - data structures

KW - Graph analysis system

KW - graph mining

KW - graph representation

KW - graph visualization

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

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

U2 - 10.1109/TKDE.2011.199

DO - 10.1109/TKDE.2011.199

M3 - Article

VL - 25

SP - 106

EP - 118

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 1

M1 - 6025354

ER -