Poster

Coresets for Relational Data and The Applications

Jiaxiang Chen · Qingyuan Yang · Ruomin Huang · Hu Ding

Hall J #734

Keywords: [ coreset ] [ Optimization ] [ relational data ]

[ Abstract ]
[ Poster [ OpenReview
Wed 30 Nov 2 p.m. PST — 4 p.m. PST
 
Spotlight presentation: Lightning Talks 1B-4
Tue 6 Dec 10:30 a.m. PST — 10:45 a.m. PST

Abstract:

A coreset is a small set that can approximately preserve the structure of the original input data set. Therefore we can run our algorithm on a coreset so as to reduce the total computational complexity. Conventional coreset techniques assume that the input data set is available to process explicitly. However, this assumption may not hold in real-world scenarios. In this paper, we consider the problem of coresets construction over relational data. Namely, the data is decoupled into several relational tables, and it could be very expensive to directly materialize the data matrix by joining the tables. We propose a novel approach called ``aggregation tree with pseudo-cube'' that can build a coreset from bottom to up. Moreover, our approach can neatly circumvent several troublesome issues of relational learning problems [Khamis et al., PODS 2019]. Under some mild assumptions, we show that our coreset approach can be applied for the machine learning tasks, such as clustering, logistic regression and SVM.

Chat is not available.