DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Myaeng, Sung-Hyon | - |
dc.contributor.advisor | 맹성현 | - |
dc.contributor.author | Kim, Jong-Beom | - |
dc.contributor.author | 김종범 | - |
dc.date.accessioned | 2013-09-12T01:49:29Z | - |
dc.date.available | 2013-09-12T01:49:29Z | - |
dc.date.issued | 2012 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=509479&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/180471 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전산학과, 2012.8, [ iv, 36 p. ] | - |
dc.description.abstract | In biomedical texts, abbreviations are frequently used due to their inclusion of many technical expressions of some length. Accordingly, appropriate recognition of abbreviations and their full form pairs is essential task in automatic text processing of biomedical documents. However, unlike biomedical literatures, clinical notes have many abbreviations without full form indicated in the text or without standard definition in dictionaries due to the nature of the documents. This causes difficulties in adapting traditional approaches for abbreviation disambiguation such as classification among fixed candidates or pattern-based definition extraction. Because of this reason, we consider the task as search problem and propose an approach with two steps: a) exploring possible full form candidates from various resources and b) choosing most acceptable one among retrieved candidates by ranking. To discover full form candidates and extract features of them, we exploited external academic resources such as MEDLINE and UMLS as well as clinical note corpus itself. To rank the candidates properly by consulting human criteria, we adopted RankBoost, one of learning to rank models developed from information retrieval and machine learning societies. Results show the suggested two-step approach has potential on this kind of task and propose another possible application of learning to rank models. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Abbreviation Resolution | - |
dc.subject | Learning to Rank | - |
dc.subject | 약어 처리 | - |
dc.subject | Learning to Rank | - |
dc.subject | 의료문서처리 | - |
dc.subject | Medical Text Processing | - |
dc.title | A method using candidate exploration and ranking for abbreviation resolution in clinical documents | - |
dc.title.alternative | 후보 탐색과 랭킹을 이용한 임상 의료문서 내의 약어 처리 방법 연구 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 509479/325007 | - |
dc.description.department | 한국과학기술원 : 전산학과, | - |
dc.identifier.uid | 020104291 | - |
dc.contributor.localauthor | Myaeng, Sung-Hyon | - |
dc.contributor.localauthor | 맹성현 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.