Increasing scalability of researcher network extraction from the web

Yohei Asada, Yutaka Matsuo, Mitsuru Ishizuka

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Social networks, which describe relations among people or organizations as a network, have recently attracted attention. With the help of a social network, we can analyze the structure of a community and thereby promote efficient communications within it. We investigate the problem of extracting a network of researchers from the Web, to assist efficient cooperation among researchers. Our method uses a search engine to get the cooccurences of names of two researchers and calculates the streangth of the relation between them. Then we label the relation by analyzing the Web pages in which these two names cooccur. Research on social network extraction using search engines as ours, is attracting attention in Japan as well as abroad. However, the former approaches issue too many queries to search engines to extract a large-scale network. In this paper, we propose a method to filter superfluous queries and facilitates the extraction of large-scale networks. By this method we are able to extract a network of around 3000-nodes. Our experimental results show that the proposed method reduces the number of queries significantly while preserving the quality of the network as compared to former methods.

Original languageEnglish
Pages (from-to)370-378
Number of pages9
JournalTransactions of the Japanese Society for Artificial Intelligence
Volume20
Issue number6
Publication statusPublished - 2005
Externally publishedYes

Fingerprint

Search engines
Scalability
Labels
Websites
Communication

Keywords

  • Cooccurrence
  • Scalability
  • Search engine
  • Social network
  • Web mining

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Increasing scalability of researcher network extraction from the web. / Asada, Yohei; Matsuo, Yutaka; Ishizuka, Mitsuru.

In: Transactions of the Japanese Society for Artificial Intelligence, Vol. 20, No. 6, 2005, p. 370-378.

Research output: Contribution to journalArticle

Asada, Yohei ; Matsuo, Yutaka ; Ishizuka, Mitsuru. / Increasing scalability of researcher network extraction from the web. In: Transactions of the Japanese Society for Artificial Intelligence. 2005 ; Vol. 20, No. 6. pp. 370-378.
@article{37149bae36af4fd99956835f71670488,
title = "Increasing scalability of researcher network extraction from the web",
abstract = "Social networks, which describe relations among people or organizations as a network, have recently attracted attention. With the help of a social network, we can analyze the structure of a community and thereby promote efficient communications within it. We investigate the problem of extracting a network of researchers from the Web, to assist efficient cooperation among researchers. Our method uses a search engine to get the cooccurences of names of two researchers and calculates the streangth of the relation between them. Then we label the relation by analyzing the Web pages in which these two names cooccur. Research on social network extraction using search engines as ours, is attracting attention in Japan as well as abroad. However, the former approaches issue too many queries to search engines to extract a large-scale network. In this paper, we propose a method to filter superfluous queries and facilitates the extraction of large-scale networks. By this method we are able to extract a network of around 3000-nodes. Our experimental results show that the proposed method reduces the number of queries significantly while preserving the quality of the network as compared to former methods.",
keywords = "Cooccurrence, Scalability, Search engine, Social network, Web mining",
author = "Yohei Asada and Yutaka Matsuo and Mitsuru Ishizuka",
year = "2005",
language = "English",
volume = "20",
pages = "370--378",
journal = "Transactions of the Japanese Society for Artificial Intelligence",
issn = "1346-0714",
publisher = "Japanese Society for Artificial Intelligence",
number = "6",

}

TY - JOUR

T1 - Increasing scalability of researcher network extraction from the web

AU - Asada, Yohei

AU - Matsuo, Yutaka

AU - Ishizuka, Mitsuru

PY - 2005

Y1 - 2005

N2 - Social networks, which describe relations among people or organizations as a network, have recently attracted attention. With the help of a social network, we can analyze the structure of a community and thereby promote efficient communications within it. We investigate the problem of extracting a network of researchers from the Web, to assist efficient cooperation among researchers. Our method uses a search engine to get the cooccurences of names of two researchers and calculates the streangth of the relation between them. Then we label the relation by analyzing the Web pages in which these two names cooccur. Research on social network extraction using search engines as ours, is attracting attention in Japan as well as abroad. However, the former approaches issue too many queries to search engines to extract a large-scale network. In this paper, we propose a method to filter superfluous queries and facilitates the extraction of large-scale networks. By this method we are able to extract a network of around 3000-nodes. Our experimental results show that the proposed method reduces the number of queries significantly while preserving the quality of the network as compared to former methods.

AB - Social networks, which describe relations among people or organizations as a network, have recently attracted attention. With the help of a social network, we can analyze the structure of a community and thereby promote efficient communications within it. We investigate the problem of extracting a network of researchers from the Web, to assist efficient cooperation among researchers. Our method uses a search engine to get the cooccurences of names of two researchers and calculates the streangth of the relation between them. Then we label the relation by analyzing the Web pages in which these two names cooccur. Research on social network extraction using search engines as ours, is attracting attention in Japan as well as abroad. However, the former approaches issue too many queries to search engines to extract a large-scale network. In this paper, we propose a method to filter superfluous queries and facilitates the extraction of large-scale networks. By this method we are able to extract a network of around 3000-nodes. Our experimental results show that the proposed method reduces the number of queries significantly while preserving the quality of the network as compared to former methods.

KW - Cooccurrence

KW - Scalability

KW - Search engine

KW - Social network

KW - Web mining

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

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

M3 - Article

AN - SCOPUS:33846574142

VL - 20

SP - 370

EP - 378

JO - Transactions of the Japanese Society for Artificial Intelligence

JF - Transactions of the Japanese Society for Artificial Intelligence

SN - 1346-0714

IS - 6

ER -