Towards interactive query expansion
SIGIR '88 Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval
Information retrieval using a singular value decomposition model of latent semantic structure
SIGIR '88 Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval
SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
Query expansion using lexical-semantic relations
SIGIR '94 Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval
A comparison of classifiers and document representations for the routing problem
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
WordNet: a lexical database for English
Communications of the ACM
Query expansion using local and global document analysis
SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
The potential and actual effectiveness of interactive query expansion
Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval
Phrase recognition and expansion for short, precision-biased queries based on a query log
Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
Patterns of search: analyzing and modeling Web query refinement
UM '99 Proceedings of the seventh international conference on User modeling
Journal of the American Society for Information Science
Web search behavior of Internet experts and newbies
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Searching the Web: the public and their queries
Journal of the American Society for Information Science and Technology
Document Ranking and the Vector-Space Model
IEEE Software
Kernel methods for relation extraction
The Journal of Machine Learning Research
A shallow parser based on closed-class words to capture relations in biomedical text
Journal of Biomedical Informatics
Journal of the American Society for Information Science and Technology - Bioinformatics
Accurate unlexicalized parsing
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Inverted files for text search engines
ACM Computing Surveys (CSUR)
LDA-based document models for ad-hoc retrieval
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Dependency tree kernels for relation extraction
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Determining the user intent of web search engine queries
Proceedings of the 16th international conference on World Wide Web
Kernel-based learning for biomedical relation extraction
Journal of the American Society for Information Science and Technology
Interpreting comparative constructions in biomedical text
BioNLP '07 Proceedings of the Workshop on BioNLP 2007: Biological, Translational, and Clinical Language Processing
Relation extraction from wikipedia using subtree mining
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Journal of Biomedical Informatics
Explicit versus latent concept models for cross-language information retrieval
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Arguments of nominals in semantic interpretation of biomedical text
BioNLP '10 Proceedings of the 2010 Workshop on Biomedical Natural Language Processing
RelExt: a tool for relation extraction from text in ontology extension
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
An optimization criterion for generalized discriminant analysis on undersampled problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
A pilot study of a predicate-based vector space model for a biomedical search engine
BIBMW '11 Proceedings of the 2011 IEEE International Conference on Bioinformatics and Biomedicine Workshops
ACM Transactions on Management Information Systems (TMIS) - Special Issue on Informatics for Smart Health and Wellbeing
Hi-index | 0.00 |
Although biomedical information available in articles and patents is increasing exponentially, we continue to rely on the same information retrieval methods and use very few keywords to search millions of documents. We are developing a fundamentally different approach for finding much more precise and complete information with a single query using predicates instead of keywords for both query and document representation. Predicates are triples that are more complex datastructures than keywords and contain more structured information. To make optimal use of them, we developed a new predicate-based vector space model and query-document similarity function with adjusted tf-idf and boost function. Using a test bed of 107,367 PubMed abstracts, we evaluated the first essential function: retrieving information. Cancer researchers provided 20 realistic queries, for which the top 15 abstracts were retrieved using a predicate-based (new) and keyword-based (baseline) approach. Each abstract was evaluated, double-blind, by cancer researchers on a 0-5 point scale to calculate precision (0 versus higher) and relevance (0-5 score). Precision was significantly higher (p