Data-driven computational social science : A survey
- Zhang, Jun, Wang, Wei, Xia, Feng, Lin, Yu-Ru, Tong, Hanghang
- Authors: Zhang, Jun , Wang, Wei , Xia, Feng , Lin, Yu-Ru , Tong, Hanghang
- Date: 2020
- Type: Text , Journal article
- Relation: Big Data Research Vol. 21, no. (2020), p. 1-22
- Full Text: false
- Reviewed:
- Description: Social science concerns issues on individuals, relationships, and the whole society. The complexity of research topics in social science makes it the amalgamation of multiple disciplines, such as economics, political science, and sociology, etc. For centuries, scientists have conducted many studies to understand the mechanisms of the society. However, due to the limitations of traditional research methods, there exist many critical social issues to be explored. To solve those issues, computational social science emerges due to the rapid advancements of computation technologies and the profound studies on social science. With the aids of the advanced research techniques, various kinds of data from diverse areas can be acquired nowadays, and they can help us look into social problems with a new eye. As a result, utilizing various data to reveal issues derived from computational social science area has attracted more and more attentions. In this paper, to the best of our knowledge, we present a survey on datadriven computational social science for the first time which primarily focuses on reviewing application domains involving human dynamics. The state-of-the-art research on human dynamics is reviewed from three aspects: individuals, relationships, and collectives. Specifically, the research methodologies used to address research challenges in aforementioned application domains are summarized. In addition, some important open challenges with respect to both emerging research topics and research methods are discussed.
DEFINE: friendship detection based on node enhancement
- Pan, Hanxiao, Guo, Teng, Bedru, Hayat, Qing, Qing, Zhang, Dongyu, Xia, Feng
- Authors: Pan, Hanxiao , Guo, Teng , Bedru, Hayat , Qing, Qing , Zhang, Dongyu , Xia, Feng
- Date: 2020
- Type: Text , Conference paper
- Relation: 31st Australasian Database Conference, ADC 2019 Vol. 12008 LNCS, p. 81-92
- Full Text:
- Reviewed:
- Description: Network representation learning (NRL) is a matter of importance to a variety of tasks such as link prediction. Learning low-dimensional vector representations for node enhancement based on nodes attributes and network structures can improve link prediction performance. Node attributes are important factors in forming networks, like psychological factors and appearance features affecting friendship networks. However, little to no work has detected friendship using the NRL technique, which combines students’ psychological features and perceived traits based on facial appearance. In this paper, we propose a framework named DEFINE (No enhancement based r e dship D tection) to detect students’ friend relationships, which combines with students’ psychological factors and facial perception information. To detect friend relationships accurately, DEFINE uses the NRL technique, which considers network structure and the additional attributes information for nodes. DEFINE transforms them into low-dimensional vector spaces while preserving the inherent properties of the friendship network. Experimental results on real-world friendship network datasets illustrate that DEFINE outperforms other state-of-art methods. © 2020, Springer Nature Switzerland AG.
- Description: E1
- Authors: Pan, Hanxiao , Guo, Teng , Bedru, Hayat , Qing, Qing , Zhang, Dongyu , Xia, Feng
- Date: 2020
- Type: Text , Conference paper
- Relation: 31st Australasian Database Conference, ADC 2019 Vol. 12008 LNCS, p. 81-92
- Full Text:
- Reviewed:
- Description: Network representation learning (NRL) is a matter of importance to a variety of tasks such as link prediction. Learning low-dimensional vector representations for node enhancement based on nodes attributes and network structures can improve link prediction performance. Node attributes are important factors in forming networks, like psychological factors and appearance features affecting friendship networks. However, little to no work has detected friendship using the NRL technique, which combines students’ psychological features and perceived traits based on facial appearance. In this paper, we propose a framework named DEFINE (No enhancement based r e dship D tection) to detect students’ friend relationships, which combines with students’ psychological factors and facial perception information. To detect friend relationships accurately, DEFINE uses the NRL technique, which considers network structure and the additional attributes information for nodes. DEFINE transforms them into low-dimensional vector spaces while preserving the inherent properties of the friendship network. Experimental results on real-world friendship network datasets illustrate that DEFINE outperforms other state-of-art methods. © 2020, Springer Nature Switzerland AG.
- Description: E1
The evolution of Turing Award Collaboration Network : bibliometric-level and network-level metrics
- Kong, Xiangjie, Shi, Yajie, Wang, Wei, Ma, Kai, Wan, Liangtian, Xia, Feng
- Authors: Kong, Xiangjie , Shi, Yajie , Wang, Wei , Ma, Kai , Wan, Liangtian , Xia, Feng
- Date: 2019
- Type: Text , Journal article
- Relation: IEEE Transactions on Computational Social Systems Vol. 6, no. 6 (2019), p. 1318-1328
- Full Text:
- Reviewed:
- Description: The year of 2017 for the 50th anniversary of the Turing Award, which represents the top-level award in the computer science field, is a milestone. We study the long-term evolution of the Turing Award Collaboration Network, and it can be considered as a microcosm of the computer science field from 1974 to 2016. First, scholars tend to publish articles by themselves at the early stages, and they began to focus on tight collaboration since the late 1980s. Second, compared with the same scale random network, although the Turing Award Collaboration Network has small-world properties, it is not a scale-free network. The reason may be that the number of collaborators per scholar is limited. It is impossible for scholars to connect to others freely (preferential attachment) as the scale-free network. Third, to measure how far a scholar is from the Turing Award, we propose a metric called the Turing Number (TN) and find that the TN decreases gradually over time. Meanwhile, we discover the phenomenon that scholars prefer to gather into groups to do research with the development of computer science. This article presents a new way to explore the evolution of academic collaboration network in the field of computer science by building and analyzing the Turing Award Collaboration Network for decades. © 2014 IEEE.
- Authors: Kong, Xiangjie , Shi, Yajie , Wang, Wei , Ma, Kai , Wan, Liangtian , Xia, Feng
- Date: 2019
- Type: Text , Journal article
- Relation: IEEE Transactions on Computational Social Systems Vol. 6, no. 6 (2019), p. 1318-1328
- Full Text:
- Reviewed:
- Description: The year of 2017 for the 50th anniversary of the Turing Award, which represents the top-level award in the computer science field, is a milestone. We study the long-term evolution of the Turing Award Collaboration Network, and it can be considered as a microcosm of the computer science field from 1974 to 2016. First, scholars tend to publish articles by themselves at the early stages, and they began to focus on tight collaboration since the late 1980s. Second, compared with the same scale random network, although the Turing Award Collaboration Network has small-world properties, it is not a scale-free network. The reason may be that the number of collaborators per scholar is limited. It is impossible for scholars to connect to others freely (preferential attachment) as the scale-free network. Third, to measure how far a scholar is from the Turing Award, we propose a metric called the Turing Number (TN) and find that the TN decreases gradually over time. Meanwhile, we discover the phenomenon that scholars prefer to gather into groups to do research with the development of computer science. This article presents a new way to explore the evolution of academic collaboration network in the field of computer science by building and analyzing the Turing Award Collaboration Network for decades. © 2014 IEEE.
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.
- 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.
Early-stage reciprocity in sustainable scientific collaboration
- Wang, Wei, Ren, Jing, Alrashoud, Mubarak, Xia, Feng, Mao, Mengyi, Tolba, Amr
- Authors: Wang, Wei , Ren, Jing , Alrashoud, Mubarak , Xia, Feng , Mao, Mengyi , Tolba, Amr
- Date: 2020
- Type: Text , Journal article
- Relation: Journal of Informetrics Vol. 14, no. 3 (2020), p.
- Full Text: false
- Reviewed:
- Description: Scientific collaboration is of significant importance in tackling grand challenges and breeding innovations. Despite the increasing interest in investigating and promoting scientific collaborations, we know little about the collaboration sustainability as well as mechanisms behind it. In this paper, we set out to study the relationships between early-stage reciprocity and collaboration sustainability. By proposing and defining h-index reciprocity, we give a comprehensive statistical analysis on how reciprocity influences scientific collaboration sustainability, and find that scholars are not altruism and the key to sustainable collaboration is fairness. The unfair h-index reciprocity has an obvious negative impact on collaboration sustainability. The bigger the reciprocity difference, the less sustainable in collaboration. This work facilitates understanding sustainable collaborations and thus will benefit both individual scholar in optimizing collaboration strategies and the whole academic society in improving teamwork efficiency. © 2020 Elsevier Ltd.
- Description: The authors extend their appreciation to the International Scientific Partnership Program ISPP at King Saud University for funding this research work through ISPP-78. This work is partially supported by China Postdoctoral Science Foundation ( 2019M651115 ).
Random walks : a review of algorithms and applications
- Xia, Feng, Liu, Jiaying, Nie, Hansong, Fu, Yonghao, Wan, Liangtian, Kong, Xiangjie
- Authors: Xia, Feng , Liu, Jiaying , Nie, Hansong , Fu, Yonghao , Wan, Liangtian , Kong, Xiangjie
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Transactions on Emerging Topics in Computational Intelligence Vol. 4, no. 2 (2020), p. 95-107
- Full Text:
- Reviewed:
- Description: A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science. Furthermore, in quantum mechanics, quantum walks can be regarded as quantum analogues of classical random walks. Classical random walks and quantum walks can be used to calculate the proximity between nodes and extract the topology in the network. Various random walk related models can be applied in different fields, which is of great significance to downstream tasks such as link prediction, recommendation, computer vision, semi-supervised learning, and network embedding. In this article, we aim to provide a comprehensive review of classical random walks and quantum walks. We first review the knowledge of classical random walks and quantum walks, including basic concepts and some typical algorithms. We also compare the algorithms based on quantum walks and classical random walks from the perspective of time complexity. Then we introduce their applications in the field of computer science. Finally we discuss the open issues from the perspectives of efficiency, main-memory volume, and computing time of existing algorithms. This study aims to contribute to this growing area of research by exploring random walks and quantum walks together. © 2017 IEEE.
- Authors: Xia, Feng , Liu, Jiaying , Nie, Hansong , Fu, Yonghao , Wan, Liangtian , Kong, Xiangjie
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Transactions on Emerging Topics in Computational Intelligence Vol. 4, no. 2 (2020), p. 95-107
- Full Text:
- Reviewed:
- Description: A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science. Furthermore, in quantum mechanics, quantum walks can be regarded as quantum analogues of classical random walks. Classical random walks and quantum walks can be used to calculate the proximity between nodes and extract the topology in the network. Various random walk related models can be applied in different fields, which is of great significance to downstream tasks such as link prediction, recommendation, computer vision, semi-supervised learning, and network embedding. In this article, we aim to provide a comprehensive review of classical random walks and quantum walks. We first review the knowledge of classical random walks and quantum walks, including basic concepts and some typical algorithms. We also compare the algorithms based on quantum walks and classical random walks from the perspective of time complexity. Then we introduce their applications in the field of computer science. Finally we discuss the open issues from the perspectives of efficiency, main-memory volume, and computing time of existing algorithms. This study aims to contribute to this growing area of research by exploring random walks and quantum walks together. © 2017 IEEE.
A shared bus profiling scheme for smart cities based on heterogeneous mobile crowdsourced data
- Kong, Xiangjie, Xia, Feng, Li, Jianxin, Hou, Mingliang, Li, Menglin, Xiang, Yong
- Authors: Kong, Xiangjie , Xia, Feng , Li, Jianxin , Hou, Mingliang , Li, Menglin , Xiang, Yong
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Transactions on Industrial Informatics Vol. 16, no. 2 (2020), p. 1436-1444
- Full Text:
- Reviewed:
- Description: Mobile crowdsourcing (MCS), as an effective and crucial technique of Industrial Internet of Things, is enabling smart city initiatives in the real world. It aims at incorporating the intelligence of dynamic crowds to collect and compute decentralized ubiquitous sensing data that can be used to solve major urbanization problems such as traffic congestion. The shared bus, as a neotype transportation mode, aims at improving the resource utilization rate and maintaining the advantages of convenience and economy. In this article, we provide a scheme to profile shared buses through heterogeneous mobile crowdsourced data (TRProfiling). First, we design an MCS-based shared bus data generation and collection solution to overcome the aforementioned data scarcity issue. Then, we propose a travel profiling to profile resident travel and design a method called multiconstraint evolution algorithm to optimize the routes. Experimental results demonstrate that TRProfiling has an excellent performance in satisfying passengers' travel requirements. © 2005-2012 IEEE.
- Authors: Kong, Xiangjie , Xia, Feng , Li, Jianxin , Hou, Mingliang , Li, Menglin , Xiang, Yong
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Transactions on Industrial Informatics Vol. 16, no. 2 (2020), p. 1436-1444
- Full Text:
- Reviewed:
- Description: Mobile crowdsourcing (MCS), as an effective and crucial technique of Industrial Internet of Things, is enabling smart city initiatives in the real world. It aims at incorporating the intelligence of dynamic crowds to collect and compute decentralized ubiquitous sensing data that can be used to solve major urbanization problems such as traffic congestion. The shared bus, as a neotype transportation mode, aims at improving the resource utilization rate and maintaining the advantages of convenience and economy. In this article, we provide a scheme to profile shared buses through heterogeneous mobile crowdsourced data (TRProfiling). First, we design an MCS-based shared bus data generation and collection solution to overcome the aforementioned data scarcity issue. Then, we propose a travel profiling to profile resident travel and design a method called multiconstraint evolution algorithm to optimize the routes. Experimental results demonstrate that TRProfiling has an excellent performance in satisfying passengers' travel requirements. © 2005-2012 IEEE.
The gene of scientific success
- Kong, Xiangjie, Zhang, Jun, Zhang, Da, Bu, Yi, Ding, Ying, Xia, Feng
- Authors: Kong, Xiangjie , Zhang, Jun , Zhang, Da , Bu, Yi , Ding, Ying , Xia, Feng
- Date: 2020
- Type: Text , Journal article
- Relation: ACM Transactions on Knowledge Discovery from Data Vol. 14, no. 4 (2020), p.
- Full Text:
- Reviewed:
- Description: This article elaborates how to identify and evaluate causal factors to improve scientific impact. Currently, analyzing scientific impact can be beneficial to various academic activities including funding application, mentor recommendation, discovering potential cooperators, and the like. It is universally acknowledged that high-impact scholars often have more opportunities to receive awards as an encouragement for their hard work. Therefore, scholars spend great efforts in making scientific achievements and improving scientific impact during their academic life. However, what are the determinate factors that control scholars' academic success? The answer to this question can help scholars conduct their research more efficiently. Under this consideration, our article presents and analyzes the causal factors that are crucial for scholars' academic success. We first propose five major factors including article-centered factors, author-centered factors, venue-centered factors, institution-centered factors, and temporal factors. Then, we apply recent advanced machine learning algorithms and jackknife method to assess the importance of each causal factor. Our empirical results show that author-centered and article-centered factors have the highest relevancy to scholars' future success in the computer science area. Additionally, we discover an interesting phenomenon that the h-index of scholars within the same institution or university are actually very close to each other. © 2020 ACM.
- Authors: Kong, Xiangjie , Zhang, Jun , Zhang, Da , Bu, Yi , Ding, Ying , Xia, Feng
- Date: 2020
- Type: Text , Journal article
- Relation: ACM Transactions on Knowledge Discovery from Data Vol. 14, no. 4 (2020), p.
- Full Text:
- Reviewed:
- Description: This article elaborates how to identify and evaluate causal factors to improve scientific impact. Currently, analyzing scientific impact can be beneficial to various academic activities including funding application, mentor recommendation, discovering potential cooperators, and the like. It is universally acknowledged that high-impact scholars often have more opportunities to receive awards as an encouragement for their hard work. Therefore, scholars spend great efforts in making scientific achievements and improving scientific impact during their academic life. However, what are the determinate factors that control scholars' academic success? The answer to this question can help scholars conduct their research more efficiently. Under this consideration, our article presents and analyzes the causal factors that are crucial for scholars' academic success. We first propose five major factors including article-centered factors, author-centered factors, venue-centered factors, institution-centered factors, and temporal factors. Then, we apply recent advanced machine learning algorithms and jackknife method to assess the importance of each causal factor. Our empirical results show that author-centered and article-centered factors have the highest relevancy to scholars' future success in the computer science area. Additionally, we discover an interesting phenomenon that the h-index of scholars within the same institution or university are actually very close to each other. © 2020 ACM.
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
- 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
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.
- 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.
Emergency warning messages dissemination in vehicular social networks: A trust based scheme
- Ullah, Noor, Kong, Xiangjie, Ning, Zhaolong, Tolba, Amr, Alrashoud, Mubarak, Xia, Feng
- Authors: Ullah, Noor , Kong, Xiangjie , Ning, Zhaolong , Tolba, Amr , Alrashoud, Mubarak , Xia, Feng
- Date: 2020
- Type: Text , Journal article
- Relation: Vehicular Communications Vol. 22 (2020)
- Full Text:
- Reviewed:
- Description: To ensure users' safety on the road, a plethora of dissemination schemes for Emergency Warning Messages (EWMs) have been proposed in vehicular networks. However, the issue of false alarms triggered by malicious users still poses serious challenges, such as disruption of vehicular traffic especially on highways leading to precarious effects. This paper proposes a novel Trust based Dissemination Scheme (TDS) for EWMs in Vehicular Social Networks (VSNs) to solve the aforementioned issue. To ensure the authenticity of EWMs, we exploit the user-post credibility network for identifying true and false alarms. Moreover, we develop a reputation mechanism by calculating a trust-score for each node based on its social-utility, behavior, and contribution in the network. We utilize the hybrid architecture of VSNs by employing social-groups based dissemination in Vehicle-to-Infrastructure (V2I) mode, whereas nodes' friendship-network in Vehicle-to-Vehicle (V2V) mode. We analyze the proposed scheme for accuracy by extensive simulations under varying malicious nodes ratio in the network. Furthermore, we compare the efficiency of TDS with state-of-the-art dissemination schemes in VSNs for delivery ratio, transmission delay, number of transmissions, and hop-count. The experimental results validate the significant efficacy of TDS in accuracy and aforementioned network parameters. © 2019 Elsevier Inc.
- Authors: Ullah, Noor , Kong, Xiangjie , Ning, Zhaolong , Tolba, Amr , Alrashoud, Mubarak , Xia, Feng
- Date: 2020
- Type: Text , Journal article
- Relation: Vehicular Communications Vol. 22 (2020)
- Full Text:
- Reviewed:
- Description: To ensure users' safety on the road, a plethora of dissemination schemes for Emergency Warning Messages (EWMs) have been proposed in vehicular networks. However, the issue of false alarms triggered by malicious users still poses serious challenges, such as disruption of vehicular traffic especially on highways leading to precarious effects. This paper proposes a novel Trust based Dissemination Scheme (TDS) for EWMs in Vehicular Social Networks (VSNs) to solve the aforementioned issue. To ensure the authenticity of EWMs, we exploit the user-post credibility network for identifying true and false alarms. Moreover, we develop a reputation mechanism by calculating a trust-score for each node based on its social-utility, behavior, and contribution in the network. We utilize the hybrid architecture of VSNs by employing social-groups based dissemination in Vehicle-to-Infrastructure (V2I) mode, whereas nodes' friendship-network in Vehicle-to-Vehicle (V2V) mode. We analyze the proposed scheme for accuracy by extensive simulations under varying malicious nodes ratio in the network. Furthermore, we compare the efficiency of TDS with state-of-the-art dissemination schemes in VSNs for delivery ratio, transmission delay, number of transmissions, and hop-count. The experimental results validate the significant efficacy of TDS in accuracy and aforementioned network parameters. © 2019 Elsevier Inc.
Network representation learning: From traditional feature learning to deep learning
- Sun, Ke, Wang, Lei, Xu, Bo, Zhao, Wenhong, Teng, Shyh, Xia, Feng
- Authors: Sun, Ke , Wang, Lei , Xu, Bo , Zhao, Wenhong , Teng, Shyh , Xia, Feng
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Access Vol. 8, no. (2020), p. 205600-205617
- Full Text:
- Reviewed:
- Description: Network representation learning (NRL) is an effective graph analytics technique and promotes users to deeply understand the hidden characteristics of graph data. It has been successfully applied in many real-world tasks related to network science, such as social network data processing, biological information processing, and recommender systems. Deep Learning is a powerful tool to learn data features. However, it is non-trivial to generalize deep learning to graph-structured data since it is different from the regular data such as pictures having spatial information and sounds having temporal information. Recently, researchers proposed many deep learning-based methods in the area of NRL. In this survey, we investigate classical NRL from traditional feature learning method to the deep learning-based model, analyze relationships between them, and summarize the latest progress. Finally, we discuss open issues considering NRL and point out the future directions in this field. © 2020 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.
- Authors: Sun, Ke , Wang, Lei , Xu, Bo , Zhao, Wenhong , Teng, Shyh , Xia, Feng
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Access Vol. 8, no. (2020), p. 205600-205617
- Full Text:
- Reviewed:
- Description: Network representation learning (NRL) is an effective graph analytics technique and promotes users to deeply understand the hidden characteristics of graph data. It has been successfully applied in many real-world tasks related to network science, such as social network data processing, biological information processing, and recommender systems. Deep Learning is a powerful tool to learn data features. However, it is non-trivial to generalize deep learning to graph-structured data since it is different from the regular data such as pictures having spatial information and sounds having temporal information. Recently, researchers proposed many deep learning-based methods in the area of NRL. In this survey, we investigate classical NRL from traditional feature learning method to the deep learning-based model, analyze relationships between them, and summarize the latest progress. Finally, we discuss open issues considering NRL and point out the future directions in this field. © 2020 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.
Deep matrix factorization for trust-aware recommendation in social networks
- Wan, Liangtian, Xia, Feng, Kong, Xiangjie, Hsu, Ching-Hsien, Huang, Runhe, Ma, Jianhua
- Authors: Wan, Liangtian , Xia, Feng , Kong, Xiangjie , Hsu, Ching-Hsien , Huang, Runhe , Ma, Jianhua
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Transactions on Network Science and Engineering Vol. 8, no. 1 (2021), p. 511-528
- Full Text:
- Reviewed:
- Description: Recent years have witnessed remarkable information overload in online social networks, and social network based approaches for recommender systems have been widely studied. The trust information in social networks among users is an important factor for improving recommendation performance. Many successful recommendation tasks are treated as the matrix factorization problems. However, the prediction performance of matrix factorization based methods largely depends on the matrixes initialization of users and items. To address this challenge, we develop a novel trust-aware approach based on deep learning to alleviate the initialization dependence. First, we propose two deep matrix factorization (DMF) techniques, i.e., linear DMF and non-linear DMF to extract features from the user-item rating matrix for improving the initialization accuracy. The trust relationship is integrated into the DMF model according to the preference similarity and the derivations of users on items. Second, we exploit deep marginalized Denoising Autoencoder (Deep-MDAE) to extract the latent representation in the hidden layer from the trust relationship matrix to approximate the user factor matrix factorized from the user-item rating matrix. The community regularization is integrated in the joint optimization function to take neighbours' effects into consideration. The results of DMF are applied to initialize the updating variables of Deep-MDAE in order to further improve the recommendation performance. Finally, we validate that the proposed approach outperforms state-of-the-art baselines for recommendation, especially for the cold-start users. © 2013 IEEE.
- Authors: Wan, Liangtian , Xia, Feng , Kong, Xiangjie , Hsu, Ching-Hsien , Huang, Runhe , Ma, Jianhua
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Transactions on Network Science and Engineering Vol. 8, no. 1 (2021), p. 511-528
- Full Text:
- Reviewed:
- Description: Recent years have witnessed remarkable information overload in online social networks, and social network based approaches for recommender systems have been widely studied. The trust information in social networks among users is an important factor for improving recommendation performance. Many successful recommendation tasks are treated as the matrix factorization problems. However, the prediction performance of matrix factorization based methods largely depends on the matrixes initialization of users and items. To address this challenge, we develop a novel trust-aware approach based on deep learning to alleviate the initialization dependence. First, we propose two deep matrix factorization (DMF) techniques, i.e., linear DMF and non-linear DMF to extract features from the user-item rating matrix for improving the initialization accuracy. The trust relationship is integrated into the DMF model according to the preference similarity and the derivations of users on items. Second, we exploit deep marginalized Denoising Autoencoder (Deep-MDAE) to extract the latent representation in the hidden layer from the trust relationship matrix to approximate the user factor matrix factorized from the user-item rating matrix. The community regularization is integrated in the joint optimization function to take neighbours' effects into consideration. The results of DMF are applied to initialize the updating variables of Deep-MDAE in order to further improve the recommendation performance. Finally, we validate that the proposed approach outperforms state-of-the-art baselines for recommendation, especially for the cold-start users. © 2013 IEEE.
MODEL : motif-based deep feature learning for link prediction
- Wang, Lei, Ren, Jing, Xu, Bo, Li, Jianxin, Luo, Wei, Xia, Feng
- Authors: Wang, Lei , Ren, Jing , Xu, Bo , Li, Jianxin , Luo, Wei , Xia, Feng
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Transactions on Computational Social Systems Vol. 7, no. 2 (2020), p. 503-516
- Full Text:
- Reviewed:
- Description: Link prediction plays an important role in network analysis and applications. Recently, approaches for link prediction have evolved from traditional similarity-based algorithms into embedding-based algorithms. However, most existing approaches fail to exploit the fact that real-world networks are different from random networks. In particular, real-world networks are known to contain motifs, natural network building blocks reflecting the underlying network-generating processes. In this article, we propose a novel embedding algorithm that incorporates network motifs to capture higher order structures in the network. To evaluate its effectiveness for link prediction, experiments were conducted on three types of networks: social networks, biological networks, and academic networks. The results demonstrate that our algorithm outperforms both the traditional similarity-based algorithms (by 20%) and the state-of-the-art embedding-based algorithms (by 19%). © 2014 IEEE.
- Authors: Wang, Lei , Ren, Jing , Xu, Bo , Li, Jianxin , Luo, Wei , Xia, Feng
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Transactions on Computational Social Systems Vol. 7, no. 2 (2020), p. 503-516
- Full Text:
- Reviewed:
- Description: Link prediction plays an important role in network analysis and applications. Recently, approaches for link prediction have evolved from traditional similarity-based algorithms into embedding-based algorithms. However, most existing approaches fail to exploit the fact that real-world networks are different from random networks. In particular, real-world networks are known to contain motifs, natural network building blocks reflecting the underlying network-generating processes. In this article, we propose a novel embedding algorithm that incorporates network motifs to capture higher order structures in the network. To evaluate its effectiveness for link prediction, experiments were conducted on three types of networks: social networks, biological networks, and academic networks. The results demonstrate that our algorithm outperforms both the traditional similarity-based algorithms (by 20%) and the state-of-the-art embedding-based algorithms (by 19%). © 2014 IEEE.
- Ullah, Noor, Kong, Xiangjie, Lin, Limei, Alrashoud, Mubarak, Tolba, Amr, Xia, Feng
- Authors: Ullah, Noor , Kong, Xiangjie , Lin, Limei , Alrashoud, Mubarak , Tolba, Amr , Xia, Feng
- Date: 2020
- Type: Text , Journal article
- Relation: Computer Networks Vol. 182, no. (2020), p.
- Full Text: false
- Reviewed:
- Description: This paper addresses the issues of selfishness, limited network resources, and their adverse effects on real-time dissemination of Emergency Warning Messages (EWMs) in modern Autonomous Moving Platforms (AMPs) such as Vehicular Social Networks (VSNs). For this purpose, we propose a social intelligence based identification mechanism to differentiate between a selfish and a cooperative node in the network. Therefore, we devise a crowdsensing based mechanism to calculate a tie-strength value based on several social metrics. Moreover, we design a recursive evolutionary algorithm for each node's reputation calculation and update. Given that, then we estimate each node's state-transition probability to select a super-spreader for rapid dissemination. In order to ensure a seamless and reliable dissemination process, we incorporate 5G network structure instead of conventional short range communication which is used in most vehicular networks at present. Finally, we design a real-time dissemination algorithm for EWMs and evaluate its performance in terms of network parameters such as delivery-ratio, delay, hop-count, and message-overhead for varying values of vehicular density, speed, and selfish nodes’ density based on realistic vehicular mobility traces. In addition, we present a comparative analysis of the performance of the proposed scheme with state-of-the-art dissemination schemes in VSNs. © 2020 Elsevier B.V.
Community-diversified influence maximization in social networks
- Li, Jianxin, Cai, Taotao, Deng, Ke, Wang, Xinjue, Sellis, Timos, Xia, Feng
- Authors: Li, Jianxin , Cai, Taotao , Deng, Ke , Wang, Xinjue , Sellis, Timos , Xia, Feng
- Date: 2020
- Type: Text , Journal article
- Relation: Information Systems Vol. 92, no. (2020), p.
- Full Text: false
- Reviewed:
- Description: To meet the requirement of social influence analytics in various applications, the problem of influence maximization has been studied in recent years. The aim is to find a limited number of nodes (i.e., users) which can activate (i.e. influence) the maximum number of nodes in social networks. However, the community diversity of influenced users is largely ignored even though it has unique value in practice. For example, the higher community diversity reduces the risk of marketing campaigns as you should not put all your eggs in one basket; the diversity can also prolong the effect of a marketing campaign in the future promotion. Motivated by this observation, this paper investigates Community-diversified Influence Maximization (CDIM) problem to efficiently find k nodes such that, if a message is initiated and spread by the k nodes, the number as well as the community diversity of the activated nodes will be maximized at the end of propagation process. This work proposes a metric to measure the community-diversified influence and addresses a series of computational challenges. Two algorithms and an innovative CPSP-Tree index have been developed. This study also investigates the situation that community definition is not specified. The effectiveness and efficiency of the proposed solutions have been verified through extensive experimental studies on five real-world social network datasets. © 2020 Elsevier Ltd
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.
- 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.
Deep Reinforcement Learning for Vehicular Edge Computing: An Intelligent Offloading System
- Ning, Zhaolong, Dong, Peiran, Wang, Xiaojie, Rodrigues, Joel, Xia, Feng
- Authors: Ning, Zhaolong , Dong, Peiran , Wang, Xiaojie , Rodrigues, Joel , Xia, Feng
- Date: 2019
- Type: Text , Journal article
- Relation: ACM Transactions on Intelligent Systems and Technology Vol. 10, no. 6 (Dec 2019), p. 24
- Full Text:
- Reviewed:
- Description: The development of smart vehicles brings drivers and passengers a comfortable and safe environment. Various emerging applications are promising to enrich users' traveling experiences and daily life. However, how to execute computing-intensive applications on resource-constrained vehicles still faces huge challenges. In this article, we construct an intelligent offloading system for vehicular edge computing by leveraging deep reinforcement learning. First, both the communication and computation states are modelled by finite Markov chains. Moreover, the task scheduling and resource allocation strategy is formulated as a joint optimization problem to maximize users' Quality of Experience (QoE). Due to its complexity, the original problem is further divided into two sub-optimization problems. A two-sided matching scheme and a deep reinforcement learning approach are developed to schedule offloading requests and allocate network resources, respectively. Performance evaluations illustrate the effectiveness and superiority of our constructed system.
- Authors: Ning, Zhaolong , Dong, Peiran , Wang, Xiaojie , Rodrigues, Joel , Xia, Feng
- Date: 2019
- Type: Text , Journal article
- Relation: ACM Transactions on Intelligent Systems and Technology Vol. 10, no. 6 (Dec 2019), p. 24
- Full Text:
- Reviewed:
- Description: The development of smart vehicles brings drivers and passengers a comfortable and safe environment. Various emerging applications are promising to enrich users' traveling experiences and daily life. However, how to execute computing-intensive applications on resource-constrained vehicles still faces huge challenges. In this article, we construct an intelligent offloading system for vehicular edge computing by leveraging deep reinforcement learning. First, both the communication and computation states are modelled by finite Markov chains. Moreover, the task scheduling and resource allocation strategy is formulated as a joint optimization problem to maximize users' Quality of Experience (QoE). Due to its complexity, the original problem is further divided into two sub-optimization problems. A two-sided matching scheme and a deep reinforcement learning approach are developed to schedule offloading requests and allocate network resources, respectively. Performance evaluations illustrate the effectiveness and superiority of our constructed system.
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:
- 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.
- 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:
- 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.
TOSNet : a topic-based optimal subnetwork identification in academic networks
- Bedru, Hayat, Zhao, Wenhong, Alrashoud, Mubarak, Tolba, Amr, Guo, He, Xia, Feng
- Authors: Bedru, Hayat , Zhao, Wenhong , Alrashoud, Mubarak , Tolba, Amr , Guo, He , Xia, Feng
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Access Vol. 8, no. (2020), p. 201015-201027
- Full Text:
- Reviewed:
- Description: Subnetwork identification plays a significant role in analyzing, managing, and comprehending the structure and functions in big networks. Numerous approaches have been proposed to solve the problem of subnetwork identification as well as community detection. Most of the methods focus on detecting communities by considering node attributes, edge information, or both. This study focuses on discovering subnetworks containing researchers with similar or related areas of interest or research topics. A topic- aware subnetwork identification is essential to discover potential researchers on particular research topics and provide qualitywork. Thus, we propose a topic-based optimal subnetwork identification approach (TOSNet). Based on some fundamental characteristics, this paper addresses the following problems: 1)How to discover topic-based subnetworks with a vigorous collaboration intensity? 2) How to rank the discovered subnetworks and single out one optimal subnetwork? We evaluate the performance of the proposed method against baseline methods by adopting the modularity measure, assess the accuracy based on the size of the identified subnetworks, and check the scalability for different sizes of benchmark networks. The experimental findings indicate that our approach shows excellent performance in identifying contextual subnetworks that maintain intensive collaboration amongst researchers for a particular research topic. © 2020 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.
- Authors: Bedru, Hayat , Zhao, Wenhong , Alrashoud, Mubarak , Tolba, Amr , Guo, He , Xia, Feng
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Access Vol. 8, no. (2020), p. 201015-201027
- Full Text:
- Reviewed:
- Description: Subnetwork identification plays a significant role in analyzing, managing, and comprehending the structure and functions in big networks. Numerous approaches have been proposed to solve the problem of subnetwork identification as well as community detection. Most of the methods focus on detecting communities by considering node attributes, edge information, or both. This study focuses on discovering subnetworks containing researchers with similar or related areas of interest or research topics. A topic- aware subnetwork identification is essential to discover potential researchers on particular research topics and provide qualitywork. Thus, we propose a topic-based optimal subnetwork identification approach (TOSNet). Based on some fundamental characteristics, this paper addresses the following problems: 1)How to discover topic-based subnetworks with a vigorous collaboration intensity? 2) How to rank the discovered subnetworks and single out one optimal subnetwork? We evaluate the performance of the proposed method against baseline methods by adopting the modularity measure, assess the accuracy based on the size of the identified subnetworks, and check the scalability for different sizes of benchmark networks. The experimental findings indicate that our approach shows excellent performance in identifying contextual subnetworks that maintain intensive collaboration amongst researchers for a particular research topic. © 2020 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.