title: Tree preserving embedding.
abstract: The goal of dimensionality reduction is to embed high-dimensional data in a low-dimensional space while preserving structure in the data relevant to exploratory data analysis such as clusters. However, existing dimensionality reduction methods often either fail to separate clusters due to the crowding problem or can only separate clusters at a single resolution. We develop a new approach to dimensionality reduction: tree preserving embedding. Our approach uses the topological notion of connectedness to separate clusters at all resolutions. We provide a formal guarantee of cluster separation for our approach that holds for finite samples. Our approach requires no parameters and can handle general types of data, making it easy to use in practice and suggesting new strategies for robust data visualization.
authors.affiliation: Department of Statistics, Harvard University, Cambridge, MA 02138, USA.
authors.forename: Albert D
authors.initials: AD
authors.lastname: Shieh
authors.forename: Tatsunori B
authors.initials: TB
authors.lastname: Hashimoto
authors.forename: Edoardo M
authors.initials: EM
authors.lastname: Airoldi
mesh_terms: D000465:Algorithms; D016000:Cluster Analysis; D003627:Data Interpretation, Statistical; D006236:Handwriting; D015233:Models, Statistical; D011825:Radar; D020539:Sequence Analysis, Protein / Q000706:statistics & numerical data