Imagen de Portada

Clustering with Set Outliers and Applications in Relational Clustering

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Surianarayanan, Vaishali, Kumar, Neeraj, Sintos, Stavros
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Databases
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Improved Approximation Algorithms for Relational Clustering
por: Esmailpour, Aryan, et al.
Publicado: (2024)

Weighted Set Multi-Cover on Bounded Universe and Applications in Package Recommendation
por: Shahbazi, Nima, et al.
Publicado: (2026)

Faster Relational Algorithms Using Geometric Data Structures
por: Esmailpour, Aryan, et al.
Publicado: (2026)

Range (Rényi) Entropy Queries and Partitioning
por: Esmailpour, Aryan, et al.
Publicado: (2023)

A Fair and Memory/Time-efficient Hashmap
por: Asudeh, Abolfazl, et al.
Publicado: (2023)

A Theoretical Framework for Distribution-Aware Dataset Search
por: Esmailpour, Aryan, et al.
Publicado: (2025)

Computing Data Distribution from Query Selectivities
por: Agarwal, Pankaj K., et al.
Publicado: (2024)

Faster Algorithms for Fair Max-Min Diversification in $\mathbb{R}^d$
por: Kurkure, Yash, et al.
Publicado: (2024)

Counting hypertriangles through hypergraph orientations
por: Paul-Pena, Daniel, et al.
Publicado: (2026)

On Fair Epsilon Net and Geometric Hitting Set
por: Dehghankar, Mohsen, et al.
Publicado: (2025)

Parameterized Approximation for Capacitated $d$-Hitting Set with Hard Capacities
por: Lokshtanov, Daniel, et al.
Publicado: (2024)

Fair Set Cover
por: Dehghankar, Mohsen, et al.
Publicado: (2024)

Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor
por: Shahbazi, Nima, et al.
Publicado: (2025)

Enumeration of Minimal Hitting Sets Parameterized by Treewidth
por: Kenig, Batya, et al.
Publicado: (2024)

A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs
por: S, Ajaykrishnan E, et al.
Publicado: (2025)

A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets
por: Li, Xuan, et al.
Publicado: (2024)

Subtree Mode and Applications
por: Zhou, Jialong, et al.
Publicado: (2025)

Targeted Least Cardinality Candidate Key for Relational Databases
por: Nakos, Vasileios, et al.
Publicado: (2024)

Dimensionality Reduced Clustered Data and Order Partition and Stepwise Dimensionality Increasing Indices
por: Thomasian, Alexander
Publicado: (2024)

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
por: Depian, Thomas, et al.
Publicado: (2025)

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach
por: Lee, Changyeol, et al.
Publicado: (2025)

Clustering What Matters in Constrained Settings
por: Jaiswal, Ragesh, et al.
Publicado: (2023)

Local Search-based Individually Fair Clustering with Outliers
por: Maity, Binita, et al.
Publicado: (2025)

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

Sampling Space-Saving Set Sketches
por: Lee, Homin K., et al.
Publicado: (2024)

Efficient Approximation of Fractional Hypertree Width
por: Korchemna, Viktoriia, et al.
Publicado: (2024)

Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
por: Carmeli, Nofar, et al.
Publicado: (2025)

Algorithms for Optimizing Acyclic Queries
por: Luo, Zheng, et al.
Publicado: (2025)

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
por: Song, Siwoo, et al.
Publicado: (2025)

Stable Tree Labelling for Accelerating Distance Queries on Dynamic Road Networks
por: Koehler, Henning, et al.
Publicado: (2025)

Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks
por: Farhan, Muhammad, et al.
Publicado: (2025)

Efficient Computation of Hyper-triangles on Hypergraphs
por: Yin, Haozhe, et al.
Publicado: (2025)

Indexing Strings with Utilities
por: Bernardini, Giulia, et al.
Publicado: (2025)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
por: Im, Sungjin, et al.
Publicado: (2025)

Smaller and More Flexible Cuckoo Filters
por: Schmitz, Johanna Elena, et al.
Publicado: (2025)

Towards Lazy B-Trees
por: Rysgaard, Casper Moldrup, et al.
Publicado: (2025)

Hilbert Forest in the SISAP 2025 Indexing Challenge
por: Imamura, Yasunobu, et al.
Publicado: (2025)

A High-Throughput GPU Framework for Adaptive Lossless Compression of Floating-Point Data
por: Li, Zheng, et al.
Publicado: (2025)

Fast Answering Pattern-Constrained Reachability Queries with Two-Dimensional Reachability Index
por: Yang, Huihui, et al.
Publicado: (2025)

Accelerating Graph Similarity Search through Integer Linear Programming
por: D'Ascenzo, Andrea, et al.
Publicado: (2025)