Iterative deep subspace clustering

No Thumbnail Available
File version
Author(s)
Zhou, L
Wang, S
Bai, X
Zhou, J
Hancock, E
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)

Bai, X

Hancock, ER

Ho, TK

Wilson, RC

Biggio, B

RoblesKelly, A

Date
2018
Size
File type(s)
Location

Beijing, China

License
Abstract

Recently, deep learning has been widely used for subspace clustering problem due to the excellent feature extraction ability of deep neural network. Most of the existing methods are built upon the auto-encoder networks. In this paper, we propose an iterative framework for unsupervised deep subspace clustering. In our method, we first cluster the given data to update the subspace ids, and then update the representation parameters of a Convolutional Neural Network (CNN) with the clustering result. By iterating the two steps, we can obtain not only a good representation for the given data, but also more precise subspace clustering result. Experiments on both synthetic and real-world data show that our method outperforms the state-of-the-art on subspace clustering accuracy.

Journal Title
Conference Title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Book Title
Edition
Volume

11004 LNCS

Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Artificial intelligence

Persistent link to this record
Citation