Dublin / San Francisco / Harlow / Barcelona / Montréal / Weimar / Information Retrieval / Hyderabad / New York / Using Wikipedia / Query / Washington / DC / Zurich / Berlin / Atlanta / Data Mining / Copenhagen / Toronto / Glasgow / /
Company
Cambridge University Press / Pearson Education Ltd. / Springer-Verlag New York Inc. / Libraries Unlimited Inc. / /
Country
Germany / Switzerland / United States / Canada / United Kingdom / Spain / India / Ireland / Denmark / /
Currency
USD / /
Event
Product Issues / Product Recall / /
Facility
Library of Congress Classification / /
IndustryTerm
greedy set-cover algorithm / search result sets / post-processing step / search experience / query-based search engine / library classification systems / Web Clustering Engines / search box / conventional query-based search engine / Subject-oriented classification systems / batch processing / online taxonomy composition process / online process / Slow search / multi-branch hierarchical clustering algorithm / search strategy / distributed processing techniques / e-discovery / daily web search experience / hierarchical clustering algorithm / pruned search space / serendipity search / conventional classification systems / search result size / search behavior / respective search results / hierarchical classification systems / online library tool / library management / online part / decent query-based search engines / Web Search Results / exploratory search setting / online processing times / search result list / query-based search engines / set cover algorithm / search engines / document cover algorithm / approximate solution / classification systems / established library tools / dynamic classification systems / search engine theory / search interfaces / slow search problem / online component / offline processing / employed search engine takes / heuristic search space pruning / static classification systems / serendipity search setting / search space / search engine / dynamic and human-made classification systems / search results / middle-ground solutions / document recommender systems / search scenarios / cluster algorithm / longer search session / /
Organization
Organization of Information / Cambridge University / Assoc. for Computational Linguistics / Idf / Canadian Society for Computational Studies / Congress / Digital Library Federation / Keyqueries Tim Gollub Michael Völske Matthias Hagen Benno Stein Bauhaus-Universität Weimar / /
Person
Arlene Taylor / Tim Gollub Michael Völske Matthias / Min Median / Min Median Max Static Max / Michael Völske Matthias Hagen Benno / Matthias Hagen Benno Stein Bauhaus-Universität / David Weinberger / Max Static / Henry Holt / /
Position
Query Formulation General / /
Product
Apache / curves / /
ProgrammingLanguage
DC / /
ProvinceOrState
Quebec / New York / Ontario / /
PublishedMedium
Computational Linguistics / Machine Learning / Communications of the ACM / /
Dynamic Taxonomy Composition via Keyqueries Tim Gollub Michael Völske Matthias Hagen