K-modes Algorithm Based on Rough Set and Information Entropy
نویسندگان
چکیده
منابع مشابه
Rough K-modes Clustering Algorithm Based on Entropy
Cluster analysis is an important technique used in data mining. Categorical data clustering has received a great deal of attention in recent years. Some existing algorithms for clustering categorical data do not consider the importance of attributes for clustering, thereby reducing the efficiency of clustering analysis and limiting its application. In this paper, we propose a novel rough k-mode...
متن کاملA Clustering Algorithm Based on Rough Set and Genetic Algorithm
With the development of computer and information technology, the capacity of data and information is increasing. The processing of data and information becomes the hot issue in the current scientific community. Rough set and genetic algorithm are two data mining and processing technologies which had been commonly used. Rough set can process data quickly and the algorithm is simple. The converge...
متن کاملInformation Entropy and Mutual Information-based Uncertainty Measures in Rough Set Theory
As an extension of the classical set theory, rough set theory plays a crucial role in uncertainty measurement. In this paper, concepts of information entropy and mutual information-based uncertainty measures are presented in both complete and incomplete information/decision systems. Then, some important properties of these measures are investigated, relationships among them are established, and...
متن کاملRough K-means Outlier Factor Based on Entropy Computation
Many studies of outlier detection have been developed based on the cluster-based outlier detection approach, since it does not need any prior knowledge of the dataset. However, the previous studies only regard the outlier factor computation with respect to a single point or a small cluster, which reflects its deviates from a common cluster. Furthermore, all objects within outlier cluster are as...
متن کاملAn Improved Heuristic Attribute Reduction Algorithm Based on Informa- tion Entropy in Rough Set
At present, in rough set theory there are two kinds of heuristic attribute reduction algorithms, one is based on discernibility matrix, the other is based on mutual information. But if these algorithms are applied to the non-core information system, there will be much problems, such as too much calculation, excessive reduction, or insufficient reduction. So we propose an improved heuristic attr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1754/1/012239