CenGCN : centralized convolutional networks with vertex imbalance for scale-free graphs
- Authors: Xia, Feng , Wang, Lei , Tang, Tao , Chen, Xin , Kong, Xiangjie , Oatley, Giles , King, Irwin
- Date: 2023
- Type: Text , Journal article
- Relation: IEEE Transactions on Knowledge and Data Engineering Vol. 35, no. 5 (2023), p. 4555-4569
- Full Text:
- Reviewed:
- Description: Graph Convolutional Networks (GCNs) have achieved impressive performance in a wide variety of areas, attracting considerable attention. The core step of GCNs is the information-passing framework that considers all information from neighbors to the central vertex to be equally important. Such equal importance, however, is inadequate for scale-free networks, where hub vertices propagate more dominant information due to vertex imbalance. In this paper, we propose a novel centrality-based framework named CenGCN to address the inequality of information. This framework first quantifies the similarity between hub vertices and their neighbors by label propagation with hub vertices. Based on this similarity and centrality indices, the framework transforms the graph by increasing or decreasing the weights of edges connecting hub vertices and adding self-connections to vertices. In each non-output layer of the GCN, this framework uses a hub attention mechanism to assign new weights to connected non-hub vertices based on their common information with hub vertices. We present two variants CenGCN_D and CenGCN_E, based on degree centrality and eigenvector centrality, respectively. We also conduct comprehensive experiments, including vertex classification, link prediction, vertex clustering, and network visualization. The results demonstrate that the two variants significantly outperform state-of-the-art baselines. © 1989-2012 IEEE.
Data-efficient graph learning meets ethical challenges
- Authors: Tang, Tao
- Date: 2023
- Type: Text , Conference paper
- Relation: 16th ACM International Conference on Web Search and Data Mining, WSDM 2023, Singapore, 27 February to 3 March 2023, WSDM 2023 - Proceedings of the 16th ACM International Conference on Web Search and Data Mining p. 1218-1219
- Full Text: false
- Reviewed:
- Description: Recommender systems have achieved great success in our daily life. In recent years, the ethical concerns of AI systems have gained lots of attention. At the same time, graph learning techniques are powerful in modelling the complex relations among users and items under recommender system applications. These graph learning- based methods are data hungry, which brought a significant data efficiency challenge. In this proposal, I introduce my PhD research from three aspects: 1) Efficient privacy-preserving recommendation for imbalanced data. 2) Efficient recommendation model training for Insufficient samples. 3) Explainability in the social recommendation. Challenges and solutions of the above research problems have been proposed in this proposal. © 2023 Owner/Author.
Collaborative filtering with network representation learning for citation recommendation
- Authors: Wang, Wei , Tang, Tao , Xia, Feng , Gong, Zhiguo , Chen, Zhikui , Liu, Huan
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Transactions on Big Data Vol. 8, no. 5 (2022), p. 1233-1246
- Full Text:
- Reviewed:
- Description: Citation recommendation plays an important role in the context of scholarly big data, where finding relevant papers has become more difficult because of information overload. Applying traditional collaborative filtering (CF) to citation recommendation is challenging due to the cold start problem and the lack of paper ratings. To address these challenges, in this article, we propose a collaborative filtering with network representation learning framework for citation recommendation, namely CNCRec, which is a hybrid user-based CF considering both paper content and network topology. It aims at recommending citations in heterogeneous academic information networks. CNCRec creates the paper rating matrix based on attributed citation network representation learning, where the attributes are topics extracted from the paper text information. Meanwhile, the learned representations of attributed collaboration network is utilized to improve the selection of nearest neighbors. By harnessing the power of network representation learning, CNCRec is able to make full use of the whole citation network topology compared with previous context-aware network-based models. Extensive experiments on both DBLP and APS datasets show that the proposed method outperforms state-of-the-art methods in terms of precision, recall, and MRR (Mean Reciprocal Rank). Moreover, CNCRec can better solve the data sparsity problem compared with other CF-based baselines. © 2015 IEEE.
Digital twin mobility profiling : a spatio-temporal graph learning approach
- Authors: Chen, Xin , Hou, Mingliang , Tang, Tao , Kaur, Achhardeep , Xia, Feng
- Date: 2022
- Type: Text , Conference paper
- Relation: 23rd IEEE International Conference on High Performance Computing and Communications, 7th IEEE International Conference on Data Science and Systems, 19th IEEE International Conference on Smart City and 7th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Applications, HPCC-DSS-SmartCity-DependSys 2021, Hainan, China, 20-22 December 2021, Proceedings 2021 IEEE 23rd International Conference on High Performance Computing & Communications, 7th International Conference on Data Science & Systems 19th International Conference on Smart City 7th International Conference on Dependability in Sensor, Cloud & Big Data Systems & Applications p. 1178-1187
- Full Text: false
- Reviewed:
- Description: With the arrival of the big data era, mobility profiling has become a viable method of utilizing enormous amounts of mobility data to create an intelligent transportation system. Mobility profiling can extract potential patterns in urban traffic from mobility data and is critical for a variety of traffic-related applications. However, due to the high level of complexity and the huge amount of data, mobility profiling faces huge challenges. Digital Twin (DT) technology paves the way for cost-effective and performance-optimised management by digitally creating a virtual representation of the network to simulate its behaviour. In order to capture the complex spatio-temporal features in traffic scenario, we construct alignment diagrams to assist in completing the spatio-temporal correlation representation and design dilated alignment convolution network (DACN) to learn the fine-grained correlations, i.e., spatio-temporal interactions. We propose a digital twin mobility profiling (DTMP) framework to learn node profiles on a mobility network DT model. Extensive experiments have been conducted upon three real-world datasets. Experimental results demonstrate the effectiveness of DTMP. © 2021 IEEE.
Attributed collaboration network embedding for academic relationship mining
- Authors: Wang, Wei , Liu, Jiaying , Tang, Tao , Tuarob, Suppawong , Xia, Feng , Gong, Zhiguo , King, Irwin
- Date: 2021
- Type: Text , Journal article
- Relation: ACM Transactions on the Web Vol. 15, no. 1 (2021), p.
- Full Text:
- Reviewed:
- Description: Finding both efficient and effective quantitative representations for scholars in scientific digital libraries has been a focal point of research. The unprecedented amounts of scholarly datasets, combined with contemporary machine learning and big data techniques, have enabled intelligent and automatic profiling of scholars from this vast and ever-increasing pool of scholarly data. Meanwhile, recent advance in network embedding techniques enables us to mitigate the challenges of large scale and sparsity of academic collaboration networks. In real-world academic social networks, scholars are accompanied with various attributes or features, such as co-authorship and publication records, which result in attributed collaboration networks. It has been observed that both network topology and scholar attributes are important in academic relationship mining. However, previous studies mainly focus on network topology, whereas scholar attributes are overlooked. Moreover, the influence of different scholar attributes are unclear. To bridge this gap, in this work, we present a novel framework of Attributed Collaboration Network Embedding (ACNE) for academic relationship mining. ACNE extracts four types of scholar attributes based on the proposed scholar profiling model, including demographics, research, influence, and sociability. ACNE can learn a low-dimensional representation of scholars considering both scholar attributes and network topology simultaneously. We demonstrate the effectiveness and potentials of ACNE in academic relationship mining by performing collaborator recommendation on two real-world datasets and the contribution and importance of each scholar attribute on scientific collaborator recommendation is investigated. Our work may shed light on academic relationship mining by taking advantage of attributed collaboration network embedding. © 2020 ACM.
Detecting outlier patterns with query-based artificially generated searching conditions
- 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:
- 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.
Heterogeneous graph learning for explainable recommendation over academic networks
- Authors: Chen, Xiangtai , Tang, Tao , Ren, Jing , Lee, Ivan , Chen, Honglong , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 2021 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, WI-IAT 2021, Virtual, Online, 14-17 December 2021, ACM International Conference Proceeding Series p. 29-36
- Full Text:
- Reviewed:
- Description: 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.
KIDNet : a knowledge-aware neural network model for academic performance prediction
- Authors: Tang, Tao , Hou, Jie , Guo, Teng , Bai, Xiaomei , Tian, Xue , Noori Hoshyar, Azadeh
- Date: 2021
- Type: Text , Conference paper
- Relation: 2021 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, WI-IAT 2021, Virtual, Online14-17 December 2021, ACM International Conference Proceeding Series p. 37-44
- Full Text: false
- Reviewed:
- Description: Academic performance prediction and analysis in educational data mining is meaningful for instructors to know the student's ongoing learning status, and also provide appropriate help to students as early as possible if academic difficulties appear. In this paper, we first collect the basic information of students and courses as features. Then, we propose a novel knowledge extraction framework to obtain course knowledge features to reinforce feature groups. The comparative analyses of the knowledge similarity and average grades of the courses in all terms demonstrate a strong correlation between them. Furthermore, we build the Knowledge Interaction Discovery Network (KIDNet) model, based on factorization machine (FM) and deep neural network (DNN) algorithms. This model uses FM to model lower-order interactions of sparse features and employs DNN to model higher-order interactions of both dense and sparse features. The effectiveness of KIDNet has been validated by conducting experiments based on a real-world dataset. © 2021 ACM.