2021
DOI: 10.3389/fnbot.2021.680613
|View full text |Cite
|
Sign up to set email alerts
|

A Clustering Algorithm for Multi-Modal Heterogeneous Big Data With Abnormal Data

Abstract: The problems of data abnormalities and missing data are puzzling the traditional multi-modal heterogeneous big data clustering. In order to solve this issue, a multi-view heterogeneous big data clustering algorithm based on improved Kmeans clustering is established in this paper. At first, for the big data which involve heterogeneous data, based on multi view data analyzing, we propose an advanced Kmeans algorithm on the base of multi view heterogeneous system to determine the similarity detection metrics. The… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 24 publications
0
5
0
Order By: Relevance
“…Recently, other soft-clustering methods for multi-modal data are reported ( Yan et al , 2021 ; Zhang et al , 2022 ). While their utility or effectiveness with multi-modal biomedical data remains unknown, they may provide an additional framework to the analysis of the multi-modal disease-omics data studied in this article.…”
Section: Discussionmentioning
confidence: 99%
“…Recently, other soft-clustering methods for multi-modal data are reported ( Yan et al , 2021 ; Zhang et al , 2022 ). While their utility or effectiveness with multi-modal biomedical data remains unknown, they may provide an additional framework to the analysis of the multi-modal disease-omics data studied in this article.…”
Section: Discussionmentioning
confidence: 99%
“…developed. For instance, new techniques of clustering analysis are being developed to deal with noise, outliers, and data sets with missing values (Song et al 2021;Yan et al 2021). These are the same limitations that cripple our efforts of chemical tagging.…”
Section: Discussionmentioning
confidence: 99%
“…Given a consensus partition matrix G * ∈ R K×N + and a set of local partitions G = {G (1) , G (2) , • • • G V }, we define the category utility function between G * and each G v with 1 ≤ v ≤ V as follows:…”
Section: Category Utility Functionmentioning
confidence: 99%
“…generated by social networks users is changing rapidly. As data collections become highly diversified [1] due to the emergence of multi-modal data sets, multi-view data sets (i.e. the same data sample described in various ways) and dispersed data, it is now critical to effectively extract inherent information from these multi-source data sets.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation