Are you sure you want to delete this task? Once this task is deleted, it cannot be recovered.
zhaijianyang 8573128012 | 1 year ago | |
---|---|---|
eval | 1 year ago | |
res | 1 year ago | |
.gitignore | 1 year ago | |
EuDist2.m | 1 year ago | |
README.md | 1 year ago | |
cal_obj.m | 1 year ago | |
main.m | 1 year ago | |
opmc.m | 1 year ago | |
update_C.m | 1 year ago | |
update_W.m | 1 year ago | |
update_Y.m | 1 year ago | |
update_beta.m | 1 year ago |
Matalb implementation for ACM Multimedia paper:
Abstract
Existing non-negative matrix factorization based multi-view clustering algorithms compute multiple coefficient matrices respect to different data views, and learn a common consensus concurrently. The final partition is always obtained from the consensus with classical clustering techniques, such as $k$-means. However, the non-negativity constraint prevents from obtaining a more discriminative embedding. Meanwhile, this two-step procedure fails to unify multi-view matrix factorization with partition generation closely, resulting in unpromising performance. Therefore, we propose an one-pass multi-view clustering algorithm by removing the non-negativity constraint and jointly optimize the aforementioned two steps. In this way, the generated partition can guide multi-view matrix factorization to produce more purposive coefficient matrix which, as a feedback, improves the quality of partition. To solve the resultant optimization problem, we design an alternate strategy which is guaranteed to be convergent theoretically. Moreover, the proposed algorithm is free of parameter and of linear complexity, making it practical in applications. In addition, the proposed algorithm is compared with recent advances in literature on benchmarks, demonstrating its effectiveness, superiority and efficiency.
If you find our code useful, please cite:
@inproceedings{conf/iccv/liuopmc21,
author = {Jiyuan Liu and
Xinwang Liu and
Yuexiang Yang and
Li Liu and
Siqi Wang and
Weixuan Liang and
Jiangyong Shi},
title = {One-pass Multi-view Clustering for Large-scale Data},
journal = {IEEE International Conference on Computer Vision (ICCV)},
volume = {},
pages = {},
year = {2021},
url = {},
doi = {}
}
Dear OpenI User
Thank you for your continuous support to the Openl Qizhi Community AI Collaboration Platform. In order to protect your usage rights and ensure network security, we updated the Openl Qizhi Community AI Collaboration Platform Usage Agreement in January 2024. The updated agreement specifies that users are prohibited from using intranet penetration tools. After you click "Agree and continue", you can continue to use our services. Thank you for your cooperation and understanding.
For more agreement content, please refer to the《Openl Qizhi Community AI Collaboration Platform Usage Agreement》