Discovering and Visualizing Hierarchy in the Data

  • Yang K
  • Wong W
  • 10


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


How to extract useful insights from data in a human perceivable manner is always a challenge when the dimension and amount of the data is large. Often, the data can be organized according to certain hierarchical structure that are stemmed either from data collection process or from the information and phenomena carried by the data itself. The current study attempts to discover and visualize these underlying hierarchies. Regarding each observation as a draw from a (hypothetical) multidimensional joint density, our first goal is to approximate this unknown density with a piecewise constant function over the binary partitioned sample space; our non-parametric approach makes no assumptions on the form of the density, such as assuming that it is Multivariate Gaussian, or that it is a mixture of a small number of Gaussians. Given the piecewise constant density function and its corresponding partitions of the sample space, our second goal is to construct a connected graph and build up a tree representation of the data from sub-level sets. To demonstrate that our method is a general data mining and visualization tool which can provide ``multi-resolution'' summaries and reveal different levels of information of the data, we apply it to two real data sets from different fields.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Kun Yang

  • Wing Hung Wong

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free