@electronic{www.informatik.uni-trier.de,
   title       = {DBLP: Dominic Widdows}, 
   url         = {http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/w/Widdows:Dominic.html},
   biburl      = {https://puma.uni-kassel.de/url/fe84e7a023dfa2204fd10bd465035800/benz},
   keywords    = {author dominic_widdows lexical_semantics toread},
   added-at    = {2011-06-06T23:23:09.000+0200},
   description = {},
   interhash   = {fe84e7a023dfa2204fd10bd465035800}, 
   intrahash   = {fe84e7a023dfa2204fd10bd465035800}
}

@electronic{research.google.com,
   title       = {Dominic Widdows}, 
   url         = {http://research.google.com/pubs/author36334.html},
   biburl      = {https://puma.uni-kassel.de/url/0d728b292197f709660e0ce1b6828d32/benz},
   keywords    = {author dominic_widdows toread},
   added-at    = {2011-06-02T23:23:09.000+0200},
   description = {Researcher },
   interhash   = {0d728b292197f709660e0ce1b6828d32}, 
   intrahash   = {0d728b292197f709660e0ce1b6828d32}
}

@electronic{www.mpdl.mpg.de,
   title       = {Koch, Traugott: Towards integration between collaborative tagging and professional indexing. Presentation at BBK 2007-07-17}, 
   url         = {http://www.mpdl.mpg.de/staff/tkoch/pres/tagging-BBK0717.html},
   biburl      = {https://puma.uni-kassel.de/url/31996b6b2a5674bf265d17104850bb7e/benz},
   keywords    = {toread},
   added-at    = {2011-02-04T16:09:13.000+0100},
   description = {},
   interhash   = {31996b6b2a5674bf265d17104850bb7e}, 
   intrahash   = {31996b6b2a5674bf265d17104850bb7e}
}

@electronic{http,
   title       = {Wir googeln uns zu Tode}, 
   url         = {http://http://www.simoneganss.de/googlesicher/pdf/theorie_de.pdf},
   biburl      = {https://puma.uni-kassel.de/url/2cb16aea89c6331c837e17ac1270c9bf/benz},
   keywords    = {google toread},
   added-at    = {2011-02-04T16:09:03.000+0100},
   description = {lange Arbeit, nur zum Teil ein Strukturproblem, aber sehr interessant},
   interhash   = {2cb16aea89c6331c837e17ac1270c9bf}, 
   intrahash   = {2cb16aea89c6331c837e17ac1270c9bf}
}

@electronic{www2008.org,
   title       = {Tag-based social interest discovery}, 
   url         = {http://www2008.org/papers/pdf/p675-liA.pdf},
   biburl      = {https://puma.uni-kassel.de/url/52b9eaeb13547242c6be3fc1ff9983ff/benz},
   keywords    = {paper toread www2008},
   added-at    = {2011-02-04T16:08:51.000+0100},
   description = {The success and popularity of social network systems, suchas del.icio.us, Facebook, MySpace, and YouTube, have generatedmany interesting and challenging problems to the researchcommunity. Among others, discovering social interestsshared by groups of users is very important because ithelps to connect people with common interests and encouragespeople to contribute and share more contents. Themain challenge to solving this problem comes from the difficultyof detecting and representing the interest of the users.The existing approaches are all based on the online connectionsof users and so unable to identify the common interestof users who have no online connections.In this paper, we propose a novel social interest discoveryapproach based on user-generated tags. Our approachis motivated by the key observation that in a social network,human users tend to use descriptive tags to annotatethe contents that they are interested in. Our analysis ona large amount of real-world traces reveals that in general,user-generated tags are consistent with the web content theyare attached to, while more concise and closer to the understandingand judgments of human users about the content.Thus, patterns of frequent co-occurrences of user tags canbe used to characterize and capture topics of user interests.We have developed an Internet Social Interest Discovery system,ISID, to discover the common user interests and clusterusers and their saved URLs by different interest topics. Ourevaluation shows that ISID can effectively cluster similardocuments by interest topics and discover user communitieswith common interests no matter if they have any onlineconnections.},
   interhash   = {52b9eaeb13547242c6be3fc1ff9983ff}, 
   intrahash   = {52b9eaeb13547242c6be3fc1ff9983ff}
}