Purpose – Social relations play an important role in a real community. Interaction patterns reveal relations among actors (such as persons, groups, firms), which can be merged to produce valuable information such as a network structure. This paper aims to present a new approach to extract inter‐firm networks from the web for further analysis. Design/methodology/approach – In this study extraction of relations between a pair of firms is obtained by using a search engine and text processing. Because names of firms co‐appear coincidentally on the web, an advanced algorithm is proposed, which is characterised by the addition of keywords (“relation keywords”) to a query. The relation keywords are obtained from the web using a Jaccard coefficient. Findings – As an application, a network of 60 firms in Japan is extracted including IT, communication, broadcasting, and electronics firms from the web and comprehensive evaluations of this approach are shown. The alliance and lawsuit relations are easily obtainable from the web using the algorithm. By adding relation keywords to named pairs of firms as a query, It is possible to collect target pages from the top of web pages more precisely than by only using the named pairs as a query. Practical implications – This study proposes a new approach for extracting inter‐firm networks from the web. The obtained network is useful in several ways. It is possible to find a cluster of firms and characterise a firm by its cluster. Business experts often make such inferences based on firm relations and firm groups. For that reason the firm network might enhance inferential abilities on the business domain. Also we might use obtained networks to recommend business partners based on structural advantages. The authors' intuition is that extracting a social network might provide information that is only recognisable from the network point of view. For example, the centrality of each firm is identified only after generating a social network. Originality/value – This study is a first attempt to extract inter‐firm networks from the web using a search engine. The approach is also applicable to other actors, such as famous persons, organisations or other multiple relational entities.
Article navigation
11 April 2008
Editors
Technical Paper|
April 11 2008
Extracting inter‐firm networks from the World Wide Web using a general‐purpose search engine
Yingzi Jin;
University of Tokyo, Tokyo, Japan
Yingzi Jin can be contacted at: eiko‐kin@mi.ci.i.u‐tokyo.ac.jp
Search for other works by this author on:
Mitsuru Ishizuka;
Mitsuru Ishizuka
University of Tokyo, Tokyo, Japan
Search for other works by this author on:
Yutaka Matsuo
Yutaka Matsuo
National Institute of Advanced Industrial Science and Technology, Tokyo, Japan
Search for other works by this author on:
Yingzi Jin can be contacted at: eiko‐kin@mi.ci.i.u‐tokyo.ac.jp
Publisher: Emerald Publishing
Online ISSN: 1468-4535
Print ISSN: 1468-4527
© Emerald Group Publishing Limited
2008
Online Information Review (2008) 32 (2): 196–210.
Citation
Ting I, Jin Y, Ishizuka M, Matsuo Y (2008), "Extracting inter‐firm networks from the World Wide Web using a general‐purpose search engine". Online Information Review, Vol. 32 No. 2 pp. 196–210, doi: https://doi.org/10.1108/14684520810879827
Download citation file:
Suggested Reading
Meta‐tags: still a matter of opinion
The Electronic Library (December,2005)
Genre analysis of bookmarked webpages
Online Information Review (November,2010)
Exploring individual communication power in the blogosphere
Internet Research (October,2008)
Enterprise 2.0: How Social Software Will Change the Future of Work
The Electronic Library (April,2010)
Del.icio.us
Reference Reviews (June,2008)
Related Chapters
Affective Personal Networks versus Daily Contacts: Analyzing Different Name Generators in a Social Activity-Travel Behavior Context
Transport Survey Methods: Best Practice for Decision Making
No Teacher Is an Island: How Social Networks Shape Teacher Quality
Promoting and Sustaining a Quality Teacher Workforce
The Enemy of My Friend Is Easy to Remember: Balance as a Compression Heuristic
Advances in Group Processes
Recommended for you
These recommendations are informed by your reading behaviors and indicated interests.
