Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Document sentences as a small world

Balinsky, Helen, Balinsky, Alexander and Simske, Steven 2011. Document sentences as a small world. Presented at: 2011 IEEE International Conference on Systems, Man, and Cybernetics (SMC), Anchorage, AK, USA, 9-12 October 2011. Published in: Tunstel, E. and Nahavandi, S. eds. Proceedings of the 2011 IEEE International Conference on Systems, Man, and Cybernetics (SMC). Los Alamitos, CA: IEEE, pp. 2583-2588. 10.1109/ICSMC.2011.6084065

Full text not available from this repository.

Abstract

In this paper we describe the possibility of constructing the well-known small world topology for an ordinary document, based on the actual document structure. Sentences in such a graph are represented by nodes, which are connected if and only if the corresponding sentences are neighbors or share at least one common keyword. This graph is built using a carefully selected one-parameter set of keywords. By varying this parameter - the level of meaningfulness - we transition the document-representing graph from a trivial path graph into a large random graph. During such a conversion, as the parameter is varied over its range, the graph becomes a small world. This in turn opens the possibility of applying many well-established ranking algorithms to the problem of ranking sentences and paragraphs in text documents. These rankings are, in turn, crucial for document understanding, summarization and information extraction. These graphs can also serve as a source of interesting small world graphs for the theory of complex networks.

Item Type: Conference or Workshop Item (Paper)
Date Type: Publication
Status: Published
Schools: Mathematics
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher: IEEE
ISBN: 9781457706523
Last Modified: 04 Jun 2017 04:20
URI: http://orca-mwe.cf.ac.uk/id/eprint/37138

Citation Data

Cited 8 times in Google Scholar. View in Google Scholar

Cited 12 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item