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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barth, L., et al.: Semantic word cloud representations: Hardness and approximation algorithms. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 514–525. Springer, Heidelberg (2014)
Cui, W., Wu, Y., Liu, S., Wei, F., Zhou, M., Qu, H.: Context-preserving dynamic word cloud visualization. IEEE Comput. Graph. Appl. 30(6), 42–53 (2010)
Deutsch, S., Schrammel, J., Tscheligi, M.: Comparing different layouts of tag clouds: Findings on visual perception. In: Ebert, A., Dix, A., Gershon, N.D., Pohl, M. (eds.) HCIV (INTERACT) 2009. LNCS, vol. 6431, pp. 23–37. Springer, Heidelberg (2011)
Erkan, G., Radev, D.R.: LexRank: Graph-based lexical centrality as salience in text summarization. J. Artificial Intelligence Res. 22(1), 457–479 (2004)
Koh, K., Lee, B., Kim, B.H., Seo, J.: ManiWordle: Providing flexible control over Wordle. IEEE Trans. Vis. Comput. Graphics 16(6), 1190–1197 (2010)
Lawler, E.L.: Fast approximation algorithms for knapsack problems. Math. Oper. Res. 4(4), 339–356 (1979)
Li, H., Abe, N.: Word clustering and disambiguation based on co-occurrence data. In: Int. Conf. Comput. Linguistics, vol. 2, pp. 749–755. Association for Computational Linguistics, Stroudsburg (1998)
Lovász, L., Plummer, M.: Matching Theory. Akadémiai Kiadó, Budapest (1986)
Manning, C.D., Raghavan, P., Schütze, H.: Introduction to Information Retrieval. Cambridge University Press, Cambridge (2008)
Porter, M.F.: An algorithm for suffix stripping. Program: Electron. Lib. 14(3), 130–137 (1980)
Schrammel, J., Leitner, M., Tscheligi, M.: Semantically structured tag clouds: An empirical evaluation of clustered presentation approaches. In: SIGCHI Conference on Human Factors in Computing Systems, pp. 2037–2040. ACM, New York (2009)
Viégas, F.B., Wattenberg, M., Feinberg, J.: Participatory visualization with Wordle. IEEE Trans. Vis. Comput. Graphics 15(6), 1137–1144 (2009)
Wu, Y., Provan, T., Wei, F., Liu, S., Ma, K.L.: Semantic-preserving word clouds by seam carving. Comput. Graph. Forum 30(3), 741–750 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Barth, L., Kobourov, S.G., Pupyrev, S. (2014). Experimental Comparison of Semantic Word Clouds. In: Gudmundsson, J., Katajainen, J. (eds) Experimental Algorithms. SEA 2014. Lecture Notes in Computer Science, vol 8504. Springer, Cham. https://doi.org/10.1007/978-3-319-07959-2_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-07959-2_21
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07958-5
Online ISBN: 978-3-319-07959-2
eBook Packages: Computer ScienceComputer Science (R0)