Cover Image

Improving Data Cleaning Using Discrete Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Smith, Kenneth, Climer, Sharlee
Format:	Preprint
Published:	2024
Subjects:	Databases Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Selection Problem in Multi-Query Optimization: a Comprehensive Survey
by: Zinchenko, Sergey, et al.
Published: (2024)

Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity
by: Focke, Jacob, et al.
Published: (2023)

Numbering Combinations for Compact Representation of Many-to-Many Relationship Sets
by: Tomovic, Savo
Published: (2025)

Relational Algebras for Subset Selection and Optimisation
by: Pratten, David Robert, et al.
Published: (2025)

Knowledge management in House of Graphs
by: Devillez, Gauvain, et al.
Published: (2026)

Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations
by: Focke, Jacob, et al.
Published: (2021)

Geometric planted matchings beyond the Gaussian model
by: Schwengber, Lucas da Rocha, et al.
Published: (2024)

The Weisfeiler-Leman Dimension of Conjunctive Queries
by: Göbel, Andreas, et al.
Published: (2023)

Cuts and Gauges for Submodular Width
by: Lanzinger, Matthias
Published: (2026)

Aspects of Artificial Intelligence: Transforming Machine Learning Systems Naturally
by: Guo, Xiuzhan
Published: (2025)

Identifying and Characterising Higher Order Interactions in Mobility Networks Using Hypergraphs
by: Sambaturu, Prathyush, et al.
Published: (2025)

Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach
by: Liao, Meihao, et al.
Published: (2025)

Identifying partial haplotypes that are associated with late‐onset Alzheimer disease
by: Sharlee Climer
Published: (2024)

Discrete Incremental Voting on Expanders
by: Cooper, Colin, et al.
Published: (2024)

Decidability of Querying First-Order Theories via Countermodels of Finite Width
by: Feller, Thomas, et al.
Published: (2023)

Strict Self-Assembly of Discrete Self-Similar Fractal Shapes
by: Becker, Florent
Published: (2024)

Flip Dynamics for Sampling Colorings: Improving $(11/6-ε)$ Using a Simple Metric
by: Carlson, Charlie, et al.
Published: (2024)

Improved Lower Bounds on Multiflow-Multicut Gaps
by: Kalantarzadeh, Sina, et al.
Published: (2025)

Improved Hotplug Caching Schemes Using PDAs and t-Designs
by: Rajput, Charul, et al.
Published: (2023)

Weighted Group Search on the Disk & Improved Lower Bounds for Priority Evacuation
by: Georgiou, Konstantinos, et al.
Published: (2024)

Mutation-Guided Differentiable Quadratic Combinatorial Optimization
by: Sun, Yongliang, et al.
Published: (2026)

Optimizing Tensor Contraction Paths: A Greedy Algorithm Approach With Improved Cost Functions
by: Orgler, Sheela, et al.
Published: (2024)

Automated Symmetric Constructions in Discrete Geometry
by: Subercaseaux, Bernardo, et al.
Published: (2025)

Density Decomposition in Dual-Modular Optimization: Markets, Fairness, and Contracts
by: Chan, T-H. Hubert, et al.
Published: (2025)

Positional Identifiability from Pairwise Collision Data
by: Li, Yun-Han, et al.
Published: (2026)

Discrete quadratic model QUBO solution landscapes
by: Zaborniak, Tristan, et al.
Published: (2023)

Discrete calculus with cubic cells on discrete manifolds
by: De Carlo, Leonardo
Published: (2019)

Efficient Lifting of Discrete Logarithms Modulo Prime Powers
by: Viglietta, Giovanni, et al.
Published: (2025)

Discrete-Time Open Quantum Walks for Vertex Ranking in Graphs
by: Dutta, Supriyo
Published: (2024)

Improving Performance in Combinatorial Optimization Problems with Inequality Constraints: An Evaluation of the Unbalanced Penalization Method on D-Wave Advantage
by: Montanez-Barrera, J. A., et al.
Published: (2023)

Improving SAT Solvers on Orthogonal Latin Square Problems
by: Barnoff, Aaron, et al.
Published: (2026)

Improved lower bounds on the maximum size of graphs with girth 5
by: Goedgebeur, Jan, et al.
Published: (2025)

Optimizing alphabet reduction pairs of arrays
by: Culus, Jean-François, et al.
Published: (2024)

$ε$-Uniform Mixing in Discrete Quantum Walks
by: Zhan, Hanmeng
Published: (2023)

Antimagic Labeling of Graphs Using Prime Numbers
by: Islam, Arafat, et al.
Published: (2024)

Discrete functional inequalities on lattice graphs
by: Gupta, Shubham
Published: (2024)

Using Graph Theory to Derive Inequalities for the Bell Numbers
by: Hertz, Alain, et al.
Published: (2021)

Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs
by: Bok, Jan, et al.
Published: (2020)

Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network
by: Manna, Bubai, et al.
Published: (2024)

Discrete Quantum Walks with Marked Vertices and Their Average Vertex Mixing Matrices
by: Mohan, Amulya, et al.
Published: (2024)