基于相对变换的骨肉瘤分类算法
The Classification of Osteosarcoma Based on Relative Transformation
DOI: 10.12677/HJDM.2017.72005, PDF, HTML, XML, 下载: 1,403  浏览: 3,854  科研立项经费支持
作者: 蔡先发, 李 洁:广东药科大学医药信息工程学院,广东 广州 ;胡 珊:中山大学中山医学院计算机中心,广东 广州
关键词: k近邻分类器局部均值算法相对变换相对局部均值算法k Nearest Neighbors Classifier Local Mean Center Classifier Relative Transformation Relative Local Mean Center Classifier
摘要: 作为一种常见的骨科疾病,骨肉瘤属于恶性程度甚高、预后极差且转移较快的骨原发性恶性肿瘤。由于该病多发于青少年且危害很大,因此,早期发现、早期诊断和早期治疗便成为治疗骨肉瘤的关键。将机器学习中的基于近邻的局部分类器引入到骨肉瘤的数据分类中来,极大的提高了分类的自动性以及效果。然而由于骨肉瘤数据可能存在稀疏、噪声和非平衡等问题,如此算法的效果往往不佳。本文根据认知的相对性规律提出了基于相对变换的局部均值分类算法,通过相对变换将数据的原始空间变换到相对空间,在相对的空间中度量数据的相似性更符合人们的直觉,从而提高了数据之间的可区分性,同时在一定条件下相对变换还能抑制噪声的影响。实验结果表明,相对局部均值算法具有非常好的分类效果,可以有效地辅助临床医生。
Abstract: As a common disease in department of orthopedics, osteosarcoma is a malignant tumor with high malignancy and poor prognosis. Because the disease often occurs in young people and is very harmful, therefore, early detection, early diagnosis and early treatment are key to the treatment of osteosarcoma. In this paper, local classifier based the nearest neighbor is introduced into the classification of osteosarcoma data, which greatly improves the classification of the automatic and effect. However when dealing with the sparse, noisy and imbalance data, it cannot guarantee to obtain good performance. Based on the relative cognitive law, this paper proposes a feasible strategy called relative local mean center classifier by using the relative transformation to local mean center classifier. The relative space is constructed which may be more line with people’s in-tuition. It should be indicated that relative transformation can improve the distinguishing ability among data points and diminish the impact of noise on classification. The experimental result shows that relative local mean center classifier has a very good classification effect, and can effec-tively assist clinicians.
文章引用:蔡先发, 胡珊, 李洁. 基于相对变换的骨肉瘤分类算法[J]. 数据挖掘, 2017, 7(2): 46-50. https://doi.org/10.12677/HJDM.2017.72005

参考文献

[1] Gao, Y., Pan, J., Ji, G. and Yang, Z. (2012) A Novel Two-Level nearest Neighbor Classification Algorithm Using an Adaptive Distance Metric. Knowledge-Based Systems, 26, 103-110.
https://doi.org/10.1016/j.knosys.2011.07.010
[2] Karl, S.N. and Truong, Q.N. (2009) An Adaptable k-Nearest Neighbors Algorithm for MMSE Image Interpolation. IEEE Transactions on Image Processing, 18, 1976-1987.
https://doi.org/10.1109/TIP.2009.2023706
[3] Keller, J.M., Gray, M.R. and Givens, J.A. (1985) A Fuzzy k-NN Neighbor Algorithm. IEEE Transactions on System, Man and Cybernetics, 15, 580-585.
https://doi.org/10.1109/TSMC.1985.6313426
[4] Denoeux, T. (1995) A k-Nearest Neighbor Classification Rule Based on Dempster Shafer Theory. IEEE Transactions on Systems, Man and Cybernetics, 25, 804-813.
https://doi.org/10.1109/21.376493
[5] Wang, H. (2006) Nearest Neighbors by Neighborhood Counting. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28, 942-953.
https://doi.org/10.1109/TPAMI.2006.126
[6] Mitani, Y. and Hamamoto, Y. (2006) A Local Mean-Based Non-parametric Classifier. Pattern Recognition Letters, 27, 1151-1159.
https://doi.org/10.1016/j.patrec.2005.12.016
[7] Li, B., Chen, Y.W. and Chen, Y.Q. (2008) The Nearest Neighbor Algorithm of Local Probability Centers. IEEE Transactions on Systems, Man and Cybernetics, Part B: Cybernetics, 38, 141-154.
https://doi.org/10.1109/TSMCB.2007.908363
[8] Vincent, P. and Bengio, Y. (2002) K-Local Hyperplane and Convex Distance nearest Neighbor Algorithms. Advances in Neural Information Processing Systems, 14, 985-992.
[9] 李海生. 基于证据理论的分类方法研究[D]: [博士学位论文]. 广州: 华南理工大学, 2013.
[10] 蔡先发. 基于图的半监督算法及其应用研究[D]: [博士学位论文]. 广州: 华南理工大学, 2013.
[11] Li, D.Y., Liu, C.Y., Du, Y. and Han, X. (2004) Artificial Intelligence with Uncertainty. Journal of Software, 15, 1583- 1594. (In Chinese with English Abstract). http://www.jos.org.cn/1000-9825/15/1583.htm
[12] Wen, G., Jiang, L.J. and Wen, J. (2009) Relative Transformation-Based Neighborhood Optimization for Isometric Embedding. Neurocomputing, 72, 1205-1213.
https://doi.org/10.1016/j.neucom.2008.02.009