Supervised Clustering via an Implicit Network for High-Dimensional Data

• Activity Number: 170 - Theory and Methods for High-Dimensional Data
• Type: Contributed
• Date/Time: Monday, July 30, 2018 : 10:30 AM to 12:20 PM
• Sponsor: IMS
• Author(s): Brandon Park* and Anand N Vidyashankar and Tucker S McElroy
• Companies: and George Mason University and U.S. Census Bureau
• Keywords: Supervised clustering; Implicit Network; Network-wide metrics; High dimension

Abstract

In high dimensional data analysis, where the number of parameters exceeds the sample size, it is critical to identify features that are associated with the response variable. It is often important to detect groups of features, referred to as clusters, which have similar effects on the response variable. This allows one to provide summarized information about the clusters. In this presentation, we introduce a network-based approach for a high dimensional data analysis. We describe a new method for constructing an implicit network and provide a new supervised clustering algorithm based on network-wide metrics. We study the properties of the network-wide metrics and establish theoretical guarantees for the consistency of the supervised clustering algorithm in a high dimensional setting. In addition, simulation studies and the application to real data represent the performance of our supervised clustering algorithm.