.png){kind=icon}
返回
Binary Codes Based on Non-Negative Matrix Factorization for Clustering and Retrieval
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.3037956.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Traditional non-negative matrix factorization methods cannot learn the subspace from the high-dimensional data space composed of binary codes. One hopes to discover a compact parts-based representation composed of binary codes, which can uncover the intrinsic information and simultaneously respect the geometric structure of the original data. For this purpose, we introduce discrete hashing methods and propose a novel non-negative matrix factorization to generate binary codes from the original data. In this paper, we construct an affinity graph to encode the geometrical structure of the original data, and the learned binary code subspace achieved by matrix factorization respects the structure. The proposed problem can be formulated as a mixed integer optimization problem. Therefore, we transform it into several sub-problems including an integer optimization problem, two convex problems with the non-negative constraint and a quadratic programming problem. Optimizing each sub-problem alternately until we achieve a local optimal solution. Image clustering and retrieval on image datasets show the excellent performance of our method in comparison to other dimensional reduction methods.
Keyword:
Binary codes
Optimization
Matrix decomposition
Complexity theory
Sparse matrices
Search problems
Heating systems
Binary codes
discrete hashing
non-negative matrix factorization
dimensional reduction
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
Revisiting the effectiveness of economic sanctions in the context of Russia’s invasion of Ukraine
PREAI
分享收藏
查看更多内容