2020
DOI: 10.1109/access.2020.2979915
|View full text |Cite
|
Sign up to set email alerts
|

Co-Clustering Ensemble Based on Bilateral K-Means Algorithm

Abstract: Clustering ensemble technique has been shown to be effective in improving the accuracy and stability of single clustering algorithms. With the development of information technology, the amount of data, such as image, text and video, has increased rapidly. Efficiently clustering these large-scale datasets is a challenge. Clustering ensembles usually transform clustering results to a co-association matrix, and then to a graph-partition problem. These methods may suffer from information loss when computing the si… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 40 publications
(38 reference statements)
0
5
0
Order By: Relevance
“…Fuzzy parameter identification of portable multidimensional control software is carried out by using the fuzzy semantic feature reconstruction method, and the feature quantity of associated information of data in portable multidimensional control software is extracted. e difference degree function of fuzzy semantic feature reconstruction is expressed as follows (3) [14]:…”
Section: Portable Multidimensional Control Software Testmentioning
confidence: 99%
“…Fuzzy parameter identification of portable multidimensional control software is carried out by using the fuzzy semantic feature reconstruction method, and the feature quantity of associated information of data in portable multidimensional control software is extracted. e difference degree function of fuzzy semantic feature reconstruction is expressed as follows (3) [14]:…”
Section: Portable Multidimensional Control Software Testmentioning
confidence: 99%
“…However, the general K-means clustering algorithm needs to determine the number of clustering centers first, and the specific number is unknown in most cases. However, if the number of clustering centers is not set properly, the final clustering result will have a large error [21]- [23]. Therefore, Canopy algorithm was used to improve the K-means clustering algorithm, and the improved K-means clustering algorithm was used to perform cluster analysis on the existing renewable energy and load data.…”
Section: A Improve K-means Clustering Algorithmmentioning
confidence: 99%
“…Here, the nodes match the data of the samples and the weights of the edges are similar. The final results of clustering are obtained by using the METIS algorithm by using a connected graph 22 . An additional method for the pairwise matrix of samples is homogeneous to consider the matching between the samples of two‐cluster, which is used as a binary matrix subscribed 23,24 .…”
Section: Literature Reviewmentioning
confidence: 99%
“…The final results of clustering are obtained by using the METIS algorithm by using a connected graph. 22 An additional method for the pairwise matrix of samples is homogeneous to consider the matching between the samples of two-cluster, which is used as a binary matrix subscribed. 23,24 Abawajy et al 25 presented this membership as a bipartite, and they named the hybrid bipartite graph formulation (HBGF) algorithm, which stands for the algorithm to formulate a hybrid graph.…”
Section: 𝛿 =mentioning
confidence: 99%
See 1 more Smart Citation