Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Query Reformulation

Encyclopedia of Criminal Activities and the Deep Web
Query reformulation refers to a set of techniques wherein a query (in some domain-specific language like SPARQL or SQL) that is originally posed against a DSS engine is reformulated into a set of queries (in the same or different language) to increase query retrieval performance. Query reformulation is a useful technique both when the underlying KG is noisy and when the original query does not fully express (or over-conditions) user intent.
Published in Chapter:
Domain-Specific Search Engines for Investigating Human Trafficking and Other Illicit Activities
Mayank Kejriwal (University of Southern California, USA)
Copyright: © 2020 |Pages: 19
DOI: 10.4018/978-1-5225-9715-5.ch033
Abstract
Web advertising related to human trafficking (HT) activity has been on the rise in recent years. Question answering over crawled sex advertisements to assist investigators in the real world is an important social problem involving many technical challenges. This article will describe the problem of domain-specific search (DSS), a specific set of technologies that can address these challenges, drawing on cutting-edge techniques developed over three years of DARPA-funded research conducted in collaboratively academic (e.g., the University of Southern California's Information Sciences Institute), government (e.g., NASA's Jet Propulsion Laboratory), and industrial (e.g., Uncharted) settings to assist analysts and investigative experts in the HT domain. Specifically, the article will describe the background, main principles and challenges of building a DSS in illicit domains and the general architecture of a DSS designed for illicit sex advertisements on the open web. The article will conclude with the scope of future research in this area.
Full Text Chapter Download: US $37.50 Add to Cart
More Results
Evolutionary Database: State of the Art and Issues
Given two schemas S1 and S2 and a set of constraints. Let Q1 a query on S1 and Q2 a query on S2. Q1 is a reformulation equivalent to Q2 if Q2 produces the same answers of Q1 on the instances of the joint schema satisfying the constraints.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR