<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="http://www.bibsonomy.org/user/mstrohm/search"><title>BibSonomy bookmarks for /user/mstrohm/search</title><link>http://www.bibsonomy.org/rss/user/mstrohm/search</link><description>BibSonomy RSS Feed for /user/mstrohm/search</description><items><rdf:Seq><rdf:li rdf:resource="http://www.wholeearth.com/issue-electronic-edition.php?iss=1330"/><rdf:li rdf:resource="http://iiix2010.org/hcir.php"/><rdf:li rdf:resource="http://www.wsdm-conference.org/2010/accepted-papers.html"/><rdf:li rdf:resource="http://www.timemachinego.com/linkmachinego/2009/11/16/me-and-belle-de-jour-could-it-be-brooke/"/><rdf:li rdf:resource="http://www.miislita.com/"/><rdf:li rdf:resource="http://lemurstudy.cs.umass.edu/"/><rdf:li rdf:resource="http://searchengineland.com/search-where-does-it-go-from-here-30630"/><rdf:li rdf:resource="http://www.youtube.com/watch?v=BpBAg4Ndi9w&amp;feature=player_embedded"/><rdf:li rdf:resource="http://workshops.fxpal.com/cscw2010cis/Overview.aspx"/><rdf:li rdf:resource="http://www.yorku.ca/wiiat10/index.php"/><rdf:li rdf:resource="http://factoryjoe.com/blog/2007/08/25/groups-for-twitter-or-a-proposal-for-twitter-tag-channels/"/><rdf:li rdf:resource="http://clubs.ya.ru/company/replies.xml?item_no=19430&amp;ncrnd=6871"/><rdf:li rdf:resource="http://technology.timesonline.co.uk/tol/news/tech_and_web/article4213681.ece"/><rdf:li rdf:resource="http://www.slate.com/id/2224932/"/><rdf:li rdf:resource="http://pagehunt.msrlivelabs.com/AboutPageHunt.htm"/><rdf:li rdf:resource="http://searchuserinterfaces.com/book/sui_ch1_design.html"/><rdf:li rdf:resource="http://www.readwriteweb.com/archives/future_of_search_social_relevancy_rank.php"/><rdf:li rdf:resource="http://palblog.fxpal.com/?p=1220"/><rdf:li rdf:resource="http://anyall.org/blog/2009/04/1-billion-web-page-dataset-from-cmu/"/><rdf:li rdf:resource="http://www.wsdm-conference.org/2010/"/></rdf:Seq></items></channel><item rdf:about="http://www.wholeearth.com/issue-electronic-edition.php?iss=1330"><title>Whole Earth Catalog Spring 1994 - Electronic Edition</title><description>The real, last, big Whole Earth Catalog.</description><link>http://www.wholeearth.com/issue-electronic-edition.php?iss=1330</link><dc:creator>mstrohm</dc:creator><dc:date>2012-01-23T04:23:35+01:00</dc:date><dc:subject>historical knowledge-management search web-science </dc:subject><content:encoded>The real, last, big Whole Earth Catalog.</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/historical"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/knowledge-management"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web-science"/></rdf:Bag></taxo:topics></item><item rdf:about="http://iiix2010.org/hcir.php"><title>HCIR workshop at IIiX 2010</title><description></description><link>http://iiix2010.org/hcir.php</link><dc:creator>mstrohm</dc:creator><dc:date>2010-02-08T12:08:02+01:00</dc:date><dc:subject>commonsense goals search workshop </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/commonsense"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/goals"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/workshop"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.wsdm-conference.org/2010/accepted-papers.html"><title>WSDM 2010 - Accepted Papers</title><description></description><link>http://www.wsdm-conference.org/2010/accepted-papers.html</link><dc:creator>mstrohm</dc:creator><dc:date>2009-12-26T17:35:15+01:00</dc:date><dc:subject>conference mining search </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/conference"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.timemachinego.com/linkmachinego/2009/11/16/me-and-belle-de-jour-could-it-be-brooke/"><title>Me and Belle de Jour – ‘Could it be Brooke?’</title><description>on &amp;#039;googlewhacking&amp;#039;</description><link>http://www.timemachinego.com/linkmachinego/2009/11/16/me-and-belle-de-jour-could-it-be-brooke/</link><dc:creator>mstrohm</dc:creator><dc:date>2009-12-17T13:36:20+01:00</dc:date><dc:subject>hacking motivation search </dc:subject><content:encoded>on &amp;#039;googlewhacking&amp;#039;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/hacking"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/motivation"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.miislita.com/"><title>Knowledge Acquisition / Information Retrieval Tutorials</title><description>including LSA / LSI</description><link>http://www.miislita.com/</link><dc:creator>mstrohm</dc:creator><dc:date>2009-12-14T14:17:33+01:00</dc:date><dc:subject>knowledge-acquisition mining search tutorial </dc:subject><content:encoded>including LSA / LSI</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/knowledge-acquisition"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tutorial"/></rdf:Bag></taxo:topics></item><item rdf:about="http://lemurstudy.cs.umass.edu/"><title>Lemur Query Log Project</title><description></description><link>http://lemurstudy.cs.umass.edu/</link><dc:creator>mstrohm</dc:creator><dc:date>2009-12-06T11:12:17+01:00</dc:date><dc:subject>datasets query-log-analysis search </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/datasets"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/query-log-analysis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/></rdf:Bag></taxo:topics></item><item rdf:about="http://searchengineland.com/search-where-does-it-go-from-here-30630"><title>Search: Where Does It Go from Here?</title><description>&amp;#034;buying a prius&amp;#034; Google vs Bing</description><link>http://searchengineland.com/search-where-does-it-go-from-here-30630</link><dc:creator>mstrohm</dc:creator><dc:date>2009-11-29T10:59:48+01:00</dc:date><dc:subject>goals search </dc:subject><content:encoded>&amp;#034;buying a prius&amp;#034; Google vs Bing</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/goals"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.youtube.com/watch?v=BpBAg4Ndi9w&amp;feature=player_embedded"><title>YouTube - Search User Interfaces</title><description>Marti Hearst</description><link>http://www.youtube.com/watch?v=BpBAg4Ndi9w&amp;amp;feature=player_embedded</link><dc:creator>mstrohm</dc:creator><dc:date>2009-11-26T09:51:47+01:00</dc:date><dc:subject>information-retrieval lecture search </dc:subject><content:encoded>Marti Hearst</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information-retrieval"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/lecture"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/></rdf:Bag></taxo:topics></item><item rdf:about="http://workshops.fxpal.com/cscw2010cis/Overview.aspx"><title>CSCW2010 CIS Collaborative Information Seeking Workshop</title><description></description><link>http://workshops.fxpal.com/cscw2010cis/Overview.aspx</link><dc:creator>mstrohm</dc:creator><dc:date>2009-11-04T21:30:10+01:00</dc:date><dc:subject>search social-search workshop </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/social-search"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/workshop"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.yorku.ca/wiiat10/index.php"><title>2010 IEEE / WIC / ACM International Conferences on Web Intelligence and Intelligent Agent Technology</title><description></description><link>http://www.yorku.ca/wiiat10/index.php</link><dc:creator>mstrohm</dc:creator><dc:date>2009-11-03T14:09:01+01:00</dc:date><dc:subject>conference knowledge-management search web-science </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/conference"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/knowledge-management"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web-science"/></rdf:Bag></taxo:topics></item><item rdf:about="http://factoryjoe.com/blog/2007/08/25/groups-for-twitter-or-a-proposal-for-twitter-tag-channels/"><title>Groups for Twitter; or A Proposal for Twitter Tag Channels</title><description>on the origin of hash tags in twitter (2007!)</description><link>http://factoryjoe.com/blog/2007/08/25/groups-for-twitter-or-a-proposal-for-twitter-tag-channels/</link><dc:creator>mstrohm</dc:creator><dc:date>2009-09-25T18:32:55+02:00</dc:date><dc:subject>historical search social-search twitter </dc:subject><content:encoded>on the origin of hash tags in twitter (2007!)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/historical"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/social-search"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/twitter"/></rdf:Bag></taxo:topics></item><item rdf:about="http://clubs.ya.ru/company/replies.xml?item_no=19430&amp;ncrnd=6871"><title>Video Eugene Agichtein: Inferring User Intent</title><description></description><link>http://clubs.ya.ru/company/replies.xml?item_no=19430&amp;amp;ncrnd=6871</link><dc:creator>mstrohm</dc:creator><dc:date>2009-09-18T18:20:56+02:00</dc:date><dc:subject>intentional lecture search </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/intentional"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/lecture"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/></rdf:Bag></taxo:topics></item><item rdf:about="http://technology.timesonline.co.uk/tol/news/tech_and_web/article4213681.ece"><title>Human flesh search engines: Chinese vigilantes that hunt victims on the web - Times Online</title><description></description><link>http://technology.timesonline.co.uk/tol/news/tech_and_web/article4213681.ece</link><dc:creator>mstrohm</dc:creator><dc:date>2009-08-31T19:12:49+02:00</dc:date><dc:subject>goals motivation search social-factors social-search </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/goals"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/motivation"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/social-factors"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/social-search"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.slate.com/id/2224932/"><title>The powerful and mysterious brain circuitry that makes us love Google, Twitter, and texting.</title><description>why we can&amp;#039;t quit searching</description><link>http://www.slate.com/id/2224932/</link><dc:creator>mstrohm</dc:creator><dc:date>2009-08-19T02:23:22+02:00</dc:date><dc:subject>cognition search </dc:subject><content:encoded>why we can&amp;#039;t quit searching</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/cognition"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/></rdf:Bag></taxo:topics></item><item rdf:about="http://pagehunt.msrlivelabs.com/AboutPageHunt.htm"><title>Page Hunt - A Game to Improve Search</title><description>Paper: http://appsrv.cse.cuhk.edu.hk/~hma/Poster_SigIR09_Hao.pdf</description><link>http://pagehunt.msrlivelabs.com/AboutPageHunt.htm</link><dc:creator>mstrohm</dc:creator><dc:date>2009-07-28T16:41:50+02:00</dc:date><dc:subject>games knowledge-acquisition search tools web-science </dc:subject><content:encoded>Paper: http://appsrv.cse.cuhk.edu.hk/~hma/Poster_SigIR09_Hao.pdf</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/games"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/knowledge-acquisition"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tools"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web-science"/></rdf:Bag></taxo:topics></item><item rdf:about="http://searchuserinterfaces.com/book/sui_ch1_design.html"><title>Design of Search User Interfaces (Ch 1) | Search User Interfaces | Marti Hearst | Cambridge University Press 2009</title><description>Category system structure in search interfaces is usually one of flat, hierarchical, or faceted. A flat list of categories works well for presenting a list of choices with which to narrow the contents of a collection, but needs to be limited to a small set in order to be scannable. Hierarchical (or tree-structured) category systems are useful and can be easy to understand for relatively simple information structures. However, a problem with assigning documents to single categories within a hierarchy is that many information items are best described by multiple different categories simultaneously.

This use of hierarchical faceted metadata provides a usable method for allowing users to browse information collections according to multiple categories simultaneously (Hearst, 2000, Hearst et al., 2002). The main idea is to build a set of category hierarchies, each of which corresponds to a different facet (dimension or feature type) that is relevant to the collection to be navigated. Each facet has a set of labels associated with it, and if this set is large, it may be organized into a hierarchy. After the facet hierarchies are designed, each item in the collection can be assigned any number of labels from any number of facets. In a properly designed faceted navigation interface, the user can browse the information collection from any of the different facets as a starting point, and after starting with one facet, can then navigate using any other facet. Usability results suggest that this kind of interface is highly usable for navigation of information collections with somewhat homogeneous content (English et al., 2001, Hearst et al., 2002, Yee et al., 2003). </description><link>http://searchuserinterfaces.com/book/sui_ch1_design.html</link><dc:creator>mstrohm</dc:creator><dc:date>2009-07-23T13:26:28+02:00</dc:date><dc:subject>search </dc:subject><content:encoded>Category system structure in search interfaces is usually one of flat, hierarchical, or faceted. A flat list of categories works well for presenting a list&lt;span class=&#034;info&#034;&gt;...&lt;div&gt;Category system structure in search interfaces is usually one of flat, hierarchical, or faceted. A flat list of categories works well for presenting a list of choices with which to narrow the contents of a collection, but needs to be limited to a small set in order to be scannable. Hierarchical (or tree-structured) category systems are useful and can be easy to understand for relatively simple information structures. However, a problem with assigning documents to single categories within a hierarchy is that many information items are best described by multiple different categories simultaneously.

This use of hierarchical faceted metadata provides a usable method for allowing users to browse information collections according to multiple categories simultaneously (Hearst, 2000, Hearst et al., 2002). The main idea is to build a set of category hierarchies, each of which corresponds to a different facet (dimension or feature type) that is relevant to the collection to be navigated. Each facet has a set of labels associated with it, and if this set is large, it may be organized into a hierarchy. After the facet hierarchies are designed, each item in the collection can be assigned any number of labels from any number of facets. In a properly designed faceted navigation interface, the user can browse the information collection from any of the different facets as a starting point, and after starting with one facet, can then navigate using any other facet. Usability results suggest that this kind of interface is highly usable for navigation of information collections with somewhat homogeneous content (English et al., 2001, Hearst et al., 2002, Yee et al., 2003). &lt;/div&gt;&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.readwriteweb.com/archives/future_of_search_social_relevancy_rank.php"><title>The Future of Search: Social Relevancy Rank</title><description></description><link>http://www.readwriteweb.com/archives/future_of_search_social_relevancy_rank.php</link><dc:creator>mstrohm</dc:creator><dc:date>2009-07-18T11:51:45+02:00</dc:date><dc:subject>search social-factors social-search </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/social-factors"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/social-search"/></rdf:Bag></taxo:topics></item><item rdf:about="http://palblog.fxpal.com/?p=1220"><title>FXPAL Blog » Information Retrieval Textbooks</title><description></description><link>http://palblog.fxpal.com/?p=1220</link><dc:creator>mstrohm</dc:creator><dc:date>2009-07-16T10:20:56+02:00</dc:date><dc:subject>information-retrieval search textbooks </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information-retrieval"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/textbooks"/></rdf:Bag></taxo:topics></item><item rdf:about="http://anyall.org/blog/2009/04/1-billion-web-page-dataset-from-cmu/"><title>1 billion web page dataset from CMU</title><description></description><link>http://anyall.org/blog/2009/04/1-billion-web-page-dataset-from-cmu/</link><dc:creator>mstrohm</dc:creator><dc:date>2009-06-30T10:26:22+02:00</dc:date><dc:subject>datasets mining search </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/datasets"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.wsdm-conference.org/2010/"><title>WSDM 2010</title><description>Third International Conference on Web Search and Data Mining</description><link>http://www.wsdm-conference.org/2010/</link><dc:creator>mstrohm</dc:creator><dc:date>2009-06-23T11:54:03+02:00</dc:date><dc:subject>conference mining search </dc:subject><content:encoded>Third International Conference on Web Search and Data Mining</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/conference"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/></rdf:Bag></taxo:topics></item></rdf:RDF>
