Abstract

Graphs are used for modeling a large spectrum of data from the web, to social connections between individuals, to concept maps and ontologies. As the number and complexities of graph based applications increase, rendering these graphs more compact, easier to understand, and navigate through are becoming crucial tasks. One approach to graph simplification is to partition the graph into smaller parts, so that instead of the whole graph, the partitions and their inter-connections need to be considered. Common approaches to graph partitioning involve identifying sets of edges (or edge-cuts) or vertices (or vertex-cuts) whose removal partitions the graph into the target number of disconnected components. While edge-cuts result in partitions that are vertex disjoint, in vertex-cuts the data vertices can serve as bridges between the resulting data partitions; consequently, vertex-cut based approaches are especially suitable when the vertices on the vertex-cut will be replicated on all relevant partitions. A significant challenge in vertex-cut based partitioning, however, is ensuring the balance of the resulting partitions while simultaneously minimizing the number of vertices that are cut (and thus replicated). In this paper, we propose a SBV-Cut algorithm which identifies a set of balance vertices that can be used to effectively and efficiently bisect a directed graph. The graph can then be further partitioned by a recursive application of structurally-balanced cuts to obtain a hierarchical partitioning of the graph. Experiments show that SBV-Cut provides better vertex-cut based expansion and modularity scores than its competitors and works several orders more efficiently than constraint-minimization based approaches.

Original languageEnglish (US)
Pages (from-to)285-303
Number of pages19
JournalData and Knowledge Engineering
Volume72
DOIs
StatePublished - Feb 2012

Fingerprint

Graph
Partitioning
Directed graph
Modularity
World Wide Web
Interconnection
Experiment
Competitors
Ontology
Modeling

Keywords

  • Clustering
  • Graph partitioning
  • Mining methods and algorithms
  • Vertex-cut

ASJC Scopus subject areas

  • Information Systems and Management

Cite this

SBV-Cut : Vertex-cut based graph partitioning using structural balance vertices. / Kim, Mijung; Candan, Kasim.

In: Data and Knowledge Engineering, Vol. 72, 02.2012, p. 285-303.

Research output: Contribution to journalArticle

@article{c45bcf60ea5b424aa48cfe8b2378d39a,
title = "SBV-Cut: Vertex-cut based graph partitioning using structural balance vertices",
abstract = "Graphs are used for modeling a large spectrum of data from the web, to social connections between individuals, to concept maps and ontologies. As the number and complexities of graph based applications increase, rendering these graphs more compact, easier to understand, and navigate through are becoming crucial tasks. One approach to graph simplification is to partition the graph into smaller parts, so that instead of the whole graph, the partitions and their inter-connections need to be considered. Common approaches to graph partitioning involve identifying sets of edges (or edge-cuts) or vertices (or vertex-cuts) whose removal partitions the graph into the target number of disconnected components. While edge-cuts result in partitions that are vertex disjoint, in vertex-cuts the data vertices can serve as bridges between the resulting data partitions; consequently, vertex-cut based approaches are especially suitable when the vertices on the vertex-cut will be replicated on all relevant partitions. A significant challenge in vertex-cut based partitioning, however, is ensuring the balance of the resulting partitions while simultaneously minimizing the number of vertices that are cut (and thus replicated). In this paper, we propose a SBV-Cut algorithm which identifies a set of balance vertices that can be used to effectively and efficiently bisect a directed graph. The graph can then be further partitioned by a recursive application of structurally-balanced cuts to obtain a hierarchical partitioning of the graph. Experiments show that SBV-Cut provides better vertex-cut based expansion and modularity scores than its competitors and works several orders more efficiently than constraint-minimization based approaches.",
keywords = "Clustering, Graph partitioning, Mining methods and algorithms, Vertex-cut",
author = "Mijung Kim and Kasim Candan",
year = "2012",
month = "2",
doi = "10.1016/j.datak.2011.11.004",
language = "English (US)",
volume = "72",
pages = "285--303",
journal = "Data and Knowledge Engineering",
issn = "0169-023X",
publisher = "Elsevier",

}

TY - JOUR

T1 - SBV-Cut

T2 - Vertex-cut based graph partitioning using structural balance vertices

AU - Kim, Mijung

AU - Candan, Kasim

PY - 2012/2

Y1 - 2012/2

N2 - Graphs are used for modeling a large spectrum of data from the web, to social connections between individuals, to concept maps and ontologies. As the number and complexities of graph based applications increase, rendering these graphs more compact, easier to understand, and navigate through are becoming crucial tasks. One approach to graph simplification is to partition the graph into smaller parts, so that instead of the whole graph, the partitions and their inter-connections need to be considered. Common approaches to graph partitioning involve identifying sets of edges (or edge-cuts) or vertices (or vertex-cuts) whose removal partitions the graph into the target number of disconnected components. While edge-cuts result in partitions that are vertex disjoint, in vertex-cuts the data vertices can serve as bridges between the resulting data partitions; consequently, vertex-cut based approaches are especially suitable when the vertices on the vertex-cut will be replicated on all relevant partitions. A significant challenge in vertex-cut based partitioning, however, is ensuring the balance of the resulting partitions while simultaneously minimizing the number of vertices that are cut (and thus replicated). In this paper, we propose a SBV-Cut algorithm which identifies a set of balance vertices that can be used to effectively and efficiently bisect a directed graph. The graph can then be further partitioned by a recursive application of structurally-balanced cuts to obtain a hierarchical partitioning of the graph. Experiments show that SBV-Cut provides better vertex-cut based expansion and modularity scores than its competitors and works several orders more efficiently than constraint-minimization based approaches.

AB - Graphs are used for modeling a large spectrum of data from the web, to social connections between individuals, to concept maps and ontologies. As the number and complexities of graph based applications increase, rendering these graphs more compact, easier to understand, and navigate through are becoming crucial tasks. One approach to graph simplification is to partition the graph into smaller parts, so that instead of the whole graph, the partitions and their inter-connections need to be considered. Common approaches to graph partitioning involve identifying sets of edges (or edge-cuts) or vertices (or vertex-cuts) whose removal partitions the graph into the target number of disconnected components. While edge-cuts result in partitions that are vertex disjoint, in vertex-cuts the data vertices can serve as bridges between the resulting data partitions; consequently, vertex-cut based approaches are especially suitable when the vertices on the vertex-cut will be replicated on all relevant partitions. A significant challenge in vertex-cut based partitioning, however, is ensuring the balance of the resulting partitions while simultaneously minimizing the number of vertices that are cut (and thus replicated). In this paper, we propose a SBV-Cut algorithm which identifies a set of balance vertices that can be used to effectively and efficiently bisect a directed graph. The graph can then be further partitioned by a recursive application of structurally-balanced cuts to obtain a hierarchical partitioning of the graph. Experiments show that SBV-Cut provides better vertex-cut based expansion and modularity scores than its competitors and works several orders more efficiently than constraint-minimization based approaches.

KW - Clustering

KW - Graph partitioning

KW - Mining methods and algorithms

KW - Vertex-cut

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

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

U2 - 10.1016/j.datak.2011.11.004

DO - 10.1016/j.datak.2011.11.004

M3 - Article

VL - 72

SP - 285

EP - 303

JO - Data and Knowledge Engineering

JF - Data and Knowledge Engineering

SN - 0169-023X

ER -