Experimental comparison of semantic word clouds

Lukas Barth, Stephen G Kobourov, Sergey Pupyrev

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

20 Citations (Scopus)

Abstract

We study the problem of computing semantics-preserving word clouds in which semantically related words are close to each other. We implement three earlier algorithms for creating word clouds and three new ones. We define several metrics for quantitative evaluation of the resulting layouts. Then the algorithms are compared according to these metrics, using two data sets of documents from Wikipedia and research papers. We show that two of our new algorithms outperform all the others by placing many more pairs of related words so that their bounding boxes are adjacent. Moreover, this improvement is not achieved at the expense of significantly worsened measurements for the other metrics.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages247-258
Number of pages12
Volume8504 LNCS
ISBN (Print)9783319079585
DOIs
StatePublished - 2014
Event13th International Symposium on Experimental Algorithms, SEA 2014 - Copenhagen, Denmark
Duration: Jun 29 2014Jul 1 2014

Publication series

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

Other

Other13th International Symposium on Experimental Algorithms, SEA 2014
CountryDenmark
CityCopenhagen
Period6/29/147/1/14

Fingerprint

Semantics
Metric
Wikipedia
Quantitative Evaluation
Layout
Adjacent
Computing

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Barth, L., Kobourov, S. G., & Pupyrev, S. (2014). Experimental comparison of semantic word clouds. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8504 LNCS, pp. 247-258). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8504 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-07959-2_21

Experimental comparison of semantic word clouds. / Barth, Lukas; Kobourov, Stephen G; Pupyrev, Sergey.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8504 LNCS Springer Verlag, 2014. p. 247-258 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8504 LNCS).

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

Barth, L, Kobourov, SG & Pupyrev, S 2014, Experimental comparison of semantic word clouds. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 8504 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8504 LNCS, Springer Verlag, pp. 247-258, 13th International Symposium on Experimental Algorithms, SEA 2014, Copenhagen, Denmark, 6/29/14. https://doi.org/10.1007/978-3-319-07959-2_21
Barth L, Kobourov SG, Pupyrev S. Experimental comparison of semantic word clouds. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8504 LNCS. Springer Verlag. 2014. p. 247-258. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-07959-2_21
Barth, Lukas ; Kobourov, Stephen G ; Pupyrev, Sergey. / Experimental comparison of semantic word clouds. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8504 LNCS Springer Verlag, 2014. pp. 247-258 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{8a3a2f61bd3f49e28f1f4fe57a283afc,
title = "Experimental comparison of semantic word clouds",
abstract = "We study the problem of computing semantics-preserving word clouds in which semantically related words are close to each other. We implement three earlier algorithms for creating word clouds and three new ones. We define several metrics for quantitative evaluation of the resulting layouts. Then the algorithms are compared according to these metrics, using two data sets of documents from Wikipedia and research papers. We show that two of our new algorithms outperform all the others by placing many more pairs of related words so that their bounding boxes are adjacent. Moreover, this improvement is not achieved at the expense of significantly worsened measurements for the other metrics.",
author = "Lukas Barth and Kobourov, {Stephen G} and Sergey Pupyrev",
year = "2014",
doi = "10.1007/978-3-319-07959-2_21",
language = "English (US)",
isbn = "9783319079585",
volume = "8504 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "247--258",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Experimental comparison of semantic word clouds

AU - Barth, Lukas

AU - Kobourov, Stephen G

AU - Pupyrev, Sergey

PY - 2014

Y1 - 2014

N2 - We study the problem of computing semantics-preserving word clouds in which semantically related words are close to each other. We implement three earlier algorithms for creating word clouds and three new ones. We define several metrics for quantitative evaluation of the resulting layouts. Then the algorithms are compared according to these metrics, using two data sets of documents from Wikipedia and research papers. We show that two of our new algorithms outperform all the others by placing many more pairs of related words so that their bounding boxes are adjacent. Moreover, this improvement is not achieved at the expense of significantly worsened measurements for the other metrics.

AB - We study the problem of computing semantics-preserving word clouds in which semantically related words are close to each other. We implement three earlier algorithms for creating word clouds and three new ones. We define several metrics for quantitative evaluation of the resulting layouts. Then the algorithms are compared according to these metrics, using two data sets of documents from Wikipedia and research papers. We show that two of our new algorithms outperform all the others by placing many more pairs of related words so that their bounding boxes are adjacent. Moreover, this improvement is not achieved at the expense of significantly worsened measurements for the other metrics.

UR - http://www.scopus.com/inward/record.url?scp=84903728254&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84903728254&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-07959-2_21

DO - 10.1007/978-3-319-07959-2_21

M3 - Conference contribution

SN - 9783319079585

VL - 8504 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 247

EP - 258

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -