Matches in ScholarlyData for { ?s ?p ?o. }
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent alex-dekhtyar.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent kevin-mcentee.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent kimberly-paterson.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent matt-tognetti.
- item-6 previous item-5.
- 16 creator johnson-apacible.
- 16 creator shahab-kamali.
- 16 creator yasaman-hosseinkashi.
- 16 type InProceedings.
- 16 label "Answering math queries with search engines".
- 16 sameAs 16.
- 16 abstract "Conventional search engines such as Bing and Google provide a user with a short answer to some queries as well as a ranked list of documents, in order to better meet her information needs. In this paper we study a class of such queries that we call math. Arithmetic computations (e.g. ``square root of 123"), unit conversions (e.g. "convert 10 meter to feet"), and symbolic computations (e.g. "x\^{}2+x+1=0") are examples of math queries. Among the queries that should be answered, math queries are special because of the infinite combinations of numbers and symbols, and rather few keywords that make them up. Answering math queries must be done through real time computations rather than keyword searches or database look ups.The lack of a formal definition for the entire range of math queries makes it hard to automatically identify them all. We propose a novel approach for recognizing and classifying math queries using large scale search logs, and investigate its accuracy through empirical experiments and statistical analysis. It allows us to discover classes of math queries even if we do not know their structures in advance. It also helps to identify queries that are not math even though they might look like math queries. We also evaluate the usefulness of math answers based on the implicit feedback from users. Traditional approaches for evaluating the quality of search results, mostly rely on the click information and interpret a click on a link as a sign of satisfaction. Answers to math queries do not contain links, therefore such metrics are not applicable to them. In this paper we describe two evaluation metrics that can be applied for math queries, and present the results on a large collection of math queries taken from Bing's search logs.".
- 16 hasAuthorList authorList.
- 16 isPartOf proceedings.
- 16 isPartOf proceedings.
- 16 keyword "Evaluation".
- 16 keyword "Math queries".
- 16 keyword "Query answering".
- 16 keyword "Query classification".
- 16 keyword "Recognizing math queries".
- 16 keyword "Search engines".
- 16 title "Answering math queries with search engines".
- 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 shahab-kamali.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent johnson-apacible.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent yasaman-hosseinkashi.
- item-3 previous item-2.
- 18 creator gyanit-singh.
- 18 creator neel-sundaresan.
- 18 creator nish-parikh.
- 18 type InProceedings.
- 18 label "Rewriting Null e-commerce Queries to Recommend Products".
- 18 sameAs 18.
- 18 abstract "In e-commerce applications product descriptions are often concise. E-Commerce search engines often have to deal with queries that cannot be easily matched to product inventory resulting in zero recall or null query situations. Null query arise from differences in buyer and seller vocabulary or from the transient nature of products. In this paper, we describe a system that rewrites null e-commerce queries to find matching products as close to the original query as possible. The system uses query relaxation to rewrite null queries in order to match products. Using eBay as an example of a dynamic marketplace, we show how using temporal feedback that respects product category structure using the repository of expired products we improve the quality of recommended results. The system is scalable and can be run in a high volumesetting. We show through our experiments that high quality product recommendations for more than 25% of null queries is achievable.".
- 18 hasAuthorList authorList.
- 18 isPartOf proceedings.
- 18 isPartOf proceedings.
- 18 keyword "Temporal analysis".
- 18 keyword "query formulation".
- 18 keyword "search process".
- 18 title "Rewriting Null e-commerce Queries to Recommend Products".
- 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 gyanit-singh.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent nish-parikh.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent neel-sundaresan.
- item-3 previous item-2.
- 2 creator xiaoqing-zheng.
- 2 type InProceedings.
- 2 label "Data Extraction from Web Pages Based on Structural-Semantic Entropy".
- 2 sameAs 2.
- 2 abstract "Most of today's web content is designed for human consumption, which makes it difficult for software tools to access them readily. Even web content that is automatically generated from back-end databases is usually presented without the original structural information. In this paper, we present an automated information extraction algorithm that can extract the relevant attribute-value pairs from product descriptions across different sites. A notion, called structural-semantic entropy, is used to locate the data of interest on web pages, which measures the density of occurrence of relevant information on the DOM tree representation of web pages. Our approach is less labor-intensive and insensitive to changes in web-page format. Experimental results on a large number of real-life web page collections are encouraging and confirm the feasibility of the approach, which has been successfully applied to detect false drug advertisements on the Web due to its capacity in associating the attributes of records with their respective values.".
- 2 hasAuthorList authorList.
- 2 isPartOf proceedings.
- 2 isPartOf proceedings.
- 2 keyword "False advertisement detection".
- 2 keyword "Structural-Semantic Entropy".
- 2 keyword "Web information extraction".
- 2 title "Data Extraction from Web Pages Based on Structural-Semantic Entropy".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasLastItem item-1.
- item-1 type ListItem.
- item-1 hasContent xiaoqing-zheng.
- 20 creator andrew-hatch.
- 20 creator mohamed-aly.