Imagen de Portada

Label-consistent clustering for evolving data

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gadekar, Ameet, Gionis, Aristides, Marette, Thibault
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Fair Committee Selection under Ordinal Preferences and Limited Cardinal Information
por: Gadekar, Ameet, et al.
Publicado: (2025)

On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering
por: Gadekar, Ameet
Publicado: (2026)

FPT Approximations for Fair Sum of Radii with Outliers and General Norm Objectives
por: Gadekar, Ameet
Publicado: (2026)

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
por: Zhang, Guangyi, et al.
Publicado: (2026)

FPT approximations for Capacitated Sum of Radii and Diameters
por: Filtser, Arnold, et al.
Publicado: (2024)

Capacitated Fair-Range Clustering: Hardness and Approximation Algorithms
por: Gadekar, Ameet, et al.
Publicado: (2025)

Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering
por: Gadekar, Ameet, et al.
Publicado: (2025)

Clustering under Constraints: Efficient Parameterized Approximation Schemes
por: Bhore, Sujoy, et al.
Publicado: (2025)

Efficient and Practical Approximation Algorithms for Advertising in Content Feeds
por: Zhang, Guangyi, et al.
Publicado: (2025)

Sample and Expand: Discovering Low-rank Submatrices With Quality Guarantees
por: Ciaperoni, Martino, et al.
Publicado: (2025)

Efficient and Adaptive Estimation of Local Triadic Coefficients
por: Sarpe, Ilie, et al.
Publicado: (2025)

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
por: Abbasi, Fateme, et al.
Publicado: (2023)

OptiRefine: Densest subgraphs and maximum cuts with $k$ refinements
por: Tu, Sijing, et al.
Publicado: (2025)

Sequential Diversification with Provable Guarantees
por: Wang, Honglian, et al.
Publicado: (2024)

Scalable Temporal Motif Densest Subnetwork Discovery
por: Sarpe, Ilie, et al.
Publicado: (2024)

Streaming Stochastic Submodular Maximization with On-Demand User Requests
por: Wang, Honglian, et al.
Publicado: (2026)

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

Collaborative Learning with Different Labeling Functions
por: Deng, Yuyang, et al.
Publicado: (2024)

An Approximation Algorithm for Graph Label Selection
por: John, Josia, et al.
Publicado: (2026)

Weak to Strong Learning from Aggregate Labels
por: Makhija, Yukti, et al.
Publicado: (2024)

Detection of Common Subtrees with Identical Label Distribution
por: Azaïs, Romain, et al.
Publicado: (2023)

Efficient Testable Learning of General Halfspaces with Adversarial Label Noise
por: Diakonikolas, Ilias, et al.
Publicado: (2024)

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

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

Fast and explainable clustering based on sorting
por: Chen, Xinye, et al.
Publicado: (2022)

Fair Clustering for Data Summarization: Improved Approximation Algorithms and Complexity Insights
por: Gadekar, Ameet, et al.
Publicado: (2024)

Approximating splits for decision trees quickly in sparse data streams
por: Tatti, Nikolaj
Publicado: (2026)

Accelerating ERM for data-driven algorithm design using output-sensitive techniques
por: Balcan, Maria-Florina, et al.
Publicado: (2022)

Hardness of Learning Boolean Functions from Label Proportions
por: Guruswami, Venkatesan, et al.
Publicado: (2024)

A 4-approximation algorithm for min max correlation clustering
por: Heidrich, Holger, et al.
Publicado: (2023)

Learning a Single Neuron Robustly to Distributional Shifts and Adversarial Label Noise
por: Li, Shuyao, et al.
Publicado: (2024)

Provably faster randomized and quantum algorithms for $k$-means clustering via uniform sampling
por: Chen, Tyler, et al.
Publicado: (2025)

Efficiently learning and sampling multimodal distributions with data-based initialization
por: Koehler, Frederic, et al.
Publicado: (2024)

Efficient Calibration for Decision Making
por: Gopalan, Parikshit, et al.
Publicado: (2025)

Learning Augmented Graph $k$-Clustering
por: Fan, Chenglin, et al.
Publicado: (2025)

Guessing Efficiently for Constrained Subspace Approximation
por: Bhaskara, Aditya, et al.
Publicado: (2025)

Cache Management for Mixture-of-Experts LLMs -- extended version
por: Angelopoulos, Spyros, et al.
Publicado: (2025)

Optimal Variance and Covariance Estimation under Differential Privacy in the Add-Remove Model and Beyond
por: Takakura, Shokichi, et al.
Publicado: (2025)

Dynamic Similarity Graph Construction with Kernel Density Estimation
por: Laenen, Steinar, et al.
Publicado: (2025)