scispace - formally typeset
Topic

Correlation clustering

About: Correlation clustering is a(n) research topic. Over the lifetime, 19362 publication(s) have been published within this topic receiving 602579 citation(s).

...read more

Papers
More filters

Proceedings Article
02 Aug 1996-
Abstract: Clustering algorithms are attractive for the task of class identification in spatial databases. However, the application to large spatial databases rises the following requirements for clustering algorithms: minimal requirements of domain knowledge to determine the input parameters, discovery of clusters with arbitrary shape and good efficiency on large databases. The well-known clustering algorithms offer no solution to the combination of these requirements. In this paper, we present the new clustering algorithm DBSCAN relying on a density-based notion of clusters which is designed to discover clusters of arbitrary shape. DBSCAN requires only one input parameter and supports the user in determining an appropriate value for it. We performed an experimental evaluation of the effectiveness and efficiency of DBSCAN using synthetic data and real data of the SEQUOIA 2000 benchmark. The results of our experiments demonstrate that (1) DBSCAN is significantly more effective in discovering clusters of arbitrary shape than the well-known algorithm CLAR-ANS, and that (2) DBSCAN outperforms CLARANS by a factor of more than 100 in terms of efficiency.

...read more

14,552 citations


Journal ArticleDOI
Anil K. Jain1, M. N. Murty2, Patrick J. Flynn3Institutions (3)
TL;DR: An overview of pattern clustering methods from a statistical pattern recognition perspective is presented, with a goal of providing useful advice and references to fundamental concepts accessible to the broad community of clustering practitioners.

...read more

Abstract: Clustering is the unsupervised classification of patterns (observations, data items, or feature vectors) into groups (clusters). The clustering problem has been addressed in many contexts and by researchers in many disciplines; this reflects its broad appeal and usefulness as one of the steps in exploratory data analysis. However, clustering is a difficult problem combinatorially, and differences in assumptions and contexts in different communities has made the transfer of useful generic concepts and methodologies slow to occur. This paper presents an overview of pattern clustering methods from a statistical pattern recognition perspective, with a goal of providing useful advice and references to fundamental concepts accessible to the broad community of clustering practitioners. We present a taxonomy of clustering techniques, and identify cross-cutting themes and recent advances. We also describe some important applications of clustering algorithms such as image segmentation, object recognition, and information retrieval.

...read more

13,346 citations


Journal ArticleDOI
J. A. Hartigan1, M. A. Wong1Institutions (1)

9,656 citations


Book
Anil K. Jain1, Richard C. Dubes1Institutions (1)
01 Jan 1988-

8,580 citations


Proceedings Article
Andrew Y. Ng1, Michael I. Jordan1, Yair Weiss2Institutions (2)
03 Jan 2001-
TL;DR: A simple spectral clustering algorithm that can be implemented using a few lines of Matlab is presented, and tools from matrix perturbation theory are used to analyze the algorithm, and give conditions under which it can be expected to do well.

...read more

Abstract: Despite many empirical successes of spectral clustering methods— algorithms that cluster points using eigenvectors of matrices derived from the data—there are several unresolved issues. First. there are a wide variety of algorithms that use the eigenvectors in slightly different ways. Second, many of these algorithms have no proof that they will actually compute a reasonable clustering. In this paper, we present a simple spectral clustering algorithm that can be implemented using a few lines of Matlab. Using tools from matrix perturbation theory, we analyze the algorithm, and give conditions under which it can be expected to do well. We also show surprisingly good experimental results on a number of challenging clustering problems.

...read more

8,315 citations


Network Information
Related Topics (5)
Fuzzy clustering

23.2K papers, 601.2K citations

95% related
CURE data clustering algorithm

13.7K papers, 461.2K citations

94% related
Constrained clustering

5.3K papers, 213.2K citations

94% related
Single-linkage clustering

6.3K papers, 261.6K citations

94% related
Canopy clustering algorithm

12K papers, 339.4K citations

93% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202135
202037
201979
2018180
20171,008
20161,422

Top Attributes

Show by:

Topic's top 5 most impactful authors

Sanghamitra Bandyopadhyay

48 papers, 5K citations

Licheng Jiao

42 papers, 776 citations

Sadaaki Miyamoto

41 papers, 239 citations

Thomas Seidl

36 papers, 1.2K citations

Sriparna Saha

36 papers, 810 citations