High-order co-clustering via strictly orthogonal and symmetric `1-norm nonnegative matrix tri-factorization

8Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

Abstract

Different to traditional clustering methods that deal with one single type of data, High-Order Co-Clustering (HOCC) aims to cluster multiple types of data simultaneously by utilizing the inter- or/and intra-type relationships across different data types. In existing HOCC methods, data points routinely enter the objective functions with squared residual errors. As a result, outlying data samples can dominate the objective functions, which may lead to incorrect clustering results. Moreover, existing methods usually suffer from soft clustering, where the probabilities to different groups can be very close. In this paper, we propose an `1-norm symmetric nonnegative matrix tri-factorization method to solve the HOCC problem. Due to the orthogonal constraints and the symmetric `1-norm formulation in our new objective, conventional auxiliary function approach no longer works. Thus we derive the solution algorithm using the alternating direction method of multipliers. Extensive experiments have been conducted on a real world data set, in which promising empirical results, including less time consumption, strictly orthogonal membership matrix, lower local minima etc., have demonstrated the effectiveness of our proposed method.

Cite

CITATION STYLE

APA

Liu, K., & Wang, H. (2018). High-order co-clustering via strictly orthogonal and symmetric `1-norm nonnegative matrix tri-factorization. In IJCAI International Joint Conference on Artificial Intelligence (Vol. 2018-July, pp. 2454–2460). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2018/340

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free