Multi-feature spectral clustering with minimax optimization

In this paper, we propose a novel formulation for multi-feature clustering using minimax optimization. To find a consensus clustering result that is agreeable to all feature modalities, our objective is to find a universal feature embedding, which not only fits each individual feature modality well,...

Full description

Saved in:
Bibliographic Details
Main Authors: Wang, Hongxing, Weng, Chaoqun, Yuan, Junsong
Other Authors: School of Electrical and Electronic Engineering
Format: Conference or Workshop Item
Language:English
Published: 2015
Subjects:
Online Access:https://hdl.handle.net/10356/103211
http://hdl.handle.net/10220/25753
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-103211
record_format dspace
spelling sg-ntu-dr.10356-1032112020-03-07T13:24:51Z Multi-feature spectral clustering with minimax optimization Wang, Hongxing Weng, Chaoqun Yuan, Junsong School of Electrical and Electronic Engineering 2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) DRNTU::Engineering::Computer science and engineering::Computing methodologies::Image processing and computer vision In this paper, we propose a novel formulation for multi-feature clustering using minimax optimization. To find a consensus clustering result that is agreeable to all feature modalities, our objective is to find a universal feature embedding, which not only fits each individual feature modality well, but also unifies different feature modalities by minimizing their pairwise disagreements. The loss function consists of both (1) unary embedding cost for each modality, and (2) pairwise disagreement cost for each pair of modalities, with weighting parameters automatically selected to maximize the loss. By performing minimax optimization, we can minimize the loss for the worst case with maximum disagreements, thus can better reconcile different feature modalities. To solve the minimax optimization, an iterative solution is proposed to update the universal embedding, individual embedding, and fusion weights, separately. Our minimax optimization has only one global parameter. The superior results on various multi-feature clustering tasks validate the effectiveness of our approach when compared with the state-of-the-art methods. Accepted version 2015-06-04T07:29:05Z 2019-12-06T21:07:33Z 2015-06-04T07:29:05Z 2019-12-06T21:07:33Z 2014 2014 Conference Paper Wong, H., Weng, C., & Yuan, J. (2014). Multi-feature spectral clustering with minimax optimization. Proceedings of 2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). https://hdl.handle.net/10356/103211 http://hdl.handle.net/10220/25753 10.1109/CVPR.2014.523 en © 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [http://dx.doi.org/10.1109/CVPR.2014.523]. 8 p. application/pdf
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic DRNTU::Engineering::Computer science and engineering::Computing methodologies::Image processing and computer vision
spellingShingle DRNTU::Engineering::Computer science and engineering::Computing methodologies::Image processing and computer vision
Wang, Hongxing
Weng, Chaoqun
Yuan, Junsong
Multi-feature spectral clustering with minimax optimization
description In this paper, we propose a novel formulation for multi-feature clustering using minimax optimization. To find a consensus clustering result that is agreeable to all feature modalities, our objective is to find a universal feature embedding, which not only fits each individual feature modality well, but also unifies different feature modalities by minimizing their pairwise disagreements. The loss function consists of both (1) unary embedding cost for each modality, and (2) pairwise disagreement cost for each pair of modalities, with weighting parameters automatically selected to maximize the loss. By performing minimax optimization, we can minimize the loss for the worst case with maximum disagreements, thus can better reconcile different feature modalities. To solve the minimax optimization, an iterative solution is proposed to update the universal embedding, individual embedding, and fusion weights, separately. Our minimax optimization has only one global parameter. The superior results on various multi-feature clustering tasks validate the effectiveness of our approach when compared with the state-of-the-art methods.
author2 School of Electrical and Electronic Engineering
author_facet School of Electrical and Electronic Engineering
Wang, Hongxing
Weng, Chaoqun
Yuan, Junsong
format Conference or Workshop Item
author Wang, Hongxing
Weng, Chaoqun
Yuan, Junsong
author_sort Wang, Hongxing
title Multi-feature spectral clustering with minimax optimization
title_short Multi-feature spectral clustering with minimax optimization
title_full Multi-feature spectral clustering with minimax optimization
title_fullStr Multi-feature spectral clustering with minimax optimization
title_full_unstemmed Multi-feature spectral clustering with minimax optimization
title_sort multi-feature spectral clustering with minimax optimization
publishDate 2015
url https://hdl.handle.net/10356/103211
http://hdl.handle.net/10220/25753
_version_ 1681043645451468800