{"title":"利用改进的竞争性Hebbian学习的一种新的神经无监督分类方法:PET图像分割洞察","authors":"M. Timouyas, S. Eddarouich, A. Hammouch","doi":"10.1504/IJBRA.2017.10002820","DOIUrl":null,"url":null,"abstract":"This paper proposes a new classification procedure based on the competitive concept, divided into three processing stages. It begins by the estimation of the Probability Density Function (pdf), followed by a competitive training neural network with the Mahalanobis distance as an activation function. This stage allows detecting the local maxima of the pdf. Then, we use the competitive Hebbian learning to analyse the connectivity between the detected maxima of the pdf upon the Mahalanobis distance. The so detected groups of maxima are then used for the classification process. Compared to the K-means clustering or the clustering approaches based on the different competitive learning schemes, the proposed approach has proven, under a number of real (positron emission tomography image) and synthetic data samples, that it does not pass by any thresholding and does not require any prior information on the number of classes or on the structure of their distributions in the data set.","PeriodicalId":434900,"journal":{"name":"Int. J. Bioinform. Res. Appl.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A new neural unsupervised classification approach using amended competitive Hebbian learning: PET image segmentation insights\",\"authors\":\"M. Timouyas, S. Eddarouich, A. Hammouch\",\"doi\":\"10.1504/IJBRA.2017.10002820\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a new classification procedure based on the competitive concept, divided into three processing stages. It begins by the estimation of the Probability Density Function (pdf), followed by a competitive training neural network with the Mahalanobis distance as an activation function. This stage allows detecting the local maxima of the pdf. Then, we use the competitive Hebbian learning to analyse the connectivity between the detected maxima of the pdf upon the Mahalanobis distance. The so detected groups of maxima are then used for the classification process. Compared to the K-means clustering or the clustering approaches based on the different competitive learning schemes, the proposed approach has proven, under a number of real (positron emission tomography image) and synthetic data samples, that it does not pass by any thresholding and does not require any prior information on the number of classes or on the structure of their distributions in the data set.\",\"PeriodicalId\":434900,\"journal\":{\"name\":\"Int. J. Bioinform. Res. Appl.\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-02-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Bioinform. Res. Appl.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJBRA.2017.10002820\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Bioinform. Res. Appl.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJBRA.2017.10002820","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new neural unsupervised classification approach using amended competitive Hebbian learning: PET image segmentation insights
This paper proposes a new classification procedure based on the competitive concept, divided into three processing stages. It begins by the estimation of the Probability Density Function (pdf), followed by a competitive training neural network with the Mahalanobis distance as an activation function. This stage allows detecting the local maxima of the pdf. Then, we use the competitive Hebbian learning to analyse the connectivity between the detected maxima of the pdf upon the Mahalanobis distance. The so detected groups of maxima are then used for the classification process. Compared to the K-means clustering or the clustering approaches based on the different competitive learning schemes, the proposed approach has proven, under a number of real (positron emission tomography image) and synthetic data samples, that it does not pass by any thresholding and does not require any prior information on the number of classes or on the structure of their distributions in the data set.