Regularized ℓ1-Graph for data clustering

Yingzhen Yang, Zhangyang Wang, Jianchao Yang, Jiawei Han, Thomas S Huang

Research output: Contribution to conferencePaper

Abstract

1-Graph has been proven to be effective in data clustering, which partitions the data space by using the sparse representation of the data as the similarity measure. However, the sparse representation is performed for each datum independently without taking into account the geometric structure of the data. Motivated by ℓ1-Graph and manifold leaning, we propose Regularized ℓ1-Graph (Rℓ1-Graph) for data clustering. Compared to ℓ1-Graph, the sparse representations of Rℓ1-Graph are regularized by the geometric information of the data. In accordance with the manifold assumption, the sparse representations vary smoothly along the geodesics of the data manifold through the graph Laplacian constructed by the sparse codes. Experimental results on various data sets demonstrate the superiority of our algorithm compared to ℓ1-Graph and other competing clustering methods.

Original languageEnglish (US)
StatePublished - Jan 1 2014
Event25th British Machine Vision Conference, BMVC 2014 - Nottingham, United Kingdom
Duration: Sep 1 2014Sep 5 2014

Other

Other25th British Machine Vision Conference, BMVC 2014
CountryUnited Kingdom
CityNottingham
Period9/1/149/5/14

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition

Cite this

Yang, Y., Wang, Z., Yang, J., Han, J., & Huang, T. S. (2014). Regularized ℓ1-Graph for data clustering. Paper presented at 25th British Machine Vision Conference, BMVC 2014, Nottingham, United Kingdom.

Regularized ℓ1-Graph for data clustering. / Yang, Yingzhen; Wang, Zhangyang; Yang, Jianchao; Han, Jiawei; Huang, Thomas S.

2014. Paper presented at 25th British Machine Vision Conference, BMVC 2014, Nottingham, United Kingdom.

Research output: Contribution to conferencePaper

Yang, Y, Wang, Z, Yang, J, Han, J & Huang, TS 2014, 'Regularized ℓ1-Graph for data clustering' Paper presented at 25th British Machine Vision Conference, BMVC 2014, Nottingham, United Kingdom, 9/1/14 - 9/5/14, .
Yang Y, Wang Z, Yang J, Han J, Huang TS. Regularized ℓ1-Graph for data clustering. 2014. Paper presented at 25th British Machine Vision Conference, BMVC 2014, Nottingham, United Kingdom.
Yang, Yingzhen ; Wang, Zhangyang ; Yang, Jianchao ; Han, Jiawei ; Huang, Thomas S. / Regularized ℓ1-Graph for data clustering. Paper presented at 25th British Machine Vision Conference, BMVC 2014, Nottingham, United Kingdom.
@conference{2a249303c0d449b9a369d4d3186f0a5e,
title = "Regularized ℓ1-Graph for data clustering",
abstract = "ℓ1-Graph has been proven to be effective in data clustering, which partitions the data space by using the sparse representation of the data as the similarity measure. However, the sparse representation is performed for each datum independently without taking into account the geometric structure of the data. Motivated by ℓ1-Graph and manifold leaning, we propose Regularized ℓ1-Graph (Rℓ1-Graph) for data clustering. Compared to ℓ1-Graph, the sparse representations of Rℓ1-Graph are regularized by the geometric information of the data. In accordance with the manifold assumption, the sparse representations vary smoothly along the geodesics of the data manifold through the graph Laplacian constructed by the sparse codes. Experimental results on various data sets demonstrate the superiority of our algorithm compared to ℓ1-Graph and other competing clustering methods.",
author = "Yingzhen Yang and Zhangyang Wang and Jianchao Yang and Jiawei Han and Huang, {Thomas S}",
year = "2014",
month = "1",
day = "1",
language = "English (US)",
note = "25th British Machine Vision Conference, BMVC 2014 ; Conference date: 01-09-2014 Through 05-09-2014",

}

TY - CONF

T1 - Regularized ℓ1-Graph for data clustering

AU - Yang, Yingzhen

AU - Wang, Zhangyang

AU - Yang, Jianchao

AU - Han, Jiawei

AU - Huang, Thomas S

PY - 2014/1/1

Y1 - 2014/1/1

N2 - ℓ1-Graph has been proven to be effective in data clustering, which partitions the data space by using the sparse representation of the data as the similarity measure. However, the sparse representation is performed for each datum independently without taking into account the geometric structure of the data. Motivated by ℓ1-Graph and manifold leaning, we propose Regularized ℓ1-Graph (Rℓ1-Graph) for data clustering. Compared to ℓ1-Graph, the sparse representations of Rℓ1-Graph are regularized by the geometric information of the data. In accordance with the manifold assumption, the sparse representations vary smoothly along the geodesics of the data manifold through the graph Laplacian constructed by the sparse codes. Experimental results on various data sets demonstrate the superiority of our algorithm compared to ℓ1-Graph and other competing clustering methods.

AB - ℓ1-Graph has been proven to be effective in data clustering, which partitions the data space by using the sparse representation of the data as the similarity measure. However, the sparse representation is performed for each datum independently without taking into account the geometric structure of the data. Motivated by ℓ1-Graph and manifold leaning, we propose Regularized ℓ1-Graph (Rℓ1-Graph) for data clustering. Compared to ℓ1-Graph, the sparse representations of Rℓ1-Graph are regularized by the geometric information of the data. In accordance with the manifold assumption, the sparse representations vary smoothly along the geodesics of the data manifold through the graph Laplacian constructed by the sparse codes. Experimental results on various data sets demonstrate the superiority of our algorithm compared to ℓ1-Graph and other competing clustering methods.

UR - http://www.scopus.com/inward/record.url?scp=84919740268&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84919740268&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:84919740268

ER -