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
A fuzzy k-modes algorithm for clustering categorical data
Zhexue Huang,Michael K. Ng +1 more
TL;DR: A new approach is developed, which allows the use of the k-means paradigm to efficiently cluster large categorical data sets and a fuzzy k-modes algorithm is presented and the effectiveness of the algorithm is demonstrated with experimental results.
Journal Article
Query Clustering Using User Logs
TL;DR: A new query clustering method that makes use of user logs which allow us to identify the documents the users have selected for a query and shows that a combination of both keywords and user logs is better than using either method alone.
Journal ArticleDOI
Data mining for the Internet of Things: literature review and challenges
TL;DR: A systematic way to review data mining in knowledge view, technique view, and application view, including classification, clustering, association analysis, time series analysis and outlier analysis is given.
Proceedings Article
Hierarchical Document Clustering Using Frequent Itemsets
TL;DR: This paper proposes to use the notion of frequent itemsets, which comes from association rule mining, for document clustering, and shows that this method outperforms best existing methods in terms of both clustering accuracy and scalability.
Journal ArticleDOI
Clustering intrusion detection alarms to support root cause analysis
TL;DR: A novel alarm-clustering method is proposed that supports the human analyst in identifying root causes and shows that the alarm load decreases quite substantially if the identified root causes are eliminated so that they can no longer trigger alarms in the future.
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.