نتایج جستجو برای: self centered graph
تعداد نتایج: 760711 فیلتر نتایج به سال:
Object localization aims to generate a tight bounding box for the target object, which is challenging problem that has been deeply studied in recent years. Since collecting bounding-box labels time-consuming and laborious, many researchers focus on weakly supervised object (WSOL). As appealing self-supervised learning technique shows its powerful function visual tasks, this paper, we take early...
Due to the complementary nature of graph neural networks and structured data in recommendations, recommendation systems using network techniques have become mainstream. However, there are still problems, such as sparse supervised signals interaction noise, task. Therefore, this paper proposes a self-supervised attention collaborative filtering for (SGACF). The correlation between adjacent nodes...
The problem of link prediction in temporal networks has attracted considerable recent attention from various domains, such as sociology, anthropology, information science, and computer science. In this paper, we propose a fast similarity-based method to predict the potential links in temporal networks. In this method, we first combine the snapshots of the temporal network into a weighted graph....
We investigate the existence of deterministic uniform self-stabilizing algorithms (DUSSAs) for a number or problems on connected undirected graphs. This investigation is carried out under three models of parallelism, namely central daemon, restricted parallelism, and maximal paral-lelism. We observe that for several problems including 2-coloring odd-degree complete bipartite graphs, 2-coloring ...
The clique graph of a graph G is the intersection graph K(G) of the (maximal) cliques of G. A graph G is called self-clique whenever G ∼= K(G). This paper gives various constructions of self-clique graphs. In particular, we employ (r, g)-cages to construct self-clique graphs whose set of clique-sizes is any given finite set of integers greater than 1.
This paper addresses the issue of learning graph edit distance cost functions for numerically labeled graphs from a corpus of sample graphs. We propose a system of self-organizing maps representing attribute distance spaces that encode edit operation costs. The selforganizing maps are iteratively adapted to minimize the edit distance of those graphs that are required to be similar. To demonstra...
Psychopathic personality traits are associated with risky sexual behavior (RSB), which itself is associated with various negative consequences. The present study extended previous cross-sectional research by examining whether psychopathic personality traits predicted RSB among women and whether these traits moderated associations between RSB and post-RSB psychological adjustment. Seventyseven f...
conclusions according to the result of this study, the presence of families in a treatment plan could be essential to follow the treatment plan and subsequently reduced the complications of hemodialysis. results the mean ages of the patients in patient-centered and the family-oriented groups were 47.41 ± 10.31 and 48.16 ± 9.21, respectively. the result showed that some of the variables such as ...
abstract the aim of the present study is to explore the impact of the cognitive reading strategy instruction on learners reading self-efficacy and their reading achievement. in order to fulfill this purpose, from 120 participants, 90 intermediate efl learners as an experimental group were chosen from three different educational settings namely, yazd university, yazd science and art un...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید