By Topic

KeyGraph: automatic indexing by co-occurrence graph based on building construction metaphor

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Y. Ohsawa ; Dept. Syst. & Huamn Sci., Osaka Univ., Japan ; N. E. Benson ; M. Yachida

Presents an algorithm for extracting keywords representing the asserted main point in a document, without relying on external devices such as natural-language processing tools or a document corpus. Our algorithm, KeyGraph, is based on the segmentation of a graph, representing the co-occurrence between terms in a document, into clusters. Each cluster corresponds to a concept on which an author's idea is based, and the top-ranked terms are selected as keywords using a statistic based on each term's relationship to these clusters. This strategy comes from considering that a document is constructed like a building for expressing new ideas based on traditional concepts. The experimental results show that the thus-extracted terms match the author's main point quite accurately, even though KeyGraph does not use each term's average frequency in a corpus, i.e. KeyGraph is a content-sensitive, domain-independent indexing device

Published in:

Research and Technology Advances in Digital Libraries, 1998. ADL 98. Proceedings. IEEE International Forum on

Date of Conference:

22-24 Apr 1998