:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Baumann, Philipp, Hochbaum, Dorit S.
Format:	Preprint
Published:	2022
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2212.14437
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm
by: Baumann, Philipp, et al.
Published: (2026)

An Effective Flow-based Method for Positive-Unlabeled Learning: 2-HNC
by: Hochbaum, Dorit, et al.
Published: (2025)

Confidence HNC: A Network Flow Technique for Binary Classification with Noisy Labels
by: Hochbaum, Dorit, et al.
Published: (2025)

Min cost flow on unit capacity networks and convex cost K-flow are as easy as the assignment problem with All-Min-Cuts algorithm
by: Hochbaum, Dorit S.
Published: (2016)

Binary weights spanning trees and the $k$-red spanning tree problem in linear time
by: Hochbaum, Dorit S.
Published: (2024)

Fast and effective algorithms for fair clustering at scale
by: Mantuano, Claudio, et al.
Published: (2026)

A Fast and Effective Breakpoints Heuristic Algorithm for the Quadratic Knapsack Problem
by: Hochbaum, Dorit S., et al.
Published: (2024)

Nonlinear subspace clustering by functional link neural networks
by: Shi, Long, et al.
Published: (2024)

A column generation algorithm with dynamic constraint aggregation for minimum sum-of-squares clustering
by: Sudoso, Antonio M., et al.
Published: (2024)

Representative Arm Identification: A fixed confidence approach to identify cluster representatives
by: Gharat, Sarvesh, et al.
Published: (2024)

Detecting outliers by clustering algorithms
by: Li, Qi, et al.
Published: (2024)

New bounds on the cohesion of complete-link and other linkage methods for agglomeration clustering
by: Dasgupta, Sanjoy, et al.
Published: (2024)

Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques
by: Roberto Asín‐Achá, et al.
Published: (2024)

On the cohesion and separability of average-link for hierarchical agglomerative clustering
by: Laber, Eduardo Sany, et al.
Published: (2024)

Modeling massive highly-multivariate nonstationary spatial data with the basis graphical lasso
by: Krock, Mitchell, et al.
Published: (2021)

A parameter-free clustering algorithm for missing datasets
by: Li, Qi, et al.
Published: (2024)

Scaling Laws for Data Filtering -- Data Curation cannot be Compute Agnostic
by: Goyal, Sachin, et al.
Published: (2024)

E(3)-equivariant models cannot learn chirality: Field-based molecular generation
by: Dumitrescu, Alexandru, et al.
Published: (2024)

Does confidence calibration improve conformal prediction?
by: Xi, Huajun, et al.
Published: (2024)

Conformal confidence sets for biomedical image segmentation
by: Davenport, Samuel
Published: (2024)

Enabling clustering algorithms to detect clusters of varying densities through scale-invariant data preprocessing
by: Aryal, Sunil, et al.
Published: (2024)

Geometric design of the tangent term in landing algorithms for orthogonality constraints
by: Goyens, Florentin, et al.
Published: (2025)

Active multiple matrix completion with adaptive confidence sets
by: Locatelli, Andrea, et al.
Published: (2026)

Sparse classification with positive-confidence data in high dimensions
by: Mai, The Tien, et al.
Published: (2025)

Tightening optimality gap with confidence through conformal prediction
by: Li, Miao, et al.
Published: (2025)

A cyclical route linking fundamental mechanism and AI algorithm: An example from tuning Poisson's ratio in amorphous networks
by: Zhu, Changliang, et al.
Published: (2023)

Base3: a simple interpolation-based ensemble method for robust dynamic link prediction
by: Emma, Kondrup
Published: (2025)

Hierarchical mixtures of Gaussians for combined dimensionality reduction and clustering
by: Sokoloski, Sacha, et al.
Published: (2022)

Extending confidence calibration to generalised measures of variation
by: Thompson, Andrew, et al.
Published: (2026)

An unified approach to link prediction in collaboration networks
by: Sosa, Juan, et al.
Published: (2024)

Sparse clustering via the Deterministic Information Bottleneck algorithm
by: Costa, Efthymios, et al.
Published: (2026)

PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms
by: Lasalle, Etienne, et al.
Published: (2024)

Multiple Kronecker RLS fusion-based link propagation for drug-side effect prediction
by: Qian, Yuqing, et al.
Published: (2024)

Attention-based clustering
by: Maulen-Soto, Rodrigo, et al.
Published: (2025)

Model uncertainty quantification using feature confidence sets for outcome excursions
by: Ren, Junting, et al.
Published: (2025)

Thought calibration: Efficient and confident test-time scaling
by: Wu, Menghua, et al.
Published: (2025)

Causal inference using invariant prediction: identification and confidence intervals
by: Peters, Jonas, et al.
Published: (2015)

Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study
by: Hochbaum, Dorit S., et al.
Published: (2025)

The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings
by: Atkinson, Nathan, et al.
Published: (2023)

Conformal link prediction for false discovery rate control
by: Marandon, Ariane
Published: (2023)