Matches in ScholarlyData for { ?s ?p ?o. }
- item-1 type ListItem.
- item-1 hasContent anders-brodersen.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent salvatore-scellato.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent mirjam-wattenhofer.
- item-3 previous item-2.
- 838 creator jianyong-wang.
- 838 creator min-wang.
- 838 creator ping-luo.
- 838 creator wei-shen.
- 838 type InProceedings.
- 838 label "LINDEN: Linking Named Entities with Knowledge Base via Semantic Knowledge".
- 838 sameAs 838.
- 838 abstract "Integrating the extracted facts with an existing knowledge base has raised an urgent need to address the problem of entity linking. Specifically, entity linking is the task to link the entity mention in text with the corresponding real world entity in the existing knowledge base. However, this task is challenging due to name ambiguity, textual inconsistency, and lack of world knowledge in the knowledge base. Several methods have been proposed to tackle this problem, but they are largely based on the co-occurrence statistics of terms between the text around the entity mention and the document associated with the entity. In this paper, we propose LINDEN, a novel framework to link named entities in text with a knowledge base unifying Wikipedia and WordNet, by leveraging the rich semantic knowledge embedded in the Wikipedia and the taxonomy of the knowledge base. We extensively evaluate the performance of our proposed LINDEN over two public data sets and empirical results show that LINDEN significantly outperforms the state-of-the-art methods in terms of accuracy.".
- 838 hasAuthorList authorList.
- 838 isPartOf proceedings.
- 838 keyword "Entity linking".
- 838 keyword "Fact integration".
- 838 keyword "Knowledge base".
- 838 keyword "Semantic knowledge".
- 838 keyword "Wikipedia".
- 838 title "LINDEN: Linking Named Entities with Knowledge Base via Semantic Knowledge".
- 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 wei-shen.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent jianyong-wang.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent ping-luo.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent min-wang.
- item-4 previous item-3.
- 846 creator ana-radovanovic.
- 846 creator william-heavlin.
- 846 type InProceedings.
- 846 label "Risk-aware Revenue Maximization in Display Advertising".
- 846 sameAs 846.
- 846 abstract "Display advertising is the graphical advertising on the World Wide Web (WWW) that appears next to content on Web pages, instant messaging (IM) applications, email, etc. Over the past decade, display ads have evolved from simple banner and pop-up ads to include various combinations of text, images, audio, video, and animations. As a market segment, display continues to show substantial growth potential, as evidenced by companies such as Microsoft, Yahoo, and Google actively vying for market share. As a sales process, display ads are typically sold in packages, the result of negotiations between sales and advertising agents. A key component to any successful business model in display advertising is sound pricing. Key objectives for on-line publishers (e.g. Amazon, YouTube, CNN) are maximizing revenue while managing their available inventory appropriately, and pricing must reflect these considerations. This paper addresses the problem of maximizing revenue by adjusting prices of display inventory. We cast this as an inventory allocation problem. Our formal objective (a) maximizes expected revenue, while (b) taking into account the opportunity costs of non-sold inventory; (a) and (b) define the primal and dual optimization programs. The major unknown for optimizing revenue in display environment is how the demand for display ads changes to prices, the classical demand curve. This we address directly, by way of a factorial pricing experiment. This enables us to estimate the gradient of the revenue function with respect to inventory prices. Overall, the result is a principled, risk-aware, and empirically efficient methodology. This paper is based on research undertaken on behalf of one of Google's clients.".
- 846 hasAuthorList authorList.
- 846 isPartOf proceedings.
- 846 keyword "display advertising".
- 846 keyword "factorial pricing experiment".
- 846 keyword "revenue maximization".
- 846 title "Risk-aware Revenue Maximization in Display Advertising".
- 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 ana-radovanovic.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent william-heavlin.
- item-2 previous item-1.
- 858 creator prithviraj-sen.
- 858 type InProceedings.
- 858 label "Context-Aware Topic Models for Entity Disambiguation".
- 858 sameAs 858.
- 858 abstract "A crucial step in adding structure to unstructured data is to identify references to entities and disambiguate them. Such disambiguated references can help enhance readability and draw similarities across different pieces of running text in an automated fashion. Previous research has tackled this problem by first forming a catalog of entities from a knowledge base such as Wikipedia and then using this catalog subsequently to disambiguate references in unseen text. However, most of the previously proposed models either do not use all text in the knowledge base thus potentially missing out on discriminative features or do not exploit word-entity proximity to learn high-quality catalogs. In this work, we propose topic models that keep track of the context of every word in the knowledge base so that entities appearing in the same context are more likely to be associated with the word. Thus, our topic models utilize all text present in the knowledge base and help learn high-quality, discerning catalogs. Our models also learn groups of co-occurring entities from the knowledge base thus allowing us to perform collective disambiguation. Unlike most previous topic models, our models are non-parametric and do not require the user to specify how many groups exist in the knowledge base. In experiments performed on an extract of Wikipedia containing almost 60,000 references, our models outperform SVM-based baselines by as much as 18\% in terms of disambiguation accuracy translating to an increment of almost 11,000 correctly disambiguated references.".
- 858 hasAuthorList authorList.
- 858 isPartOf proceedings.
- 858 keyword "Entity disambiguation".
- 858 keyword "Structured data".
- 858 keyword "Topic models".
- 858 title "Context-Aware Topic Models for Entity Disambiguation".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasLastItem item-1.
- item-1 type ListItem.
- item-1 hasContent prithviraj-sen.
- 860 creator qi-li.
- 860 type InProceedings.
- 860 label "Combining Flat and Structured Approaches for Temporal Slot Filling or: How Much to Compress?".
- 860 sameAs 860.
- 860 abstract "In this paper, we present a hybrid approach to Temporal Slot Filling (TSF) task at NIST TAC Knowledge Base Population (KBP2011) track. Our method decomposes the task into two steps: temporal classification and temporal aggregation. As in many other NLP tasks, a key challenge lies in capturing relations between text elements separated by a long context. We have observed that features derived from a structured text representation can help compressing the context and reducing ambiguity; while surface lexical features are more robust and work better in some cases. Experiments show that both surface and structured approaches outperform some baselines and that proposed hybrid method can further improve the performance significantly. Our system achieved the top performance in KBP2011 evaluation.".
- 860 hasAuthorList authorList.
- 860 isPartOf proceedings.
- 860 keyword "Kernel Methods".
- 860 keyword "Temporal Aggregation".
- 860 keyword "Temporal Classification".
- 860 keyword "Temporal Slot Filling".
- 860 title "Combining Flat and Structured Approaches for Temporal Slot Filling or: How Much to Compress?".
- authorList type List.