{"title":"Online accelarated implementation of the Fuzzy C-means algorithm with the use of the GPU platform","authors":"Sharanyan Srikanthan, V. Krishnan, Arvind Kumar","doi":"10.1109/ICCCT.2011.6075148","DOIUrl":null,"url":null,"abstract":"Fuzzy C-means is a very widely covered topic in literature. It is a very successful clustering method whose subtle variations are involved in various clustering related applications. Despite its success, it shares a disadvantage with almost all of its contemporary pattern discovery algorithms — computational complexity. With the explosion in multimedia data over the internet and growing storage systems, there is a lot of research done in content based data retrieval. Fuzzy C-means is an integral part of this goal but its innate complexity makes it a strictly offline algorithm. Online pattern discovery is the need of the hour and our paper aims to address this issue without the use of powerful servers for implementing Fuzzy C-Means (FCM). We aim at accelerating the algorithm using Graphical Processing Units (GPUs), which are basically graphic cards common in desktop computers. We aim at restructuring the algorithm in a manner in which maximum data parallelism could be extracted thus utilizing the resources of the GPU to the fullest extent. In this paper we compare the speed of our approach using a NVIDIA Tesla C1060 GPU to that of sequential versions running on an Intel Xeon 2.93 GHz and an Intel Dual Core 2GHz.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCT.2011.6075148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Fuzzy C-means is a very widely covered topic in literature. It is a very successful clustering method whose subtle variations are involved in various clustering related applications. Despite its success, it shares a disadvantage with almost all of its contemporary pattern discovery algorithms — computational complexity. With the explosion in multimedia data over the internet and growing storage systems, there is a lot of research done in content based data retrieval. Fuzzy C-means is an integral part of this goal but its innate complexity makes it a strictly offline algorithm. Online pattern discovery is the need of the hour and our paper aims to address this issue without the use of powerful servers for implementing Fuzzy C-Means (FCM). We aim at accelerating the algorithm using Graphical Processing Units (GPUs), which are basically graphic cards common in desktop computers. We aim at restructuring the algorithm in a manner in which maximum data parallelism could be extracted thus utilizing the resources of the GPU to the fullest extent. In this paper we compare the speed of our approach using a NVIDIA Tesla C1060 GPU to that of sequential versions running on an Intel Xeon 2.93 GHz and an Intel Dual Core 2GHz.