DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Lee, Do-Heon | - |
dc.contributor.advisor | 이도헌 | - |
dc.contributor.author | Shin, Moon-Shik | - |
dc.contributor.author | 신문식 | - |
dc.date.accessioned | 2015-04-23T07:08:25Z | - |
dc.date.available | 2015-04-23T07:08:25Z | - |
dc.date.issued | 2012 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=568077&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/197197 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 로봇공학학제전공, 2012.2, [ vi, 38 p. ] | - |
dc.description.abstract | Electronic Medical Records (EMRs) enable the sharing of patient medical data whenever it is needed and also are used as a tool for building new medical technology and patient recommendation systems. Since EMRs include patients’ private data there exist restriction to researchers for access. Thus an anonymizing technique is necessary that keeps patients’ private data safe while undamaging useful medical information. Conventional research has been focusing on de-identification which can lead to unexpected privacy exposure issue. To prevent unexpected privacy exposure issues anonymization techniques based on k-anonymity has been previously introduced. k-member clustering anonymization is a technique that approaches the k-anonymization as a clustering issue. The objective of the k-member clustering problem is to gather (i.e. cluster) records that will minimize the data distortion during data generalization process. Most of the clustering techniques include random seed selection and iteration process to gather record that gives minimum information distortion. However, dealing with massive medical patient dataset, randomly selecting a cluster seed will provide inconsistent performance. This paper proposes a seed selection method based on closeness centrality which not only provides consistent information loss but at the same time reduces the information loss and execution time. We experimentally compare our algorithm with two previous studies. The experiments show that our algorithm provides better performance with respect to information loss. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | K-anonymity | - |
dc.subject | 정보 손실량 | - |
dc.subject | 근접 중심성 분석 | - |
dc.subject | seed 선정 알고리즘 | - |
dc.subject | k-요소 군집화 재식별 방지 | - |
dc.subject | k-재식별 방지 | - |
dc.subject | K-member clustering anonymization | - |
dc.subject | Seed selection algorithm | - |
dc.subject | Closeness Centrality | - |
dc.subject | Information Loss | - |
dc.title | Machine learning approach for anonymizing electronic medical records | - |
dc.title.alternative | 전자의무기록의 기계학습 기반 익명화 기법 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 568077/325007 | - |
dc.description.department | 한국과학기술원 : 로봇공학학제전공, | - |
dc.identifier.uid | 020103336 | - |
dc.contributor.localauthor | Lee, Do-Heon | - |
dc.contributor.localauthor | 이도헌 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.