TY - GEN
T1 - Projected clustering via robust orthogonal least square regression with optimal scaling
AU - Zhang, Rui
AU - Nie, Feiping
AU - Li, Xuelong
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/6/30
Y1 - 2017/6/30
N2 - The orthogonal least square regression (OLSR) serves as a pretty significant problem for the dimensionality reduction. Due to lack of the scale change in OLSR, the scaling term is at first introduced to OLSR to build up a novel orthogonal least square regression with optimal scaling (OLSR-OS) problem. However, OLSR-OS is still sensitive to the outliers, such that associated results could be fallacious. To strengthen the robustness of OLSR-OS, we propose an original robust OLSR-OS (ROLSR-OS) problem in ℓ2,1-norm. To tackle a more ill-defined situation, ROLSR-OS in ℓ2,1-norm can be further extended to ROLSR-OS in capped ℓ2-norm. Besides, the associated ROLSR-OS methods could be derived by solving the re-weighted counterparts of ROLSR-OS problems in both norms. Moreover, the equivalence between the re-weighted counterparts and the original ROLSR-OS problems is also provided along with the convergence analysis of the proposed ROLSR-OS methods. Accordingly, both the optimal scaling and weight can be achieved automatically via the proposed ROLSR-OS approaches. Specifically, the proposed ROLSR-OS methods are self-adaptive, such that the smaller weight would be automatically assigned to the term with larger outliers to enhance the robustness. Consequently, projected clustering and modified projected clustering under the proposed ROLSR-OS problems are further investigated both theoretically and experimentally.
AB - The orthogonal least square regression (OLSR) serves as a pretty significant problem for the dimensionality reduction. Due to lack of the scale change in OLSR, the scaling term is at first introduced to OLSR to build up a novel orthogonal least square regression with optimal scaling (OLSR-OS) problem. However, OLSR-OS is still sensitive to the outliers, such that associated results could be fallacious. To strengthen the robustness of OLSR-OS, we propose an original robust OLSR-OS (ROLSR-OS) problem in ℓ2,1-norm. To tackle a more ill-defined situation, ROLSR-OS in ℓ2,1-norm can be further extended to ROLSR-OS in capped ℓ2-norm. Besides, the associated ROLSR-OS methods could be derived by solving the re-weighted counterparts of ROLSR-OS problems in both norms. Moreover, the equivalence between the re-weighted counterparts and the original ROLSR-OS problems is also provided along with the convergence analysis of the proposed ROLSR-OS methods. Accordingly, both the optimal scaling and weight can be achieved automatically via the proposed ROLSR-OS approaches. Specifically, the proposed ROLSR-OS methods are self-adaptive, such that the smaller weight would be automatically assigned to the term with larger outliers to enhance the robustness. Consequently, projected clustering and modified projected clustering under the proposed ROLSR-OS problems are further investigated both theoretically and experimentally.
UR - http://www.scopus.com/inward/record.url?scp=85031030183&partnerID=8YFLogxK
U2 - 10.1109/IJCNN.2017.7966199
DO - 10.1109/IJCNN.2017.7966199
M3 - 会议稿件
AN - SCOPUS:85031030183
T3 - Proceedings of the International Joint Conference on Neural Networks
SP - 2784
EP - 2791
BT - 2017 International Joint Conference on Neural Networks, IJCNN 2017 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 International Joint Conference on Neural Networks, IJCNN 2017
Y2 - 14 May 2017 through 19 May 2017
ER -