CRAFT : ClusteR-specific Assorted Feature selecTion

Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016. === Cataloged from PDF version of thesis. === Includes bibliographical references (pages 45-46). === In this thesis, we present a hierarchical Bayesian framework for clustering with...

Full description

Bibliographic Details
Main Author: Garg, Vikas, Ph. D. (Vikas Kamur). Massachusetts Institute of Technology
Other Authors: Tommi S. Jaakkola and Cynthia Rudin.
Format: Others
Language:English
Published: Massachusetts Institute of Technology 2016
Subjects:
Online Access:http://hdl.handle.net/1721.1/105697
id ndltd-MIT-oai-dspace.mit.edu-1721.1-105697
record_format oai_dc
spelling ndltd-MIT-oai-dspace.mit.edu-1721.1-1056972020-12-03T05:11:46Z CRAFT : ClusteR-specific Assorted Feature selecTion ClusteR-specific Assorted Feature selecTion Garg, Vikas, Ph. D. (Vikas Kamur). Massachusetts Institute of Technology Tommi S. Jaakkola and Cynthia Rudin. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Electrical Engineering and Computer Science. Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016. Cataloged from PDF version of thesis. Includes bibliographical references (pages 45-46). In this thesis, we present a hierarchical Bayesian framework for clustering with cluster-specific feature selection. We derive a simplified model, CRAFT, by analyzing the asymptotic behavior of the log posterior formulations in a nonparametric MAP-based clustering setting in this framework. The model handles assorted data, i.e., both numeric and categorical data, and the underlying objective functions are intuitively appealing. The resulting algorithm is simple to implement and scales nicely, requires minimal parameter tuning, obviates the need to specify the number of clusters a priori, and compares favorably with other state-of-the-art methods on several datasets. We provide empirical evidence on carefully designed synthetic data sets to highlight the robustness of the algorithm to recover the underlying feature subspaces, even when the average dimensionality of the features across clusters is misspecified. Besides, the framework seamlessly allows for multiple views of clustering by interpolating between the two extremes of cluster-specific feature selection and global selection, and recovers the DP-means objective [14] under the degenerate setting of clustering without feature selection. by Vikas Garg. S.M. 2016-12-05T19:58:28Z 2016-12-05T19:58:28Z 2016 2016 Thesis http://hdl.handle.net/1721.1/105697 964524600 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 46 pages application/pdf Massachusetts Institute of Technology
collection NDLTD
language English
format Others
sources NDLTD
topic Electrical Engineering and Computer Science.
spellingShingle Electrical Engineering and Computer Science.
Garg, Vikas, Ph. D. (Vikas Kamur). Massachusetts Institute of Technology
CRAFT : ClusteR-specific Assorted Feature selecTion
description Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016. === Cataloged from PDF version of thesis. === Includes bibliographical references (pages 45-46). === In this thesis, we present a hierarchical Bayesian framework for clustering with cluster-specific feature selection. We derive a simplified model, CRAFT, by analyzing the asymptotic behavior of the log posterior formulations in a nonparametric MAP-based clustering setting in this framework. The model handles assorted data, i.e., both numeric and categorical data, and the underlying objective functions are intuitively appealing. The resulting algorithm is simple to implement and scales nicely, requires minimal parameter tuning, obviates the need to specify the number of clusters a priori, and compares favorably with other state-of-the-art methods on several datasets. We provide empirical evidence on carefully designed synthetic data sets to highlight the robustness of the algorithm to recover the underlying feature subspaces, even when the average dimensionality of the features across clusters is misspecified. Besides, the framework seamlessly allows for multiple views of clustering by interpolating between the two extremes of cluster-specific feature selection and global selection, and recovers the DP-means objective [14] under the degenerate setting of clustering without feature selection. === by Vikas Garg. === S.M.
author2 Tommi S. Jaakkola and Cynthia Rudin.
author_facet Tommi S. Jaakkola and Cynthia Rudin.
Garg, Vikas, Ph. D. (Vikas Kamur). Massachusetts Institute of Technology
author Garg, Vikas, Ph. D. (Vikas Kamur). Massachusetts Institute of Technology
author_sort Garg, Vikas, Ph. D. (Vikas Kamur). Massachusetts Institute of Technology
title CRAFT : ClusteR-specific Assorted Feature selecTion
title_short CRAFT : ClusteR-specific Assorted Feature selecTion
title_full CRAFT : ClusteR-specific Assorted Feature selecTion
title_fullStr CRAFT : ClusteR-specific Assorted Feature selecTion
title_full_unstemmed CRAFT : ClusteR-specific Assorted Feature selecTion
title_sort craft : cluster-specific assorted feature selection
publisher Massachusetts Institute of Technology
publishDate 2016
url http://hdl.handle.net/1721.1/105697
work_keys_str_mv AT gargvikasphdvikaskamurmassachusettsinstituteoftechnology craftclusterspecificassortedfeatureselection
AT gargvikasphdvikaskamurmassachusettsinstituteoftechnology clusterspecificassortedfeatureselection
_version_ 1719367981651197952