Copertina

Fast and explainable clustering based on sorting

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chen, Xinye, Güttel, Stefan
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Machine Learning Data Structures and Algorithms Computation
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Fast and exact fixed-radius neighbor search based on sorting
di: Chen, Xinye, et al.
Pubblicazione: (2022)

Fast Agnostic Learners in the Plane
di: Eden, Talya, et al.
Pubblicazione: (2025)

Label-consistent clustering for evolving data
di: Gadekar, Ameet, et al.
Pubblicazione: (2025)

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform
di: Alman, Josh, et al.
Pubblicazione: (2025)

Fast, robust approximate message passing
di: Ivkov, Misha, et al.
Pubblicazione: (2024)

Fast and Simple Densest Subgraph with Predictions
di: Bui, Thai, et al.
Pubblicazione: (2025)

Fast decision tree learning solves hard coding-theoretic problems
di: Koch, Caleb, et al.
Pubblicazione: (2024)

Metric $k$-clustering using only Weak Comparison Oracles
di: Raychaudhury, Rahul, et al.
Pubblicazione: (2026)

Fast Computation of Leave-One-Out Cross-Validation for $k$-NN Regression
di: Kanagawa, Motonobu
Pubblicazione: (2024)

Fast and Efficient Matching Algorithm with Deadline Instances
di: Song, Zhao, et al.
Pubblicazione: (2023)

Fast online node labeling with graph subsampling
di: Huang, Yushen, et al.
Pubblicazione: (2025)

Cascaded Learned Bloom Filter for Optimal Model-Filter Size Balance and Fast Rejection
di: Sato, Atsuki, et al.
Pubblicazione: (2025)

Accelerating Matroid Optimization through Fast Imprecise Oracles
di: Eberle, Franziska, et al.
Pubblicazione: (2024)

Fast-MWEM: Private Data Release in Sublinear Time
di: Haris, Themistoklis, et al.
Pubblicazione: (2026)

Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation
di: Pham, Ninh, et al.
Pubblicazione: (2025)

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

New Bounds for Kernel Sums via Fast Spherical Embeddings
di: Wagner, Tal
Pubblicazione: (2026)

Fast and Accurate Triangle Counting in Graph Streams Using Predictions
di: Boldrin, Cristian, et al.
Pubblicazione: (2024)

Regularized Dikin Walks for Sampling Truncated Logconcave Measures, Mixed Isoperimetry and Beyond Worst-Case Analysis
di: Jiang, Minhui, et al.
Pubblicazione: (2024)

Fast White-Box Adversarial Streaming Without a Random Oracle
di: Feng, Ying, et al.
Pubblicazione: (2024)

Inner Product Aware Quantization: Provably Fast, Accurate, and Adaptive Algorithms
di: White, Nathan, et al.
Pubblicazione: (2026)

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair
di: Beretta, Lorenzo, et al.
Pubblicazione: (2025)

Improved Robust Estimation for Erdős-Rényi Graphs: The Sparse Regime and Optimal Breakdown Point
di: Chen, Hongjie, et al.
Pubblicazione: (2025)

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
di: Amanatidis, Georgios, et al.
Pubblicazione: (2020)

Fit Like You Sample: Sample-Efficient Generalized Score Matching from Fast Mixing Diffusions
di: Qin, Yilong, et al.
Pubblicazione: (2023)

Dynamic data summarization for hierarchical spatial clustering
di: Abduaziz, Kayumov, et al.
Pubblicazione: (2024)

Testably Learning Polynomial Threshold Functions
di: Slot, Lucas, et al.
Pubblicazione: (2024)

Fast Partition-Based Cross-Validation With Centering and Scaling for $\mathbf{X}^\mathbf{T}\mathbf{X}$ and $\mathbf{X}^\mathbf{T}\mathbf{Y}$
di: Engstrøm, Ole-Christian Galbo, et al.
Pubblicazione: (2024)

Fast sampling from constrained spaces using the Metropolis-adjusted Mirror Langevin algorithm
di: Srinivasan, Vishwak, et al.
Pubblicazione: (2023)

SoS Certificates for Sparse Singular Values and Their Applications: Robust Statistics, Subspace Distortion, and More
di: Diakonikolas, Ilias, et al.
Pubblicazione: (2024)

Experimental Design Using Interlacing Polynomials
di: Lau, Lap Chi, et al.
Pubblicazione: (2024)

Testing Calibration in Nearly-Linear Time
di: Hu, Lunjia, et al.
Pubblicazione: (2024)

Distributed clustering in partially overlapping feature spaces
di: Maritan, Alessio, et al.
Pubblicazione: (2025)

Diversity-aware clustering: Computational Complexity and Approximation Algorithms
di: Thejaswi, Suhas, et al.
Pubblicazione: (2024)

Optimal antimatroid sorting
di: Berendsohn, Benjamin Aram
Pubblicazione: (2025)

Linear Programming based Approximation to Individually Fair k-Clustering with Outliers
di: Maity, Binita, et al.
Pubblicazione: (2024)

Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
di: Mishra, Nina, et al.
Pubblicazione: (2025)

Correlation Clustering Algorithm for Dynamic Complete Signed Graphs: An Index-based Approach
di: Shakiba, Ali
Pubblicazione: (2023)

Learned Static Function Data Structures
di: Hermann, Stefan, et al.
Pubblicazione: (2025)

Fair Submodular Cover
di: Chen, Wenjing, et al.
Pubblicazione: (2024)