نتایج جستجو برای: self centered graph

تعداد نتایج: 760711  

Journal: :Journal of the Mathematical Society of Japan 2020

Journal: :Neurocomputing 2021

Graph neural networks (GNNs) apply deep learning techniques to graph-structured data and have achieved promising performance in graph representation learning. However, existing GNNs rely heavily on labeled or well-designed negative samples. To address these issues, we propose a new self-supervised method: bootstrapping (DGB). DGB consists of two networks: online target networks, the input them ...

Journal: :Journal of Mathematical Physics 2008

Journal: :Proceedings of the ... AAAI Conference on Artificial Intelligence 2023

Deep learning methods have demonstrated promising performance on the NP-hard Graph Matching (GM) problems. However, state-of-the-art usually require ground-truth labels, which may take extensive human efforts or be impractical to collect. In this paper, we present a robust self-supervised bidirectional method (IA-SSGM) tackle GM in an unsupervised manner. It involves affinity component and clas...

Journal: :Proceedings of the ... AAAI Conference on Artificial Intelligence 2021

Graph classification is a widely studied problem and has broad applications. In many real-world problems, the number of labeled graphs available for training models limited, which renders these prone to overfitting. To address this problem, we propose two approaches based on contrastive self-supervised learning (CSSL) alleviate first approach, use CSSL pretrain graph encoders widely-available u...

Introduction: Working in the complex and ever changinghealthcare settings forces the nurses and nursing students to beequipped with lifelong learning skills. One of the lifelong learningskills is self-directed learning. This study aimed to explore theM.Sc. nursing students’ self-directed learning activities.Methods: A qualitative design using conventional content analysisapproach was used in th...

1998
Reiko Heckel Berthold Hoffmann Peter Knirsch Sabine Kuske

The language Grace is being proposed for specifying and programming in a graph-centered environment based on graph transformation. Emphasis in the design of Grace is laid on modular structur-ing of programs. In this paper we present a simple kind of modules for the language which encapsulate rules and graph transformation units, and export some of them. The local transformation units deene comp...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه الزهراء - دانشکده علوم پایه 1391

در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...

Journal: :International Journal of Advanced Computer Science and Applications 2020

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید