Heterogeneous co–transfer spectral clustering

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

With the rapid growth of data collection techniques, it is very common that instances in different domains/views share the same set of categories, or one instance is represented in different domains which is called co-occurrence data. For example, the multilingual learning scenario contains documents in different languages, the images in the social media website simultaneously have text descriptions, and etc. In this paper, we address the problem of automatically clustering the instances by making use of the multi-domain information. Especially, the information comes from heterogeneous domains, i.e., the feature spaces in different domains are different. A heterogeneous co-transfer spectral clustering framework is proposed with three main steps. One is to build the relationships across different domains with the aid of co-occurrence data. The next is to construct a joint graph which contains the inter-relationship across different domains and intra-relationship within each domain. The last is to simultaneously group the instances in all domains by applying spectral clustering on the joint graph. A series of experiments on real-world data sets have shown the good performance of the proposed method by comparing with the state-of-the-art methods.

Cite

CITATION STYLE

APA

Yang, L., Yang, L., Jing, L., & Yu, J. (2014). Heterogeneous co–transfer spectral clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8818, pp. 352–363). Springer Verlag. https://doi.org/10.1007/978-3-319-11740-9_33

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