Fast Gaussian Pairwise Constrained Spectral Clustering

No abstract is available for this paper.

• Publication year

  2014

• Venue

  ECML/PKDD

• Publication date

  2014-09-15

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-662-44848-9_16
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On comparing partitions

  2015influential reference
• CoNLL-2012 Shared Task: Modeling Multilingual Unrestricted Coreference in OntoNotes

  2012cited by this paper
• Constrained 1-Spectral Clustering

  2012cited by this paper
• On constrained spectral clustering and its applications

  2012influential reference
• Beyond Spectral Clustering - Tight Relaxations of Balanced Graph Cuts

  2011cited by this paper
• Stanford’s Multi-Pass Sieve Coreference Resolution System at the CoNLL-2011 Shared Task

  2011cited by this paper
• Constrained Spectral Clustering via Exhaustive and Efficient Constraint Propagation

  2010cited by this paper
• Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop, SSPR&SPR 2010, Cesme, Izmir, Turkey, August 18-20, 2010. Proceedings

  2010cited by this paper
• End-to-End Coreference Resolution via Hypergraph Partitioning

  2010influential reference
• On Spectral Learning

  2010influential reference
• Flexible constrained spectral clustering

  2010cited by this paper
• Constrained clustering via spectral regularization

  2009influential reference
• Understanding the Value of Features for Coreference Resolution

  2008cited by this paper
• Constrained spectral clustering through affinity propagation

  2008cited by this paper
• A tutorial on spectral clustering

  2007cited by this paper
• k-means++: the advantages of careful seeding

  2007cited by this paper
• BESTCUT: A Graph Algorithm for Coreference Resolution

  2006cited by this paper
• Semi-supervised graph clustering: a kernel approach

  2005cited by this paper
• Clustering with Constraints: Feasibility Issues and the k-Means Algorithm

  2005cited by this paper
• On Coreference Resolution Performance Metrics

  2005influential reference
• Supervised clustering with support vector machines

  2005cited by this paper
• The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering

  2004cited by this paper
• A Unified View of Kernel k-means , Spectral Clustering and Graph Cuts

  2004cited by this paper
• Learning from General Label Constraints

  2004cited by this paper
• Machine Learning: ECML 2004

  2004cited by this paper
• Kernel k-means: spectral clustering and normalized cuts

  2004cited by this paper
• Learning Spectral Clustering

  2003cited by this paper
• Combining active learning and semi-supervised learning using Gaussian fields and harmonic functions

  2003cited by this paper
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation

  2003cited by this paper
• Distance Metric Learning with Application to Clustering with Side-Information

  2002cited by this paper
• Improving Machine Learning Approaches to Coreference Resolution

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

  2001cited by this paper
• On Spectral Clustering: Analysis and an algorithm

  2001cited by this paper
• Grouping with Bias

  2001cited by this paper
• Algorithms for Scoring Coreference Chains

  1998cited by this paper
• On the Quality of Spectral Separators

  1998cited by this paper
• Normalized cuts and image segmentation

  1997cited by this paper
• A Model-Theoretic Coreference Scoring Scheme

  1995cited by this paper
• Resistance distance

  1993cited by this paper

• Self-weighted spectral clustering with parameter-free constraint

  2017cites this paper
• Partially Supervised Graph Embedding for Positive Unlabelled Feature Selection

  2016cites this paper
• Matrixized learning machine with modified pairwise constraints

  2015cites this paper