Matches in ScholarlyData for { ?s ?p ?o. }
- online-spelling-correction-for-query-completion abstract "In this paper, we study the problem of online spelling correction for query completions. Misspelling is a common phenomenon among search engines queries. In order to help users effectively express their information needs, mechanisms for automatically correcting misspelled queries are required. Online spelling correction aims to provide spell corrected completion suggestions as a query is incrementally entered. As latency is crucial to the utility of the suggestions, such an algorithm needs to be not only accurate, but also efficient. To tackle this problem, we propose and study a generative model for input queries, based on a noisy channel transformation of the intended queries. Utilizing spelling correction pairs, we train a Markov n-gram transformation model that captures user spelling behavior in an unsupervised fashion. To find the top spell-corrected completion suggestions in real-time, we adapt the A* search algorithm with various pruning heuristics to dynamically expand the search space efficiently. Evaluation of the proposed methods demonstrates a substantial increase in the effectiveness of online spelling correction over existing techniques.".
- online-spelling-correction-for-query-completion hasAuthorList authorList.
- online-spelling-correction-for-query-completion hasTopic query-analysis.
- online-spelling-correction-for-query-completion hasTopic World_Wide_Web.
- online-spelling-correction-for-query-completion isPartOf proceedings.
- online-spelling-correction-for-query-completion title "Online Spelling Correction for Query Completion".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent huizhong-duan.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent bo-june.
- item-2 previous item-1.
- parallel-boosted-regression-trees-for-web-search-r creator jennifer-paykin.
- parallel-boosted-regression-trees-for-web-search-r creator kilian-q-weinberger.
- parallel-boosted-regression-trees-for-web-search-r creator kunal-agrawal.
- parallel-boosted-regression-trees-for-web-search-r creator stephen-tyree.
- parallel-boosted-regression-trees-for-web-search-r type InProceedings.
- parallel-boosted-regression-trees-for-web-search-r label "Parallel Boosted Regression Trees for Web Search Ranking".
- parallel-boosted-regression-trees-for-web-search-r sameAs parallel-boosted-regression-trees-for-web-search-r.
- parallel-boosted-regression-trees-for-web-search-r abstract "Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned web-search ranking - a domain notorious for very large data sets. In this paper, we propose a novel method for parallelizing the training of GBRT. Our technique parallelizes the construction of the individual regression trees and operates using the master-worker paradigm as follows. The data are partitioned among the workers. At each iteration, the worker summarizes its data-partition using histograms. The master processor uses these to build one layer of a regression tree, and then sends this layer to the workers, allowing the workers to build histograms for the next layer. Our algorithm carefully orchestrates overlap between communication and computation to achieve good performance. Since this approach is based on data partitioning, and requires a small amount of communication, it generalizes to distributed and shared memory machines, as well as clouds. We present experimental results on both shared memory machines and clusters for two large scale web search ranking data sets. We demonstrate that the loss in accuracy induced due to the histogram approximation in the regression tree creation can be compensated for through slightly deeper trees. As a result, we see no significant loss in accuracy on the Yahoo data sets and a very small reduction in accuracy for the Microsoft LETOR data. In addition, on shared memory machines, we obtain almost perfect linear speed-up with up to about 48 cores on the large data sets. On distributed memory machines, we get a speedup of 25 with 32 processors. Due to data partitioning our approach can scale to even larger data sets, on which one can reasonably expect even higher speedups.".
- parallel-boosted-regression-trees-for-web-search-r hasAuthorList authorList.
- parallel-boosted-regression-trees-for-web-search-r hasTopic ranking.
- parallel-boosted-regression-trees-for-web-search-r hasTopic World_Wide_Web.
- parallel-boosted-regression-trees-for-web-search-r isPartOf proceedings.
- parallel-boosted-regression-trees-for-web-search-r title "Parallel Boosted Regression Trees for Web Search Ranking".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent stephen-tyree.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent kilian-q-weinberger.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent kunal-agrawal.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent jennifer-paykin.
- item-4 previous item-3.
- pay-as-you-browse-microcomputations-as-micropaymen creator aurelien-francillon.
- pay-as-you-browse-microcomputations-as-micropaymen creator ghassan-o-karame.
- pay-as-you-browse-microcomputations-as-micropaymen creator srdjan-capkun.
- pay-as-you-browse-microcomputations-as-micropaymen type InProceedings.
- pay-as-you-browse-microcomputations-as-micropaymen label "Pay as You Browse: Microcomputations as Micropayments in Web-Based Services".
- pay-as-you-browse-microcomputations-as-micropaymen sameAs pay-as-you-browse-microcomputations-as-micropaymen.
- pay-as-you-browse-microcomputations-as-micropaymen abstract "Currently, several online businesses deem that advertising revenues alone are not sufficient to generate profits and are therefore set to charge for online content. In this paper, we explore a complement to the current advertisement model; more specifically, we propose a micropayment model for non-specialized commodity web-services based on microcomputations. In our model, a user that wishes to access online content offered by a website does not need to register or pay to access the website; instead, he will accept to run microcomputations on behalf of the website in exchange for access to the content. These microcomputations can, for example, support ongoing computing projects that have clear social benefits (e.g., projects relating to HIV, dengue, cancer, etc.) or can contribute towards commercial computing projects. We argue that this micropayment model is economically and technically viable and that it can be integrated in existing distributed computing frameworks (e.g., the BOINC platform). We implement a preliminary prototype of a system based on our model through which we evaluate its performance and usability. Finally, we analyze the security and privacy of our proposal and we show that it ensures payment for the content while preserving the privacy of users.".
- pay-as-you-browse-microcomputations-as-micropaymen hasAuthorList authorList.
- pay-as-you-browse-microcomputations-as-micropaymen hasTopic e-commerce.
- pay-as-you-browse-microcomputations-as-micropaymen hasTopic World_Wide_Web.
- pay-as-you-browse-microcomputations-as-micropaymen isPartOf proceedings.
- pay-as-you-browse-microcomputations-as-micropaymen title "Pay as You Browse: Microcomputations as Micropayments in Web-Based Services".
- 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 ghassan-o-karame.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent aurelien-francillon.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent srdjan-capkun.
- item-3 previous item-2.
- pragmatic-evaluation-of-folksonomies creator christoph-trattner.
- pragmatic-evaluation-of-folksonomies creator denis-helic.
- pragmatic-evaluation-of-folksonomies creator kristina-lerman.
- pragmatic-evaluation-of-folksonomies creator markus-muhr.
- pragmatic-evaluation-of-folksonomies creator markus-strohmaier.
- pragmatic-evaluation-of-folksonomies type InProceedings.
- pragmatic-evaluation-of-folksonomies label "Pragmatic Evaluation of Folksonomies".
- pragmatic-evaluation-of-folksonomies sameAs pragmatic-evaluation-of-folksonomies.
- pragmatic-evaluation-of-folksonomies abstract "Recently, a number of algorithms have been proposed to obtain hierarchical structures so-called folksonomies from social tagging data. Work on these algorithms is in part driven by a belief that folksonomies are useful for tasks such as: (a) Navigating social tagging systems and (b) Acquiring semantic relationships between tags. While the promises and pitfalls of the latter have been studied to some extent, we know very little about the extent to which folksonomies are pragmatically useful for navigating social tagging systems. This paper sets out to address this gap by presenting and applying a pragmatic framework for evaluating folksonomies. We model exploratory navigation of a tagging system as decentralized search on a network of tags. Evaluation is based on the fact that the performance of a decentralized search algorithm depends on the quality of the background knowledge used. The key idea of our approach is to use hierarchical structures learned by folksonomy algorithm as background knowledge for decentralized search. Utilizing decentralized search on tag networks in combination with different folksonomies as hierarchical background knowledge allows us to evaluate navigational tasks in social tagging systems. Our experiments with four state-of-the-art folksonomy algorithms on five different social tagging datasets reveal that existing folksonomy algorithms exhibit significant, previously undiscovered, differences with regard to their utility for navigation. Our results are relevant for engineers aiming to improve navigability of social tagging systems and for scientists aiming to evaluate different folksonomy algorithms from a pragmatic perspective.".
- pragmatic-evaluation-of-folksonomies hasAuthorList authorList.
- pragmatic-evaluation-of-folksonomies hasTopic evaluation.
- pragmatic-evaluation-of-folksonomies hasTopic World_Wide_Web.
- pragmatic-evaluation-of-folksonomies isPartOf proceedings.
- pragmatic-evaluation-of-folksonomies title "Pragmatic Evaluation of Folksonomies".
- 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.