Sciweavers

89 search results - page 2 / 18
» A Fast Algorithm for Finding Correlation Clusters in Noise D...
Sort
View
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
14 years 5 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
SSDBM
2006
IEEE
123views Database» more  SSDBM 2006»
13 years 11 months ago
Mining Hierarchies of Correlation Clusters
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...
Elke Achtert, Christian Böhm, Peer Kröge...
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 5 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
APWEB
2006
Springer
13 years 9 months ago
Generalized Projected Clustering in High-Dimensional Data Streams
Clustering is to identify densely populated subgroups in data, while correlation analysis is to find the dependency between the attributes of the data set. In this paper, we combin...
Ting Wang
ACCV
2009
Springer
13 years 12 months ago
Evolving Mean Shift with Adaptive Bandwidth: A Fast and Noise Robust Approach
Abstract. This paper presents a novel nonparametric clustering algorithm called evolving mean shift (EMS) algorithm. The algorithm iteratively shrinks a dataset and generates well ...
Qi Zhao, Zhi Yang, Hai Tao, Wentai Liu