Library and Information Science Commons^™

The Ensemble Mesh-Term Query Expansion Models Using Multiple Lda Topic Models And Ann Classifiers In Health Information Retrieval, Sukjin You

Theses and Dissertations

Information retrieval in the health field has several challenges. Health information terminology is difficult for consumers (laypeople) to understand. Formulating a query with professional terms is not easy for consumers because health-related terms are more familiar to health professionals. If health terms related to a query are automatically added, it would help consumers to find relevant information. The proposed query expansion (QE) models show how to expand a query using MeSH (Medical Subject Headings) terms. The documents were represented by MeSH terms (i.e. Bag-of-MeSH), which were included in the full-text articles. And then the MeSH terms were used to generate …

Examining Medline Search Query Reproducibility And Resulting Variation In Search Results, C. Sean Burns, Robert M. Shapiro Ii, Tyler Nix, Jeffrey T. Huber

Information Science Faculty Publications

The MEDLINE database is publicly available through the National Library of Medicine’s PubMed but the data file itself is also licensed to a number of vendors, who may offer their versions to institutional and other parties as part of a database platform. These vendors provide their own interface to the MEDLINE file and offer other technologies that attempt to make their version useful to subscribers. However, little is known about how vendor platforms ingest and interact with MEDLINE data files, nor how these changes influence the construction of search queries and the results they produce. This poster presents a longitudinal …

A Comparative Study On Text Categorization, Aditya Chainulu Karamcheti

UNLV Theses, Dissertations, Professional Papers, and Capstones

Automated text categorization is a supervised learning task, defined as assigning category labels to new documents based on likelihood suggested by a training set of labeled documents. Two examples of methodology for text categorizations are Naive Bayes and K-Nearest Neighbor.

In this thesis, we implement two categorization engines based on Naive Bayes and K-Nearest Neighbor methodology. We then compare the effectiveness of these two engines by calculating standard precision and recall for a collection of documents. We will further report on time efficiency of these two engines.