FIVES: Feature Interaction Via Edge Search for Large-Scale Tabular Data
Abstract
High-order interactive features capture the correlation between different columns and thus are promising to enhance various learning tasks on ubiquitous tabular data. To automate the generation of interactive features, existing works either explicitly traverse the feature space or implicitly express the interactions via intermediate activations of some designed models. These two kinds of methods show that there is essentially a trade-off between feature interpretability and search efficiency. To possess both of their merits, we propose a novel method named Feature Interaction Via Edge Search (FIVES), which formulates the task of interactive feature generation as searching for edges on the defined feature graph. Specifically, we first present our theoretical evidence that motivates us to search for useful interactive features with increasing order. Then we instantiate this search strategy by optimizing both a dedicated graph neural network (GNN) and the adjacency tensor associated with the defined feature graph. In this way, the proposed FIVES method simplifies the time-consuming traversal as a typical training course of GNN and enables explicit feature generation according to the learned adjacency tensor. Experimental results on both benchmark and real-world datasets show the advantages of FIVES over several state-of-the-art methods. Moreover, the interactive features identified by FIVES are deployed on the recommender system of Taobao, a worldwide leading e-commerce platform. Results of an online A/B testing further verify the effectiveness of the proposed method FIVES, and we further provide FIVES as AI utilities for the customers of Alibaba Cloud.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The search strategy shifts from discrete reinforcement learning to differentiable searching, which adaptively selects architectures within one-shot learning to circumvent computational burden, for more efficient convergence.
“The search strategy shifts from the discrete reinforcement learning process, which iteratively samples architectures for training and is time-consuming, into the differentiable searching, which adaptively selects architectures within one-shot learning to circumvent the computational burden, for more efficient convergence.”
From When large language models meet personalization: perspectives of challenges and opportunities (2024) · cites this paper as [187]
The citation lists haven’t been fetched yet
References 34 · Cited by 18
- Authors
- Xie, Y., Wang, Z., Li, Y., Ding, B., Gürel, N. M., Zhang, C., Huang, M., Lin, W., & Zhou, J.
- Affiliations
- Alibaba Group (China) (CN)
- Alibaba Group, Bellevue, WA, USA
- ETH Zurich (CH)
- Tsinghua University (CN)
- ORCID
- Venue
- Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining
- Publisher
- ACM
- Published
- 2021-08-14
- Pages
- 3795-3805
- OpenAlex
- W3172054950
- Cited by
- 18
- References
- 34
- Citations by year
- 2026: 2 · 2025: 2 · 2024: 4 · 2023: 7 · 2022: 2 · 2021: 1
- FWCI
- 2.90
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
- Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
- Keywords
- high-order feature interactions, tabular data, feature graph, graph neural networks, adjacency tensor, feature interpretability, recommender systems, e-commerce recommendation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review