{"title":"Cbica:基于相关性的增量聚类算法","authors":"Kaustubh Shinde, Preeti Mulay","doi":"10.1109/I2CT.2017.8226138","DOIUrl":null,"url":null,"abstract":"With progress in the area of computer science, it is achievable to read, process, store and generate information out of the available data. Humongous amount of data is generated, which is of mixed type, including time-series, Boolean, spatial-temporal and alpha-numeric data. This data is generated at a very giant speed and volume, which makes difficult for the traditional clustering algorithms to create and maintain the desired clusters. Thus, the proposed system encourages incremental clustering using a non-probability based similarity measure. The experimental results, of Correlation Based Incremental Clustering Algorithm (CBICA), which are obtained using the Pearson's coefficient of correlation, are compared with the experimental results of the Closeness-Factor Based Algorithm (CFBA), which uses the probability based similarity measures. The threshold computation is done to decide the cluster members in the post clustering phase, to adapt influx of new data. Wherein the new data is accommodated in the available clusters or new clusters are formed, depending upon the threshold values.","PeriodicalId":343232,"journal":{"name":"2017 2nd International Conference for Convergence in Technology (I2CT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Cbica: Correlation based incremental clustering algorithm, a new approach\",\"authors\":\"Kaustubh Shinde, Preeti Mulay\",\"doi\":\"10.1109/I2CT.2017.8226138\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With progress in the area of computer science, it is achievable to read, process, store and generate information out of the available data. Humongous amount of data is generated, which is of mixed type, including time-series, Boolean, spatial-temporal and alpha-numeric data. This data is generated at a very giant speed and volume, which makes difficult for the traditional clustering algorithms to create and maintain the desired clusters. Thus, the proposed system encourages incremental clustering using a non-probability based similarity measure. The experimental results, of Correlation Based Incremental Clustering Algorithm (CBICA), which are obtained using the Pearson's coefficient of correlation, are compared with the experimental results of the Closeness-Factor Based Algorithm (CFBA), which uses the probability based similarity measures. The threshold computation is done to decide the cluster members in the post clustering phase, to adapt influx of new data. Wherein the new data is accommodated in the available clusters or new clusters are formed, depending upon the threshold values.\",\"PeriodicalId\":343232,\"journal\":{\"name\":\"2017 2nd International Conference for Convergence in Technology (I2CT)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 2nd International Conference for Convergence in Technology (I2CT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/I2CT.2017.8226138\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 2nd International Conference for Convergence in Technology (I2CT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/I2CT.2017.8226138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cbica: Correlation based incremental clustering algorithm, a new approach
With progress in the area of computer science, it is achievable to read, process, store and generate information out of the available data. Humongous amount of data is generated, which is of mixed type, including time-series, Boolean, spatial-temporal and alpha-numeric data. This data is generated at a very giant speed and volume, which makes difficult for the traditional clustering algorithms to create and maintain the desired clusters. Thus, the proposed system encourages incremental clustering using a non-probability based similarity measure. The experimental results, of Correlation Based Incremental Clustering Algorithm (CBICA), which are obtained using the Pearson's coefficient of correlation, are compared with the experimental results of the Closeness-Factor Based Algorithm (CFBA), which uses the probability based similarity measures. The threshold computation is done to decide the cluster members in the post clustering phase, to adapt influx of new data. Wherein the new data is accommodated in the available clusters or new clusters are formed, depending upon the threshold values.