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

A new weakly supervised discrete discriminant hashing for robust data representation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 33 publications
0
3
0
Order By: Relevance
“…Data security is essential to financial control, especially in the context of growing cyber security threats. Data encryption technologies protect financial and non-financial information during storage and transfer (Chen and Wang 2023) while hashing is used to verify the integrity of data without the need to reveal its contents (Wan et al 2022). Caching improves the performance of financial control systems by providing fast access to frequently used information.…”
Section: Digital Tools For Information Managementmentioning
confidence: 99%
“…Data security is essential to financial control, especially in the context of growing cyber security threats. Data encryption technologies protect financial and non-financial information during storage and transfer (Chen and Wang 2023) while hashing is used to verify the integrity of data without the need to reveal its contents (Wan et al 2022). Caching improves the performance of financial control systems by providing fast access to frequently used information.…”
Section: Digital Tools For Information Managementmentioning
confidence: 99%
“…In recent years, l 1 -norm [10] has been greatly developed, and when the image is noisy, the recognition accuracy of the image is still high [11][12][13][14][15]. To further improve the robustness of subspace learning method, l p -norm is proposed, and because of it, PCA [16] and LDA [17] are further developed.…”
Section: Introductionmentioning
confidence: 99%
“…Equation (29) shows that the objective function of Equation ( 12) decreases monotonically in each iteration. Combining the convergence conditions given by Algorithm 1, it can be determined that the objective function (12) has a lower bound, and finally converges to the local optimal solution, so Theorem 2 is true.…”
mentioning
confidence: 98%