• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 27
Next 10 →

Mining Broad Latent Query Aspects from Search Sessions

by Xuanhui Wang, Deepayan Chakrabarti, Kunal Punera - KDD '09 , 2009
"... Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords that succinctly represents one particular sense, or one particular information need, that can aid users in reformulating ..."
Abstract - Cited by 14 (1 self) - Add to MetaCart
that uses single-keyword reformulations: a gain of 14 % and 23 % in terms of human-judged accuracy and click-through data respectively, and around 20 % in terms of consistency among aspects predicted for “similar ” queries. This demonstrates both the importance of broad query aspects, and the efficacy

Data integration and query reformulation in service-based grids

by Carmela Comito, Domenico Talia, Anastasios Gounaris, Rizos Sakellariou - In Proc. of the 1st CoreGRID Integration Workshop , 2005
"... This paper describes the XMAP data integration framework and query reformulation algorithm, provides insights into the performance of the algorithm, and about its use in implementing query processing services. Here we propose an approach for data integration-enabled distributed query processing on G ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
This paper describes the XMAP data integration framework and query reformulation algorithm, provides insights into the performance of the algorithm, and about its use in implementing query processing services. Here we propose an approach for data integration-enabled distributed query processing

Reformulations of Rational Functions of 0-1 Variables

by Mohit Tawarmalani, Shabbir Ahmed, Nikolaos V. Sahinidis , 2001
"... We present mix5UqC teger linear programming reformulations of rational functions of 0-1 variables and analyze the tightness of the corresponding linear relax ations. In the process of doing so, we develop a number of new results. First, we consider the product of a single continuous variable and the ..."
Abstract - Add to MetaCart
We present mix5UqC teger linear programming reformulations of rational functions of 0-1 variables and analyze the tightness of the corresponding linear relax ations. In the process of doing so, we develop a number of new results. First, we consider the product of a single continuous variable

An Evolutionary approach for Candidate Set generation with String Transformation Technique

by B Srinivas Reddy , V Vidyasagar , Final M Techstudent
"... Abstract: String Transformation is still an important research issue in the field of natural language processingand search engine optimization, Even though various traditional approaches available for string transformation they are not optimal because of Accuracy and efficiency are the basic parame ..."
Abstract - Add to MetaCart
parameters to optimize. While generation of the output Strings, Initially we consider the set of similar keywords. In this paper we are proposing an efficient approach of String transformation with Candidate generation and Selection and Query Reformulation, for the generation of the candidate sets we

, Principal

by Javvaji Vamshi Krishna, P. Prabhakar
"... Abstract:Probabilistic String Transformation is always an important research topic in the field of natural language processing and search engine optimization, Even though various traditional approaches available for string transformation or candidate set generation, they are not efficient approaches ..."
Abstract - Add to MetaCart
an efficient Model of String transformation for Candidateset generation and Query Reformulation, we are proposing an evolutionary approach for the correction of the misspelled wordswith edit distance and index based comparison either by single character or substring. I.

An Empirical Model of Candidate Set Generation in Information Retrieval

by unknown authors
"... Abstract: String Transformation is still an important research issue in the field of natural language processingand search engine optimization, Even though various traditional approaches available for string transformation they are not optimal because of Accuracy and efficiency are the basic paramet ..."
Abstract - Add to MetaCart
parameters to optimize. While generation of the output Strings, Initially we consider the set of similar keywords. In this paper we are proposing an efficient approach of String transformation with Candidate generation and Selection and Query Reformulation, for the generation of the candidate sets we

Coping with the Variability of Medical Terms

by M. Fieschi Et Al. (eds, Robert H Baud, Patrick Ruch, Arnaud Gaudinat, Paul Fabry, Christian Lovis, Antoine Geissbuhler, Robert H Baud , 2004
"... Objectives: To cope with medical terms, which present a high variability of expression through a single natural language, in the sense that any term may be reformulated in hundred of different ways. Methods: A typology of term variants is presented as a systematic approach in order to favour the imp ..."
Abstract - Add to MetaCart
Objectives: To cope with medical terms, which present a high variability of expression through a single natural language, in the sense that any term may be reformulated in hundred of different ways. Methods: A typology of term variants is presented as a systematic approach in order to favour

CuZero: Embracing the Frontier of Interactive Visual Search for Informed Users

by Eric Zavesky, Shih-fu Chang
"... Users of most visual search systems suffer from two primary sources of frustration. Before a search over this data is executed, a query must be formulated. Traditional keyword search systems offer only passive, non-interactive input, which frustrates users that are unfamiliar with the search topic o ..."
Abstract - Cited by 14 (5 self) - Add to MetaCart
Users of most visual search systems suffer from two primary sources of frustration. Before a search over this data is executed, a query must be formulated. Traditional keyword search systems offer only passive, non-interactive input, which frustrates users that are unfamiliar with the search topic

Semantic

by Krishnaprasad Thirunarayan
"... Abstract—Many complex information needs that arise in biomedical disciplines require exploring multiple documents in order to obtain information. While traditional information retrieval techniques that return a single ranked list of docu-ments are quite common for such tasks, they may not always be ..."
Abstract - Add to MetaCart
an alternative to query reformulation by establishing a framework for transitioning from one document to another. We evaluate this novel knowledge-driven approach using precision and recall metrics on the 2006 TREC Genomics Track. Keywords-semantic predications, question answering, back-ground knowledge

Multi-objective Optimal Block Transaction model based Transient Stability Evaluation

by Rui Ma, Hongwen Yan
"... Abstract:- This paper presents a novel multi-objective optimization block bidding model for power markets, which take the minimum of the pool purchase cost and the minimum pollution emission into consideration. Firstly, two single-objective problem is solved and the value of objective function are g ..."
Abstract - Add to MetaCart
are gained, then by using fuzzy sets theory the multi-objective problem is reformulated into a new standard single-objective nonlinear programming problem by means of max-min operator, finally, the new bidding results that multi-objective optimal is gained by the queuing algorithm. To evaluate
Next 10 →
Results 1 - 10 of 27
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University