2019
DOI: 10.5916/jkosme.2019.43.6.455
|View full text |Cite
|
Sign up to set email alerts
|

Fault diagnosis of bearings using machine learning algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(9 citation statements)
references
References 0 publications
0
8
0
Order By: Relevance
“…It attempts to use a reasonable number of parameters to obtain better graph classification performance. Inspired by the work of [23], we adopted a graph pooling method based on self-attention, called SAG-Pool, to extract crucial features from EEG data. The detailed steps are shown as follows:…”
Section: Gannsmentioning
confidence: 99%
“…It attempts to use a reasonable number of parameters to obtain better graph classification performance. Inspired by the work of [23], we adopted a graph pooling method based on self-attention, called SAG-Pool, to extract crucial features from EEG data. The detailed steps are shown as follows:…”
Section: Gannsmentioning
confidence: 99%
“…Graph coarsening and pooling layers are important for GNN models to avoid overfitting by reducing the number of parameters [45]. Self-attention graph pooling (SAGPooling) [45,46] aims to aggregate the information of a graph's nodes and reduce the graph's size for further processing. SAGPooling is a type of graph pooling which is based on self-attention mechanisms.…”
Section: Gnn Backgroundmentioning
confidence: 99%
“…Where idx is the index of the new set of selected nodes and top k is the function that selects the top k nodes based on their attention scores as shown in figure 2(c). The remaining nodes' feature matrix and adjacency matrix are updated with X (l+1) = X (l) ⊙ Z idx and Â(l+1) = Â(l) idx,idx , where ⊙ is the elementwise product [45].…”
Section: Gnn Backgroundmentioning
confidence: 99%
See 1 more Smart Citation
“…Where α ij is expressed as: The update function U is expressed as: The pooling mechanism of TopK [20][21][22] is a process of continuously discarding nodes according to the characteristic data of different scales on the It places the pooling scope on the full graph node. By setting the pooling rate k, k ∈ (0, 1), then learning to obtain a value z that can characterize the node importance and sorting it.…”
Section: Model Of a Troubleshooting Algorithm Based On Stack Diagram ...mentioning
confidence: 99%