Mining temporal subgraph patterns in heterogeneous information networks

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

9 Citations (Scopus)

Abstract

With an increasing interest in social network applications, finding frequent social interactions can help us to do disease modeling, cultural and information transmission and behavioral ecology. We model the social interactions among objects and people by a temporal heterogeneous information network, where a node in the network represents an individual, and an edge between two nodes denotes the interaction between two individuals in a certain time interval. As time goes by, lots of temporal heterogonous information networks at different time unit can be collect. In this work, we aim to mine frequent temporal social interactions (call patterns) exist in numerous temporal heterogonous information networks. We propose a novel algorithm, TSP-algorithm (Temporal Subgraph Patterns algorithm) to mine the patterns which contain temporal information and forms a connective subgraph. The proposed method recursively grows the patterns in a depth-first search manner. Since the TSP-algorithm only needs to scan the database once and does not generate unnecessary candidates, the experiment results show that the TSP-algorithm outperforms the modified Apriori on time-efficiency and memory usage in both synthetic and real datasets.

Original languageEnglish
Title of host publicationProceedings - SocialCom 2010
Subtitle of host publication2nd IEEE International Conference on Social Computing, PASSAT 2010: 2nd IEEE International Conference on Privacy, Security, Risk and Trust
Pages282-287
Number of pages6
DOIs
Publication statusPublished - 2010 Nov 29
Event2nd IEEE International Conference on Social Computing, SocialCom 2010, 2nd IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2010 - Minneapolis, MN, United States
Duration: 2010 Aug 202010 Aug 22

Publication series

NameProceedings - SocialCom 2010: 2nd IEEE International Conference on Social Computing, PASSAT 2010: 2nd IEEE International Conference on Privacy, Security, Risk and Trust

Other

Other2nd IEEE International Conference on Social Computing, SocialCom 2010, 2nd IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2010
CountryUnited States
CityMinneapolis, MN
Period10-08-2010-08-22

Fingerprint

Ecology
Data storage equipment
Experiments

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications
  • Information Systems

Cite this

Hsieh, H-P., & Li, C-T. (2010). Mining temporal subgraph patterns in heterogeneous information networks. In Proceedings - SocialCom 2010: 2nd IEEE International Conference on Social Computing, PASSAT 2010: 2nd IEEE International Conference on Privacy, Security, Risk and Trust (pp. 282-287). [5591222] (Proceedings - SocialCom 2010: 2nd IEEE International Conference on Social Computing, PASSAT 2010: 2nd IEEE International Conference on Privacy, Security, Risk and Trust). https://doi.org/10.1109/SocialCom.2010.47
Hsieh, Hsun-Ping ; Li, Cheng-Te. / Mining temporal subgraph patterns in heterogeneous information networks. Proceedings - SocialCom 2010: 2nd IEEE International Conference on Social Computing, PASSAT 2010: 2nd IEEE International Conference on Privacy, Security, Risk and Trust. 2010. pp. 282-287 (Proceedings - SocialCom 2010: 2nd IEEE International Conference on Social Computing, PASSAT 2010: 2nd IEEE International Conference on Privacy, Security, Risk and Trust).
@inproceedings{72fa50a984c042619f4eaf272a0a544b,
title = "Mining temporal subgraph patterns in heterogeneous information networks",
abstract = "With an increasing interest in social network applications, finding frequent social interactions can help us to do disease modeling, cultural and information transmission and behavioral ecology. We model the social interactions among objects and people by a temporal heterogeneous information network, where a node in the network represents an individual, and an edge between two nodes denotes the interaction between two individuals in a certain time interval. As time goes by, lots of temporal heterogonous information networks at different time unit can be collect. In this work, we aim to mine frequent temporal social interactions (call patterns) exist in numerous temporal heterogonous information networks. We propose a novel algorithm, TSP-algorithm (Temporal Subgraph Patterns algorithm) to mine the patterns which contain temporal information and forms a connective subgraph. The proposed method recursively grows the patterns in a depth-first search manner. Since the TSP-algorithm only needs to scan the database once and does not generate unnecessary candidates, the experiment results show that the TSP-algorithm outperforms the modified Apriori on time-efficiency and memory usage in both synthetic and real datasets.",
author = "Hsun-Ping Hsieh and Cheng-Te Li",
year = "2010",
month = "11",
day = "29",
doi = "10.1109/SocialCom.2010.47",
language = "English",
isbn = "9780769542119",
series = "Proceedings - SocialCom 2010: 2nd IEEE International Conference on Social Computing, PASSAT 2010: 2nd IEEE International Conference on Privacy, Security, Risk and Trust",
pages = "282--287",
booktitle = "Proceedings - SocialCom 2010",

}

Hsieh, H-P & Li, C-T 2010, Mining temporal subgraph patterns in heterogeneous information networks. in Proceedings - SocialCom 2010: 2nd IEEE International Conference on Social Computing, PASSAT 2010: 2nd IEEE International Conference on Privacy, Security, Risk and Trust., 5591222, Proceedings - SocialCom 2010: 2nd IEEE International Conference on Social Computing, PASSAT 2010: 2nd IEEE International Conference on Privacy, Security, Risk and Trust, pp. 282-287, 2nd IEEE International Conference on Social Computing, SocialCom 2010, 2nd IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2010, Minneapolis, MN, United States, 10-08-20. https://doi.org/10.1109/SocialCom.2010.47

Mining temporal subgraph patterns in heterogeneous information networks. / Hsieh, Hsun-Ping; Li, Cheng-Te.

Proceedings - SocialCom 2010: 2nd IEEE International Conference on Social Computing, PASSAT 2010: 2nd IEEE International Conference on Privacy, Security, Risk and Trust. 2010. p. 282-287 5591222 (Proceedings - SocialCom 2010: 2nd IEEE International Conference on Social Computing, PASSAT 2010: 2nd IEEE International Conference on Privacy, Security, Risk and Trust).

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

TY - GEN

T1 - Mining temporal subgraph patterns in heterogeneous information networks

AU - Hsieh, Hsun-Ping

AU - Li, Cheng-Te

PY - 2010/11/29

Y1 - 2010/11/29

N2 - With an increasing interest in social network applications, finding frequent social interactions can help us to do disease modeling, cultural and information transmission and behavioral ecology. We model the social interactions among objects and people by a temporal heterogeneous information network, where a node in the network represents an individual, and an edge between two nodes denotes the interaction between two individuals in a certain time interval. As time goes by, lots of temporal heterogonous information networks at different time unit can be collect. In this work, we aim to mine frequent temporal social interactions (call patterns) exist in numerous temporal heterogonous information networks. We propose a novel algorithm, TSP-algorithm (Temporal Subgraph Patterns algorithm) to mine the patterns which contain temporal information and forms a connective subgraph. The proposed method recursively grows the patterns in a depth-first search manner. Since the TSP-algorithm only needs to scan the database once and does not generate unnecessary candidates, the experiment results show that the TSP-algorithm outperforms the modified Apriori on time-efficiency and memory usage in both synthetic and real datasets.

AB - With an increasing interest in social network applications, finding frequent social interactions can help us to do disease modeling, cultural and information transmission and behavioral ecology. We model the social interactions among objects and people by a temporal heterogeneous information network, where a node in the network represents an individual, and an edge between two nodes denotes the interaction between two individuals in a certain time interval. As time goes by, lots of temporal heterogonous information networks at different time unit can be collect. In this work, we aim to mine frequent temporal social interactions (call patterns) exist in numerous temporal heterogonous information networks. We propose a novel algorithm, TSP-algorithm (Temporal Subgraph Patterns algorithm) to mine the patterns which contain temporal information and forms a connective subgraph. The proposed method recursively grows the patterns in a depth-first search manner. Since the TSP-algorithm only needs to scan the database once and does not generate unnecessary candidates, the experiment results show that the TSP-algorithm outperforms the modified Apriori on time-efficiency and memory usage in both synthetic and real datasets.

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

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

U2 - 10.1109/SocialCom.2010.47

DO - 10.1109/SocialCom.2010.47

M3 - Conference contribution

SN - 9780769542119

T3 - Proceedings - SocialCom 2010: 2nd IEEE International Conference on Social Computing, PASSAT 2010: 2nd IEEE International Conference on Privacy, Security, Risk and Trust

SP - 282

EP - 287

BT - Proceedings - SocialCom 2010

ER -

Hsieh H-P, Li C-T. Mining temporal subgraph patterns in heterogeneous information networks. In Proceedings - SocialCom 2010: 2nd IEEE International Conference on Social Computing, PASSAT 2010: 2nd IEEE International Conference on Privacy, Security, Risk and Trust. 2010. p. 282-287. 5591222. (Proceedings - SocialCom 2010: 2nd IEEE International Conference on Social Computing, PASSAT 2010: 2nd IEEE International Conference on Privacy, Security, Risk and Trust). https://doi.org/10.1109/SocialCom.2010.47