By Topic

A data mining approach to PubMed query refinement

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Berardi, M. ; Dipt. di Informatica, Universita degli Studi di Bari, Italy ; Lapi, M. ; Leo, P. ; Malerba, D.
more authors

Finding disease relationships requires laborious examination of hundreds of possible candidate heterogeneous factors. Much of the related information is currently contained in biological and medical journals, making biomedical text mining a central bioinformatic problem. More than 14 million abstracts of such papers are contained in the Medline collection and are available online. In this paper we present a data mining engine, namely MeSH Terms Associator (MTA), that has been employed in a distributed architecture to refine a generic PubMed query by means of discovery of concept relations in the form of association rules. However, the number of discovered association rules is usually high and the interest of most of them does not fulfil user expectations. In addition, the presentation of thousands of rules can discourage users from interpreting them. To overcome this problem we investigate the application of some filtering techniques. Experimental results on datasets corresponding to real-world biomedical queries are discussed and future directions are drawn.

Published in:

Database and Expert Systems Applications, 2004. Proceedings. 15th International Workshop on

Date of Conference:

30 Aug.-3 Sept. 2004