Increasing scalability of researcher network extraction from the web

Yohei Asada*, Yutaka Matsuo, Mitsuru Ishizuka

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


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
Issue number6
Publication statusPublished - 2005
Externally publishedYes


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

ASJC Scopus subject areas

  • Artificial Intelligence


Dive into the research topics of 'Increasing scalability of researcher network extraction from the web'. Together they form a unique fingerprint.

Cite this