Matches in ScholarlyData for { ?s ?p ?o. }
- estimating-sizes-of-social-networks-via-biased-sam hasAuthorList authorList.
- estimating-sizes-of-social-networks-via-biased-sam hasTopic clustering.
- estimating-sizes-of-social-networks-via-biased-sam hasTopic World_Wide_Web.
- estimating-sizes-of-social-networks-via-biased-sam isPartOf proceedings.
- estimating-sizes-of-social-networks-via-biased-sam title "Estimating Sizes of Social Networks via Biased Sampling".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent liran-katzir.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent edo-liberty.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent oren-somekh.
- item-3 previous item-2.
- evaluating-new-search-engine-configurations-with-p creator benoit-dumoulin.
- evaluating-new-search-engine-configurations-with-p creator rosie-jones.
- evaluating-new-search-engine-configurations-with-p creator umut-ozertem.
- evaluating-new-search-engine-configurations-with-p type InProceedings.
- evaluating-new-search-engine-configurations-with-p label "Evaluating New Search Engine Configurations with Pre-Existing Judgments and Clicks".
- evaluating-new-search-engine-configurations-with-p sameAs evaluating-new-search-engine-configurations-with-p.
- evaluating-new-search-engine-configurations-with-p abstract "We provide a novel method of evaluating search results, which allows us to combine existing editorial judgments with the relevance estimates generated by click-based user browsing models. There are evaluation methods in the literature that use clicks and editorial judgments together, but our approach is novel in the sense that it allows us to predict the impact of unseen search models without online tests to collect clicks and without requesting new editorial data, since we are only re-using existing editorial data, and clicks observed for previous result set configurations. Since the user browsing model and the pre-existing editorial data cannot provide relevance estimates for all documents for the selected set of queries, one important challenge is to obtain this performance estimation where there are a lot of ranked documents with missing relevance values. We introduce a query and rank based smoothing to overcome this problem. We show that a hybrid of these smoothing techniques performs better than both query and position based smoothing, and despite the high percentage of missing judgments, the resulting method is significantly correlated (0.74) with DCG values evaluated using fully judged datasets, and approaches inter-annotator agreement. We show that previously published techniques, applicable to frequent queries, degrade when applied to a random sample of queries, with a correlation of only 0.29. While our experiments focus on evaluation using DCG, our method is also applicable to other commonly used metrics.".
- evaluating-new-search-engine-configurations-with-p hasAuthorList authorList.
- evaluating-new-search-engine-configurations-with-p hasTopic evaluation.
- evaluating-new-search-engine-configurations-with-p hasTopic World_Wide_Web.
- evaluating-new-search-engine-configurations-with-p isPartOf proceedings.
- evaluating-new-search-engine-configurations-with-p title "Evaluating New Search Engine Configurations with Pre-Existing Judgments and Clicks".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent umut-ozertem.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent rosie-jones.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent benoit-dumoulin.
- item-3 previous item-2.
- facto-a-fact-lookup-engine-based-on-web-tables creator chao-liu.
- facto-a-fact-lookup-engine-based-on-web-tables creator wenzhao-tan.
- facto-a-fact-lookup-engine-based-on-web-tables creator xiaoxin-yin.
- facto-a-fact-lookup-engine-based-on-web-tables type InProceedings.
- facto-a-fact-lookup-engine-based-on-web-tables label "FACTO: A Fact Lookup Engine Based on Web Tables".
- facto-a-fact-lookup-engine-based-on-web-tables sameAs facto-a-fact-lookup-engine-based-on-web-tables.
- facto-a-fact-lookup-engine-based-on-web-tables abstract "Recently answers for fact lookup queries have appeared on major search engines. For example, for the query {Barack Obama date of birth} Google directly shows 4 August 1961 above its regular results. In this paper, we describe FACTO, an end-to-end system for answering fact lookup queries for web search. FACTO extracts structured data from tables on the web, aggregates and cleans such data and stores them in a database. Given a web search query, FACTO will decide if it asks for facts in this database, and provides the most confident answer when possible. FACTO achieves higher precision and comparable coverage comparing with the fact lookup engines by Google and Ask.com, although FACTO is developed by a very small team. We present the challenges and our solutions in developing every component of FACTO. Some solutions are based on existing technologies, and many others are novel approaches proposed by us.".
- facto-a-fact-lookup-engine-based-on-web-tables hasAuthorList authorList.
- facto-a-fact-lookup-engine-based-on-web-tables hasTopic search-systems.
- facto-a-fact-lookup-engine-based-on-web-tables hasTopic World_Wide_Web.
- facto-a-fact-lookup-engine-based-on-web-tables isPartOf proceedings.
- facto-a-fact-lookup-engine-based-on-web-tables title "FACTO: A Fact Lookup Engine Based on Web Tables".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent xiaoxin-yin.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent wenzhao-tan.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent chao-liu.
- item-3 previous item-2.
- finding-hierarchy-in-directed-online-social-networ creator jing-li.
- finding-hierarchy-in-directed-online-social-networ creator liviu-iftode.
- finding-hierarchy-in-directed-online-social-networ creator mangesh-gupte.
- finding-hierarchy-in-directed-online-social-networ creator pravin-shankar.
- finding-hierarchy-in-directed-online-social-networ creator s-muthukrishnan.
- finding-hierarchy-in-directed-online-social-networ type InProceedings.
- finding-hierarchy-in-directed-online-social-networ label "Finding Hierarchy in Directed Online Social Networks".
- finding-hierarchy-in-directed-online-social-networ sameAs finding-hierarchy-in-directed-online-social-networ.
- finding-hierarchy-in-directed-online-social-networ abstract "Social hierarchy and stratification among humans is a well studied concept in sociology. The popularity of online social networks presents an opportunity to study social hierarchy for different types of networks and at different scales. We adopt the premise that people form connections in a social network based on their perceived social hierarchy; as a result, the edge directions in directed social networks can be leveraged to infer hierarchy. In this paper, we de fine a measure of hierarchy in a directed online social network, and present an efficient algorithm to compute this measure. We validate our measure using ground truth including Wikipedia notability score. We use this measure to study hierarchy in several directed online social networks including Twitter, Delicious, YouTube, Flickr, LiveJournal, and curated lists of several categories of people based on different occupations, and different organizations. Our experiments on different online social networks show how hierarchy emerges as we increase the size of the network. This is in contrast to random graphs, where the hierarchy decreases as the network size increases. Further, we show that the degree of stratification in a network increases very slowly as we increase the size of the graph.".
- finding-hierarchy-in-directed-online-social-networ hasAuthorList authorList.
- finding-hierarchy-in-directed-online-social-networ hasTopic social-network-analysis.
- finding-hierarchy-in-directed-online-social-networ hasTopic World_Wide_Web.
- finding-hierarchy-in-directed-online-social-networ isPartOf proceedings.
- finding-hierarchy-in-directed-online-social-networ title "Finding Hierarchy in Directed Online Social Networks".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasLastItem item-5.
- item-1 type ListItem.