Correntropy based graph regularized concept factorization for clustering
Concept factorization (CF) technique is one of the most powerful approaches for feature learning, and has been successfully adopted in a wide range of practical applications such as data mining, computer vision, and information retrieval. Most existing concept factorization methods mainly minimize t...
Saved in:
Main Authors: | Peng, Siyuan, Ser, Wee, Chen, Badong, Sun, Lei, Lin, Zhiping |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/136678 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Robust sparse nonnegative matrix factorization based on maximum correntropy criterion
by: Peng, Siyuan, et al.
Published: (2020) -
Another construction of edge-regular graphs with regular cliques
by: Greaves, Gary Royden Watson, et al.
Published: (2020) -
Edge-regular graphs with regular cliques
by: Greaves, Gary Royden Watson, et al.
Published: (2019) -
On applications of the retracing method for distance-regular graphs
by: Vencer, Norma Luz C.
Published: (2006) -
Robust anchor-based multi-view clustering via spectral embedded concept factorization
by: Yang, Ben, et al.
Published: (2023)