{"title":"Tsallis熵在分类数据聚类中的有效性","authors":"Shachi Sharma, I. Bassi","doi":"10.1109/IBSSC47189.2019.8973057","DOIUrl":null,"url":null,"abstract":"Categorical data clustering is an important area of research today as databases usually contain categorical data [1]. The current work proposes that the behavior of attributes in categorical dataset is important in selecting the clustering algorithm. A Tsallis entropy based categorical data clustering (TEC) algorithm is also presented. It is shown that when the attributes depict power law behavior, the proposed TEC algorithm outperforms existing Shannon entropy based clustering algorithms. Experimental results on UCI and WEB KB datasets validates the efficacy of TEC algorithm.","PeriodicalId":148941,"journal":{"name":"2019 IEEE Bombay Section Signature Conference (IBSSC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Efficacy of Tsallis Entropy in Clustering Categorical Data\",\"authors\":\"Shachi Sharma, I. Bassi\",\"doi\":\"10.1109/IBSSC47189.2019.8973057\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Categorical data clustering is an important area of research today as databases usually contain categorical data [1]. The current work proposes that the behavior of attributes in categorical dataset is important in selecting the clustering algorithm. A Tsallis entropy based categorical data clustering (TEC) algorithm is also presented. It is shown that when the attributes depict power law behavior, the proposed TEC algorithm outperforms existing Shannon entropy based clustering algorithms. Experimental results on UCI and WEB KB datasets validates the efficacy of TEC algorithm.\",\"PeriodicalId\":148941,\"journal\":{\"name\":\"2019 IEEE Bombay Section Signature Conference (IBSSC)\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE Bombay Section Signature Conference (IBSSC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IBSSC47189.2019.8973057\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Bombay Section Signature Conference (IBSSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IBSSC47189.2019.8973057","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficacy of Tsallis Entropy in Clustering Categorical Data
Categorical data clustering is an important area of research today as databases usually contain categorical data [1]. The current work proposes that the behavior of attributes in categorical dataset is important in selecting the clustering algorithm. A Tsallis entropy based categorical data clustering (TEC) algorithm is also presented. It is shown that when the attributes depict power law behavior, the proposed TEC algorithm outperforms existing Shannon entropy based clustering algorithms. Experimental results on UCI and WEB KB datasets validates the efficacy of TEC algorithm.