Mining Hierarchies of Correlation Clusters

@article{Achtert2006MiningHO,
  title={Mining Hierarchies of Correlation Clusters},
  author={Elke Achtert and C. B{\"o}hm and Peer Kr{\"o}ger and Arthur Zimek},
  journal={18th International Conference on Scientific and Statistical Database Management (SSDBM'06)},
  year={2006},
  pages={119-128}
}
  • Elke Achtert, C. Böhm, +1 author A. Zimek
  • Published 2006
  • Computer Science
  • 18th International Conference on Scientific and Statistical Database Management (SSDBM'06)
The detection of correlations between different features in high dimensional data sets is a very important data mining task. These correlations can be arbitrarily complex: one or more features might be correlated with several other features, and both noise features as well as the actual dependencies may be different for different clusters. Therefore, each cluster contains points that are located on a common hyperplane of arbitrary dimensionality in the data space and thus generates a separate… Expand
On Exploring Complex Relationships of Correlation Clusters
TLDR
The algorithm ERiC is proposed, which finds more information than state-of-the-art correlation clustering methods and outperforms existing competitors in terms of efficiency and to visualize the result by means of a graph-based representation. Expand
Subspace clustering for complex data
TLDR
This work introduces novel methods for effective subspace clustering on various types of complex data: vector data, imperfect data, and graph data and proposes models whose solutions contain only non-redundant and, thus, valuable clusters. Expand
Finding the Optimal Subspace for Clustering
TLDR
This paper develops the mathematical foundation ORT (Optimal Rigid Transform) to determine an arbitrarily-oriented subspace, suitable for a given cluster structure, and proposes FOSSCLU (Finding the Optimal Sub Space for Clustering), a new iterative clustering algorithm. Expand
Hierarchical Subspace Clustering
It is well-known that traditional clustering methods considering all dimensions of the feature space usually fail in terms of efficiency and effectivity when applied to high-dimensional data. ThisExpand
Hierarchical Subspace Clustering
TLDR
The goal of this dissertation is to develop new efficient and effective methods for hierarchical subspace clustering by identifying novel challenges for the hierarchical approach and proposing innovative and solid solutions for these challenges. Expand
Local graph based correlation clustering
TLDR
Local Graph Based Correlation Clustering (LGBACC) is an efficient and scalable approach that produces high-quality clusters in high-dimensional and large data spaces and uses graph models to visualize the results. Expand
Multi-purpose exploratory mining of complex data
TLDR
Several new algorithms combining different data mining tasks for complex data with various data types and data structures to discover the novel knowledge hidden behind the complex data are proposed. Expand
SONAR: Signal De-mixing for Robust Correlation Clustering
TLDR
Outlier-robust detection of correlation clusters of various density and subspace orientation, requiring no difficult input parameters, and scalability to large data sets are demonstrated. Expand
KLNCC: A new nonlinear correlation clustering algorithm based on KL-divergence
TLDR
KLNCC, a novel nonlinear correlation clustering algorithm which adopts a dynamic two-phase approach and adopts the KL-divergence as the distance between two microclusters when using the EM clustering algorithms to find the microcl clusters. Expand
Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering
TLDR
This survey tries to clarify the different problem definitions related to subspace clustering in general; the specific difficulties encountered in this field of research; the varying assumptions, heuristics, and intuitions forming the basis of different approaches; and how several prominent solutions tackle different problems. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 21 REFERENCES
Computing Clusters of Correlation Connected objects
TLDR
This paper proposes a method called 4C (Computing Correlation Connected Clusters), based on a combination of PCA and density-based clustering, to identify local subgroups of the data objects sharing a uniform but arbitrarily complex correlation. Expand
Density-Connected Subspace Clustering for High-Dimensional Data
TLDR
SUBCLU (density-connected Subspace Clustering), an effective and efficient approach to the subspace clustering problem, based on a formal clustering notion using the concept of density-connectivity underlying the algorithm DBSCAN [EKSX96]. Expand
CURLER: finding and visualizing nonlinear correlation clusters
TLDR
An algorithm for finding and visualizing nonlinear correlation clusters in the subspace of high-dimensional databases using a novel concept called co-sharing level which captures both spatial proximity and cluster orientation when judging similarity between clusters. Expand
OP-cluster: clustering by tendency in high dimensional space
  • Jinze Liu, W. Wang
  • Mathematics, Computer Science
  • Third IEEE International Conference on Data Mining
  • 2003
TLDR
A flexible yet powerful clustering model, namely OP-cluster (Order Preserving Cluster), which is essential in revealing significant gene regulatory networks and its effectiveness and efficiency in detecting coregulated patterns is demonstrated. Expand
Fast algorithms for projected clustering
TLDR
An algorithmic framework for solving the projected clustering problem, in which the subsets of dimensions selected are specific to the clusters themselves, is developed and tested. Expand
Finding generalized projected clusters in high dimensional spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimensional data, even theExpand
Finding Generalized Projected Clusters In High Dimensional Spaces
TLDR
Very general techniques for projected clustering are discussed which are able to construct clusters in arbitrarily aligned subspaces of lower dimensionality, which is substantially more general and realistic than currently available techniques. Expand
Clustering by pattern similarity in large data sets
TLDR
This paper introduces an effective algorithm to detect clusters of genes that are essential in revealing significant connections in gene regulatory networks, and performs tests on several real and synthetic data sets to show its effectiveness. Expand
OPTICS: ordering points to identify the clustering structure
TLDR
A new algorithm is introduced for the purpose of cluster analysis which does not produce a clustering of a data set explicitly; but instead creates an augmented ordering of the database representing its density-based clustering structure. Expand
Automatic subspace clustering of high dimensional data for data mining applications
TLDR
CLIQUE is presented, a clustering algorithm that satisfies each of these requirements of data mining applications including the ability to find clusters embedded in subspaces of high dimensional data, scalability, end-user comprehensibility of the results, non-presumption of any canonical data distribution, and insensitivity to the order of input records. Expand
...
1
2
3
...