ترجمه فارسی مقاله رمزگذار ویژگی برای شبکه های عصبی گراف

• کتاب صدها نکته فارسی (خودمونی) – نسخه PDF — زبان ساده و کاربردی
  مشاهده نمونه نسخه نکات ساده
• کتاب صدها نکته رسمی فارسی – نسخه PDF — نگارش استاندارد و علمی
  مشاهده نمونه نسخه نکات رسمی
• کتاب صدها پرسش و پاسخ تشریحی – نسخه PDF
  — هر سؤال همراه با پاسخ کامل برای درک عمیق مفاهیم
  مشاهده نمونه نسخه پرسش و پاسخ
• کتاب پرسش و پاسخ چهارگزینه‌ای – نسخه یادگیری سریع
  — پاسخ‌ها بلافاصله بعد از سؤال برای مرور سریع
  مشاهده نمونه نسخه کوییز سریع
• کتاب پرسش و پاسخ چهارگزینه‌ای – نسخه خودآزمایی
  — پاسخ‌ها در انتهای بخش‌ها برای سنجش واقعی یادگیری
  مشاهده نمونه نسخه آزمونی

🎯 این بسته یک دورهٔ آموزشی کامل و چندلایه است؛ شامل ویدیوهای آموزشی، کتاب‌ها، تمرین‌ها و خودآزمایی.

چکیده

Graph machine learning, particularly using graph neural networks, fundamentally relies on node features. Nevertheless, numerous real-world systems, such as social and biological networks, often lack node features due to various reasons, including privacy concerns, incomplete or missing data, and limitations in data collection. In such scenarios, researchers typically resort to methods like structural and positional encoding to construct node features. However, the length of such features is contingent on the maximum value within the property being encoded, for example, the highest node degree, which can be exceedingly large in applications like scale-free networks. Furthermore, these encoding schemes are limited to categorical data and might not be able to encode metrics returning other type of values. In this paper, we introduce a novel, universally applicable encoder, termed PropEnc, which constructs expressive node embedding from any given graph metric. PropEnc leverages histogram construction combined with reverse index encoding, offering a flexible method for node features initialization. It supports flexible encoding in terms of both dimensionality and type of input, demonstrating its effectiveness across diverse applications. PropEnc allows encoding metrics in low-dimensional space which effectively avoids the issue of sparsity and enhances the efficiency of the models. We show that \emph{PropEnc} can construct node features that either exactly replicate one-hot encoding or closely approximate indices under various settings. Our extensive evaluations in graph classification setting across multiple social networks that lack node features support our hypothesis. The empirical results conclusively demonstrate that PropEnc is both an efficient and effective mechanism for constructing node features from diverse set of graph metrics.

چکیده به فارسی (ترجمه ماشینی)