KeyWorld: Extracting keywords from a document as a small world

Yutaka Matsuo, Yukio Ohsawa, Mitsuru Ishizuka

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

21 Citations (Scopus)

Abstract

The small world topology is known widespread in biological, social and man-made systems. This paper shows that the small world structure also exists in documents, such as papers. A document is represented by a network; the nodes represent terms, and the edges represent the co-occurrence of terms. This network is shown to have the characteristics of being a small world, i.e., nodes are highly clustered yet the path length between them is small. Based on the topology, we develop an indexing system called KeyWorld, which extracts important terms by measuring their contribution to the graph being small world.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages271-281
Number of pages11
Volume2226
ISBN (Print)9783540429562
Publication statusPublished - 2001
Externally publishedYes
Event4th International Conference on Discovery Science, DS 2001 - Washington, United States
Duration: 2001 Nov 252001 Nov 28

Publication series

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

Other

Other4th International Conference on Discovery Science, DS 2001
Country/TerritoryUnited States
CityWashington
Period01/11/2501/11/28

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Fingerprint

Dive into the research topics of 'KeyWorld: Extracting keywords from a document as a small world'. Together they form a unique fingerprint.

Cite this