GAIS: A Novel Approach to Instance Selection with Graph Attention Networks

December 26, 2024 ยท Declared Dead ยท ๐Ÿ› 2024 IEEE International Conference on Knowledge Graph (ICKG)

๐Ÿ“œ CAUSE OF DEATH: Death by README
Repo has only a README

Repo contents: LICENSE

Authors Zahiriddin Rustamov, Ayham Zaitouny, Rafat Damseh, Nazar Zaki arXiv ID 2412.19201 Category cs.LG: Machine Learning Citations 1 Venue 2024 IEEE International Conference on Knowledge Graph (ICKG) Repository https://github.com/zahiriddin-rustamov/gais โญ 1 Last Checked 1 month ago
Abstract
Instance selection (IS) is a crucial technique in machine learning that aims to reduce dataset size while maintaining model performance. This paper introduces a novel method called Graph Attention-based Instance Selection (GAIS), which leverages Graph Attention Networks (GATs) to identify the most informative instances in a dataset. GAIS represents the data as a graph and uses GATs to learn node representations, enabling it to capture complex relationships between instances. The method processes data in chunks, applies random masking and similarity thresholding during graph construction, and selects instances based on confidence scores from the trained GAT model. Experiments on 13 diverse datasets demonstrate that GAIS consistently outperforms traditional IS methods in terms of effectiveness, achieving high reduction rates (average 96\%) while maintaining or improving model performance. Although GAIS exhibits slightly higher computational costs, its superior performance in maintaining accuracy with significantly reduced training data makes it a promising approach for graph-based data selection.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning

Died the same way โ€” ๐Ÿ“œ Death by README