Abstract
A document is represented by a network; the nodes represent terms, and the edges represent the co-occurrence of terms. This paper shows that the network has the characteristics of being small world, i.e., highly clustered and short path length. Based on the topology, we can extract important terms, even if they are rare, by measuring their contribution to the graph being small world.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Albert, H. Jeong, and A.-L. Barabasi. The diameter of the World Wide Web. Nature, 401, 1999.
H. Kautz, B. Selman, and M. Shah. The hidden Web. AI magagine, 18(2), 1997.
J. Kleinberg. The small-worldphenomenon: An algorithmic perspective. Technical Report TR 99-1776, Cornell University, 1999.
Y. Matsuo, Y. Ohsawa, M. Ishizuka. A Document as a Small World In Proc. SCI-01, Vol.8, pages 410–414, 2001
T. Walsh. Search in a small world. In Proc. IJCAI-99, pages 1172–1177, 1999.
D. Watts. Small worlds: the dynamics of networks between order and randomness. Princeton, 1999.
D. Watts and S. Strogatz. Collective dynamics of small-world net works. Nature, 393, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matsuo, Y., Ohsawa, Y., Ishizuka, M. (2001). A Document as a Small World. In: Terano, T., Ohsawa, Y., Nishida, T., Namatame, A., Tsumoto, S., Washio, T. (eds) New Frontiers in Artificial Intelligence. JSAI 2001. Lecture Notes in Computer Science(), vol 2253. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45548-5_60
Download citation
DOI: https://doi.org/10.1007/3-540-45548-5_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43070-4
Online ISBN: 978-3-540-45548-6
eBook Packages: Springer Book Archive