Cluster analysis, which focuses on the grouping and categorization of similar elements, is widely used in various fields of research. Inspired by the phenomenon of atomic fission, this paper proposes a novel density-based clustering algorithm, called fission clustering (FC). It focuses on mining the dense families of clusters in the dataset and utilizes the information of the distance matrix to fissure the dataset into subsets. A K-nearest neighbor (KNN) local density indicator is applied to identify and remove the points of sparse areas so as to obtain a dense subset that consists of the dense families of clusters. The algorithm, denoted as FC-KNN, is achieved by merging FC and KNN local density indicator. Several frequently-used datasets were applied to test the performance of the proposed clustering approach and to compare the results with those of other algorithms. The comprehensive comparisons indicate that the proposed method has advantages over other common methods.
Hesitant fuzzy set theory serves as a valuable framework that has been extensively applied across various domains, including decision-making, attribute reduction, linguistic perception, among others. Hesitant fuzzy elements are discrete arrays, and the intersection and union operations for hesitant fuzzy sets differ from those defined for fuzzy sets. Consequently, certain erroneous propositions have emerged in the literature on hesitant fuzzy sets. This review examines some incorrect propositions found in studies related to hesitant fuzzy topological spaces, hesitant fuzzy approximation spaces and hesitant fuzzy algebra, and provides corresponding counterexamples in each incorrect proposition. The advancement of a mathematical knowledge system must be free from errors, as inaccuracies can compromise the integrity of the theoretical framework. It is essential that researchers rigorously scrutinize the flawed propositions identified in this work when further investigating hesitant fuzzy sets and their mathematical structures, thereby promoting the robust development of hesitant fuzzy set theory.
A hesitant fuzzy element is defined as a discrete array characterized by complexity and diversity. Consequently, certain inadequate propositions have been identified in the existing literature on hesitant fuzzy sets. The development of a mathematical knowledge system relies on well-established theoretical foundations; even minor deficiencies in these foundations can undermine the integrity of subsequent knowledge frameworks. Topology and approximation space theory serve as essential pillars for a broad range of theoretical constructs. To rectify the flawed propositions in hesitant fuzzy approximation spaces and hesitant fuzzy topological spaces, this study proposes new intersection and union operators for hesitant fuzzy sets and refines the fundamental propositions of hesitant fuzzy sets under these operators. By presenting the inadequate propositions from the literature on these two mathematical structures and replacing the original intersection and union operations with the newly defined ones, all previously identified inadequacies can be rigorously addressed. Consequently, the theories derived from these propositions are also rigorously valid.