A better strategy of discovering link-pattern based communities by classical clustering methods

Chen Yi Lin, Jia Ling Koh, Arbee L.P. Chen

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

5 Citations (Scopus)

Abstract

The definition of a community in social networks varies with applications. To generalize different types of communities, the concept of linkpattern based community was proposed in a previous study to group nodes into communities, where the nodes in a community have similar intra-community and inter-community interaction behaviors. In this paper, by defining centroid of a community, a distance function is provided to measure the similarity between the link pattern of a node and the centroid of a community. The problem of discovering link-pattern based communities is transformed into a data clustering problem on nodes for minimizing a given objective function. By extending the partitioning methods of cluster analysis, two algorithms named G-LPC and KM-LPC are proposed to solve the problem. The experiment results show that KM-LPC outperforms the previous work on the efficiency, the memory utilization, and the clustering result. Besides, G-LPC achieves the best result approaching the optimal solution.

Original languageEnglish
Title of host publicationAdvances in Knowledge Discovery and Data Mining - 14th Pacific-Asia Conference, PAKDD 2010, Proceedings
Pages56-67
Number of pages12
EditionPART 1
DOIs
Publication statusPublished - 2010 Dec 1
Event14th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2010 - Hyderabad, India
Duration: 2010 Jun 212010 Jun 24

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume6118 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other14th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2010
CountryIndia
CityHyderabad
Period10/6/2110/6/24

Fingerprint

Clustering Methods
Cluster analysis
Data storage equipment
Vertex of a graph
Centroid
Experiments
Community
Strategy
Data Clustering
Cluster Analysis
Distance Function
Social Networks
Partitioning
Objective function
Optimal Solution
Clustering
Vary
Generalise

Keywords

  • Clustering algorithms
  • Link-pattern based community
  • Social network

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Lin, C. Y., Koh, J. L., & Chen, A. L. P. (2010). A better strategy of discovering link-pattern based communities by classical clustering methods. In Advances in Knowledge Discovery and Data Mining - 14th Pacific-Asia Conference, PAKDD 2010, Proceedings (PART 1 ed., pp. 56-67). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6118 LNAI, No. PART 1). https://doi.org/10.1007/978-3-642-13657-3_9

A better strategy of discovering link-pattern based communities by classical clustering methods. / Lin, Chen Yi; Koh, Jia Ling; Chen, Arbee L.P.

Advances in Knowledge Discovery and Data Mining - 14th Pacific-Asia Conference, PAKDD 2010, Proceedings. PART 1. ed. 2010. p. 56-67 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6118 LNAI, No. PART 1).

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

Lin, CY, Koh, JL & Chen, ALP 2010, A better strategy of discovering link-pattern based communities by classical clustering methods. in Advances in Knowledge Discovery and Data Mining - 14th Pacific-Asia Conference, PAKDD 2010, Proceedings. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 6118 LNAI, pp. 56-67, 14th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2010, Hyderabad, India, 10/6/21. https://doi.org/10.1007/978-3-642-13657-3_9
Lin CY, Koh JL, Chen ALP. A better strategy of discovering link-pattern based communities by classical clustering methods. In Advances in Knowledge Discovery and Data Mining - 14th Pacific-Asia Conference, PAKDD 2010, Proceedings. PART 1 ed. 2010. p. 56-67. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). https://doi.org/10.1007/978-3-642-13657-3_9
Lin, Chen Yi ; Koh, Jia Ling ; Chen, Arbee L.P. / A better strategy of discovering link-pattern based communities by classical clustering methods. Advances in Knowledge Discovery and Data Mining - 14th Pacific-Asia Conference, PAKDD 2010, Proceedings. PART 1. ed. 2010. pp. 56-67 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).
@inproceedings{91e212d8cc0b4971ba17e294812c029e,
title = "A better strategy of discovering link-pattern based communities by classical clustering methods",
abstract = "The definition of a community in social networks varies with applications. To generalize different types of communities, the concept of linkpattern based community was proposed in a previous study to group nodes into communities, where the nodes in a community have similar intra-community and inter-community interaction behaviors. In this paper, by defining centroid of a community, a distance function is provided to measure the similarity between the link pattern of a node and the centroid of a community. The problem of discovering link-pattern based communities is transformed into a data clustering problem on nodes for minimizing a given objective function. By extending the partitioning methods of cluster analysis, two algorithms named G-LPC and KM-LPC are proposed to solve the problem. The experiment results show that KM-LPC outperforms the previous work on the efficiency, the memory utilization, and the clustering result. Besides, G-LPC achieves the best result approaching the optimal solution.",
keywords = "Clustering algorithms, Link-pattern based community, Social network",
author = "Lin, {Chen Yi} and Koh, {Jia Ling} and Chen, {Arbee L.P.}",
year = "2010",
month = "12",
day = "1",
doi = "10.1007/978-3-642-13657-3_9",
language = "English",
isbn = "3642136567",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 1",
pages = "56--67",
booktitle = "Advances in Knowledge Discovery and Data Mining - 14th Pacific-Asia Conference, PAKDD 2010, Proceedings",
edition = "PART 1",

}

TY - GEN

T1 - A better strategy of discovering link-pattern based communities by classical clustering methods

AU - Lin, Chen Yi

AU - Koh, Jia Ling

AU - Chen, Arbee L.P.

PY - 2010/12/1

Y1 - 2010/12/1

N2 - The definition of a community in social networks varies with applications. To generalize different types of communities, the concept of linkpattern based community was proposed in a previous study to group nodes into communities, where the nodes in a community have similar intra-community and inter-community interaction behaviors. In this paper, by defining centroid of a community, a distance function is provided to measure the similarity between the link pattern of a node and the centroid of a community. The problem of discovering link-pattern based communities is transformed into a data clustering problem on nodes for minimizing a given objective function. By extending the partitioning methods of cluster analysis, two algorithms named G-LPC and KM-LPC are proposed to solve the problem. The experiment results show that KM-LPC outperforms the previous work on the efficiency, the memory utilization, and the clustering result. Besides, G-LPC achieves the best result approaching the optimal solution.

AB - The definition of a community in social networks varies with applications. To generalize different types of communities, the concept of linkpattern based community was proposed in a previous study to group nodes into communities, where the nodes in a community have similar intra-community and inter-community interaction behaviors. In this paper, by defining centroid of a community, a distance function is provided to measure the similarity between the link pattern of a node and the centroid of a community. The problem of discovering link-pattern based communities is transformed into a data clustering problem on nodes for minimizing a given objective function. By extending the partitioning methods of cluster analysis, two algorithms named G-LPC and KM-LPC are proposed to solve the problem. The experiment results show that KM-LPC outperforms the previous work on the efficiency, the memory utilization, and the clustering result. Besides, G-LPC achieves the best result approaching the optimal solution.

KW - Clustering algorithms

KW - Link-pattern based community

KW - Social network

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

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

U2 - 10.1007/978-3-642-13657-3_9

DO - 10.1007/978-3-642-13657-3_9

M3 - Conference contribution

AN - SCOPUS:79956292361

SN - 3642136567

SN - 9783642136566

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 56

EP - 67

BT - Advances in Knowledge Discovery and Data Mining - 14th Pacific-Asia Conference, PAKDD 2010, Proceedings

ER -