The Community for Technology Leaders
2012 IEEE International Conference on Bioinformatics and Biomedicine Workshops (2012)
Philadelphia, USA USA
Oct. 4, 2012 to Oct. 7, 2012
ISBN: 978-1-4673-2746-6
pp: 816-821
V. Datla , Dept. of Comput. Sci., Univ. of Memphis, Memphis, TN, USA
King-Ip Lin , Dept. of Comput. Sci., Univ. of Memphis, Memphis, TN, USA
M. Louwerse , Dept. of Psychol., Univ. of Memphis, Memphis, TN, USA
ABSTRACT
The field of medical informatics has been thriving over the last decade. One critical task in medical informatics is whether computational algorithms allow for predicting diseases from symptoms and vice versa. A niche of algorithms that has not been explored extensively are computational linguistic in nature and focus on higher-order co-occurrences of language units, such as words and paragraphs. The current study explored whether disease-symptom relations can be captured using such higher-order co-occurrences. Results indicated that higher order co-occurrences allow for capturing the semantic relation between disease and symptom. Two algorithms were tested, one using latent semantic analysis (LSA), which typically ignores the role of negations in language, and a customized LSA algorithm that took negations into account. Both algorithms predicted the semantic relations between symptoms and diseases well above chance level, with the customized algorithm outperforming the original LSA algorithm.
INDEX TERMS
Diseases, Semantics, Pain, Algorithm design and analysis, Prediction algorithms, Medical diagnostic imaging, Informatics
CITATION

V. Datla, King-Ip Lin and M. Louwerse, "Capturing disease-symptom relations using higher-order co-occurrence algorithms," 2012 IEEE International Conference on Bioinformatics and Biomedicine Workshops(BIBMW), Philadelphia, USA USA, 2013, pp. 816-821.
doi:10.1109/BIBMW.2012.6470245
312 ms
(Ver 3.3 (11022016))