Generating social network features for link-based classification

Jun Karamon, Yutaka Matsuo, Hikaru Yamamoto, Mitsuru Ishizuka

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

9 Citations (Scopus)

Abstract

There have been numerous attempts at the aggregation of attributes for relational data mining. Recently, an increasing number of studies have been undertaken to process social network data, partly because of the fact that so much social network data has become available. Among the various tasks in link mining, a popular task is link-based classification, by which samples are classified using the relations or links that are present among them. On the other hand, we sometimes employ traditional analytical methods in the field of social network analysis using e.g., centrality measures, structural holes, and network clustering. Through this study, we seek to bridge the gap between the aggregated features from the network data and traditional indices used in social network analysis. The notable feature of our algorithm is the ability to invent several indices that are well studied in sociology. We first define general operators that are applicable to an adjacent network. Then the combinations of the operators generate new features, some of which correspond to traditional indices, and others which are considered to be new. We apply our method for classification to two different datasets, thereby demonstrating the effectiveness of our approach.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages127-139
Number of pages13
Volume4702 LNAI
Publication statusPublished - 2007
Externally publishedYes
Event11th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD 2007 - Warsaw, Poland
Duration: 2007 Sep 172007 Sep 21

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4702 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other11th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD 2007
CountryPoland
CityWarsaw
Period07/9/1707/9/21

Fingerprint

Electric network analysis
Social Support
Social Networks
Social Network Analysis
Data mining
Agglomeration
Centrality
Operator
Analytical Methods
Aptitude
Data Mining
Sociology
Mining
Aggregation
Adjacent
Attribute
Clustering
Cluster Analysis

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Karamon, J., Matsuo, Y., Yamamoto, H., & Ishizuka, M. (2007). Generating social network features for link-based classification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4702 LNAI, pp. 127-139). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4702 LNAI).

Generating social network features for link-based classification. / Karamon, Jun; Matsuo, Yutaka; Yamamoto, Hikaru; Ishizuka, Mitsuru.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4702 LNAI 2007. p. 127-139 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4702 LNAI).

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

Karamon, J, Matsuo, Y, Yamamoto, H & Ishizuka, M 2007, Generating social network features for link-based classification. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4702 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4702 LNAI, pp. 127-139, 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD 2007, Warsaw, Poland, 07/9/17.
Karamon J, Matsuo Y, Yamamoto H, Ishizuka M. Generating social network features for link-based classification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4702 LNAI. 2007. p. 127-139. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Karamon, Jun ; Matsuo, Yutaka ; Yamamoto, Hikaru ; Ishizuka, Mitsuru. / Generating social network features for link-based classification. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4702 LNAI 2007. pp. 127-139 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{c1efc10c9abe4d80aef8ea8aae57c95a,
title = "Generating social network features for link-based classification",
abstract = "There have been numerous attempts at the aggregation of attributes for relational data mining. Recently, an increasing number of studies have been undertaken to process social network data, partly because of the fact that so much social network data has become available. Among the various tasks in link mining, a popular task is link-based classification, by which samples are classified using the relations or links that are present among them. On the other hand, we sometimes employ traditional analytical methods in the field of social network analysis using e.g., centrality measures, structural holes, and network clustering. Through this study, we seek to bridge the gap between the aggregated features from the network data and traditional indices used in social network analysis. The notable feature of our algorithm is the ability to invent several indices that are well studied in sociology. We first define general operators that are applicable to an adjacent network. Then the combinations of the operators generate new features, some of which correspond to traditional indices, and others which are considered to be new. We apply our method for classification to two different datasets, thereby demonstrating the effectiveness of our approach.",
author = "Jun Karamon and Yutaka Matsuo and Hikaru Yamamoto and Mitsuru Ishizuka",
year = "2007",
language = "English",
isbn = "9783540749752",
volume = "4702 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "127--139",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Generating social network features for link-based classification

AU - Karamon, Jun

AU - Matsuo, Yutaka

AU - Yamamoto, Hikaru

AU - Ishizuka, Mitsuru

PY - 2007

Y1 - 2007

N2 - There have been numerous attempts at the aggregation of attributes for relational data mining. Recently, an increasing number of studies have been undertaken to process social network data, partly because of the fact that so much social network data has become available. Among the various tasks in link mining, a popular task is link-based classification, by which samples are classified using the relations or links that are present among them. On the other hand, we sometimes employ traditional analytical methods in the field of social network analysis using e.g., centrality measures, structural holes, and network clustering. Through this study, we seek to bridge the gap between the aggregated features from the network data and traditional indices used in social network analysis. The notable feature of our algorithm is the ability to invent several indices that are well studied in sociology. We first define general operators that are applicable to an adjacent network. Then the combinations of the operators generate new features, some of which correspond to traditional indices, and others which are considered to be new. We apply our method for classification to two different datasets, thereby demonstrating the effectiveness of our approach.

AB - There have been numerous attempts at the aggregation of attributes for relational data mining. Recently, an increasing number of studies have been undertaken to process social network data, partly because of the fact that so much social network data has become available. Among the various tasks in link mining, a popular task is link-based classification, by which samples are classified using the relations or links that are present among them. On the other hand, we sometimes employ traditional analytical methods in the field of social network analysis using e.g., centrality measures, structural holes, and network clustering. Through this study, we seek to bridge the gap between the aggregated features from the network data and traditional indices used in social network analysis. The notable feature of our algorithm is the ability to invent several indices that are well studied in sociology. We first define general operators that are applicable to an adjacent network. Then the combinations of the operators generate new features, some of which correspond to traditional indices, and others which are considered to be new. We apply our method for classification to two different datasets, thereby demonstrating the effectiveness of our approach.

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

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

M3 - Conference contribution

SN - 9783540749752

VL - 4702 LNAI

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

SP - 127

EP - 139

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

ER -