Bilateral K - Means algorithm for fast co-clustering

32Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.

Abstract

With the development of the information technology, the amount of data, e.g. text, image and video, has been increased rapidly. Efficiently clustering those large scale data sets is a challenge. To address this problem, this paper proposes a novel co-clustering method named bilateral k-means algorithm (BKM) for fast co-clustering. Different from traditional k-means algorithms, the proposed method has two indicator matrices P and Q and a diagonal matrix S to be solved, which represent the cluster memberships of samples and features, and the co-cluster centres, respectively. Therefore, it could implement different clustering tasks on the samples and features simultaneously. We also introduce an effective approach to solve the proposed method, which involves less multiplication. The computational complexity is analyzed. Extensive experiments on various types of data sets are conducted. Compared with the state-of-the-art clustering methods, the proposed BKM not only has faster computational speed, but also achieves promising clustering results.

Cite

CITATION STYLE

APA

Han, J., Song, K., Nie, F., & Li, X. (2017). Bilateral K - Means algorithm for fast co-clustering. In 31st AAAI Conference on Artificial Intelligence, AAAI 2017 (pp. 1969–1975). AAAI press. https://doi.org/10.1609/aaai.v31i1.10860

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