mlsanityData to 14 Oct 2026

EAPCR: A Universal Feature Extractor for Scientific Data without Explicit Feature Relation Patterns

arXiv 2411.08164 ↗First posted 12 Nov 2024cs.LG cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

Conventional methods, including Decision Tree (DT)-based methods, have been effective in scientific tasks, such as non-image medical diagnostics, system anomaly detection, and inorganic catalysis efficiency prediction. However, most deep-learning techniques have struggled to surpass or even match this level of success as traditional machine-learning methods. The primary reason is that these applications involve multi-source, heterogeneous data where features lack explicit relationships. This contrasts with image data, where pixels exhibit spatial relationships; textual data, where words have sequential dependencies; and graph data, where nodes are connected through established associations. The absence of explicit Feature Relation Patterns (FRPs) presents a significant challenge for deep learning techniques in scientific applications that are not image, text, and graph-based. In this paper, we introduce EAPCR, a universal feature extractor designed for data without explicit FRPs. Tested across various scientific tasks, EAPCR consistently outperforms traditional methods and bridges the gap where deep learning models fall short. To further demonstrate its robustness, we synthesize a dataset without explicit FRPs. While Kolmogorov-Arnold Network (KAN) and feature extractors like Convolutional Neural Networks (CNNs), Graph Convolutional Networks (GCNs), and Transformers struggle, EAPCR excels, demonstrating its robustness and superior performance in scientific tasks without FRPs.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 13 of its 54 references that are in the map. First posted on arXiv 12 Nov 2024.

Builds on

13 of 54 references.

References · 13

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  4. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  5. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
  6. 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
  7. 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
  8. 2024KAN: Kolmogorov-Arnold Networkscited by 649
  9. 2018Bilinear Attention Networkscited by 280
  10. 2016Multimodal Compact Bilinear Pooling for Visual Question Answering and Visual Groundingcited by 243
  11. 2024KAN 2.0: Kolmogorov-Arnold Networks Meet Sciencecited by 118
  12. 2021Discovering and Explaining the Representation Bottleneck of DNNscited by 42
1 more
  1. 2023URLOST: Unsupervised Representation Learning without Stationarity or Topologycited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.