2022
DOI: 10.1016/j.isatra.2022.05.006
|View full text |Cite
|
Sign up to set email alerts
|

Fault diagnosis of rotor based on Semi-supervised Multi-Graph Joint Embedding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
8

Relationship

2
6

Authors

Journals

citations
Cited by 20 publications
(8 citation statements)
references
References 32 publications
0
8
0
Order By: Relevance
“…The computational complexity of an algorithm is a key indicator of the merit of an algorithm [22]. Usually, the computational complexity of a DR algorithm is generally related to the original dimension d of the data, the target dimension r and the total number of samples n. Therefore, the complexity of the LGSHE algorithm mainly includes the following aspects: The complexity required to construct each hypergraph is O(dn 2 ); the computational complexity of computing the corresponding hyper-Laplacian matrix is O(n 3 ).…”
Section: Instruction Of Lgshementioning
confidence: 99%
See 2 more Smart Citations
“…The computational complexity of an algorithm is a key indicator of the merit of an algorithm [22]. Usually, the computational complexity of a DR algorithm is generally related to the original dimension d of the data, the target dimension r and the total number of samples n. Therefore, the complexity of the LGSHE algorithm mainly includes the following aspects: The complexity required to construct each hypergraph is O(dn 2 ); the computational complexity of computing the corresponding hyper-Laplacian matrix is O(n 3 ).…”
Section: Instruction Of Lgshementioning
confidence: 99%
“…In addition, according to [19,22], when the value of the number of nearest neighbor points is too small, LGSHE cannot completely portray the intrinsic structure of the faulty data; however, when the close neighbor points is too much, not only the nonlinearity and local structure of the data are easily ignored, but also the computational difficulty is increased. Therefore, considering these factors, k 1 and k 2 are set to k 1 = 12 and k 2 = 7 by experiment, respectively.…”
Section: Parameters Determinationmentioning
confidence: 99%
See 1 more Smart Citation
“…* Authors to whom any correspondence should be addressed. the existence of noise information [8][9][10][11][12][13][14]. Therefore, some strategies are still needed to be explored to improve the accuracy and effectiveness of fault diagnosis.…”
Section: Introductionmentioning
confidence: 99%
“…The complete acquisition of label information for samples is quite difficult, while semi-supervised methods can perform fault diagnosis without relying heavily on a large amount of label information. To reduce dependence on a large number of labels, Yuan et al [32] proposed a semi-supervised multi-graph joint embedding fault diagnosis method that uses semi-supervised hypergraphs and ordinary graphs to portray the complex structural relationships between data.…”
Section: Introductionmentioning
confidence: 99%