{"title":"用于特征聚类和降维的模糊特征相似函数","authors":"Arun Nagaraja, U. Boregowda, V. Radhakrishna","doi":"10.1145/3460620.3460758","DOIUrl":null,"url":null,"abstract":"Dimensionality reduction is usually obtained by applying some of the most well unknown methods such as principal component analysis, singular value decomposition, feature selection algorithms which are based on information gain, Gini index etc. The objective behind achievement of dimensionality reduction is reducing computational complexity and at the same time aiming to attain better performance by learning algorithms which may perform supervised or unsupervised learning. In this paper, we present a feature clustering similarity function for dimensionality reduction so that the eventual reduced dataset may be used to reduce the computational complexity and also result better classifier evaluation results interms of accuracy, precision etc.","PeriodicalId":36824,"journal":{"name":"Data","volume":"1 1","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2021-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Fuzzy Feature Similarity Functions for Feature Clustering and Dimensionality Reduction\",\"authors\":\"Arun Nagaraja, U. Boregowda, V. Radhakrishna\",\"doi\":\"10.1145/3460620.3460758\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Dimensionality reduction is usually obtained by applying some of the most well unknown methods such as principal component analysis, singular value decomposition, feature selection algorithms which are based on information gain, Gini index etc. The objective behind achievement of dimensionality reduction is reducing computational complexity and at the same time aiming to attain better performance by learning algorithms which may perform supervised or unsupervised learning. In this paper, we present a feature clustering similarity function for dimensionality reduction so that the eventual reduced dataset may be used to reduce the computational complexity and also result better classifier evaluation results interms of accuracy, precision etc.\",\"PeriodicalId\":36824,\"journal\":{\"name\":\"Data\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2021-04-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Data\",\"FirstCategoryId\":\"90\",\"ListUrlMain\":\"https://doi.org/10.1145/3460620.3460758\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Data","FirstCategoryId":"90","ListUrlMain":"https://doi.org/10.1145/3460620.3460758","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Fuzzy Feature Similarity Functions for Feature Clustering and Dimensionality Reduction
Dimensionality reduction is usually obtained by applying some of the most well unknown methods such as principal component analysis, singular value decomposition, feature selection algorithms which are based on information gain, Gini index etc. The objective behind achievement of dimensionality reduction is reducing computational complexity and at the same time aiming to attain better performance by learning algorithms which may perform supervised or unsupervised learning. In this paper, we present a feature clustering similarity function for dimensionality reduction so that the eventual reduced dataset may be used to reduce the computational complexity and also result better classifier evaluation results interms of accuracy, precision etc.