The traditional K-Means clustering is sensitive to random selection of initial cluster centroids, easily into the local optimal solution. In this paper, an efficient aggregation algorithm which combined with Artificial bee colony and K-Means algorithm is proposed to apply to the diagnosis of liver function. The algorithm reduced the dependence on the initial cluster centroids and the probability to be trapped by local optimal solution, thus assigning data points to their appropriate cluster more efficient. The experimental results show that algorithm proposed in this paper is superior to the K-Means clustering in diagnosis of liver function.
목차
Abstract 1. Introduction 2. Computer-aided Diagnosis of Liver Function 3. Aggregation Algorithm Combined with ABC and K-Means Clustering 3.1. Artificial Bee Colony Algorithm 3.2. K-Means Clustering Algorithm 3.3. Aggregation Algorithm 4. Experiments 5. Conclusion References
Zhang Lin [ School of Computer Science and Technology, Harbin University of Science and Technology, 150080 Harbin, China ]
Li Peng [ School of Software, Harbin University of Science and Technology, 150080 Harbin, China, School of Computer Science and Technology, Harbin University of Science and Technology, 150080 Harbin, China ]
Qiao Pei-li [ School of Computer Science and Technology, Harbin University of Science and Technology, 150080 Harbin, China ]
보안공학연구지원센터(IJUNESST) [Science & Engineering Research Support Center, Republic of Korea(IJUNESST)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of u- and e- Service, Science and Technology
간기
격월간
pISSN
2005-4246
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of u- and e- Service, Science and Technology Vol.9 No.1