Correlation clustering methodologies and their fundamental results

No abstract is available for this paper.

• Publication year

  2018

• Venue

  Expert Syst. J. Knowl. Eng.

• Publication date

  2018-02-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1111/exsy.12229
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Computers And Intractability A Guide To The Theory Of Np Completeness

  2016influential reference
• Correlation clustering: from theory to practice

  2014influential reference
• Survey on distance metric learning and dimensionality reduction in data mining

  2014cited by this paper
• Correlation clustering in MapReduce

  2014cited by this paper
• Recent Advances in Graph Partitioning

  2013cited by this paper
• Characterizing data analysis workloads in data centers

  2013cited by this paper
• Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality

  2012cited by this paper
• Clustering Sparse Graphs

  2012cited by this paper
• A Correlation Clustering Approach to Link Classification in Signed Networks

  2012cited by this paper
• Overlapping correlation clustering

  2011cited by this paper
• Correlation clustering with noisy input

  2010cited by this paper
• Hierarchical document clustering using local patterns

  2010cited by this paper
• Large-Scale Deduplication with Constraints Using Dedupalog

  2009cited by this paper
• Bounding and Comparing Methods for Correlation Clustering Beyond ILP

  2009cited by this paper
• Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems

  2009cited by this paper
• A survey of Web clustering engines

  2009cited by this paper
• Framework for Evaluating Clustering Algorithms in Duplicate Detection

  2009cited by this paper
• Generating labels from clicks

  2009cited by this paper
• Expander flows, geometric embeddings and graph partitioning

  2009cited by this paper
• Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering

  2009cited by this paper
• Harmony K-means algorithm for document clustering

  2009cited by this paper
• A graph-theoretic approach to webpage segmentation

  2008cited by this paper
• The Development of Social Network Analysis: A Study in the Sociology of Science

  2008cited by this paper
• Web People Search via Connection Analysis

  2008cited by this paper
• Playing Random and Expanding Unique Games

  2007cited by this paper
• Recent Developments in Document Clustering

  2007cited by this paper
• Deterministic pivoting algorithms for constrained ranking and clustering problems

  2007cited by this paper
• A bound on the label complexity of agnostic active learning

  2007cited by this paper
• Noisy sorting without resampling

  2007cited by this paper
• Duplicate Record Detection: A Survey

  2007cited by this paper
• Correlation clustering in general weighted graphs

  2006influential reference
• Algorithms, Theory

  2006cited by this paper
• Finding near-duplicate web pages: a large-scale evaluation of algorithms

  2006cited by this paper
• Correlation clustering with a fixed number of clusters

  2005cited by this paper
• Supervised clustering with support vector machines

  2005cited by this paper
• Survey of clustering algorithms

  2005cited by this paper
• The Development of Social Network Analysis: A Study in the Sociology of Science, Linton C. Freeman. Empirical Press, Vancouver, BC (2004)

  2005cited by this paper
• Clustering aggregation

  2005cited by this paper
• Locality-sensitive hashing scheme based on p-stable distributions

  2004cited by this paper
• Toward efficient agnostic learning

  2004cited by this paper
• Subspace clustering for high dimensional data: a review

  2004cited by this paper
• Maximizing quadratic programs: extending Grothendieck's inequality

  2004cited by this paper
• Clustering with qualitative information

  2003cited by this paper
• Efficient location area planning for personal communication systems

  2003cited by this paper
• Toward Conditional Models of Identity Uncertainty with Application to Proper Noun Coreference

  2003cited by this paper
• Approximation schemes for clustering problems

  2003cited by this paper
• Cluster graph modification problems

  2002cited by this paper
• From Instance-level Constraints to Space-Level Constraints: Making the Most of Prior Knowledge in Data Clustering

  2002cited by this paper
• Correlation Clustering

  2002influential reference
• Improved algorithms for the random cluster graph model

  2002cited by this paper
• An Efficient k-Means Clustering Algorithm: Analysis and Implementation

  2002cited by this paper
• Spectral partitioning of random graphs

  2001cited by this paper
• Agnostic Boosting

  2001cited by this paper
• Constrained K-means Clustering with Background Knowledge

  2001cited by this paper
• A min-max cut algorithm for graph partitioning and data clustering

  2001cited by this paper
• On the 'Dimensionality Curse' and the 'Self-Similarity Blessing'

  2001cited by this paper
• Deflating the dimensionality curse using multiple fractal dimensions

  2000cited by this paper
• A Comparison of Document Clustering Techniques

  2000cited by this paper
• Clustering for edge-cost minimization (extended abstract)

  2000cited by this paper
• Mobility modeling of rush hour traffic for location area design in cellular networks

  2000cited by this paper
• Noise-tolerant learning, the parity problem, and the statistical query model

  2000cited by this paper
• Finding and certifying a large hidden clique in a semirandom graph

  2000cited by this paper
• Clustering with Instance-Level Constraints

  2000cited by this paper
• Web mining research: a survey

  2000cited by this paper
• Data clustering: a review

  1999cited by this paper
• Algorithms for graph partitioning on the planted partition model

  1999cited by this paper
• Clustering Gene Expression Patterns

  1999cited by this paper
• Rounding algorithms for a geometric embedding of minimum multiway cut

  1999cited by this paper
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

  1999cited by this paper
• When Is ''Nearest Neighbor'' Meaningful?

  1999cited by this paper
• How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis

  1998cited by this paper
• Efficient noise-tolerant learning from statistical queries

  1998cited by this paper
• An improved approximation algorithm for multiway cut

  1998cited by this paper
• Clustering for Mining in Large Spatial Databases

  1998cited by this paper
• Finding a large hidden clique in a random graph

  1998cited by this paper
• An Experimental Comparison of Several Clustering and Initialization Methods

  1998cited by this paper
• A randomized approximation scheme for metric MAX-CUT

  1998cited by this paper
• Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values

  1998cited by this paper
• Primal-dual approximation algorithms for integral flow and multicut in trees

  1997cited by this paper
• Property testing and its connection to learning and approximation

  1996cited by this paper
• Expected Complexity of Graph Partitioning Problems

  1995cited by this paper
• Estimating the Selectivity of Spatial Queries Using the 'Correlation' Fractal Dimension

  1995cited by this paper
• Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension

  1994cited by this paper
• The Complexity of Multiterminal Cuts

  1994cited by this paper
• Improved Bounds for the Max-Flow Min-Multicut Ratio for Planar and K_r, r-Free Graphs

  1993cited by this paper
• Excluded minors, network decomposition, and multicommodity flow

  1993cited by this paper
• Approximate max-flow min-(multi)cut theorems and their applications

  1993cited by this paper
• The complexity of multiway cuts (extended abstract)

  1992cited by this paper
• Large Cliques Elude the Metropolis Process

  1992cited by this paper
• Eigenvalues and graph bisection: An average-case analysis

  1987cited by this paper
• A unified approach to approximation algorithms for bottleneck problems

  1986cited by this paper
• Eigenvalues, geometric expanders, sorting in rounds, and ramsey theory

  1986cited by this paper
• A Survey of Recent Advances in Hierarchical Clustering Algorithms

  1983cited by this paper
• The eigenvalues of random symmetric matrices

  1981cited by this paper
• Some methods for classification and analysis of multivariate observations

  1967cited by this paper
• Multi-Commodity Network Flows

  1963cited by this paper

• Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach

  2025cites this paper
• Approximation Algorithms for Graph Clustering Problems with Clusters of Bounded Size

  2024cites this paper
• A combinatorial multi-armed bandit approach to correlation clustering

  2023cites this paper
• A Literature Review on Correlation Clustering: Cross-disciplinary Taxonomy with Bibliometric Analysis

  2022influential citation
• Correlation Clustering with Global Weight Bounds

  2021cites this paper
• Multivariate Exploratory Data Analysis Using Component Models

  2021cites this paper
• In and Out: Optimizing Overall Interaction in Probabilistic Graphs under Clustering Constraints

  2020cites this paper
• Cuckoo and krill herd‐based k‐means++ hybrid algorithms for clustering

  2019cites this paper