@inproceedings{Chirita07tagDesktop,
  abstract = {The success of the Semantic Web depends on the availability of Web pages annotated with metadata. Free form metadata or tags, as used in social bookmarking and folksonomies, have become more and more popular and successful. Such tags are relevant keywords associated with or assigned to a piece of information (e.g., a Web page), describing the item and enabling keyword-based classification. In this paper we propose P-TAG, a method which automatically generates personalized tags for Web pages. Upon browsing a Web page, P-TAG produces keywords relevant both to its textual content, but also to the data residing on the surfer's Desktop, thus expressing a personalized viewpoint. Empirical evaluations with several algorithms pursuing this approach showed very promising results. We are therefore very confident that such a user oriented automatic tagging approach can provide large scale personalized metadata annotations as an important step towards realizing the Semantic Web.},
  added-at = {2010-10-28T05:13:45.000+0200},
  address = {New York, NY, USA},
  author = {Chirita, Paul Alexandru and Costache, Stefania and Nejdl, Wolfgang and Handschuh, Siegfried},
  biburl = {http://www.bibsonomy.org/bibtex/258f1705eb270c20c6aaea2377f88e664/lee_peck},
  booktitle = {WWW '07: Proceedings of the 16th international conference on World Wide Web},
  description = {P-TAG},
  doi = {10.1145/1242572.1242686},
  interhash = {93612f3a17257a5d0d73e95d59d0c408},
  intrahash = {58f1705eb270c20c6aaea2377f88e664},
  isbn = {978-1-59593-654-7},
  keywords = {07 Chirita content desktop recommendation tag},
  location = {Banff, Alberta, Canada},
  pages = {845--854},
  publisher = {ACM},
  timestamp = {2010-10-28T05:13:45.000+0200},
  title = {P-TAG: large scale automatic generation of personalized annotation tags for the web},
  url = {http://portal.acm.org/citation.cfm?id=1242686},
  year = 2007
}

@article{JaMa07,
  abstract = {Collaborative tagging systems allow users to assign keywords{\^a}€”so called {\^a}€œtags{\^a}€{\^a}€”to resources. Tags are used for navigation, finding resources and serendipitous browsing and thus provide an immediate benefit for users. These systems usually includetag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabularyacross users. In practice, however, only very basic recommendation strategies are applied.},
  added-at = {2010-08-04T09:43:28.000+0200},
  author = {J{\"a}schke, Robert and Marinho, Leandro and Hotho, Andreas and Schmidt-Thieme, Lars and Stumme, Gerd},
  biburl = {http://www.bibsonomy.org/bibtex/2ac3f5a621c09b7ea45e28210d9b99a30/telli},
  interhash = {083c60e52ba108c6c5d96b56431c8d86},
  intrahash = {ac3f5a621c09b7ea45e28210d9b99a30},
  journal = {Knowledge Discovery in Databases: PKDD 2007},
  keywords = {07 Jaschke folkrank recommendation tag},
  pages = {506--514},
  timestamp = {2010-08-04T09:43:28.000+0200},
  title = {Tag Recommendations in Folksonomies},
  url = {http://dx.doi.org/10.1007/978-3-540-74976-9_52},
  year = 2007
}

@article{Jaschke07tagRecommendation,
  abstract = {Collaborative tagging systems allow users to assign keywords—so called “tags”—to resources. Tags are used for navigation,
finding resources and serendipitous browsing and thus provide an immediate benefit for users. These systems usually includetag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabularyacross users. In practice, however, only very basic recommendation strategies are applied.},
  added-at = {2010-04-21T01:27:25.000+0200},
  author = {J\"{a}schke, Robert and Marinho, Leandro and Hotho, Andreas and Schmidt-Thieme, Lars and Stumme, Gerd},
  biburl = {http://www.bibsonomy.org/bibtex/2ac3f5a621c09b7ea45e28210d9b99a30/lee_peck},
  description = {SpringerLink - Book Chapter},
  interhash = {083c60e52ba108c6c5d96b56431c8d86},
  intrahash = {ac3f5a621c09b7ea45e28210d9b99a30},
  journal = {Knowledge Discovery in Databases: PKDD 2007},
  keywords = {07 Jaschke folkrank recommendation tag},
  pages = {506--514},
  timestamp = {2010-04-21T01:27:25.000+0200},
  title = {Tag Recommendations in Folksonomies},
  url = {http://dx.doi.org/10.1007/978-3-540-74976-9_52},
  year = 2007
}

@article{Ercan07lexicalChains,
  abstract = {Keywords can be considered as condensed versions of documents and short forms of their summaries. In this paper, the problem of automatic extraction of keywords from documents is treated as a supervised learning task. A lexical chain holds a set of semantically related words of a text and it can be said that a lexical chain represents the semantic content of a portion of the text. Although lexical chains have been extensively used in text summarization, their usage for keyword extraction problem has not been fully investigated. In this paper, a keyword extraction technique that uses lexical chains is described, and encouraging results are obtained.},
  added-at = {2010-03-05T19:50:57.000+0100},
  author = {Ercan, Gonenc and Cicekli, Ilyas},
  biburl = {http://www.bibsonomy.org/bibtex/2a2ce0a2396c2db71f15b6c35daa31f01/lee_peck},
  description = {ScienceDirect - Information Processing & Management : Using lexical chains for keyword extraction},
  doi = {DOI: 10.1016/j.ipm.2007.01.015},
  interhash = {125688a52156e39122101918247285c3},
  intrahash = {a2ce0a2396c2db71f15b6c35daa31f01},
  issn = {0306-4573},
  journal = {Information Processing & Management},
  keywords = {07 Ercan WordNet chains extraction keyword lexical text},
  note = {Text Summarization},
  number = 6,
  pages = {1705 - 1714},
  timestamp = {2010-03-05T19:50:57.000+0100},
  title = {Using lexical chains for keyword extraction},
  url = {http://www.sciencedirect.com/science/article/B6VC8-4N5KY5S-2/2/fdb331a352bdad3b6cd61b929f37ec54},
  volume = 43,
  year = 2007
}

@inproceedings{Gabrilovich07relatednessWikipedia,
  added-at = {2010-02-16T03:40:55.000+0100},
  address = {San Francisco, CA, USA},
  author = {Gabrilovich, Evgeniy and Markovitch, Shaul},
  biburl = {http://www.bibsonomy.org/bibtex/2698b6212222a3eeb34e3885f3835e4b1/lee_peck},
  booktitle = {IJCAI'07: Proceedings of the 20th international joint conference on Artifical intelligence},
  interhash = {5baf6af4bf58cf3926b39a12edb35e58},
  intrahash = {698b6212222a3eeb34e3885f3835e4b1},
  keywords = {07 Gabrilovich relatedness semantics wikipedia},
  location = {Hyderabad, India},
  pages = {1606--1611},
  publisher = {Morgan Kaufmann Publishers Inc.},
  timestamp = {2010-02-16T03:40:55.000+0100},
  title = {Computing semantic relatedness using Wikipedia-based explicit semantic analysis},
  year = 2007
}

@inproceedings{Banerjee07clusteringShort,
  added-at = {2010-02-16T02:50:06.000+0100},
  address = {New York, NY, USA},
  author = {Banerjee, Somnath and Ramanathan, Krishnan and Gupta, Ajay},
  biburl = {http://www.bibsonomy.org/bibtex/2636ba6a840386d6d2b83a6aa38af2fec/lee_peck},
  booktitle = {SIGIR '07: Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval},
  doi = {http://doi.acm.org/10.1145/1277741.1277909},
  interhash = {fa9b159e2969385ffd5de334479a9579},
  intrahash = {636ba6a840386d6d2b83a6aa38af2fec},
  isbn = {978-1-59593-597-7},
  keywords = {07 Banerjee clustering semantic short texts wikipedia},
  location = {Amsterdam, The Netherlands},
  pages = {787--788},
  publisher = {ACM},
  timestamp = {2010-02-16T02:50:06.000+0100},
  title = {Clustering short texts using wikipedia},
  year = 2007
}

@article{Cattuto07semioticDynamics,
  abstract = {10.1073/pnas.0610487104 Collaborative tagging has been quickly gaining ground because of its ability to recruit the activity of web users into effectively organizing and sharing vast amounts of information. Here we collect data from a popular system and investigate the statistical properties of tag cooccurrence. We introduce a stochastic model of user behavior embodying two main aspects of collaborative tagging: () a frequency-bias mechanism related to the idea that users are exposed to each other's tagging activity; () a notion of memory, or aging of resources, in the form of a heavy-tailed access to the past state of the system. Remarkably, our simple modeling is able to account quantitatively for the observed experimental features with a surprisingly high accuracy. This points in the direction of a universal behavior of users who, despite the complexity of their own cognitive processes and the uncoordinated and selfish nature of their tagging activity, appear to follow simple activity patterns.},
  added-at = {2010-01-30T05:29:47.000+0100},
  author = {Cattuto, Ciro and Loreto, Vittorio and Pietronero, Luciano},
  biburl = {http://www.bibsonomy.org/bibtex/2f4ec35fe0a480e478a3b1a2073682941/lee_peck},
  day = 30,
  description = {CiteULike: Semiotic dynamics and collaborative tagging},
  interhash = {189402152f540f931a0eea5b8538411f},
  intrahash = {f4ec35fe0a480e478a3b1a2073682941},
  journal = {Proceedings of the National Academy of Sciences (PNAS)},
  keywords = {07 Cattuto dynamics folksonomy modelling semiotic},
  month = {January},
  number = 5,
  pages = {1461--1464},
  timestamp = {2010-01-30T05:29:47.000+0100},
  title = {Semiotic dynamics and collaborative tagging},
  url = {http://dx.doi.org/10.1073/pnas.0610487104},
  volume = 104,
  year = 2007
}

@inproceedings{Yucesoy07semanticSimilarity,
  abstract = {With the rapid growth of the World Wide Web (www), it becomes a critical issue to design and organize the vast amounts of on-line documents on the web according to their topic. Even for the search engines it is very important to group similar documents in order to improve their performance when a query is submitted to the system. Clusterng is useful for taxonomy design and similarity search of documents on such a domain. Similarity is fundamental to many clustering applications on hypertext. In this paper, we will study how measures of similarity are used to cluster a collection of documents on a web site. Most of the document clustering techniques rely on single term analysis of text, such as vector space model. To better group of related documents we propose a new semantic similarity measure. We compare our measure with Wu-Palmer similarity and cosine similarity. Experimental results show that cosine similarity perform better than the semantic similarities. We demonstrate our results on Turkish documents. This is a first study that considers the semantic similarities between Turkish documents.},
  added-at = {2010-01-26T03:41:30.000+0100},
  author = {Yucesoy, B. and Oguducu, S.G.},
  biburl = {http://www.bibsonomy.org/bibtex/2b87f04dd555f54a9cba00d716ed0902b/lee_peck},
  booktitle = {Machine Learning and Applications, 2007. ICMLA 2007. Sixth International Conference on},
  description = {Welcome to IEEE Xplore 2.0: Comparison of semantic and single term similarity measures for clustering turkish documents},
  doi = {10.1109/ICMLA.2007.52},
  interhash = {d5a1574e478339a5de103178d0ac2e1d},
  intrahash = {b87f04dd555f54a9cba00d716ed0902b},
  keywords = {07 Yucesoy clustering semantic similarity term turkish},
  month = {Dec.},
  pages = {393-398},
  timestamp = {2010-01-26T03:41:30.000+0100},
  title = {Comparison of semantic and single term similarity measures for clustering turkish documents},
  url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?tp=&arnumber=4457262&isnumber=4457184},
  year = 2007
}

@inproceedings{Bollegala07semanticSearch,
  added-at = {2010-01-26T01:34:43.000+0100},
  address = {New York, NY, USA},
  author = {Bollegala, Danushka and Matsuo, Yutaka and Ishizuka, Mitsuru},
  biburl = {http://www.bibsonomy.org/bibtex/2c957aa2fd65df63c8c4af14b1fc827c5/lee_peck},
  booktitle = {WWW '07: Proceedings of the 16th international conference on World Wide Web},
  doi = {http://doi.acm.org/10.1145/1242572.1242675},
  interhash = {46247eb09b5e87a6e5d4a8b2cf821ee7},
  intrahash = {c957aa2fd65df63c8c4af14b1fc827c5},
  isbn = {978-1-59593-654-7},
  keywords = {07 Bollegala engine search semantic similarity term},
  location = {Banff, Alberta, Canada},
  pages = {757--766},
  publisher = {ACM},
  timestamp = {2010-01-26T01:34:43.000+0100},
  title = {Measuring semantic similarity between words using web search engines},
  year = 2007
}

@inproceedings{Ahn07snowballSampling,
  abstract = {Social networking services are a fast-growing business in the Internet. However, it is unknown if online relationships and their growth patterns are the same as in real-life social networks. In this paper, we compare the structures of three online social networking services: Cyworld, MySpace, and orkut, each with more than 10 million users, respectively. We have access to complete data of Cyworld's ilchon (friend) relationships and analyze its degree distribution, clustering property, degree correlation, and evolution over time. We also use Cyworld data to evaluate the validity of snowball sampling method, which we use to crawl and obtain partial network topologies of MySpace and orkut. Cyworld, the oldest of the three, demonstrates a changing scaling behavior over time in degree distribution. The latest Cyworld data's degree distribution exhibits a multi-scaling behavior, while those of MySpace and orkut have simple scaling behaviors with different exponents. Very interestingly, each of the two e ponents corresponds to the different segments in Cyworld's degree distribution. Certain online social networking services encourage online activities that cannot be easily copied in real life; we show that they deviate from close-knit online social networks which show a similar degree correlation pattern to real-life social networks.},
  added-at = {2010-01-08T03:21:33.000+0100},
  address = {New York, NY, USA},
  author = {Ahn, Yong-Yeol and Han, Seungyeop and Kwak, Haewoon and Moon, Sue and Jeong, Hawoong},
  biburl = {http://www.bibsonomy.org/bibtex/26165fcf297f7b8cca2f9bb7e73c7d890/lee_peck},
  booktitle = {WWW '07: Proceedings of the 16th international conference on World Wide Web},
  description = {Analysis of topological characteristics of huge online social networking services},
  doi = {http://doi.acm.org/10.1145/1242572.1242685},
  interhash = {444ffef9e7a5b4255d78f26f0409864d},
  intrahash = {6165fcf297f7b8cca2f9bb7e73c7d890},
  isbn = {978-1-59593-654-7},
  keywords = {07 Ahn networks sampling snowball social},
  location = {Banff, Alberta, Canada},
  pages = {835--844},
  publisher = {ACM},
  timestamp = {2010-01-08T03:21:33.000+0100},
  title = {Analysis of topological characteristics of huge online social networking services},
  url = {http://portal.acm.org/citation.cfm?id=1242685},
  year = 2007
}

@article{Mika07ontologiesModel,
  abstract = {In our work the traditional bipartite model of ontologies is extended with the social dimension, leading to a tripartite model of actors, concepts and instances. We demonstrate the application of this representation by showing how community-based semantics emerges from this model through a process of graph transformation. We illustrate ontology emergence by two case studies, an analysis of a large scale folksonomy system and a novel method for the extraction of community-based ontologies from Web pages.},
  added-at = {2010-01-07T01:37:21.000+0100},
  address = {Amsterdam, The Netherlands, The Netherlands},
  author = {Mika, Peter},
  biburl = {http://www.bibsonomy.org/bibtex/2db2140398fe061b8f99cad45cf438e3e/lee_peck},
  doi = {http://dx.doi.org/10.1016/j.websem.2006.11.002},
  interhash = {5bba04607af19c94d2438ae13f362649},
  intrahash = {db2140398fe061b8f99cad45cf438e3e},
  issn = {1570-8268},
  journal = {Web Semant.},
  keywords = {07 Mika folksonomy model ontology},
  number = 1,
  pages = {5--15},
  publisher = {Elsevier Science Publishers B. V.},
  timestamp = {2010-01-07T01:37:21.000+0100},
  title = {Ontologies are us: A unified model of social networks and semantics},
  url = {http://portal.acm.org/citation.cfm?id=1229195},
  volume = 5,
  year = 2007
}

@inproceedings{Halpin07complexDynamics,
  abstract = {The debate within the Web community over the optimal means by which to organize information often pits formalized classifications against distributed collaborative tagging systems. A number of questions remain unanswered, however, regarding the nature of collaborative tagging systems including whether coherent categorization schemes can emerge from unsupervised tagging by users. This paper uses data from the social bookmarking site delicio. us to examine the dynamics of collaborative tagging systems. In particular, we examine whether the distribution of the frequency of use of tags for "popular" sites with a long history (many tags and many users) can be described by a power law distribution, often characteristic of what are considered complex systems. We produce a generative model of collaborative tagging in order to understand the basic dynamics behind tagging, including how a power law distribution of tags could arise. We empirically examine the tagging history of sites in order to determine how this distribution arises over time and to determine the patterns prior to a stable distribution. Lastly, by focusing on the high-frequency tags of a site where the distribution of tags is a stabilized power law, we show how tag co-occurrence networks for a sample domain of tags can be used to analyze the meaning of particular tags given their relationship to other tags.},
  added-at = {2010-01-04T02:15:06.000+0100},
  address = {New York, NY, USA},
  author = {Halpin, Harry and Robu, Valentin and Shepherd, Hana},
  biburl = {http://www.bibsonomy.org/bibtex/22c2c689cb9946670785d0940e9dab324/lee_peck},
  booktitle = {WWW '07: Proceedings of the 16th international conference on World Wide Web},
  description = {The complex dynamics of collaborative tagging},
  doi = {http://doi.acm.org/10.1145/1242572.1242602},
  interhash = {0a44c162c87ebd3186879a070d2c8c9d},
  intrahash = {2c2c689cb9946670785d0940e9dab324},
  isbn = {978-1-59593-654-7},
  keywords = {07 Halpin collaborative complex dynamics law model power tagging},
  location = {Banff, Alberta, Canada},
  pages = {211--220},
  publisher = {ACM},
  timestamp = {2010-01-04T02:15:06.000+0100},
  title = {The complex dynamics of collaborative tagging},
  url = {http://portal.acm.org/citation.cfm?id=1242602},
  year = 2007
}

@article{Wash07publicBookmarks,
  added-at = {2010-01-03T22:17:10.000+0100},
  address = {School of Information, University of Michigan; School of Information, University of Michigan},
  author = {Wash, Rick and Rader, Emilee},
  biburl = {http://www.bibsonomy.org/bibtex/2c13630d081d5b3d74e1e9da25e8f998a/lee_peck},
  description = {Public bookmarks and private benefits: An analysis of incentives in social computing. Rick Wash. 2008; Proceedings of the American Society for Information Science and Technology - Wiley InterScience},
  doi = {10.1002/meet.1450440240},
  interhash = {b934e86b5d49cb858ae190d9c585c1fe},
  intrahash = {c13630d081d5b3d74e1e9da25e8f998a},
  journal = {Proceedings of the American Society for Information Science and Technology},
  keywords = {07 Wash folksonomy model personal},
  number = 1,
  pages = {1-13},
  publisher = {Copyright © by American Society for Information Science and Technology},
  timestamp = {2010-01-03T22:17:10.000+0100},
  title = {Public bookmarks and private benefits: An analysis of incentives in social computing},
  url = {http://dx.doi.org/10.1002/meet.1450440240},
  volume = 44,
  year = 2007
}

@article{Benz07collaborativeClassification,
  abstract = {Bookmarks (or favorites, hotlists) are popular strategies to relocate interesting websites on the WWW by creating a personalized URL repository. Most current browsers offer a facility to locally store and manage bookmarks in a hierarchy of folders; though, with growing size, users reportedly have trouble to create and maintain a stable organization structure. This paper presents a novel collaborative approach to ease bookmark management, especially the “classification” of new bookmarks into a folder. We propose a methodology to realize the collaborative classification idea of considering how similar users have classified a bookmark. A combination of nearest-neighbor-classifiers is used to derive a recommendation from similar users on where to store a new bookmark. A prototype system called CariBo has been implemented as a plugin for the central bookmark server software SiteBar. All findings have been evaluated on a reasonably large scale, real user dataset with promising results, and possible implications for shared and social bookmarking systems are discussed.},
  added-at = {2009-09-13T21:50:17.000+0200},
  author = {Benz, Dominik and Tso, Karen H. L. and Schmidt-Thieme, Lars},
  biburl = {http://www.bibsonomy.org/bibtex/2672348691746d55cd7eb05022ed91ef9/lee_peck},
  interhash = {5feb6b95a7217fe0616c3fff4a2f0169},
  intrahash = {672348691746d55cd7eb05022ed91ef9},
  journal = {Special Issue of the Computer Networks journal on Innovations in Web Communications Infrastructure},
  keywords = {07 @sugesstionMalnisFall09 Benz classification folksonomy hierarchical},
  number = 16,
  pages = {4574--4585},
  timestamp = {2009-09-13T21:50:17.000+0200},
  title = {Suppporting Collaborative Hierarchical Classification: Bookmarks as an Example},
  url = {http://dx.doi.org/10.1016/j.comnet.2007.06.014},
  volume = 51,
  year = 2007
}

@inproceedings{Auer07extractingSemantics,
  added-at = {2009-04-21T21:56:25.000+0200},
  address = {Berlin, Heidelberg},
  author = {Auer, S\"{o}ren and Lehmann, Jens},
  biburl = {http://www.bibsonomy.org/bibtex/2fe1f71ea6249d09715d6c3f505697a1f/lee_peck},
  booktitle = {ESWC '07: Proceedings of the 4th European conference on The Semantic Web},
  description = {What Have Innsbruck and Leipzig in Common? Extracting Semantics from Wiki Content},
  doi = {http://dx.doi.org/10.1007/978-3-540-72667-8_36},
  interhash = {2b70ab546da1b45f5350d3ff742c4288},
  intrahash = {fe1f71ea6249d09715d6c3f505697a1f},
  isbn = {978-3-540-72666-1},
  keywords = {07 @sugesstionMalnisWinter10 Auer extraction semantics wiki},
  location = {Innsbruck, Austria},
  pages = {503--517},
  publisher = {Springer-Verlag},
  timestamp = {2009-04-21T21:56:25.000+0200},
  title = {What Have Innsbruck and Leipzig in Common? Extracting Semantics from Wiki Content},
  url = {http://portal.acm.org/citation.cfm?id=1419709},
  year = 2007
}

@article{Li07nalixXml,
  added-at = {2009-03-10T03:51:19.000+0100},
  address = {New York, NY, USA},
  author = {Li, Yunyao and Yang, Huahai and Jagadish, H. V.},
  biburl = {http://www.bibsonomy.org/bibtex/2ee2e3f31e4f422abacaa715f35d9786e/lee_peck},
  description = {NaLIX},
  doi = {http://doi.acm.org/10.1145/1292609.1292620},
  interhash = {97cea3f73c4caafc20fce55dfd86b24c},
  intrahash = {ee2e3f31e4f422abacaa715f35d9786e},
  issn = {0362-5915},
  journal = {ACM Trans. Database Syst.},
  keywords = {07 Li Nalix XML language natural queries search},
  number = 4,
  pages = 30,
  publisher = {ACM},
  timestamp = {2009-03-10T03:51:19.000+0100},
  title = {NaLIX: A generic natural language search environment for XML data},
  url = {http://portal.acm.org/citation.cfm?id=1292609.1292620&coll=Portal&dl=GUIDE&CFID=25974215&CFTOKEN=78712896},
  volume = 32,
  year = 2007
}

@inproceedings{Chu07extractionSearch,
  added-at = {2009-03-10T03:47:00.000+0100},
  address = {New York, NY, USA},
  author = {Chu-Carroll, Jennifer and Prager, John},
  biburl = {http://www.bibsonomy.org/bibtex/2e9ace43f92693fef0cb4b4417857642f/lee_peck},
  booktitle = {CIKM '07: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management},
  description = {An experimental study of the impact of information extraction accuracy on semantic search performance},
  doi = {http://doi.acm.org/10.1145/1321440.1321512},
  interhash = {b994252d9795068e1e4c8e79aea3787b},
  intrahash = {e9ace43f92693fef0cb4b4417857642f},
  isbn = {978-1-59593-803-9},
  keywords = {07 @sugesstionMalnisWinter10 Chu extraction information noise search semantics},
  location = {Lisbon, Portugal},
  pages = {505--514},
  publisher = {ACM},
  timestamp = {2009-03-10T03:47:00.000+0100},
  title = {An experimental study of the impact of information extraction accuracy on semantic search performance},
  url = {http://portal.acm.org/citation.cfm?id=1321440.1321512&coll=Portal&dl=GUIDE&CFID=25974215&CFTOKEN=78712896},
  year = 2007
}

@inproceedings{Michlmayr07userProfiles,
  added-at = {2009-03-09T16:20:22.000+0100},
  author = {Michlmayr, Elke and Cayzer, Steve},
  biburl = {http://www.bibsonomy.org/bibtex/2906d61fdb0f79d76fb9e3b6428adcfe5/lee_peck},
  booktitle = {Proceedings of the Workshop on Tagging and Metadata for Social Information Organization, 16th International World Wide Web Conference},
  description = {Learning user profiles from tagging data and leveraging them for personal(ized) information access - CiteSeerX},
  interhash = {506fd3e53236139f1267941370f58fd1},
  intrahash = {906d61fdb0f79d76fb9e3b6428adcfe5},
  keywords = {07 Michlmayr extraction profiles social tagging toread user},
  timestamp = {2009-03-09T16:20:22.000+0100},
  title = {Learning user profiles from tagging data and leveraging them for personal(ized) information access},
  year = 2007
}

@article{Busa-Fekete07treeBuilding,
  abstract = {Here we introduce a new Multi-Stack (MS) based phylogenetic tree building method. The Multi-Stack approach organizes the candidate
subtrees (i.e. those having same number of leaves) into limited priority queues, always selecting the K-best subtrees, according to their distance estimation error. Using the K-best subtrees our method iteratively applies a novel subtree joining strategy to generate candidate higher level subtreesfrom the existing low-level ones. This new MS method uses the Constrained Least Squares Criteria (CLSC) which guarantees thenon-negativity of the edge weights.},
  added-at = {2009-01-11T23:02:32.000+0100},
  author = {Busa-Fekete, Robert and Kocsor, Andras and Bagyinka, Csaba},
  biburl = {http://www.bibsonomy.org/bibtex/2d0d7ce97d4dfc6b9ce1f977f3f2352f3/lee_peck},
  description = {SpringerLink - Book Chapter},
  interhash = {f444ec60316f42ea98ff2842385026a8},
  intrahash = {d0d7ce97d4dfc6b9ce1f977f3f2352f3},
  journal = {Bioinformatics Research and Applications},
  keywords = {07 Busa-Fekete UPGMA agglomerative clustering tree},
  pages = {49--60},
  timestamp = {2009-01-11T23:02:32.000+0100},
  title = {A Multi-Stack Based Phylogenetic Tree Building Method},
  url = {http://dx.doi.org/10.1007/978-3-540-72031-7_5},
  year = 2007
}

@article{Handl07multiobjectiveClustering,
  abstract = {The framework of multiobjective optimization is used to tackle the unsupervised learning problem, data clustering, following a formulation first proposed in the statistics literature. The conceptual advantages of the multiobjective formulation are discussed and an evolutionary approach to the problem is developed. The resulting algorithm, multiobjective clustering with automatic k-determination, is compared with a number of well-established single-objective clustering algorithms, a modern ensemble technique, and two methods of model selection. The experiments demonstrate that the conceptual advantages of multiobjective clustering translate into practical and scalable performance benefits},
  added-at = {2008-12-15T20:40:32.000+0100},
  author = {Handl, J. and Knowles, J.},
  biburl = {http://www.bibsonomy.org/bibtex/2d5defac71d60e4c4895fb5e2c66f948f/lee_peck},
  doi = {10.1109/TEVC.2006.877146},
  interhash = {0afaf70d6c3d118f6d6dc23f8123ef7e},
  intrahash = {d5defac71d60e4c4895fb5e2c66f948f},
  issn = {1089-778X},
  journal = {Evolutionary Computation, IEEE Transactions on},
  keywords = {07 Handl algorithm clustering genetic multiobjective},
  month = {Feb. },
  number = 1,
  pages = {56-76},
  timestamp = {2008-12-15T20:40:32.000+0100},
  title = {An Evolutionary Approach to Multiobjective Clustering},
  volume = 11,
  year = 2007
}