License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FUN.2016.9
URN: urn:nbn:de:0030-drops-58777
URL: http://drops.dagstuhl.de/opus/volltexte/2016/5877/
Go to the corresponding LIPIcs Volume Portal


Cambi, Francesco ; Crescenzi, Pierluigi ; Pagli, Linda

Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering

pdf-format:
17.pdf (3 MB)


Abstract

In this paper, we analyse the contents of the web site of two Italian press agencies and of four of the most popular Italian newspapers, in order to answer questions such as what are the most relevant news, what is the average life of news, and how much different are different sites. To this aim, we have developed a web-based application which hourly collects the articles in the main column of the six web sites, implements an incremental clustering algorithm for grouping the articles into news, and finally allows the user to see the answer to the above questions. We have also designed and implemented a two-layer modification of the incremental clustering algorithm and executed some preliminary experimental evaluation of this modification: it turns out that the two-layer clustering is extremely efficient in terms of time performances, and it has quite good performances in terms of precision and recall.

BibTeX - Entry

@InProceedings{cambi_et_al:LIPIcs:2016:5877,
  author =	{Francesco Cambi and Pierluigi Crescenzi and Linda Pagli},
  title =	{{Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{9:1--9:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Erik D. Demaine and Fabrizio Grandoni},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/5877},
  URN =		{urn:nbn:de:0030-drops-58777},
  doi =		{10.4230/LIPIcs.FUN.2016.9},
  annote =	{Keywords: text mining, incremental clustering, on-line news}
}

Keywords: text mining, incremental clustering, on-line news
Seminar: 8th International Conference on Fun with Algorithms (FUN 2016)
Issue Date: 2016
Date of publication: 25.05.2016


DROPS-Home | Fulltext Search | Imprint Published by LZI