2021
DOI: 10.1016/j.inffus.2020.09.007
|View full text |Cite
|
Sign up to set email alerts
|

Joint auto-weighted graph fusion and scalable semi-supervised learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 27 publications
(20 citation statements)
references
References 39 publications
0
20
0
Order By: Relevance
“…From Table 2, our strategy achieves the maximum division precision possible. The musicality division has 94 percent accuracy in terms of speed, which is 19 percent greater than the speed limit division used in work [26][27][28][29]. Furthermore, in the context of kinematic highlights and beat, the impacts of division approaches are superior to those in the context of kinematic highlights.…”
Section: Recall = T P T P + E N Precision = T P T P + F N mentioning
confidence: 94%
“…From Table 2, our strategy achieves the maximum division precision possible. The musicality division has 94 percent accuracy in terms of speed, which is 19 percent greater than the speed limit division used in work [26][27][28][29]. Furthermore, in the context of kinematic highlights and beat, the impacts of division approaches are superior to those in the context of kinematic highlights.…”
Section: Recall = T P T P + E N Precision = T P T P + F N mentioning
confidence: 94%
“…Beyond trustworthy decision, our approach automatically alleviates the impact from heavily noisy or corrupted modality. Compared with the intermediate fusion [4,43,44], our method can effectively distinguish which modality is noisy or corrupted for different samples, and accordingly can take the modality-specific uncertainty into account for robust integration.…”
Section: Multimodal Learningmentioning
confidence: 99%
“…To build a more robust adaptive neighborhood graph, Bo et al [13] proposed to learn latent representations in multi-view data and incorporate label information into the model using label propagation techniques. Bahrami et al [14] proposed a multiview learning method for graph fusion and label propagation that predicts the labels of unlabeled data while fusing graphs. However, there are two major limitations to such these methods that must be overcome [15]: on the one hand, as the key to the success of these methods is to construct appropriate similarity graphs and propagate the label information over the graph, different similarity measure functions or hyper-parameters will drastically alter the performance of the final task.…”
Section: Introductionmentioning
confidence: 99%