Browse State-of-the-Art › hypergraph partitioning
hypergraph partitioning
6 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Papers archive 2025-07-28
archive papers tagged: 26 · with a code link: 6 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran: none of the 26 tagged papers has a Syntology run on record
Page 1 of 1: papers 1 to 26 of 26, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from.
-
26 Oct 2022 1 repository listedThis paper introduces a scalable algorithmic framework (HyperEF) for spectral coarsening (decomposition) of large-scale hypergraphs by exploiting hyperedge effective resistances.
-
17 Aug 2021 1 repository listedTo address the ever-increasing computational challenges, graph coarsening can be potentially applied for preprocessing a given hypergraph by aggressively aggregating its vertices (nodes).
-
19 Feb 2021 1 repository listedWe propose a novel method to co-cluster the vertices and hyperedges of hypergraphs with edge-dependent vertex weights (EDVWs).
-
5 Sep 2017 1 repository listedHypergraph partitioning is an important problem in machine learning, computer vision and network analytics.
-
1 Jan 2017 1 repository listedWe present an improved coarsening process for multilevel hypergraph partitioning that incorporates global information about the community structure.
-
1 Dec 2002 1 repository listedWe evaluate the effectiveness of cluster ensembles in three qualitatively different application scenarios: (i) where the original clusters were formed based on non-identical sets of features, (ii) where the original…
-
SHyPar: A Spectral Coarsening Approach to Hypergraph Partitioning9 Oct 2024 0 repositories listedState-of-the-art hypergraph partitioners utilize a multilevel paradigm to construct progressively coarser hypergraphs across multiple layers, guiding cut refinements at each level of the hierarchy.
-
VLSI Hypergraph Partitioning with Deep Learning2 Sep 2024 0 repositories listedPartitioning is a known problem in computer science and is critical in chip design workflows, as advancements in this area can significantly influence design quality and efficiency.
-
K-SpecPart: Supervised embedding algorithms and cut overlay for improved hypergraph partitioning7 May 2023 0 repositories listedState-of-the-art hypergraph partitioners follow the multilevel paradigm that constructs multiple levels of progressively coarser hypergraphs that are used to drive cut refinement on each level of the hierarchy.
-
Scalable Graph Convolutional Network Training on Distributed-Memory Systems9 Dec 2022 0 repositories listedGraph Convolutional Networks (GCNs) are extensively utilized for deep learning on graphs.
-
More Recent Advances in (Hyper)Graph Partitioning26 May 2022 0 repositories listedIn recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms.
-
Multilevel Memetic Hypergraph Partitioning with Greedy Recombination7 Apr 2022 0 repositories listedThe Hypergraph Partitioning (HGP) problem is a well-studied problem that finds applications in a variety of domains.
-
Balanced Coarsening for Multilevel Hypergraph Partitioning via Wasserstein Discrepancy14 Jun 2021 0 repositories listedWe propose a balanced coarsening scheme for multilevel hypergraph partitioning.
-
Hypergraph Partitioning using Tensor Eigenvalue Decomposition16 Nov 2020 0 repositories listedHypergraphs have gained increasing attention in the machine learning community lately due to their superiority over graphs in capturing super-dyadic interactions among entities.
-
Multilevel Acyclic Hypergraph Partitioning6 Feb 2020 0 repositories listedA directed acyclic hypergraph is a generalized concept of a directed acyclic graph, where each hyperedge can contain an arbitrary number of tails and heads.
-
Hypergraph Partitioning With Embeddings9 Sep 2019 0 repositories listedProblems in scientific computing, such as distributing large sparse matrix operations, have analogous formulations as hypergraph partitioning problems.
-
Quadratic Decomposable Submodular Function Minimization: Theory and Practice (Computation and Analysis of PageRank over Hypergraphs)26 Feb 2019 0 repositories listedWe introduce a new convex optimization problem, termed quadratic decomposable submodular function minimization (QDSFM), which allows to model a number of learning tasks on graphs and hypergraphs.
-
Bandana: Using Non-volatile Memory for Storing Deep Learning Models14 Nov 2018 0 repositories listedTypical large-scale recommender systems use deep learning models that are stored on a large amount of DRAM.
-
Evolutionary n-level Hypergraph Partitioning with Adaptive Coarsening25 Mar 2018 0 repositories listedHypergraph partitioning is an NP-hard problem that occurs in many computer science applications where it is necessary to reduce large problems into a number of smaller, computationally tractable sub-problems.
-
Engineering a direct k-way Hypergraph Partitioning Algorithm18 Jan 2017 0 repositories listedWe develop a fast and high quality multilevel algorithm that directly partitions hypergraphs into k balanced blocks – without the detour over recursive bipartitioning.
-
Uniform Hypergraph Partitioning: Provable Tensor Methods and Sampling Techniques21 Feb 2016 0 repositories listedIn a series of recent works, we have generalised the consistency results in the stochastic block model literature to the case of uniform and non-uniform hypergraphs.
-
Streaming Min-max Hypergraph Partitioning1 Dec 2015 0 repositories listedIn many applications, the data is of rich structure that can be represented by a hypergraph, where the data items are represented by vertices and the associations among items are represented by hyperedges.
-
Consistency of Spectral Hypergraph Partitioning under Planted Partition Model7 May 2015 0 repositories listedHypergraph partitioning lies at the heart of a number of problems in machine learning and network sciences.
-
Context-Aware Hypergraph Construction for Robust Spectral Clustering4 Jan 2014 0 repositories listedSpectral clustering is a powerful tool for unsupervised data analysis.
-
A Hypergraph-Partitioned Vertex Programming Approach for Large-scale Consensus Optimization30 Aug 2013 0 repositories listedIn modern data science problems, techniques for extracting value from big data require performing large-scale optimization over heterogenous, irregularly structured data.
-
A Constraint-Based Hypergraph Partitioning Approach to Coreference Resolution1 Jan 2013 0 repositories listed
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections