Sigcon: Simplifying a Graph Based on Degree Correlation and Clustering Coefficient

Hojin Jung, Songkuk Kim

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

Abstract

Depicting a complex system like social networks as a graph helps understand its structure and relation. As advances in technology increase the amount of data, simplifying a large-scale graph has attracted interests. Simplification reduces the size of a graph while preserving its important properties. In this paper, we propose the summarization algorithm to simplify a graph focusing on degree correlation and clustering coefficient. The degree correlation is a measure to assess the influence of each vertex and their connections. The clustering coefficient estimates latent connections between two distinct vertices. To this end, we first separate a graph into communities. Looking at groups instead of a graph itself allows us to extract important vertices and edges more easily. We then categorize communities into four cases and simplify them in different ways to preserve the innate characteristics. The quantitative and qualitative evaluations demonstrate how effectively our algorithm serves the goal. Overall, our contributions are as follows: (a) unique pattern: We found that hubs are connected indirectly via low-degree vertices. Sigcon preserves these vertices during simplification. (b) efficient algorithm: Sigcon identifies influential vertices and edges to simplify a graph on the basis of degree correlation and clustering coefficient connecting vertices effectively.

Original languageEnglish
Title of host publicationProceedings - 2017 IEEE 19th Intl Conference on High Performance Computing and Communications, HPCC 2017, 2017 IEEE 15th Intl Conference on Smart City, SmartCity 2017 and 2017 IEEE 3rd Intl Conference on Data Science and Systems, DSS 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages372-379
Number of pages8
ISBN (Electronic)9781538625880
DOIs
Publication statusPublished - 2018 Feb 14
Event19th IEEE Intl Conference on High Performance Computing and Communications, 15th IEEE Intl Conference on Smart City, and 3rd IEEE Intl Conference on Data Science and Systems, HPCC/SmartCity/DSS 2017 - Bangkok, Thailand
Duration: 2017 Dec 182017 Dec 20

Publication series

NameProceedings - 2017 IEEE 19th Intl Conference on High Performance Computing and Communications, HPCC 2017, 2017 IEEE 15th Intl Conference on Smart City, SmartCity 2017 and 2017 IEEE 3rd Intl Conference on Data Science and Systems, DSS 2017
Volume2018-January

Other

Other19th IEEE Intl Conference on High Performance Computing and Communications, 15th IEEE Intl Conference on Smart City, and 3rd IEEE Intl Conference on Data Science and Systems, HPCC/SmartCity/DSS 2017
CountryThailand
CityBangkok
Period17/12/1817/12/20

Fingerprint

Large scale systems

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Hardware and Architecture
  • Computer Science Applications
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Software

Cite this

Jung, H., & Kim, S. (2018). Sigcon: Simplifying a Graph Based on Degree Correlation and Clustering Coefficient. In Proceedings - 2017 IEEE 19th Intl Conference on High Performance Computing and Communications, HPCC 2017, 2017 IEEE 15th Intl Conference on Smart City, SmartCity 2017 and 2017 IEEE 3rd Intl Conference on Data Science and Systems, DSS 2017 (pp. 372-379). (Proceedings - 2017 IEEE 19th Intl Conference on High Performance Computing and Communications, HPCC 2017, 2017 IEEE 15th Intl Conference on Smart City, SmartCity 2017 and 2017 IEEE 3rd Intl Conference on Data Science and Systems, DSS 2017; Vol. 2018-January). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/HPCC-SmartCity-DSS.2017.49
Jung, Hojin ; Kim, Songkuk. / Sigcon : Simplifying a Graph Based on Degree Correlation and Clustering Coefficient. Proceedings - 2017 IEEE 19th Intl Conference on High Performance Computing and Communications, HPCC 2017, 2017 IEEE 15th Intl Conference on Smart City, SmartCity 2017 and 2017 IEEE 3rd Intl Conference on Data Science and Systems, DSS 2017. Institute of Electrical and Electronics Engineers Inc., 2018. pp. 372-379 (Proceedings - 2017 IEEE 19th Intl Conference on High Performance Computing and Communications, HPCC 2017, 2017 IEEE 15th Intl Conference on Smart City, SmartCity 2017 and 2017 IEEE 3rd Intl Conference on Data Science and Systems, DSS 2017).
@inproceedings{894a021c09f049fd92c52accaf9bbf5e,
title = "Sigcon: Simplifying a Graph Based on Degree Correlation and Clustering Coefficient",
abstract = "Depicting a complex system like social networks as a graph helps understand its structure and relation. As advances in technology increase the amount of data, simplifying a large-scale graph has attracted interests. Simplification reduces the size of a graph while preserving its important properties. In this paper, we propose the summarization algorithm to simplify a graph focusing on degree correlation and clustering coefficient. The degree correlation is a measure to assess the influence of each vertex and their connections. The clustering coefficient estimates latent connections between two distinct vertices. To this end, we first separate a graph into communities. Looking at groups instead of a graph itself allows us to extract important vertices and edges more easily. We then categorize communities into four cases and simplify them in different ways to preserve the innate characteristics. The quantitative and qualitative evaluations demonstrate how effectively our algorithm serves the goal. Overall, our contributions are as follows: (a) unique pattern: We found that hubs are connected indirectly via low-degree vertices. Sigcon preserves these vertices during simplification. (b) efficient algorithm: Sigcon identifies influential vertices and edges to simplify a graph on the basis of degree correlation and clustering coefficient connecting vertices effectively.",
author = "Hojin Jung and Songkuk Kim",
year = "2018",
month = "2",
day = "14",
doi = "10.1109/HPCC-SmartCity-DSS.2017.49",
language = "English",
series = "Proceedings - 2017 IEEE 19th Intl Conference on High Performance Computing and Communications, HPCC 2017, 2017 IEEE 15th Intl Conference on Smart City, SmartCity 2017 and 2017 IEEE 3rd Intl Conference on Data Science and Systems, DSS 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "372--379",
booktitle = "Proceedings - 2017 IEEE 19th Intl Conference on High Performance Computing and Communications, HPCC 2017, 2017 IEEE 15th Intl Conference on Smart City, SmartCity 2017 and 2017 IEEE 3rd Intl Conference on Data Science and Systems, DSS 2017",
address = "United States",

}

Jung, H & Kim, S 2018, Sigcon: Simplifying a Graph Based on Degree Correlation and Clustering Coefficient. in Proceedings - 2017 IEEE 19th Intl Conference on High Performance Computing and Communications, HPCC 2017, 2017 IEEE 15th Intl Conference on Smart City, SmartCity 2017 and 2017 IEEE 3rd Intl Conference on Data Science and Systems, DSS 2017. Proceedings - 2017 IEEE 19th Intl Conference on High Performance Computing and Communications, HPCC 2017, 2017 IEEE 15th Intl Conference on Smart City, SmartCity 2017 and 2017 IEEE 3rd Intl Conference on Data Science and Systems, DSS 2017, vol. 2018-January, Institute of Electrical and Electronics Engineers Inc., pp. 372-379, 19th IEEE Intl Conference on High Performance Computing and Communications, 15th IEEE Intl Conference on Smart City, and 3rd IEEE Intl Conference on Data Science and Systems, HPCC/SmartCity/DSS 2017, Bangkok, Thailand, 17/12/18. https://doi.org/10.1109/HPCC-SmartCity-DSS.2017.49

Sigcon : Simplifying a Graph Based on Degree Correlation and Clustering Coefficient. / Jung, Hojin; Kim, Songkuk.

Proceedings - 2017 IEEE 19th Intl Conference on High Performance Computing and Communications, HPCC 2017, 2017 IEEE 15th Intl Conference on Smart City, SmartCity 2017 and 2017 IEEE 3rd Intl Conference on Data Science and Systems, DSS 2017. Institute of Electrical and Electronics Engineers Inc., 2018. p. 372-379 (Proceedings - 2017 IEEE 19th Intl Conference on High Performance Computing and Communications, HPCC 2017, 2017 IEEE 15th Intl Conference on Smart City, SmartCity 2017 and 2017 IEEE 3rd Intl Conference on Data Science and Systems, DSS 2017; Vol. 2018-January).

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

TY - GEN

T1 - Sigcon

T2 - Simplifying a Graph Based on Degree Correlation and Clustering Coefficient

AU - Jung, Hojin

AU - Kim, Songkuk

PY - 2018/2/14

Y1 - 2018/2/14

N2 - Depicting a complex system like social networks as a graph helps understand its structure and relation. As advances in technology increase the amount of data, simplifying a large-scale graph has attracted interests. Simplification reduces the size of a graph while preserving its important properties. In this paper, we propose the summarization algorithm to simplify a graph focusing on degree correlation and clustering coefficient. The degree correlation is a measure to assess the influence of each vertex and their connections. The clustering coefficient estimates latent connections between two distinct vertices. To this end, we first separate a graph into communities. Looking at groups instead of a graph itself allows us to extract important vertices and edges more easily. We then categorize communities into four cases and simplify them in different ways to preserve the innate characteristics. The quantitative and qualitative evaluations demonstrate how effectively our algorithm serves the goal. Overall, our contributions are as follows: (a) unique pattern: We found that hubs are connected indirectly via low-degree vertices. Sigcon preserves these vertices during simplification. (b) efficient algorithm: Sigcon identifies influential vertices and edges to simplify a graph on the basis of degree correlation and clustering coefficient connecting vertices effectively.

AB - Depicting a complex system like social networks as a graph helps understand its structure and relation. As advances in technology increase the amount of data, simplifying a large-scale graph has attracted interests. Simplification reduces the size of a graph while preserving its important properties. In this paper, we propose the summarization algorithm to simplify a graph focusing on degree correlation and clustering coefficient. The degree correlation is a measure to assess the influence of each vertex and their connections. The clustering coefficient estimates latent connections between two distinct vertices. To this end, we first separate a graph into communities. Looking at groups instead of a graph itself allows us to extract important vertices and edges more easily. We then categorize communities into four cases and simplify them in different ways to preserve the innate characteristics. The quantitative and qualitative evaluations demonstrate how effectively our algorithm serves the goal. Overall, our contributions are as follows: (a) unique pattern: We found that hubs are connected indirectly via low-degree vertices. Sigcon preserves these vertices during simplification. (b) efficient algorithm: Sigcon identifies influential vertices and edges to simplify a graph on the basis of degree correlation and clustering coefficient connecting vertices effectively.

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

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

U2 - 10.1109/HPCC-SmartCity-DSS.2017.49

DO - 10.1109/HPCC-SmartCity-DSS.2017.49

M3 - Conference contribution

AN - SCOPUS:85047460927

T3 - Proceedings - 2017 IEEE 19th Intl Conference on High Performance Computing and Communications, HPCC 2017, 2017 IEEE 15th Intl Conference on Smart City, SmartCity 2017 and 2017 IEEE 3rd Intl Conference on Data Science and Systems, DSS 2017

SP - 372

EP - 379

BT - Proceedings - 2017 IEEE 19th Intl Conference on High Performance Computing and Communications, HPCC 2017, 2017 IEEE 15th Intl Conference on Smart City, SmartCity 2017 and 2017 IEEE 3rd Intl Conference on Data Science and Systems, DSS 2017

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Jung H, Kim S. Sigcon: Simplifying a Graph Based on Degree Correlation and Clustering Coefficient. In Proceedings - 2017 IEEE 19th Intl Conference on High Performance Computing and Communications, HPCC 2017, 2017 IEEE 15th Intl Conference on Smart City, SmartCity 2017 and 2017 IEEE 3rd Intl Conference on Data Science and Systems, DSS 2017. Institute of Electrical and Electronics Engineers Inc. 2018. p. 372-379. (Proceedings - 2017 IEEE 19th Intl Conference on High Performance Computing and Communications, HPCC 2017, 2017 IEEE 15th Intl Conference on Smart City, SmartCity 2017 and 2017 IEEE 3rd Intl Conference on Data Science and Systems, DSS 2017). https://doi.org/10.1109/HPCC-SmartCity-DSS.2017.49