نتایج جستجو برای: query formulation
تعداد نتایج: 166605 فیلتر نتایج به سال:
Complicated search such as making a travel plan usually requires more than one search queries. A user interacts with a search engine for multiple iterations, which we call a session. Session search is the task that deals with document retrieval within a session. A session often involves a series of interactions between the user and the search engine. To make use of all the queries and various i...
Despite a wide variety of new solutions, structured information search still has only one practical approach – formbased interface. A key limitation of this interface is poor handling of iterative search. While browsing the results users have to memorize all new search constraints, go back to the form, and enter them into the appropriate fields. To overcome this obstacle we created Natural Sear...
The impact of using phrases as content representation for documents and for queries has generally been accepted as a desirable feature in information retrieval systems because phrases are generally regarded as being more content-bearing than their constituent words. This has been borne by experiments in which the impact of phrases on retrieval performance has usually been found to be positive. ...
Industry Abstracts; Australian Business Deans Council (ABDC); Bacon’s Media Directory; Burrelle’s Media Directory; Cabell’s Directories; Ceramic Abstracts; Compendex (Elsevier Engineering Index); Computer & Information Systems Abstracts; Corrosion Abstracts; CSA Civil Engineering Abstracts; CSA Illumina; CSA Mechanical & Transportation Engineering Abstracts; Current
Biologists increasingly need to ask complex questions over the large quantity of data and analysis tools that now exist. To do this, the individual sources need to be made to work together. The knowledge needed to accomplish this places a barrier between the bench biologist and the question he or she wishes to ask. The TAMBIS project (Transparent Access to Multiple Bioinformatics Information So...
This paper proposes an approach which allows users to edit natural language fragments given by the system and to obtain a pseudonatural language text describing the meaning of the intended query. Algorithms presented here translate manipulations on the pseudonatural language text being edited intro changes on a query hypergraph as its internal representation, calculate possible quantifier scope...
This paper presents the experiments and results of DCU in CLEF-IP 2009. Our work applied standard information retrieval (IR) techniques to patent search. Different experiments tested various methods for the patent retrieval, including query formulation, structured index, weighted fields, document filtering, and blind relevance feedback. Some methods did not show expected good retrieval effectiv...
............................................................................................................ 169 Autobiographical Statement .............................................................................. 171
Heterogeneous graphs are increasingly used to represent complex relationships in schema-less data. Querying these graphs is a fundamental and critical task for many graph applications. While such graphs are content-rich, they are difficult to use. In this work we present techniques to help schema-agnostic users easily query such large heterogeneous graphs. As an initial step towards making such...
Grounded on real industrial use cases, we recently proposed an ontology-based visual query system for SPARQL, named OptiqueVQS. Ontology-based visual query systems employ ontologies and visual representations to depict the domain of interest and queries, and are promising to enable end users without any technical background to access data on their own. However, even with considerably small onto...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید