From Features to Graphs: Exploring Graph Structures and Pairwise Interactions via GNNs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912426347200512 |
|---|---|
| author | Yamchote, Phaphontee Win, Saw Nay Htet Amornbunchornvej, Chainarong Noraset, Thanapon |
| author_facet | Yamchote, Phaphontee Win, Saw Nay Htet Amornbunchornvej, Chainarong Noraset, Thanapon |
| contents | Feature interaction is crucial in predictive machine learning models, as it captures the relationships between features that influence model performance. In this work, we focus on pairwise interactions and investigate their importance in constructing feature graphs for Graph Neural Networks (GNNs). We leverage existing GNN models and tools to explore the relationship between feature graph structures and their effectiveness in modeling interactions. Through experiments on synthesized datasets, we uncover that edges between interacting features are important for enabling GNNs to model feature interactions effectively. We also observe that including non-interaction edges can act as noise, degrading model performance. Furthermore, we provide theoretical support for sparse feature graph selection using the Minimum Description Length (MDL) principle. We prove that feature graphs retaining only necessary interaction edges yield a more efficient and interpretable representation than complete graphs, aligning with Occam's Razor. Our findings offer both theoretical insights and practical guidelines for designing feature graphs that improve the performance and interpretability of GNN models. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_13471 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | From Features to Graphs: Exploring Graph Structures and Pairwise Interactions via GNNs Yamchote, Phaphontee Win, Saw Nay Htet Amornbunchornvej, Chainarong Noraset, Thanapon Machine Learning Artificial Intelligence 68T07 68T07 68T07 I.2.6 Feature interaction is crucial in predictive machine learning models, as it captures the relationships between features that influence model performance. In this work, we focus on pairwise interactions and investigate their importance in constructing feature graphs for Graph Neural Networks (GNNs). We leverage existing GNN models and tools to explore the relationship between feature graph structures and their effectiveness in modeling interactions. Through experiments on synthesized datasets, we uncover that edges between interacting features are important for enabling GNNs to model feature interactions effectively. We also observe that including non-interaction edges can act as noise, degrading model performance. Furthermore, we provide theoretical support for sparse feature graph selection using the Minimum Description Length (MDL) principle. We prove that feature graphs retaining only necessary interaction edges yield a more efficient and interpretable representation than complete graphs, aligning with Occam's Razor. Our findings offer both theoretical insights and practical guidelines for designing feature graphs that improve the performance and interpretability of GNN models. |
| title | From Features to Graphs: Exploring Graph Structures and Pairwise Interactions via GNNs |
| topic | Machine Learning Artificial Intelligence 68T07 68T07 68T07 I.2.6 |
| url | https://arxiv.org/abs/2502.13471 |