It is difficult for users to formulate appropriate queries for search. In this paper, we propose an approach to query term selection by measuring the effectiveness of a query term in IR systems based on its linguistic and statistical properties in document collections. Two query formulation algorithms are presented for improving IR performance. Experiments on NTCIR-4 and NTCIR-5 ad-hoc IR tasks...

Motivation Ontology Based Data Access (OBDA) [16] is a recently proposed prominent approach that aims at providing domain experts with a direct access to available enterprise data sources without IT-experts being involved. OBDA is an alternative to centralised approaches, where an IT-expert translates the requirements of domain experts into Extract-Transform-Load (ETL) processes to first integr...

In this work, we emphasize on formulating effective structured queries for session search. For a given query, phrase-like text nuggets are identified and formulated into Lemur queries to feed into the Lemur search engine. Nuggets are substrings in qn, similar to phrases but not necessarily as semantically coherent as phrases. We assume that a valid nugget appears frequently in top returned snip...

web search engines are one of the most popular tools on the internet which are widely-used by expert and novice users. constructing an adequate query which represents the best specification of users’ information need to the search engine is an important concern of web users. query expansion is a way to reduce this concern and increase user satisfaction. in this paper, a new method of query expa...

A new query formulation system based on a semantic graph model is presented. The graph provides a semantic model for the data in the database with userde ned relationships. The query formulator allows users to specify their requests and constraints in highlevel concepts. The query candidates are formulated based on the user input by a graph search algorithm and ranked according to a probabilist...

Information seekers using the usual search techniques and engines are delighted by the sheer power of the technology at their command – speed, quantity. Upon closer inspection of the results, and reflection upon the next stages of the information seeking knowledge work, users are typically overwhelmed, and frustrated. We propose a partial solution by focusing on the query formulation aspect of ...

We recently demonstrated 2 to 64-fold query-time speedups of Support Vector Machine and Kernel Fisher classifiers via a new computational geometry method for anytime output bounds (DeCoste, 2002). This new paper refines our approach in two key ways. First, we introduce a simple linear algebra formulation based on Cholesky factorization, yielding simpler equations and lower computational overhea...