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

Motifs in big networks : methods and applications

- Yu, Shuo, Xu, Jin, Zhang, Chen, Xia, Feng, Almakhadmeh, Zafer, Tolba, Amr

Authors: Yu, Shuo , Xu, Jin , Zhang, Chen , Xia, Feng , Almakhadmeh, Zafer , Tolba, Amr
Date: 2019
Type: Text , Journal article
Relation: IEEE Access Vol. 7, no. (2019), p. 183322-183338
Full Text:
Reviewed:
Description: Motifs have been recognized as basic network blocks and are found to be quite powerful in modeling certain patterns. Generally speaking, local characteristics of big networks could be reflected in network motifs. Over the years, motifs have attracted a lot of attention from researchers. However, most current literature reviews on motifs generally focus on the field of biological science. In contrast, here we try to present a comprehensive survey on motifs in the context of big networks. We introduce the definition of motifs and other related concepts. Big networks with motif-based structures are analyzed. Specifically, we respectively analyze four kinds of networks, including biological networks, social networks, academic networks, and infrastructure networks. We then examine methods for motif discovery, motif counting, and motif clustering. The applications of motifs in different areas have also been reviewed. Finally, some challenges and open issues in this direction are discussed. © 2013 IEEE.

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.

Showing items 1 - 4 of 4