A graph-based approach for biomedical thesaurus expansion
Pages 79 - 82
Abstract
The addition of new terms to biomedical thesauri is important for keeping pace with new research. In the context of a thesaurus expansion task, we investigate the property of Laplacian diffusion kernel matrices that depreciate pivotal vertices having many links to surrounding vertices. We confirm that this property can be seen on the Laplacian matrix of a graph that we construct from the GENIA corpus (a subset of MEDLINE abstracts) and simulate thesaurus expansion by employing either the Laplacian diffusion kernel matrix, or the adjacency matrix (i.e., cosine similarity), to determine the correct position for new biomedical terms being added to the MeSH thesaurus. Whilst results do not show the desired precision, our approach is shown to be complementary to calculation of cosine similarity between thesaurus terms and we recognize directions for future work.
References
[1]
K. Bharat and M. R. Henzinger. Improved algorithms for topic distillation in a hyperlinked environment. In Proc. of SIGIR-98, pages 104--111, 1998.
[2]
V. D. Blondel, A. Gajardo, M. Heymans, P. Senellart, and P. V. Dooren. A measure of similarity between graph vertices: Applications to synonym extraction and web searching. SIAM Rev., 46(4):647--666, 2004.
[3]
D. J. Cook and L. B. Holder. Mining Graph Data. John Wiley&Sons, 2006.
[4]
F. Fouss, L. Yen, A. Pirotte, and M. Saerens. An experimental investigation of graph kernels on a collaborative recommendation task. IEEE International Conference on Data Mining, pages 863--868, 2006.
[5]
M. Hagiwara. A supervised learning approach to automatic synonym identification based on distributional features. In Proc. of the ACL-08: HLT Student Research Workshop, pages 1--6, 2008.
[6]
M. Hagiwara, Y. Ogawa, and K. Toyama. PLSI utilization for automatic thesaurus construction. In Proc. of IJCNLP-05, pages 334--345, 2005.
[7]
M. Hagiwara, Y. Ogawa, and K. Toyama. Selection of effective contextual information for automatic synonym acquisition. In Proc. of COLING/ACL-06, pages 353--360, 2006.
[8]
Z. Harris. Distributional structure. The Philosophy of Linguistics, pages 26--47, 1985.
[9]
M. Komachi, T. Kudo, M. Shimbo, and Y. Matsumoto. Graph-based analysis of semantic drift in Espresso-like bootstrapping algorithms. In Proc. of EMNLP-08, pages 1011--1020, 2008.
[10]
N. Shimizu, M. Hagiwara, Y. Ogawa, K. Toyama, and H. Nakagawa. Metric learning for synonym acquisition. In Proc. of COLING-08, pages 793--800, 2008.
Index Terms
- A graph-based approach for biomedical thesaurus expansion
Recommendations
Simple Weighting Techniques for Query Expansion in Biomedical Document Retrieval
In this paper, we propose two weighting techniques to improve performances of query expansion in biomedical document retrieval, especially when a short biomedical term in a query is expanded with its synonymous multi-word terms. When a query contains ...
Language model-based automatic prefix abbreviation expansion method for biomedical big data analysis
AbstractIn biomedical domain, abbreviations are appearing more and more frequently in various data sets, which has caused significant obstacles to biomedical big data analysis. The dictionary-based approach has been adopted to process ...
Highlights- An automatic method is proposed for biomedical big data.
- This method overcomes ...
A hybrid approach to chinese abbreviation expansion
ICCPOL'06: Proceedings of the 21st international conference on Computer Processing of Oriental Languages: beyond the orient: the research challenges aheadThis paper presents a hybrid approach to Chinese abbreviation expansion. In this study, each short-form in Chinese text is assumed to be created by the method of reduction and the method of elimination or generalization, respectively. A mapping table ...
Comments
Information & Contributors
Information
Published In
November 2009
106 pages
ISBN:9781605588032
DOI:10.1145/1651318
- General Chairs:
- Doheon Lee,
- Russ Altman,
- Program Chairs:
- Min Song,
- Jun Huan
Copyright © 2009 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 06 November 2009
Check for updates
Author Tags
Qualifiers
- Short-paper
Conference
Acceptance Rates
DTMBIO '09 Paper Acceptance Rate 8 of 18 submissions, 44%;
Overall Acceptance Rate 41 of 247 submissions, 17%
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 147Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 15 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in