Skip to content
Universidad del Mar SIBUMAR Descubridor Institucional UMAR
  • Inicio
  • Búsqueda avanzada
  • Explorar
  • Login
    • English
    • Deutsch
    • Español
    • Français
    • Italiano
Advanced
  • On the Feasibility of Fidelity$^-$ for Graph Pruning
Cover Image

On the Feasibility of Fidelity$^-$ for Graph Pruning

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Shin, Yong-Min, Shin, Won-Yong
Format: Preprint
Published: 2024
Subjects:
Machine Learning
Artificial Intelligence
Information Theory
Neural and Evolutionary Computing
Social and Information Networks
Online Access:
Acceder al recurso
Tags: Add Tag
No Tags, Be the first to tag this record!
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Save to List
  • Permanent link
  • Holdings
  • Description
  • Comments
  • Similar Items
  • Staff View

Internet

https://arxiv.org/abs/2406.11504

Similar Items

  • PAGE: Prototype-Based Model-Level Explanations for Graph Neural Networks
    by: Shin, Yong-Min, et al.
    Published: (2022)
  • Faithful and Accurate Self-Attention Attribution for Message Passing Neural Networks via the Computation Tree Viewpoint
    by: Shin, Yong-Min, et al.
    Published: (2024)
  • IM-META: Influence Maximization Using Node Metadata in Networks With Unknown Topology
    by: Tran, Cong, et al.
    Published: (2021)
  • Tokenize Once, Recommend Anywhere: Unified Item Tokenization for Multi-domain LLM-based Recommendation
    by: Hou, Yu, et al.
    Published: (2025)
  • Centrality-Based Node Feature Augmentation for Robust Network Alignment
    by: Park, Jin-Duk, et al.
    Published: (2023)
Universidad del Mar
Universidad del MarSistema Bibliotecario de la Universidad del MarDescubridor Institucional UMARImplementación y desarrollo: Mtro. Carlos Alonso Albores Pérez
InicioBúsqueda avanzadaExplorar
Visitas al Descubridor: 33,245© 2026 Universidad del Mar