Matches in ScholarlyData for { ?s ?p ?o. }
- a-stochastic-learning-to-rank-algorithm-and-its-ap label "A Stochastic Learning-To-Rank Algorithm and Its Application to Contextual Advertising".
- a-stochastic-learning-to-rank-algorithm-and-its-ap sameAs a-stochastic-learning-to-rank-algorithm-and-its-ap.
- a-stochastic-learning-to-rank-algorithm-and-its-ap abstract "This paper is concerned with the problem of learning a model to rank objects (Web pages, ads and etc.). We propose a framework where the ranking model is both optimized and evaluated using the same information retrieval measures such as Normalized Discounted Cumulative Gain (NDCG) and Mean Average Precision (MAP). The main difficulty in direct optimization of NDCG and MAP is that these measures depend on the rank of objects and are not differentiable. Most learning-to-rank methods that attempt to optimize NDCG or MAP approximate such measures so that they can be differentiable. In this paper, we propose a simple yet effective stochastic optimization algorithm to directly minimize any loss function, which can be defined on NDCG or MAP for the learning-to-rank problem. The algorithm employs Simulated Annealing along with Simplex method for its parameter search and finds the global optimal parameters. Experiment results using NDCG-Annealing algorithm, an instance of the proposed algorithm, on LETOR benchmark data sets show that the proposed algorithm is both effective and stable when compared to the baselines provided in LETOR 3.0. In addition, we applied the algorithm for ranking ads in contextual advertising. Our method has shown to significantly improve relevance in offline evaluation and business metrics in online tests in a real large-scale advertising serving system. To scale our computations, we parallelize the algorithm in a MapReduce framework running on Hadoop.".
- a-stochastic-learning-to-rank-algorithm-and-its-ap hasAuthorList authorList.
- a-stochastic-learning-to-rank-algorithm-and-its-ap hasTopic ranking.
- a-stochastic-learning-to-rank-algorithm-and-its-ap hasTopic World_Wide_Web.
- a-stochastic-learning-to-rank-algorithm-and-its-ap isPartOf proceedings.
- a-stochastic-learning-to-rank-algorithm-and-its-ap title "A Stochastic Learning-To-Rank Algorithm and Its Application to Contextual Advertising".
- 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 maryam-karimzadehgan.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent wei-li.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent ruofei-zhang.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent jianchang-mao.
- item-4 previous item-3.
- a-unified-framework-for-recommending-diverse-and-r creator hua-wei-shen.
- a-unified-framework-for-recommending-diverse-and-r creator jiafeng-guo.
- a-unified-framework-for-recommending-diverse-and-r creator pan-du.
- a-unified-framework-for-recommending-diverse-and-r creator xiaofei-zhu.
- a-unified-framework-for-recommending-diverse-and-r creator xueqi-cheng.
- a-unified-framework-for-recommending-diverse-and-r type InProceedings.
- a-unified-framework-for-recommending-diverse-and-r label "A Unified Framework for Recommending Diverse and Relevant Queries".
- a-unified-framework-for-recommending-diverse-and-r sameAs a-unified-framework-for-recommending-diverse-and-r.
- a-unified-framework-for-recommending-diverse-and-r abstract "Query recommendation has been considered as an effective way to help search users in their information seeking activities. Traditional approaches mainly focused on recommending alternative queries with close search intent to the original query. However, to only take relevance into account may generate redundant recommendations to users. It is better to provide diverse as well as relevant query recommendations, so that we can cover multiple potential search intents of users and minimize the risk that users will not be satisfied. Besides, previous query recommendation approaches mostly relied on measuring the relevance or similarity between queries in the Euclidean space. However, there is no convincing evidence that the query space is Euclidean. It is more natural and reasonable to assume that the query space is a manifold. In this paper, therefore, we aim to recommend diverse and relevant queries based on the intrinsic query manifold. We propose a unified model, named manifold ranking with stop points, for query recommendation. By turning ranked queries into stop points on the query manifold, our approach can generate query recommendations by simultaneously considering both diversity and relevance in a unified way. Empirical experimental results on a large scale query log of a commercial search engine show that our approach can effectively generate highly diverse as well as closely related query recommendations.".
- a-unified-framework-for-recommending-diverse-and-r hasAuthorList authorList.
- a-unified-framework-for-recommending-diverse-and-r hasTopic recommendation.
- a-unified-framework-for-recommending-diverse-and-r hasTopic World_Wide_Web.
- a-unified-framework-for-recommending-diverse-and-r isPartOf proceedings.
- a-unified-framework-for-recommending-diverse-and-r title "A Unified Framework for Recommending Diverse and Relevant Queries".
- 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.
- item-1 hasContent xiaofei-zhu.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent jiafeng-guo.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent xueqi-cheng.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent pan-du.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent hua-wei-shen.
- item-5 previous item-4.
- a-word-at-a-time-computing-word-relatedness-using- creator eugene-agichtein.
- a-word-at-a-time-computing-word-relatedness-using- creator evgeniy-gabrilovich.
- a-word-at-a-time-computing-word-relatedness-using- creator kira-radinsky.
- a-word-at-a-time-computing-word-relatedness-using- creator shaul-markovitch.
- a-word-at-a-time-computing-word-relatedness-using- type InProceedings.
- a-word-at-a-time-computing-word-relatedness-using- label "A Word at a Time: Computing Word Relatedness Using Temporal Semantic Analysis".
- a-word-at-a-time-computing-word-relatedness-using- sameAs a-word-at-a-time-computing-word-relatedness-using-.
- a-word-at-a-time-computing-word-relatedness-using- abstract "Computing the degree of semantic relatedness of words is a key functionality of many language applications such as search, clustering, and disambiguation. Previous approaches to computing semantic relatedness mostly used static language resources, while essentially ignoring their temporal aspects. We believe that a considerable amount of relatedness information can also be found in studying patterns of word usage over time. Consider, for instance, a newspaper archive spanning many years. Two words such as ``war'' and ``peace'' might rarely co-occur in the same articles, yet their patterns of use over time might be similar. In this paper, we propose a new semantic relatedness model, Temporal Semantic Analysis (TSA), which captures this temporal information. The previous state of the art method, Explicit Semantic Analysis (ESA), represented word semantics as a vector of concepts. TSA uses a more refined representation, where each concept is no longer scalar, but is instead represented as time series over a corpus of temporally-ordered documents. To the best of our knowledge, this is the first attempt to incorporate temporal evidence into models of semantic relatedness. Empirical evaluation shows that TSA provides consistent improvements over the state of the art ESA results on multiple benchmarks.".
- a-word-at-a-time-computing-word-relatedness-using- hasAuthorList authorList.
- a-word-at-a-time-computing-word-relatedness-using- hasTopic semantic-analysis.
- a-word-at-a-time-computing-word-relatedness-using- hasTopic World_Wide_Web.
- a-word-at-a-time-computing-word-relatedness-using- isPartOf proceedings.
- a-word-at-a-time-computing-word-relatedness-using- title "A Word at a Time: Computing Word Relatedness Using Temporal Semantic Analysis".
- 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 kira-radinsky.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent eugene-agichtein.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent evgeniy-gabrilovich.
- item-3 next item-4.
- item-3 previous item-2.