Cure: An efficient clustering algorithm for large databases
From MaRDI portal
Publication:1860260
DOI10.1016/S0306-4379(01)00008-4zbMath1006.68661OpenAlexW1996510517WikidataQ127472190 ScholiaQ127472190MaRDI QIDQ1860260
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
Publication date: 20 February 2003
Published in: Information Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0306-4379(01)00008-4
Related Items
TOBAE: a density-based agglomerative clustering algorithm, An incremental algorithm of text clustering based on semantic sequences, Unsupervised learning of arbitrarily shaped clusters using ensembles of Gaussian models, An efficient enhanced \(k\)-means clustering algorithm, A clustering algorithm based on maximal \(\varTheta\)-distant subtrees, Approximate kernel competitive learning, A Clustered Gaussian Process Model for Computer Experiments, Adaptive density-based clustering algorithm with shared KNN conflict game, Determining the number of clusters using information entropy for mixed data, GrDBSCAN: a granular density-based clustering algorithm, A fair-multicluster approach to clustering of categorical data, Clustering categorical data: soft rounding \(k\)-modes, Improvement of the fast clustering algorithm improved by \(K\)-means in the big data, Hierarchical data organization, clustering and denoising via localized diffusion folders, Research and application of cluster and association analysis in geochemical data processing, Clustering of the self-organizing map using a clustering validity index based on inter-cluster and intra-cluster density., Information theoretic hierarchical clustering, A SCALABLE CLUSTERING METHOD FOR CATEGORICAL SEQUENCE DATA, GoSCAN: decentralized scalable data clustering, An enhanced self-organizing incremental neural network for online unsupervised learning, Improving CLOPE's profit value and stability with an optimized agglomerative approach, The fast clustering algorithm for the big data based on K-means, Energy-based function to evaluate data stream clustering, Genetic algorithm based framework for mining fuzzy association rules, ICLUS: A robust and scalable clustering model for time series via independent component analysis, Approaches for scaling DBSCAN algorithm to large spatial databases, QCC: a novel clustering algorithm based on quasi-cluster centers, Robustness of density-based clustering methods with various neighborhood relations, Elastic translation invariant matching of trajectories, A hybrid novelty score and its use in keystroke dynamics-based user authentication, Cluster-based outlier detection, Chameleon based on clustering feature tree and its application in customer segmentation, Unnamed Item, Statistical Perspectives on “Big Data”, TASC: two-attribute-set clustering through decision tree construction, Multidisciplinary pattern recognition applications: a review, Clustering: a neural network approach, Enhancing principal direction divisive clustering, Speeding up the large-scale consensus fuzzy clustering for handling big data, Local and global approaches of affinity propagation clustering for large scale data, A multi-prototype clustering algorithm, Extending fuzzy and probabilistic clustering to very large data sets, A distance-relatedness dynamic model for clustering high dimensional data of arbitrary shapes and densities, Constrained overlapping clusters: minimizing the negative effects of bridge‐nodes, A framework for clustering massive graph streams, Classification of large data sets with mixture models via sufficient EM, PFHC: A clustering algorithm based on data partitioning for unevenly distributed datasets, A graph b-coloring framework for data clustering, Clustering of time series data -- a survey, A tandem clustering process for multimodal datasets, Squeezer: An efficient algorithm for clustering categorical data., Robust Hierarchical Clustering for Directed Networks: An Axiomatic Approach, A new fuzzy clustering algorithm based on multi-objective mathematical programming, Analyzing XpLoRe download profiles with Intelligent Miner, Approximate \(k\)-closest-pairs in large high-dimensional data sets
