• AS 136

  • Referenced in 278 articles [sw14176]
  • Algorithm AS 136: A K-Means Clustering Algorithm...
  • PRISM

  • Referenced in 416 articles [sw01186]
  • systems, including randomized distributed algorithms, manufacturing systems and workstation clusters...
  • ROCK

  • Referenced in 68 articles [sw37720]
  • ROCK: a robust clustering algorithm for categorical attributes. Clustering, in data mining, is useful ... distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based ... partitions. In this paper, we study clustering algorithms for data with boolean and categorical attributes ... show that traditional clustering algorithms that use distances between points for clustering are not appropriate...
  • SIFT

  • Referenced in 606 articles [sw16554]
  • fast nearest-neighbor algorithm, followed by a Hough transform to identify clusters belonging...
  • APCluster

  • Referenced in 106 articles [sw11002]
  • Affinity propagation (AP) is a clustering algorithm that has been introduced by Brendan J. Frey ... follows: ”An algorithm that identifies exemplars among data points and forms clusters of data points ... until a good set of exemplars and clusters emerges.” AP has been applied in various ... important. Frey and Dueck have made their algorithm available as Matlab code. Matlab, however...
  • mclust

  • Referenced in 260 articles [sw00563]
  • Mixture Modeling fitted via EM algorithm for Model-Based Clustering, Classification, and Density Estimation, including...
  • apcluster

  • Referenced in 107 articles [sw11001]
  • Dueck’s Affinity Propagation clustering in R. The algorithms are largely analogous to the Matlab ... affinity propagation and an algorithm for exemplar-based agglomerative clustering that can also be used...
  • SuLQ

  • Referenced in 122 articles [sw11355]
  • principal component analysis, k means clustering, the Perceptron Algorithm, the ID3 algorithm, and (apparently...
  • MOCK

  • Referenced in 42 articles [sw04156]
  • idea by describing an advanced multiobjective clustering algorithm, MOCK, with the capacity to identify good ... determine the number of clusters in a data set. The algorithm has been subject ... which explain its superiority to single-objective clustering techniques, and we analyse how MOCK ... single-objective algorithms run with a range of different numbers of clusters specified...
  • MCODE

  • Referenced in 47 articles [sw35748]
  • paper describes a novel graph theoretic clustering algorithm, ”Molecular Complex Detection” (MCODE), that detects densely ... given parameters. The algorithm has the advantage over other graph clustering methods of having ... network and allows examination of cluster interconnectivity, which is relevant for protein networks. Protein interaction ... which correspond to known protein complexes. The algorithm is not affected by a known high...
  • COSA

  • Referenced in 47 articles [sw22936]
  • conjunction with conventional distance-based clustering algorithms this procedure encourages those algorithms to detect automatically...
  • OSCAR

  • Referenced in 47 articles [sw03026]
  • method, called OSCAR (octagonal shrinkage and clustering algorithm for regression), is proposed to simultaneously select...
  • PARDISO

  • Referenced in 270 articles [sw00679]
  • SMPs and Cluster of SMPs. Automatic combination of iterative and direct solver algorithms to accelerate...
  • COOLCAT

  • Referenced in 28 articles [sw37383]
  • COOLCAT: an entropy-based algorithm for categorical clustering. In this paper we explore the connection ... incremental heuristic algorithm, COOLCAT, which is capable of efficiently clustering large data sets of records ... streams. In contrast with other categorical clustering algorithms published in the past, COOLCAT’s clustering ... since it is an incremental algorithm capable of clustering new points without having to look...
  • MixSim

  • Referenced in 33 articles [sw07914]
  • Simulating Data to Study Performance of Clustering Algorithms. MixSim allows simulating mixtures of Gaussian distributions ... readily employed to control the clustering complexity of datasets simulated from mixtures. These datasets ... systematic performance investigation of clustering and finite mixture modeling algorithms. Among other capabilities of MixSim...
  • ROOT

  • Referenced in 51 articles [sw06817]
  • analysis (multi-dimensional histogramming, fitting, minimization, cluster finding algorithms) and visualization tools. The user interacts...
  • PASCAL VOC

  • Referenced in 120 articles [sw36507]
  • whether differences in the performance of two algorithms are significant or not; a normalised average ... positive instances; a clustering method for visualising the performance across multiple algorithms so that...
  • k-means++

  • Referenced in 126 articles [sw21622]
  • squared distance between points in the same cluster. Although it offers no accuracy guarantees ... obtain an algorithm that is Θ(logk)-competitive with the optimal clustering. Preliminary experiments show...
  • flexclust

  • Referenced in 27 articles [sw04583]
  • flexclust: Flexible Cluster Algorithms , The main function kcca implements a general framework for k-centroids...
  • BicAT

  • Referenced in 16 articles [sw12371]
  • provides five biclustering and two standard clustering algorithms. BicAT works on Windows, Solaris, Linux ... interface for several existing biclustering and clustering algorithms. The main purpose of the tool...