Open AccessBook
Algorithms for clustering data
Anil K. Jain,Richard C. Dubes +1 more
Reads0
Chats0
About:
The article was published on 1988-01-01 and is currently open access. It has received 8586 citations till now. The article focuses on the topics: Cluster analysis & Correlation clustering.read more
Citations
More filters
Journal ArticleDOI
Clustering Web services to facilitate service discovery
TL;DR: This paper proposes a hybrid Web service tag recommendation strategy, named WSTRec, which employs tag co-occurrence, tag mining, and semantic relevance measurement for tag recommendation for tags recommendation.
Journal Article
Clustering approaches to identifying gene expression patterns from DNA microarray data
Jin Hwan Do,Dong-Kug Choi +1 more
TL;DR: The basic principles of clustering of DNA microarray data are surveyed, from crisp clustering algorithms such as hierarchical clustering, K-means and self-organizing maps, to complex clusteringgorithms like fuzzy clustering.
Journal ArticleDOI
Document clustering for electronic meetings: an experimental comparison of two techniques
Dmitri Roussinov,Hsinchun Chen +1 more
TL;DR: The implementation and comparison of two text clustering techniques based on Ward's clustering and Kohonen's Self-organizing Maps showed that both techniques have worked equally well in detecting associations between text documents.
Proceedings ArticleDOI
A Local Density Based Spatial Clustering Algorithm with Noise
TL;DR: A new clustering algorithm LDBSCAN relying on a local-density-based notion of clusters is proposed to solve problems of density-based clustering in spatial database and takes the advantage of the LOF to detect the noises.
Journal ArticleDOI
A survey of constrained classification
TL;DR: The paper provides a survey of work in constrained classification, in which constraints restrict the set of allowable solutions, and ways of assessing the results of a constrained classification study are surveyed.
References
More filters
Journal ArticleDOI
Shortest connection networks and some generalizations
TL;DR: In this paper, the basic problem of interconnecting a given set of terminals with a shortest possible network of direct links is considered, and a set of simple and practical procedures are given for solving this problem both graphically and computationally.
Journal ArticleDOI
An examination of procedures for determining the number of clusters in a data set
TL;DR: A Monte Carlo evaluation of 30 procedures for determining the number of clusters was conducted on artificial data sets which contained either 2, 3, 4, or 5 distinct nonoverlapping clusters to provide a variety of clustering solutions.
Journal ArticleDOI
SLINK: An optimally efficient algorithm for the single-link cluster method
TL;DR: Sibson gives an O(n 2) algorithm for single-linkage clustering, and proves that this algorithm achieves the theoretically optimal lower time bound for obtaining a single- linkage dendrogram.