1,485 research outputs found
OFFER: A Motif Dimensional Framework for Network Representation Learning
Aiming at better representing multivariate relationships, this paper
investigates a motif dimensional framework for higher-order graph learning. The
graph learning effectiveness can be improved through OFFER. The proposed
framework mainly aims at accelerating and improving higher-order graph learning
results. We apply the acceleration procedure from the dimensional of network
motifs. Specifically, the refined degree for nodes and edges are conducted in
two stages: (1) employ motif degree of nodes to refine the adjacency matrix of
the network; and (2) employ motif degree of edges to refine the transition
probability matrix in the learning process. In order to assess the efficiency
of the proposed framework, four popular network representation algorithms are
modified and examined. By evaluating the performance of OFFER, both link
prediction results and clustering results demonstrate that the graph
representation learning algorithms enhanced with OFFER consistently outperform
the original algorithms with higher efficiency
CHIEF : clustering With higher-order motifs in big networks
Clustering network vertices is an enabler of various applications such as social computing and Internet of Things. However, challenges arise for clustering when networks increase in scale. This paper proposes CHIEF (Clustering with HIgher-ordEr motiFs), a solution which consists of two motif clustering techniques: standard acceleration CHIEF-ST and approximate acceleration CHIEF-AP. Both algorithms firstly find the maximal -edge-connected subgraphs within the target networks to lower the network scale by optimizing the network structure with maximal -edge-connected subgraphs, and then use heterogeneous four-node motifs clustering in higher-order dense networks. For CHIEF-ST, we illustrate that all target motifs will be kept after this procedure when the minimum node degree of the target motif is equal or greater than . For CHIEF-AP, we prove that the eigenvalues of the adjacency matrix and the Laplacian matrix are relatively stable after this step. CHIEF offers an improved efficiency of motif clustering for big networks, and it verifies higher-order motif significance. Experiments on real and synthetic networks demonstrate that the proposed solutions outperform baseline approaches in large network analysis, and higher-order motifs outperform traditional triangle motifs in clustering. © 2022 IEEE Computer Society. All rights reserved
Graph learning for anomaly analytics : algorithms, applications, and challenges
Anomaly analytics is a popular and vital task in various research contexts that has been studied for several decades. At the same time, deep learning has shown its capacity in solving many graph-based tasks, like node classification, link prediction, and graph classification. Recently, many studies are extending graph learning models for solving anomaly analytics problems, resulting in beneficial advances in graph-based anomaly analytics techniques. In this survey, we provide a comprehensive overview of graph learning methods for anomaly analytics tasks. We classify them into four categories based on their model architectures, namely graph convolutional network, graph attention network, graph autoencoder, and other graph learning models. The differences between these methods are also compared in a systematic manner. Furthermore, we outline several graph-based anomaly analytics applications across various domains in the real world. Finally, we discuss five potential future research directions in this rapidly growing field. © 2023 Association for Computing Machinery
Detecting outlier patterns with query-based artificially generated searching conditions
In the age of social computing, finding interesting network patterns or motifs is significant and critical for various areas, such as decision intelligence, intrusion detection, medical diagnosis, social network analysis, fake news identification, and national security. However, subgraph matching remains a computationally challenging problem, let alone identifying special motifs among them. This is especially the case in large heterogeneous real-world networks. In this article, we propose an efficient solution for discovering and ranking human behavior patterns based on network motifs by exploring a user's query in an intelligent way. Our method takes advantage of the semantics provided by a user's query, which in turn provides the mathematical constraint that is crucial for faster detection. We propose an approach to generate query conditions based on the user's query. In particular, we use meta paths between the nodes to define target patterns as well as their similarities, leading to efficient motif discovery and ranking at the same time. The proposed method is examined in a real-world academic network using different similarity measures between the nodes. The experiment result demonstrates that our method can identify interesting motifs and is robust to the choice of similarity measures. © 2014 IEEE
Heterogeneous graph learning for explainable recommendation over academic networks
With the explosive growth of new graduates with research degrees every year, unprecedented challenges arise for early-career researchers to find a job at a suitable institution. This study aims to understand the behavior of academic job transition and hence recommend suitable institutions for PhD graduates. Specifically, we design a deep learning model to predict the career move of early-career researchers and provide suggestions. The design is built on top of scholarly/academic networks, which contains abundant information about scientific collaboration among scholars and institutions. We construct a heterogeneous scholarly network to facilitate the exploring of the behavior of career moves and the recommendation of institutions for scholars. We devise an unsupervised learning model called HAI (Heterogeneous graph Attention InfoMax) which aggregates attention mechanism and mutual information for institution recommendation. Moreover, we propose scholar attention and meta-path attention to discover the hidden relationships between several meta-paths. With these mechanisms, HAI provides ordered recommendations with explainability. We evaluate HAI upon a real-world dataset against baseline methods. Experimental results verify the effectiveness and efficiency of our approach. © 2021 ACM
Quantifying Success in Science: An Overview
Quantifying success in science plays a key role in guiding funding
allocations, recruitment decisions, and rewards. Recently, a significant amount
of progresses have been made towards quantifying success in science. This lack
of detailed analysis and summary continues a practical issue. The literature
reports the factors influencing scholarly impact and evaluation methods and
indices aimed at overcoming this crucial weakness. We focus on categorizing and
reviewing the current development on evaluation indices of scholarly impact,
including paper impact, scholar impact, and journal impact. Besides, we
summarize the issues of existing evaluation methods and indices, investigate
the open issues and challenges, and provide possible solutions, including the
pattern of collaboration impact, unified evaluation standards, implicit success
factor mining, dynamic academic network embedding, and scholarly impact
inflation. This paper should help the researchers obtaining a broader
understanding of quantifying success in science, and identifying some potential
research directions
- …