List of Titles

OFFER: A Motif Dimensional Framework for Network Representation Learning

- Yu, Shuo, Xia, Feng, Xu, Jin, Chen, Zhikui, Lee, Ivan

Authors: Yu, Shuo , Xia, Feng , Xu, Jin , Chen, Zhikui , Lee, Ivan
Date: 2020
Type: Text , Conference proceedings
Relation: 29th ACM International Conference on Information and Knowledge Management, CIKM 2020 p. 3349-3352
Full Text: false
Reviewed:
Description: 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. © 2020 ACM.

Quick View

API : an index for quantifying a scholar's academic potential

- Ren, Jing, Wang, Lei, Wang, Kailai, Yu, Shuo, Hou, Mingliang, Lee, Ivan, Kong, Xiangje, Xia, Feng

Authors: Ren, Jing , Wang, Lei , Wang, Kailai , Yu, Shuo , Hou, Mingliang , Lee, Ivan , Kong, Xiangje , Xia, Feng
Date: 2019
Type: Text , Journal article
Relation: IEEE Access Vol. 7, no. (2019), p. 178675-178684
Full Text:
Reviewed:
Description: In the context of big scholarly data, various metrics and indicators have been widely applied to evaluate the impact of scholars from different perspectives, such as publication counts, citations, ${h}$-index, and their variants. However, these indicators have limited capacity in characterizing prospective impacts or achievements of scholars. To solve this problem, we propose the Academic Potential Index (API) to quantify scholar's academic potential. Furthermore, an algorithm is devised to calculate the value of API. It should be noted that API is a dynamic index throughout scholar's academic career. By applying API to rank scholars, we can identify scholars who show their academic potentials during the early academic careers. With extensive experiments conducted based on the Microsoft Academic Graph dataset, it can be found that the proposed index evaluates scholars' academic potentials effectively and captures the variation tendency of their academic impacts. Besides, we also apply this index to identify rising stars in academia. Experimental results show that the proposed API can achieve superior performance in identifying potential scholars compared with three baseline methods. © 2019 IEEE.

Quick View

DINE : a framework for deep incomplete network embedding

- Hou, Ke, Liu, Jiaying, Peng, Yin, Xu, Bo, Lee, Ivan, Xia, Feng

Authors: Hou, Ke , Liu, Jiaying , Peng, Yin , Xu, Bo , Lee, Ivan , Xia, Feng
Date: 2019
Type: Text , Conference paper
Relation: 32nd Australasian Joint Conference on Artificial Intelligence, AI 2019 Vol. 11919 LNAI, p. 165-176
Full Text:
Reviewed:
Description: Network representation learning (NRL) plays a vital role in a variety of tasks such as node classification and link prediction. It aims to learn low-dimensional vector representations for nodes based on network structures or node attributes. While embedding techniques on complete networks have been intensively studied, in real-world applications, it is still a challenging task to collect complete networks. To bridge the gap, in this paper, we propose a Deep Incomplete Network Embedding method, namely DINE. Specifically, we first complete the missing part including both nodes and edges in a partially observable network by using the expectation-maximization framework. To improve the embedding performance, we consider both network structures and node attributes to learn node representations. Empirically, we evaluate DINE over three networks on multi-label classification and link prediction tasks. The results demonstrate the superiority of our proposed approach compared against state-of-the-art baselines. © 2019, Springer Nature Switzerland AG.
Description: E1

Detecting outlier patterns with query-based artificially generated searching conditions

- Yu, Shuo, Xia, Feng, Sun, Yuchen, Tang, Tao, Yan, Xiaoran, Lee, Ivan

Authors: Yu, Shuo , Xia, Feng , Sun, Yuchen , Tang, Tao , Yan, Xiaoran , Lee, Ivan
Date: 2021
Type: Text , Journal article
Relation: IEEE Transactions on Computational Social Systems Vol. 8, no. 1 (2021), p. 134-147
Full Text: false
Reviewed:
Description: 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.

Quick View

Quantifying success in science : an overview

- Bai, Xiaomei, Pan, Habxiao, Hou, Jie, Guo, Teng, Lee, Ivan, Xia, Feng

Authors: Bai, Xiaomei , Pan, Habxiao , Hou, Jie , Guo, Teng , Lee, Ivan , Xia, Feng
Date: 2020
Type: Text , Journal article
Relation: IEEE Access Vol. 8, no. (2020), p. 123200-123214
Full Text:
Reviewed:
Description: 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. © 2013 IEEE.
Description: This work was supported in part by the Liaoning Provincial Key Research and Development Guidance Project under Grant 2018104021, and in part by the Liaoning Provincial Natural Fund Guidance Plan under Grant 20180550011.

Showing items 1 - 5 of 5