@inproceedings{chi2008understanding,
  abstract = {Given the rise in popularity of social tagging systems, it seems only natural to ask how efficient is the organically evolved tagging vocabulary in describing underlying document objects? Does this distributed process really provide a way to circumnavigate the traditional "vocabulary problem" with ontology? We analyze a social tagging site, namely del.icio.us, with information theory in order to evaluate the efficiency of this social tagging site for encoding navigation paths to information sources. We show that information theory provides a natural and interesting way to understand this efficiency - or the descriptive, encoding power of tags. Our results indicate the efficiency of tags appears to be waning. We discuss the implications of our findings and provide insight into how our methods can be used to design more usable social tagging software.},
  acmid = {1379110},
  address = {New York, NY, USA},
  author = {Chi, Ed H. and Mytkowicz, Todd},
  booktitle = {Proceedings of the nineteenth ACM conference on Hypertext and hypermedia},
  doi = {10.1145/1379092.1379110},
  interhash = {81c80283290d396a41015d0df11822c7},
  intrahash = {d44d1c9a48f5b676388ffbc90c7577ba},
  isbn = {978-1-59593-985-2},
  location = {Pittsburgh, PA, USA},
  numpages = {8},
  pages = {81--88},
  publisher = {ACM},
  title = {Understanding the efficiency of social tagging systems using information theory},
  url = {http://doi.acm.org/10.1145/1379092.1379110},
  year = 2008
}

@inproceedings{dhillon:mallela:modha:03,
  author = {Dhillon, I. S. and Mallela, S. and Modha, D. S.},
  booktitle = {Proceedings of The Ninth ACM SIGKDD International              Conference on Knowledge Discovery and Data Mining({KDD}-2003)},
  interhash = {30fe4c22011ee3c5565d35709d9ce1f1},
  intrahash = {f7d4e60faba05f7c41e6836a8fbee5b2},
  pages = {89--98},
  title = {Information-Theoretic Co-Clustering},
  url = {/brokenurl#citeseer.ist.psu.edu/dhillon03informationtheoretic.html},
  year = 2003
}

@inproceedings{chi2008understanding,
  abstract = {Given the rise in popularity of social tagging systems, it seems only natural to ask how efficient is the organically evolved tagging vocabulary in describing underlying document objects? Does this distributed process really provide a way to circumnavigate the traditional "vocabulary problem" with ontology? We analyze a social tagging site, namely del.icio.us, with information theory in order to evaluate the efficiency of this social tagging site for encoding navigation paths to information sources. We show that information theory provides a natural and interesting way to understand this efficiency - or the descriptive, encoding power of tags. Our results indicate the efficiency of tags appears to be waning. We discuss the implications of our findings and provide insight into how our methods can be used to design more usable social tagging software.},
  address = {New York, NY, USA},
  author = {Chi, Ed H. and Mytkowicz, Todd},
  booktitle = {HT '08: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia},
  doi = {10.1145/1379092.1379110},
  interhash = {81c80283290d396a41015d0df11822c7},
  intrahash = {dfa880e6d3e33d0aeb357396fb1833cd},
  isbn = {978-1-59593-985-2},
  location = {Pittsburgh, PA, USA},
  pages = {81--88},
  publisher = {ACM},
  title = {Understanding the efficiency of social tagging systems using information theory},
  url = {http://portal.acm.org/citation.cfm?id=1379110&coll=GUIDE&dl=GUIDE&CFID=37458772&CFTOKEN=13998061&ret=1},
  year = 2008
}

@misc{citeulike:155,
  abstract = {Inspired by empirical studies of networked systems such as the Internet,
social networks, and biological networks, researchers have in recent years
developed a variety of techniques and models to help us understand or predict
the behavior of these systems. Here we review developments in this field,
including such concepts as the small-world effect, degree distributions,
clustering, network correlations, random graph models, models of network growth
and preferential attachment, and dynamical processes taking place on networks.},
  author = {Newman, M. E. J.},
  citeulike-article-id = {155},
  eprint = {cond-mat/0303516},
  interhash = {7bedd01cb4c06af9f5200b0fb3faa571},
  intrahash = {d53568209eef08fb0a8734cf34c59a71},
  keywords = {affinity algorithm arch clustering complex-systems folksonomy growth information_retrieval math network network_theory readinggroup scale-free-networks small_world socialnetwork systems thesis web web-graph},
  month = {March},
  priority = {5},
  title = {The structure and function of complex networks},
  url = {http://arxiv.org/abs/cond-mat/0303516},
  year = 2003
}