2020
DOI: 10.1016/j.knosys.2020.106318
|View full text |Cite
|
Sign up to set email alerts
|

Fast t-SNE algorithm with forest of balanced LSH trees and hybrid computation of repulsive forces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…After being adapted by JDA, the size of 315 × 60 feature set initially extracted from three tools can be converted to the size of 315 × 4 feature set. In order to intuitively compare the change characteristics of the two features before and after feature adaptation, the t-distributed stochastic neighbor embedding (t-SNE (Orliński and Jankowski, 2022)) is used to visualize the feature sets of three tool wear samples before and after adaptation. The results are shown in Figures 6 and 7.…”
Section: Discussionmentioning
confidence: 99%
“…After being adapted by JDA, the size of 315 × 60 feature set initially extracted from three tools can be converted to the size of 315 × 4 feature set. In order to intuitively compare the change characteristics of the two features before and after feature adaptation, the t-distributed stochastic neighbor embedding (t-SNE (Orliński and Jankowski, 2022)) is used to visualize the feature sets of three tool wear samples before and after adaptation. The results are shown in Figures 6 and 7.…”
Section: Discussionmentioning
confidence: 99%
“…This paper proposes the use of gradient for trajectory optimization, which can be seen as solving extreme value problems of multivariate objective functions 28 . The optimal approach for solving such unconstrained optimization problems is to use the Newton method.…”
Section: Optimization Of Trajectorymentioning
confidence: 99%
“…To better visualize the final embeddings obtained by the last layers of the different models, a 2D projected representation of them were computed using the so-called T-SNE algorithm, updated in [30] with a level of perplexity equal to 80.…”
Section: B Self-supervised User Embeddingmentioning
confidence: 99%