scispace - formally typeset
Journal ArticleDOI

A complex network approach to text summarization

Reads0
Chats0
TLDR
A set of 14 summarizers are developed, generically referred to as CN-Summ, employing network concepts such as node degree, length of shortest paths, d-rings and k-cores to select sentences for an extractive summary of texts.
About
This article is published in Information Sciences.The article was published on 2009-02-01. It has received 139 citations till now. The article focuses on the topics: Automatic summarization & Multi-document summarization.

read more

Citations
More filters
Journal ArticleDOI

Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications

TL;DR: A diversity of phenomena are surveyed, which may be classified into no less than 11 areas, providing a clear indication of the impact of the field of complex networks.
Journal ArticleDOI

Analyzing and modeling real-world phenomena with complex networks: a survey of applications

TL;DR: The success of new scientific areas can be assessed by their potential in contributing to new theoretical approaches and in applications to real-world problems as mentioned in this paper, and complex networks have fared extremely well in both these aspects, with their sound theoretical basis being developed over the years and with a variety of applications.
Journal ArticleDOI

Recent automatic text summarization techniques: a survey

TL;DR: A comprehensive survey of recent text summarization extractive approaches developed in the last decade is presented and the discussion of useful future directions that can help researchers to identify areas where further research is needed are discussed.
Posted Content

Language as an Evolving Word Web

TL;DR: The authors treated language as a self-organizing network of interacting words and showed that the distribution of the number of connections of words in such a network is of a peculiar form which includes two pronounced power-law regions.
Journal ArticleDOI

K-core decomposition of large networks on a single PC

TL;DR: A thorough analysis of all algorithms concluding that it is viable to compute k-core decomposition for large networks in a consumer-grade PC and an optimized implementation of an external-memory algorithm by Cheng, Ke, Chu, and Ozsu is presented.
References
More filters
Journal ArticleDOI

Collective dynamics of small-world networks

TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Journal ArticleDOI

Emergence of Scaling in Random Networks

TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Book

Introduction to Algorithms

TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Journal ArticleDOI

Statistical mechanics of complex networks

TL;DR: In this paper, a simple model based on the power-law degree distribution of real networks was proposed, which was able to reproduce the power law degree distribution in real networks and to capture the evolution of networks, not just their static topology.