Tag clouds provide an aggregate of tag-usage statistics. They are typically
sent as in-line HTML to browsers. However, display mechanisms suited for
ordinary text are not ideal for tags, because font sizes may vary widely on a
line. As well, the typical layout does not account for relationships that may
be known between tags. This paper presents models and algorithms to improve the
display of tag clouds that con- sist of in-line HTML, as well as algorithms
that use nested tables to achieve a more general 2-dimensional layout in which
tag relationships are considered. The first algorithms leverage prior work in
typesetting and rectangle packing, whereas the second group of algorithms
leverage prior work in Electronic Design Automation. Experiments show our
algorithms can be efficiently implemented and perform well.
%0 Generic
%1 citeulike:1299464
%A Kaser, Owen
%A Lemire, Daniel
%D 2007
%K algorithm, tag\_clustering, tagcloud
%T Tag-Cloud Drawing: Algorithms for Cloud Visualization
%U http://arxiv.org/abs/cs/0703109
%X Tag clouds provide an aggregate of tag-usage statistics. They are typically
sent as in-line HTML to browsers. However, display mechanisms suited for
ordinary text are not ideal for tags, because font sizes may vary widely on a
line. As well, the typical layout does not account for relationships that may
be known between tags. This paper presents models and algorithms to improve the
display of tag clouds that con- sist of in-line HTML, as well as algorithms
that use nested tables to achieve a more general 2-dimensional layout in which
tag relationships are considered. The first algorithms leverage prior work in
typesetting and rectangle packing, whereas the second group of algorithms
leverage prior work in Electronic Design Automation. Experiments show our
algorithms can be efficiently implemented and perform well.
@misc{citeulike:1299464,
abstract = {Tag clouds provide an aggregate of tag-usage statistics. They are typically
sent as in-line HTML to browsers. However, display mechanisms suited for
ordinary text are not ideal for tags, because font sizes may vary widely on a
line. As well, the typical layout does not account for relationships that may
be known between tags. This paper presents models and algorithms to improve the
display of tag clouds that con- sist of in-line HTML, as well as algorithms
that use nested tables to achieve a more general 2-dimensional layout in which
tag relationships are considered. The first algorithms leverage prior work in
typesetting and rectangle packing, whereas the second group of algorithms
leverage prior work in Electronic Design Automation. Experiments show our
algorithms can be efficiently implemented and perform well.},
added-at = {2009-12-11T23:34:46.000+0100},
archiveprefix = {arXiv},
author = {Kaser, Owen and Lemire, Daniel},
biburl = {https://www.bibsonomy.org/bibtex/2fa902a6990c860a534dd737871e463cd/djsaab},
citeulike-article-id = {1299464},
citeulike-linkout-0 = {http://arxiv.org/abs/cs/0703109},
citeulike-linkout-1 = {http://arxiv.org/pdf/cs/0703109},
day = 7,
description = {djsaab's CiteULike library 20091211},
eprint = {cs/0703109},
interhash = {cb6ed5e3340cf684ec55299adc65e1a9},
intrahash = {fa902a6990c860a534dd737871e463cd},
keywords = {algorithm, tag\_clustering, tagcloud},
month = May,
posted-at = {2008-05-29 12:57:39},
priority = {4},
timestamp = {2009-12-11T23:34:59.000+0100},
title = {Tag-Cloud Drawing: Algorithms for Cloud Visualization},
url = {http://arxiv.org/abs/cs/0703109},
year = 2007
}