arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2403.06367cs.LGcs.DB
收藏

FeatAug:基于一对多关系表的自动特征增强

FeatAug: Automatic Feature Augmentation From One-to-Many Relationship Tables

Simon Fraser University(西蒙菲莎大学)

Danrui Qi, Weiling Zheng, Jiannan Wang

AI总结:

针对一对多关系表自动特征增强中谓词缺失导致候选查询爆炸的问题,提出 FeatAug 框架,结合贝叶斯优化、预热策略与束搜索生成谓词感知 SQL,并在四个真实数据集上验证优于 Featuretools 等基线。

摘要:

从一对多关系表进行特征增强是机器学习模型开发中一个关键但具有挑战性的问题。为了增强出好的特征,数据科学家需要手动构思 SQL 查询,这非常耗时。Featuretools [1] 是数据科学社区广泛使用的工具,它通过从相关表中提取新特征来自动增强训练数据。它将每个特征表示为对相关表执行的分组聚合 SQL 查询,并能自动生成这些 SQL 查询。然而,它在这些查询中不包含谓词,这显著限制了其在许多真实场景中的应用。为克服这一局限,我们提出 FEATAUG,这是一种新的特征增强框架,可从一对多关系表中自动提取谓词感知的 SQL 查询。这一扩展并非易事,因为考虑谓词会使候选查询数量呈指数级增长。因此,原本将所有候选查询物化的 Featuretools 框架将无法工作,需要重新设计。我们形式化定义了该问题,并将其建模为超参数优化问题。我们讨论了如何在此应用贝叶斯优化,并提出一种新颖的预热策略来优化它。为使算法更实用,我们还研究了如何识别有潜力的谓词属性组合。我们展示了束搜索思想如何能够部分解决该问题,并提出若干技术进一步优化它。我们在四个真实数据集上的实验表明,与 Featuretools 和其他基线相比,FeatAug 提取出了更有效的特征。代码已在 https://github.com/sfu-db/FeatAug 开源。

英文摘要:

Feature augmentation from one-to-many relationship tables is a critical but challenging problem in ML model development. To augment good features, data scientists need to come up with SQL queries manually, which is time-consuming. Featuretools [1] is a widely used tool by the data science community to automatically augment the training data by extracting new features from relevant tables. It represents each feature as a group-by aggregation SQL query on relevant tables and can automatically generate these SQL queries. However, it does not include predicates in these queries, which significantly limits its application in many real-world scenarios. To overcome this limitation, we propose FEATAUG, a new feature augmentation framework that automatically extracts predicate-aware SQL queries from one-to-many relationship tables. This extension is not trivial because considering predicates will exponentially increase the number of candidate queries. As a result, the original Featuretools framework, which materializes all candidate queries, will not work and needs to be redesigned. We formally define the problem and model it as a hyperparameter optimization problem. We discuss how the Bayesian Optimization can be applied here and propose a novel warm-up strategy to optimize it. To make our algorithm more practical, we also study how to identify promising attribute combinations for predicates. We show that how the beam search idea can partially solve the problem and propose several techniques to further optimize it. Our experiments on four real-world datasets demonstrate that FeatAug extracts more effective features compared to Featuretools and other baselines. The code is open-sourced at https://github.com/sfu-db/FeatAug

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑