Earticle

현재 위치 Home

Oral Session B-2 : Mobile & Communication

A Comparison of Node Classification Using Constructed Graph and Non-Graph

첫 페이지 보기
  • 발행기관
    한국차세대컴퓨팅학회 바로가기
  • 간행물
    한국차세대컴퓨팅학회 학술대회 바로가기
  • 통권
    ICNGC 2025 The 11th International Conference on Next Generation Computing 2025 (2025.12)바로가기
  • 페이지
    pp.87-91
  • 저자
    Kittikun Nimitsaengtian, Maleerat Maliyaem, Nalinpat Bhumpenpien, Nathaporn Utakrit
  • 언어
    영어(ENG)
  • URL
    https://www.earticle.net/Article/A478467

원문정보

초록

영어
This study develops a systematic, verifiable experimental study to clarify when and how transforming tabular data into graph structures enhances node-level classification: AI-generated synthetic dataset with controlled numbers of nodes, classes, and imbalance; two interpretable graphs are constructed (1) a similarity-based k-nearest neighbors graph with the number of neighbors and model depth varied, and (2) a rule-based graph with explicit, transparent connection rules; and graph-based methods GCN, GraphSAGE to approach this baseline when k and depth are appropriately tuned, before performance saturates or declines due to excessive signal averaging; and rule-based graphs expose architectural differences GraphSAGE is higherperforming and more stable, whereas GCN is more structuresensitive and degrades with depth implying that approaches preserving node-specific information and flexibly aggregating signals are more robust to structural heterogeneity. Overall, the framework offers practical guidance for method selection and graph construction particularly the choice neighbors and depth in a simplified, reproducible form readily extensible to real-world applications.

목차

Abstract
I. INTRODUCTION
II. OBJECTIVES
III. RESEARCH METHODOLOGY
A. Dataset
B. Graph Construction
C. Comparative models
D. Experimental Design
E. Evaluation
IV. RESULTS
A. Case without Graph
B. Rule-Based Graph
C. Similarity-Based Graph and the Role of k
D. Number of Model Layers
E. Robustness to Edge Perturbation
F. Graph Quality and Outcomes
V. DISCUSSION
VI. LIMITATONS OF THE STUDY
VII. FUTURE DIRECTIONS
VIII. CONCLUSION
REFERENCES

키워드

Node classification Graph construction Graph neural network non-graph

저자

  • Kittikun Nimitsaengtian [ Faculty of Information Technology and Digital Innovaiton King Mongkut's University of Technology North Bangkok Bangkok, Thailand ]
  • Maleerat Maliyaem [ Faculty of Information Technology and Digital Innovaiton King Mongkut's University of Technology North Bangkok Bangkok, Thailand ]
  • Nalinpat Bhumpenpien [ Faculty of Information Technology and Digital Innovaiton King Mongkut's University of Technology North Bangkok Bangkok, Thailand ]
  • Nathaporn Utakrit [ Faculty of Information Technology and Digital Innovaiton King Mongkut's University of Technology North Bangkok Bangkok, Thailand ]

참고문헌

자료제공 : 네이버학술정보

간행물 정보

발행기관

  • 발행기관명
    한국차세대컴퓨팅학회 [Korean Institute of Next Generation Computing]
  • 설립연도
    2005
  • 분야
    공학>컴퓨터학
  • 소개
    본 학회는 차세대 PC 및 그 관련분야의 학술활동을 통하여 차세대 PC의 학문 및 기술발전을 도모하고 산업발전 및 국제협력 증진을 목적으로 한다.

간행물

  • 간행물명
    한국차세대컴퓨팅학회 학술대회
  • 간기
    반년간
  • 수록기간
    2021~2025
  • 십진분류
    KDC 566 DDC 004

이 권호 내 다른 논문 / 한국차세대컴퓨팅학회 학술대회 ICNGC 2025 The 11th International Conference on Next Generation Computing 2025

    피인용수 : 0(자료제공 : 네이버학술정보)

    함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.

      페이지 저장