A Constraint-Based Hypergraph Partitioning Approach to Coreference Resolution
Code (0)
등록된 구현이 없습니다.
Tasks
coreference-resolutionCoreference Resolutionhypergraph partitioningSimilar Papers 제목 키워드 기반
Collaborative Partitioning for Coreference Resolution
This paper presents a collaborative partitioning algorithm{---}a novel ensemble-based approach to coreference resolution. Starting from the all-singleton partition, we search for a solution close to the ensemble{'}s outp…
coreference-resolutionCoreference ResolutionBalanced Coarsening for Multilevel Hypergraph Partitioning via Wasserstein Discrepancy
We propose a balanced coarsening scheme for multilevel hypergraph partitioning. In addition, an initial partitioning algorithm is designed to improve the quality of k-way hypergraph partitioning. By assigning vertex weig…
hypergraph partitioningInhomogeneous Hypergraph Clustering with Applications
Hypergraph partitioning is an important problem in machine learning, computer vision and network analytics. A widely used method for hypergraph partitioning relies on minimizing a normalized sum of the costs of partition…
Clusteringhypergraph partitioningExact Partitioning of High-order Planted Models with a Tensor Nuclear Norm Constraint
We study the problem of efficient exact partitioning of the hypergraphs generated by high-order planted models. A high-order planted model assumes some underlying cluster structures, and simulates high-order interactions…
Multilevel Acyclic Hypergraph Partitioning
A directed acyclic hypergraph is a generalized concept of a directed acyclic graph, where each hyperedge can contain an arbitrary number of tails and heads. Directed hypergraphs can be used to model data flow and executi…
hypergraph partitioningScheduling