Parameter-Free Hierarchical Co-Clustering by n-Ary Splits
published: Oct. 20, 2009, recorded: September 2009, views: 3705
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Clustering high-dimensional data is challenging. Classic metrics fail in identifying real similarities between objects. Moreover, the huge number of features makes the cluster interpretation hard. To tackle these problems, several co-clustering approaches have been proposed which try to compute a partition of objects and a partition of features simultaneously. Unfortunately, these approaches identify only a predefined number of flat co-clusters. Instead, it is useful if the clusters are arranged in a hierarchical fashion because the hierarchy provides insides on the clusters.In this paper we propose a novel hierarchical co-clustering, which builds two coupled hierarchies, one on the objects and one on features thus providing insights on both them. Our approach does not require a pre-specified number of clusters, and produces compact hierarchies because it makes ro-ary splits, where ro is automatically determined. We validate our approach on several high-dimensional datasets with state of the art competitors.
Download slides: ecmlpkdd09_ienco_pfhccas_01.pdf (652.0 KB)
Download slides: ecmlpkdd09_ienco_pfhccas_01.pptx (660.2 KB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !