{"title":"基于哈希索引和Voronoi聚类的不确定数据聚类有效方法","authors":"Samir N. Ajani, M. Wanjari","doi":"10.1109/CICN.2013.106","DOIUrl":null,"url":null,"abstract":"Recently the classifying uncertain data in spatial database used in data mining attract a main attention by researchers. The main task is to handle the uncertainty of the data in order to classify or cluster it. In order to classify or cluster the valid or certain data, there are various techniques like DTL, Rule based Classification, Naive Bayes Classification and many more techniques. It's easy to classify the certain data but classification of the uncertain data is bit difficult. Generally K-means algorithm is used to make clusters of uncertain of uncertain data but it increases overhead and computation time. Hence to improve the performance of K-means algorithm we are proposing a technique in which K-means is combined with Voronoi clustering but this will increase the prune overhead so to reduce this prune overhead we will add Hash indexing on th uncertain data object. Our technique of combining K-means with hash indexing and Vornoi diagram results better than older technique used for clustering based on K-Means algorithm.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"An Efficient Approach for Clustering Uncertain Data Mining Based on Hash Indexing and Voronoi Clustering\",\"authors\":\"Samir N. Ajani, M. Wanjari\",\"doi\":\"10.1109/CICN.2013.106\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently the classifying uncertain data in spatial database used in data mining attract a main attention by researchers. The main task is to handle the uncertainty of the data in order to classify or cluster it. In order to classify or cluster the valid or certain data, there are various techniques like DTL, Rule based Classification, Naive Bayes Classification and many more techniques. It's easy to classify the certain data but classification of the uncertain data is bit difficult. Generally K-means algorithm is used to make clusters of uncertain of uncertain data but it increases overhead and computation time. Hence to improve the performance of K-means algorithm we are proposing a technique in which K-means is combined with Voronoi clustering but this will increase the prune overhead so to reduce this prune overhead we will add Hash indexing on th uncertain data object. Our technique of combining K-means with hash indexing and Vornoi diagram results better than older technique used for clustering based on K-Means algorithm.\",\"PeriodicalId\":415274,\"journal\":{\"name\":\"2013 5th International Conference on Computational Intelligence and Communication Networks\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 5th International Conference on Computational Intelligence and Communication Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CICN.2013.106\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 5th International Conference on Computational Intelligence and Communication Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICN.2013.106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Efficient Approach for Clustering Uncertain Data Mining Based on Hash Indexing and Voronoi Clustering
Recently the classifying uncertain data in spatial database used in data mining attract a main attention by researchers. The main task is to handle the uncertainty of the data in order to classify or cluster it. In order to classify or cluster the valid or certain data, there are various techniques like DTL, Rule based Classification, Naive Bayes Classification and many more techniques. It's easy to classify the certain data but classification of the uncertain data is bit difficult. Generally K-means algorithm is used to make clusters of uncertain of uncertain data but it increases overhead and computation time. Hence to improve the performance of K-means algorithm we are proposing a technique in which K-means is combined with Voronoi clustering but this will increase the prune overhead so to reduce this prune overhead we will add Hash indexing on th uncertain data object. Our technique of combining K-means with hash indexing and Vornoi diagram results better than older technique used for clustering based on K-Means algorithm.