Structural Correlation Pattern mining for large graphs

Arlei Silva, Wagner Meira, Mohammed J. Zaki

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

23 Citations (Scopus)

Abstract

In this paper we define the Structural Correlation Pattern (SCP) mining problem, which consists of determining correlations among vertex attributes and dense components in an undirected graph. Vertex attributes play an important role in several real-life graphs and SCPs help to understand how they relate to the associated graph topology. SCPs may describe, for example, interesting relationships between personal characteristics and the community structure in social networks. We also propose an efficient algorithm, called SCORP, to extract SCPs from large graphs, and compare it against a naive approach for SCP mining, demonstrating its scalability and efficiency. We also discuss the application of SCORP to two actual scenarios, co-authorship networks and social music discovery, showing relevant results that demonstrate the applicability of the proposed approach.

Original languageEnglish
Title of host publicationProceedings of the 8th Workshop on Mining and Learning with Graphs, MLG'10
Pages119-126
Number of pages8
DOIs
Publication statusPublished - 8 Sep 2010
Externally publishedYes
Event8th Workshop on Mining and Learning with Graphs, MLG'10 - Washington, DC, United States
Duration: 24 Jul 201025 Jul 2010

Other

Other8th Workshop on Mining and Learning with Graphs, MLG'10
CountryUnited States
CityWashington, DC
Period24/7/1025/7/10

Fingerprint

Scalability
Topology

Keywords

  • Correlation
  • Graph mining
  • Quasi-cliques

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

Silva, A., Meira, W., & Zaki, M. J. (2010). Structural Correlation Pattern mining for large graphs. In Proceedings of the 8th Workshop on Mining and Learning with Graphs, MLG'10 (pp. 119-126) https://doi.org/10.1145/1830252.1830268

Structural Correlation Pattern mining for large graphs. / Silva, Arlei; Meira, Wagner; Zaki, Mohammed J.

Proceedings of the 8th Workshop on Mining and Learning with Graphs, MLG'10. 2010. p. 119-126.

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

Silva, A, Meira, W & Zaki, MJ 2010, Structural Correlation Pattern mining for large graphs. in Proceedings of the 8th Workshop on Mining and Learning with Graphs, MLG'10. pp. 119-126, 8th Workshop on Mining and Learning with Graphs, MLG'10, Washington, DC, United States, 24/7/10. https://doi.org/10.1145/1830252.1830268
Silva A, Meira W, Zaki MJ. Structural Correlation Pattern mining for large graphs. In Proceedings of the 8th Workshop on Mining and Learning with Graphs, MLG'10. 2010. p. 119-126 https://doi.org/10.1145/1830252.1830268
Silva, Arlei ; Meira, Wagner ; Zaki, Mohammed J. / Structural Correlation Pattern mining for large graphs. Proceedings of the 8th Workshop on Mining and Learning with Graphs, MLG'10. 2010. pp. 119-126
@inproceedings{b8134973c4944607b95b8b07a576528d,
title = "Structural Correlation Pattern mining for large graphs",
abstract = "In this paper we define the Structural Correlation Pattern (SCP) mining problem, which consists of determining correlations among vertex attributes and dense components in an undirected graph. Vertex attributes play an important role in several real-life graphs and SCPs help to understand how they relate to the associated graph topology. SCPs may describe, for example, interesting relationships between personal characteristics and the community structure in social networks. We also propose an efficient algorithm, called SCORP, to extract SCPs from large graphs, and compare it against a naive approach for SCP mining, demonstrating its scalability and efficiency. We also discuss the application of SCORP to two actual scenarios, co-authorship networks and social music discovery, showing relevant results that demonstrate the applicability of the proposed approach.",
keywords = "Correlation, Graph mining, Quasi-cliques",
author = "Arlei Silva and Wagner Meira and Zaki, {Mohammed J.}",
year = "2010",
month = "9",
day = "8",
doi = "10.1145/1830252.1830268",
language = "English",
isbn = "9781450302142",
pages = "119--126",
booktitle = "Proceedings of the 8th Workshop on Mining and Learning with Graphs, MLG'10",

}

TY - GEN

T1 - Structural Correlation Pattern mining for large graphs

AU - Silva, Arlei

AU - Meira, Wagner

AU - Zaki, Mohammed J.

PY - 2010/9/8

Y1 - 2010/9/8

N2 - In this paper we define the Structural Correlation Pattern (SCP) mining problem, which consists of determining correlations among vertex attributes and dense components in an undirected graph. Vertex attributes play an important role in several real-life graphs and SCPs help to understand how they relate to the associated graph topology. SCPs may describe, for example, interesting relationships between personal characteristics and the community structure in social networks. We also propose an efficient algorithm, called SCORP, to extract SCPs from large graphs, and compare it against a naive approach for SCP mining, demonstrating its scalability and efficiency. We also discuss the application of SCORP to two actual scenarios, co-authorship networks and social music discovery, showing relevant results that demonstrate the applicability of the proposed approach.

AB - In this paper we define the Structural Correlation Pattern (SCP) mining problem, which consists of determining correlations among vertex attributes and dense components in an undirected graph. Vertex attributes play an important role in several real-life graphs and SCPs help to understand how they relate to the associated graph topology. SCPs may describe, for example, interesting relationships between personal characteristics and the community structure in social networks. We also propose an efficient algorithm, called SCORP, to extract SCPs from large graphs, and compare it against a naive approach for SCP mining, demonstrating its scalability and efficiency. We also discuss the application of SCORP to two actual scenarios, co-authorship networks and social music discovery, showing relevant results that demonstrate the applicability of the proposed approach.

KW - Correlation

KW - Graph mining

KW - Quasi-cliques

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

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

U2 - 10.1145/1830252.1830268

DO - 10.1145/1830252.1830268

M3 - Conference contribution

SN - 9781450302142

SP - 119

EP - 126

BT - Proceedings of the 8th Workshop on Mining and Learning with Graphs, MLG'10

ER -