<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/concept/user/mstrohm/BIB-DATA"><title>BibSonomy bookmarks for /concept/user/mstrohm/BIB-DATA</title><link>https://www.bibsonomy.org/concept/user/mstrohm/BIB-DATA</link><description>BibSonomy RSS Feed for /concept/user/mstrohm/BIB-DATA</description><items><rdf:Seq><rdf:li rdf:resource="http://www.cs.berkeley.edu/~kevin/research_files/caniniG11.pdf"/><rdf:li rdf:resource="http://asc-parc.blogspot.com/2008/10/user-needs-during-social-search.html"/><rdf:li rdf:resource="http://webinsight.cs.washington.edu/papers/transcendence.pdf"/></rdf:Seq></items></channel><item rdf:about="http://www.cs.berkeley.edu/~kevin/research_files/caniniG11.pdf"><title>A nonparametric Bayesian model of multi-level category learning. </title><description>on learning hierarchical structures</description><link>http://www.cs.berkeley.edu/~kevin/research_files/caniniG11.pdf</link><dc:creator>mstrohm</dc:creator><dc:date>2011-07-25T20:00:10+02:00</dc:date><dc:subject>PRELIMINARY-BIBTEX TOREAD categorization folksonomy tagging </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;on learning hierarchical structures&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/PRELIMINARY-BIBTEX"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/TOREAD"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/categorization"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/folksonomy"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tagging"/></rdf:Bag></taxo:topics></item><item rdf:about="http://asc-parc.blogspot.com/2008/10/user-needs-during-social-search.html"><title>User Needs during Social Search</title><description></description><link>http://asc-parc.blogspot.com/2008/10/user-needs-during-social-search.html</link><dc:creator>mstrohm</dc:creator><dc:date>2008-10-16T10:06:47+02:00</dc:date><dc:subject>MUSTREAD PRELIMINARY-BIBTEX goals search social-search </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2008-10-16T10:06:47+02:00&#034; href=&#034;http://asc-parc.blogspot.com/2008/10/user-needs-during-social-search.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://asc-parc.blogspot.com/2008/10/user-needs-during-social-search.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/MUSTREAD"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/PRELIMINARY-BIBTEX"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/goals"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/search"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/social-search"/></rdf:Bag></taxo:topics></item><item rdf:about="http://webinsight.cs.washington.edu/papers/transcendence.pdf"><title>Transcendence: Enabling a Personal View of the Deep Web</title><description>presented at IUI by Jeffrey Bigham, Anna Cavender, Ryan Kaminsky (University of Washington, USA)</description><link>http://webinsight.cs.washington.edu/papers/transcendence.pdf</link><dc:creator>mstrohm</dc:creator><dc:date>2008-01-15T18:18:35+01:00</dc:date><dc:subject>PRELIMINARY-BIBTEX TOREAD search social-factors web-science </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;presented at IUI by Jeffrey Bigham, Anna Cavender, Ryan Kaminsky (University of Washington, USA)&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/PRELIMINARY-BIBTEX"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/TOREAD"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/search"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/social-factors"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/web-science"/></rdf:Bag></taxo:topics></item></rdf:RDF>