{"title":"基于粗糙熵的分类数据聚类数据标注方法","authors":"G. Sreenivasulu, S. Raju, N. Rao","doi":"10.1109/ICECCE.2014.7086654","DOIUrl":null,"url":null,"abstract":"Clustering is one of the most important method in data mining. Clustering a huge data set is difficult and time taking process. In this scenario a new method proposed that is based on Rough Entropy for improving efficiency of clustering and labeling the unlabeled data points in clusters. Data Labeling is a simple process in numerical domain but not in categorical domain. Why because distance is a major parameter in numerical whereas not in categorical attributes. So, In this paper proposed a new method for data labeling using Rough Entropy for clustering categorical data attributes. This method is mainly divided into two phases. Phase-1 is aimed to find the partition with respect to attributes and phase-II is to find the Rough Entropy to know the node importance for data labeling.","PeriodicalId":223751,"journal":{"name":"2014 International Conference on Electronics, Communication and Computational Engineering (ICECCE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Data Labeling method based on Rough Entropy for categorical data clustering\",\"authors\":\"G. Sreenivasulu, S. Raju, N. Rao\",\"doi\":\"10.1109/ICECCE.2014.7086654\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Clustering is one of the most important method in data mining. Clustering a huge data set is difficult and time taking process. In this scenario a new method proposed that is based on Rough Entropy for improving efficiency of clustering and labeling the unlabeled data points in clusters. Data Labeling is a simple process in numerical domain but not in categorical domain. Why because distance is a major parameter in numerical whereas not in categorical attributes. So, In this paper proposed a new method for data labeling using Rough Entropy for clustering categorical data attributes. This method is mainly divided into two phases. Phase-1 is aimed to find the partition with respect to attributes and phase-II is to find the Rough Entropy to know the node importance for data labeling.\",\"PeriodicalId\":223751,\"journal\":{\"name\":\"2014 International Conference on Electronics, Communication and Computational Engineering (ICECCE)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Electronics, Communication and Computational Engineering (ICECCE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECCE.2014.7086654\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Electronics, Communication and Computational Engineering (ICECCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECCE.2014.7086654","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Data Labeling method based on Rough Entropy for categorical data clustering
Clustering is one of the most important method in data mining. Clustering a huge data set is difficult and time taking process. In this scenario a new method proposed that is based on Rough Entropy for improving efficiency of clustering and labeling the unlabeled data points in clusters. Data Labeling is a simple process in numerical domain but not in categorical domain. Why because distance is a major parameter in numerical whereas not in categorical attributes. So, In this paper proposed a new method for data labeling using Rough Entropy for clustering categorical data attributes. This method is mainly divided into two phases. Phase-1 is aimed to find the partition with respect to attributes and phase-II is to find the Rough Entropy to know the node importance for data labeling.