Massively parallel entity matching with linear classification in low dimensional space

DOI10.4230/LIPICS.ICDT.2018.20MaRDI QIDQ3305368zbMATH OpenFDO

Authors Yufei Tao

Publication date 6 August 2020

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2018.20

zbMATH Keywords

dominance joinentity matchinglinear programmingmassively parallel computationrange counting

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10) Parallel algorithms in computer science (68W10)

Recommendations

• Machine Learning: ECML 2004
• Multidimensional assignment problem for multipartite entity resolution
• ERBlox: combining matching dependencies with machine learning for entity resolution
• Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs
• Round compression for parallel matching algorithms

Cites work

• Bounded-independance derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
• Communication-Efficient Parallel Sorting
• Fast and optimal parallel multidimensional search in PRAMs with applications to linear programming and related problems
• GYM: a multiround distributed join algorithm
• Las Vegas algorithms for linear and integer programming when the dimension is small
• Multi-pass geometric algorithms
• On the equivalence of some rectangle problems
• Parallel skyline queries
• Worst-case optimal algorithms for parallel query processing

Cited in

(1)

• Parallel acyclic joins: optimal algorithms and cyclicity separation

Describes a project that uses

Uses Software

• GRAPE

This page was built for publication: Massively parallel entity matching with linear classification in low dimensional space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3305368)