In your face : sentiment analysis of metaphor with facial expressive features
- Zhang, Dongyu, Zhang, Minghao, Guo, Teng, Peng, Ciyuan, Saikrishna, Vidya, Xia, Feng
- Authors: Zhang, Dongyu , Zhang, Minghao , Guo, Teng , Peng, Ciyuan , Saikrishna, Vidya , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 2021 International Joint Conference on Neural Networks, IJCNN 2021 Vol. 2021-July
- Full Text:
- Reviewed:
- Description: Metaphor plays an important role in human communication, which often conveys and evokes sentiments. Numerous approaches to sentiment analysis of metaphors have thus gained attention in natural language processing (NLP). The primary focus of these approaches is on linguistic features and text rather than other modal information and data. However, visual features such as facial expressions also play an important role in expressing sentiments. In this paper, we present a novel neural network approach to sentiment analysis of metaphorical expressions that combines both linguistic and visual features and refer to it as the multimodal model approach. For this, we create a Chinese dataset, containing textual data from metaphorical sentences along with visual data on synchronized facial images. The experimental results indicate that our multimodal model outperforms several other linguistic and visual models, and also outperforms the state-of-the-art methods. The contribution is realized in terms of novelty of the approach and creation of a new, sizeable, and scarce dataset with linguistic and synchronized facial expressive image data. The dataset is particularly useful in languages other than English and the approach addresses one of the most challenging NLP issue: sentiment analysis in metaphor. © 2021 IEEE.
- Authors: Zhang, Dongyu , Zhang, Minghao , Guo, Teng , Peng, Ciyuan , Saikrishna, Vidya , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 2021 International Joint Conference on Neural Networks, IJCNN 2021 Vol. 2021-July
- Full Text:
- Reviewed:
- Description: Metaphor plays an important role in human communication, which often conveys and evokes sentiments. Numerous approaches to sentiment analysis of metaphors have thus gained attention in natural language processing (NLP). The primary focus of these approaches is on linguistic features and text rather than other modal information and data. However, visual features such as facial expressions also play an important role in expressing sentiments. In this paper, we present a novel neural network approach to sentiment analysis of metaphorical expressions that combines both linguistic and visual features and refer to it as the multimodal model approach. For this, we create a Chinese dataset, containing textual data from metaphorical sentences along with visual data on synchronized facial images. The experimental results indicate that our multimodal model outperforms several other linguistic and visual models, and also outperforms the state-of-the-art methods. The contribution is realized in terms of novelty of the approach and creation of a new, sizeable, and scarce dataset with linguistic and synchronized facial expressive image data. The dataset is particularly useful in languages other than English and the approach addresses one of the most challenging NLP issue: sentiment analysis in metaphor. © 2021 IEEE.
MAM : a metaphor-based approach for mental illness detection
- Zhang, Dongyu, Shi, Nan, Peng, Ciyuan, Aziz, Abdul, Zhao, Wenhong, Xia, Feng
- Authors: Zhang, Dongyu , Shi, Nan , Peng, Ciyuan , Aziz, Abdul , Zhao, Wenhong , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 21st International Conference on Computational Science, ICCS 2021 Vol. 12744 LNCS, p. 570-583
- Full Text:
- Reviewed:
- Description: Among the most disabling disorders, mental illness is one that affects millions of people across the world. Although a great deal of research has been done to prevent mental disorders, detecting mental illness in potential patients remains a considerable challenge. This paper proposes a novel metaphor-based approach (MAM) to determine whether a social media user has a mental disorder or not by classifying social media texts. We observe that the social media texts posted by people with mental illness often contain many implicit emotions that metaphors can express. Therefore, we extract these texts’ metaphor features as the primary indicator for the text classification task. Our approach firstly proposes a CNN-RNN (Convolution Neural Network - Recurrent Neural Network) framework to enable the representations of long texts. The metaphor features are then applied to the attention mechanism for achieving the metaphorical emotions-based mental illness detection. Subsequently, compared with other works, our approach achieves creative results in the detection of mental illnesses. The recall scores of MAM on depression, anorexia, and suicide detection are the highest, with 0.50, 0.70, and 0.65, respectively. Furthermore, MAM has the best F1 scores on depression and anorexia detection tasks, with 0.51 and 0.71. © 2021, Springer Nature Switzerland AG.
- Authors: Zhang, Dongyu , Shi, Nan , Peng, Ciyuan , Aziz, Abdul , Zhao, Wenhong , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 21st International Conference on Computational Science, ICCS 2021 Vol. 12744 LNCS, p. 570-583
- Full Text:
- Reviewed:
- Description: Among the most disabling disorders, mental illness is one that affects millions of people across the world. Although a great deal of research has been done to prevent mental disorders, detecting mental illness in potential patients remains a considerable challenge. This paper proposes a novel metaphor-based approach (MAM) to determine whether a social media user has a mental disorder or not by classifying social media texts. We observe that the social media texts posted by people with mental illness often contain many implicit emotions that metaphors can express. Therefore, we extract these texts’ metaphor features as the primary indicator for the text classification task. Our approach firstly proposes a CNN-RNN (Convolution Neural Network - Recurrent Neural Network) framework to enable the representations of long texts. The metaphor features are then applied to the attention mechanism for achieving the metaphorical emotions-based mental illness detection. Subsequently, compared with other works, our approach achieves creative results in the detection of mental illnesses. The recall scores of MAM on depression, anorexia, and suicide detection are the highest, with 0.50, 0.70, and 0.65, respectively. Furthermore, MAM has the best F1 scores on depression and anorexia detection tasks, with 0.51 and 0.71. © 2021, Springer Nature Switzerland AG.
Matching algorithms : fundamentals, applications and challenges
- Ren, Jing, Xia, Feng, Chen, Xiangtai, Liu, Jiaying, Sultanova, Nargiz
- Authors: Ren, Jing , Xia, Feng , Chen, Xiangtai , Liu, Jiaying , Sultanova, Nargiz
- Date: 2021
- Type: Text , Journal article , Review
- Relation: IEEE Transactions on Emerging Topics in Computational Intelligence Vol. 5, no. 3 (2021), p. 332-350
- Full Text:
- Reviewed:
- Description: Matching plays a vital role in the rational allocation of resources in many areas, ranging from market operation to people's daily lives. In economics, the term matching theory is coined for pairing two agents in a specific market to reach a stable or optimal state. In computer science, all branches of matching problems have emerged, such as the question-answer matching in information retrieval, user-item matching in a recommender system, and entity-relation matching in the knowledge graph. A preference list is the core element during a matching process, which can either be obtained directly from the agents or generated indirectly by prediction. Based on the preference list access, matching problems are divided into two categories, i.e., explicit matching and implicit matching. In this paper, we first introduce the matching theory's basic models and algorithms in explicit matching. The existing methods for coping with various matching problems in implicit matching are reviewed, such as retrieval matching, user-item matching, entity-relation matching, and image matching. Furthermore, we look into representative applications in these areas, including marriage and labor markets in explicit matching and several similarity-based matching problems in implicit matching. Finally, this survey paper concludes with a discussion of open issues and promising future directions in the field of matching. © 2017 IEEE. **Please note that there are multiple authors for this article therefore only the name of the first 5 including Federation University Australia affiliate “Jing Ren, Xia Feng, Nargiz Sultanova" is provided in this record**
- Authors: Ren, Jing , Xia, Feng , Chen, Xiangtai , Liu, Jiaying , Sultanova, Nargiz
- Date: 2021
- Type: Text , Journal article , Review
- Relation: IEEE Transactions on Emerging Topics in Computational Intelligence Vol. 5, no. 3 (2021), p. 332-350
- Full Text:
- Reviewed:
- Description: Matching plays a vital role in the rational allocation of resources in many areas, ranging from market operation to people's daily lives. In economics, the term matching theory is coined for pairing two agents in a specific market to reach a stable or optimal state. In computer science, all branches of matching problems have emerged, such as the question-answer matching in information retrieval, user-item matching in a recommender system, and entity-relation matching in the knowledge graph. A preference list is the core element during a matching process, which can either be obtained directly from the agents or generated indirectly by prediction. Based on the preference list access, matching problems are divided into two categories, i.e., explicit matching and implicit matching. In this paper, we first introduce the matching theory's basic models and algorithms in explicit matching. The existing methods for coping with various matching problems in implicit matching are reviewed, such as retrieval matching, user-item matching, entity-relation matching, and image matching. Furthermore, we look into representative applications in these areas, including marriage and labor markets in explicit matching and several similarity-based matching problems in implicit matching. Finally, this survey paper concludes with a discussion of open issues and promising future directions in the field of matching. © 2017 IEEE. **Please note that there are multiple authors for this article therefore only the name of the first 5 including Federation University Australia affiliate “Jing Ren, Xia Feng, Nargiz Sultanova" is provided in this record**
Predicting mental health problems with personality, behavior, and social networks
- Zhang, Dongyu, Guo, Teng, Han, Shiyu, Vahabli, Sadaf, Naseriparsa, Mehdi, Xia, Feng
- Authors: Zhang, Dongyu , Guo, Teng , Han, Shiyu , Vahabli, Sadaf , Naseriparsa, Mehdi , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 2021 IEEE International Conference on Big Data, Big Data 2021, virtual online, 15-18 December 2021, Proceedings - 2021 IEEE International Conference on Big Data, Big Data 2021 p. 4537-4546
- Full Text:
- Reviewed:
- Description: Mental health is an integral part of human health and well-being. Unhealthy mentality leads to serious consequences such as self-mutilation and suicide, especially for college students. While the literature focused on analysing the relationship between mental health and a single factor such as personality or behavior, accurate prediction is yet to be achieved due to the lack of cross-dimensional analysis and multi-dimensional joint prediction. To this end, this work proposes leveraging multiple factors from three crucial dimensions of mental health: behaviors, personality, and social networks. We recruited 490 college students, and collected their behavioral records from smart cards. In addition, we extracted their psychological traits from questionnaires, and social networks by conducting the survey on the nominating community members. We created a neural network-based model to integrate behavioral, psychological, and social network factors to predict mental health problems. The experimental results verify the efficacy of the proposed model, and demonstrate that the classification model of various factors effectively predicts the students' mental issues. © 2021 IEEE.
- Authors: Zhang, Dongyu , Guo, Teng , Han, Shiyu , Vahabli, Sadaf , Naseriparsa, Mehdi , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 2021 IEEE International Conference on Big Data, Big Data 2021, virtual online, 15-18 December 2021, Proceedings - 2021 IEEE International Conference on Big Data, Big Data 2021 p. 4537-4546
- Full Text:
- Reviewed:
- Description: Mental health is an integral part of human health and well-being. Unhealthy mentality leads to serious consequences such as self-mutilation and suicide, especially for college students. While the literature focused on analysing the relationship between mental health and a single factor such as personality or behavior, accurate prediction is yet to be achieved due to the lack of cross-dimensional analysis and multi-dimensional joint prediction. To this end, this work proposes leveraging multiple factors from three crucial dimensions of mental health: behaviors, personality, and social networks. We recruited 490 college students, and collected their behavioral records from smart cards. In addition, we extracted their psychological traits from questionnaires, and social networks by conducting the survey on the nominating community members. We created a neural network-based model to integrate behavioral, psychological, and social network factors to predict mental health problems. The experimental results verify the efficacy of the proposed model, and demonstrate that the classification model of various factors effectively predicts the students' mental issues. © 2021 IEEE.
Scholar2vec : vector representation of scholars for lifetime collaborator prediction
- Wang, Wei, Xia, Feng, Wu, Jian, Gong, Zhiguo, Tong, Hanghang, Davison, Brian
- Authors: Wang, Wei , Xia, Feng , Wu, Jian , Gong, Zhiguo , Tong, Hanghang , Davison, Brian
- Date: 2021
- Type: Text , Journal article
- Relation: ACM Transactions on Knowledge Discovery from Data Vol. 15, no. 3 (2021), p.
- Full Text:
- Reviewed:
- Description: While scientific collaboration is critical for a scholar, some collaborators can be more significant than others, e.g., lifetime collaborators. It has been shown that lifetime collaborators are more influential on a scholar's academic performance. However, little research has been done on investigating predicting such special relationships in academic networks. To this end, we propose Scholar2vec, a novel neural network embedding for representing scholar profiles. First, our approach creates scholars' research interest vector from textual information, such as demographics, research, and influence. After bridging research interests with a collaboration network, vector representations of scholars can be gained with graph learning. Meanwhile, since scholars are occupied with various attributes, we propose to incorporate four types of scholar attributes for learning scholar vectors. Finally, the early-stage similarity sequence based on Scholar2vec is used to predict lifetime collaborators with machine learning methods. Extensive experiments on two real-world datasets show that Scholar2vec outperforms state-of-the-art methods in lifetime collaborator prediction. Our work presents a new way to measure the similarity between two scholars by vector representation, which tackles the knowledge between network embedding and academic relationship mining. © 2021 Association for Computing Machinery.
- Authors: Wang, Wei , Xia, Feng , Wu, Jian , Gong, Zhiguo , Tong, Hanghang , Davison, Brian
- Date: 2021
- Type: Text , Journal article
- Relation: ACM Transactions on Knowledge Discovery from Data Vol. 15, no. 3 (2021), p.
- Full Text:
- Reviewed:
- Description: While scientific collaboration is critical for a scholar, some collaborators can be more significant than others, e.g., lifetime collaborators. It has been shown that lifetime collaborators are more influential on a scholar's academic performance. However, little research has been done on investigating predicting such special relationships in academic networks. To this end, we propose Scholar2vec, a novel neural network embedding for representing scholar profiles. First, our approach creates scholars' research interest vector from textual information, such as demographics, research, and influence. After bridging research interests with a collaboration network, vector representations of scholars can be gained with graph learning. Meanwhile, since scholars are occupied with various attributes, we propose to incorporate four types of scholar attributes for learning scholar vectors. Finally, the early-stage similarity sequence based on Scholar2vec is used to predict lifetime collaborators with machine learning methods. Extensive experiments on two real-world datasets show that Scholar2vec outperforms state-of-the-art methods in lifetime collaborator prediction. Our work presents a new way to measure the similarity between two scholars by vector representation, which tackles the knowledge between network embedding and academic relationship mining. © 2021 Association for Computing Machinery.
Shifu2 : a network representation learning based model for advisor-advisee relationship mining
- Liu, Jiaying, Xia, Feng, Wang, Lei, Xu, Bo, Kong, Xiangjie
- Authors: Liu, Jiaying , Xia, Feng , Wang, Lei , Xu, Bo , Kong, Xiangjie
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Transactions on Knowledge and Data Engineering Vol. 33, no. 4 (2021), p. 1763-1777
- Full Text:
- Reviewed:
- Description: The advisor-advisee relationship represents direct knowledge heritage, and such relationship may not be readily available from academic libraries and search engines. This work aims to discover advisor-advisee relationships hidden behind scientific collaboration networks. For this purpose, we propose a novel model based on Network Representation Learning (NRL), namely Shifu2, which takes the collaboration network as input and the identified advisor-advisee relationship as output. In contrast to existing NRL models, Shifu2 considers not only the network structure but also the semantic information of nodes and edges. Shifu2 encodes nodes and edges into low-dimensional vectors respectively, both of which are then utilized to identify advisor-advisee relationships. Experimental results illustrate improved stability and effectiveness of the proposed model over state-of-the-art methods. In addition, we generate a large-scale academic genealogy dataset by taking advantage of Shifu2. © 1989-2012 IEEE.
- Authors: Liu, Jiaying , Xia, Feng , Wang, Lei , Xu, Bo , Kong, Xiangjie
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Transactions on Knowledge and Data Engineering Vol. 33, no. 4 (2021), p. 1763-1777
- Full Text:
- Reviewed:
- Description: The advisor-advisee relationship represents direct knowledge heritage, and such relationship may not be readily available from academic libraries and search engines. This work aims to discover advisor-advisee relationships hidden behind scientific collaboration networks. For this purpose, we propose a novel model based on Network Representation Learning (NRL), namely Shifu2, which takes the collaboration network as input and the identified advisor-advisee relationship as output. In contrast to existing NRL models, Shifu2 considers not only the network structure but also the semantic information of nodes and edges. Shifu2 encodes nodes and edges into low-dimensional vectors respectively, both of which are then utilized to identify advisor-advisee relationships. Experimental results illustrate improved stability and effectiveness of the proposed model over state-of-the-art methods. In addition, we generate a large-scale academic genealogy dataset by taking advantage of Shifu2. © 1989-2012 IEEE.
Solving ESL sentence completion questions via pre-trained neural language models
- Liu, Qiongqiong, Liu, Tianqiao, Zhao, Jiafu, Fang, Qiang, Ding, Wenbiao, Wu, Zhongqin, Xia, Feng, Tang, Jiliang, Liu, Zitao
- Authors: Liu, Qiongqiong , Liu, Tianqiao , Zhao, Jiafu , Fang, Qiang , Ding, Wenbiao , Wu, Zhongqin , Xia, Feng , Tang, Jiliang , Liu, Zitao
- Date: 2021
- Type: Text , Conference paper
- Relation: 22nd International Conference on Artificial Intelligence in Education, AIED 2021, Virtual, Online, 14-18 June 2021, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 12749 LNAI, p. 256-261
- Full Text:
- Reviewed:
- Description: Sentence completion (SC) questions present a sentence with one or more blanks that need to be filled in, three to five possible words or phrases as options. SC questions are widely used for students learning English as a Second Language (ESL) and building computational approaches to automatically solve such questions is beneficial to language learners. In this work, we propose a neural framework to solve SC questions in English examinations by utilizing pre-trained language models. We conduct extensive experiments on a real-world K-12 ESL SC question dataset and the results demonstrate the superiority of our model in terms of prediction accuracy. Furthermore, we run precision-recall tradeoff analysis to discuss the practical issues when deploying it in real-life scenarios. To encourage reproducible results, we make our code publicly available at https://github.com/AIED2021/ESL-SentenceCompletion. © Springer Nature Switzerland AG 2021.
- Authors: Liu, Qiongqiong , Liu, Tianqiao , Zhao, Jiafu , Fang, Qiang , Ding, Wenbiao , Wu, Zhongqin , Xia, Feng , Tang, Jiliang , Liu, Zitao
- Date: 2021
- Type: Text , Conference paper
- Relation: 22nd International Conference on Artificial Intelligence in Education, AIED 2021, Virtual, Online, 14-18 June 2021, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 12749 LNAI, p. 256-261
- Full Text:
- Reviewed:
- Description: Sentence completion (SC) questions present a sentence with one or more blanks that need to be filled in, three to five possible words or phrases as options. SC questions are widely used for students learning English as a Second Language (ESL) and building computational approaches to automatically solve such questions is beneficial to language learners. In this work, we propose a neural framework to solve SC questions in English examinations by utilizing pre-trained language models. We conduct extensive experiments on a real-world K-12 ESL SC question dataset and the results demonstrate the superiority of our model in terms of prediction accuracy. Furthermore, we run precision-recall tradeoff analysis to discuss the practical issues when deploying it in real-life scenarios. To encourage reproducible results, we make our code publicly available at https://github.com/AIED2021/ESL-SentenceCompletion. © Springer Nature Switzerland AG 2021.
The dominance of big teams in china’s scientific output
- Liu, Linlin, Yu, Jianfei, Huang, Junming, Xia, Feng, Jia, Tao
- Authors: Liu, Linlin , Yu, Jianfei , Huang, Junming , Xia, Feng , Jia, Tao
- Date: 2021
- Type: Text , Journal article
- Relation: Quantitative Science Studies Vol. 2, no. 1 (2021), p. 350-362
- Full Text:
- Reviewed:
- Description: Modern science is dominated by scientific productions from teams. A recent finding shows that teams of both large and small sizes are essential in research, prompting us to analyze the extent to which a country’s scientific work is carried out by big or small teams. Here, using over 26 million publications from Web of Science, we find that China’s research output is more dominated by big teams than the rest of the world, which is particularly the case in fields of natural science. Despite the global trend that more papers are written by big teams, China’s drop in small team output is much steeper. As teams in China shift from small to large size, the team diversity that is essential for innovative work does not increase as much as that in other countries. Using the national average as the baseline, we find that the National Natural Science Foundation of China (NSFC) supports fewer small teams than the National Science Foundation (NSF) of the United States does, implying that big teams are preferred by grant agencies in China. Our finding provides new insights into the concern of originality and innovation in China, which indicates a need to balance small and big teams. © 2020 Linlin Liu, Jianfei Yu, Junming Huang, Feng Xia, and Tao Jia. Published under a Creative Commons Attribution 4.0 International (CC BY 4.0) license.
- Authors: Liu, Linlin , Yu, Jianfei , Huang, Junming , Xia, Feng , Jia, Tao
- Date: 2021
- Type: Text , Journal article
- Relation: Quantitative Science Studies Vol. 2, no. 1 (2021), p. 350-362
- Full Text:
- Reviewed:
- Description: Modern science is dominated by scientific productions from teams. A recent finding shows that teams of both large and small sizes are essential in research, prompting us to analyze the extent to which a country’s scientific work is carried out by big or small teams. Here, using over 26 million publications from Web of Science, we find that China’s research output is more dominated by big teams than the rest of the world, which is particularly the case in fields of natural science. Despite the global trend that more papers are written by big teams, China’s drop in small team output is much steeper. As teams in China shift from small to large size, the team diversity that is essential for innovative work does not increase as much as that in other countries. Using the national average as the baseline, we find that the National Natural Science Foundation of China (NSFC) supports fewer small teams than the National Science Foundation (NSF) of the United States does, implying that big teams are preferred by grant agencies in China. Our finding provides new insights into the concern of originality and innovation in China, which indicates a need to balance small and big teams. © 2020 Linlin Liu, Jianfei Yu, Junming Huang, Feng Xia, and Tao Jia. Published under a Creative Commons Attribution 4.0 International (CC BY 4.0) license.
Time-expanded method improving throughput in dynamic renewable networks
- Zhang, Jianhui, Guan, Siqi, Wang, Jiacheng, Liu, Liming, Wang, HanXiang, Xia, Feng
- Authors: Zhang, Jianhui , Guan, Siqi , Wang, Jiacheng , Liu, Liming , Wang, HanXiang , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 29th IEEE/ACM International Symposium on Quality of Service, IWQOS 2021
- Full Text:
- Reviewed:
- Description: In the Dynamic Rechargeable Networks (DRNs), the existing studies usually consider the spatio-temporal dynamics of the harvested energy so as to maximize the throughput by efficient energy allocation. However, the network dynamics have seldom been considered simultaneously including the time variable link quality, communication power and battery charge efficiency. Furthermore, the wireless interference brings extra challenge. To take these dynamics into account together, this paper studies the quite challenging problem, the network throughput maximization in the DRNs, by proper energy allocation while considering the additional affection of wireless interference. We introduce the Time-Expanded Graph (TEG) to describe the above dynamics in a feasible easy way, and then look into the scenario where there is only one pair of source-target firstly. To maximize the throughput, this paper designs the Single Pair Throughput maximization (SPT) algorithm based on TEG while considering the wireless interference. In the case of multiple pairs of source-targets, it's quite complex to solve the network throughput maximization problem directly. This paper introduces the Garg and Könemanns framework and then designs the Multiple Pairs Throughput (MPT) algorithm to maximize the overall throughput of all pairs. MPT is a fast approximation solution with the ratio of 1-3ϵ, where 0 < ϵ < 1 is a small positive constant. This paper also conducts the extensive numerical evaluation based on the simulated data and the data collected by our real system. The numerical simulation results demonstrate the throughput improvement of our algorithms. © 2021 IEEE.
- Authors: Zhang, Jianhui , Guan, Siqi , Wang, Jiacheng , Liu, Liming , Wang, HanXiang , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 29th IEEE/ACM International Symposium on Quality of Service, IWQOS 2021
- Full Text:
- Reviewed:
- Description: In the Dynamic Rechargeable Networks (DRNs), the existing studies usually consider the spatio-temporal dynamics of the harvested energy so as to maximize the throughput by efficient energy allocation. However, the network dynamics have seldom been considered simultaneously including the time variable link quality, communication power and battery charge efficiency. Furthermore, the wireless interference brings extra challenge. To take these dynamics into account together, this paper studies the quite challenging problem, the network throughput maximization in the DRNs, by proper energy allocation while considering the additional affection of wireless interference. We introduce the Time-Expanded Graph (TEG) to describe the above dynamics in a feasible easy way, and then look into the scenario where there is only one pair of source-target firstly. To maximize the throughput, this paper designs the Single Pair Throughput maximization (SPT) algorithm based on TEG while considering the wireless interference. In the case of multiple pairs of source-targets, it's quite complex to solve the network throughput maximization problem directly. This paper introduces the Garg and Könemanns framework and then designs the Multiple Pairs Throughput (MPT) algorithm to maximize the overall throughput of all pairs. MPT is a fast approximation solution with the ratio of 1-3ϵ, where 0 < ϵ < 1 is a small positive constant. This paper also conducts the extensive numerical evaluation based on the simulated data and the data collected by our real system. The numerical simulation results demonstrate the throughput improvement of our algorithms. © 2021 IEEE.
Tracing the Pace of COVID-19 research : topic modeling and evolution
- Liu, Jiaying, Nie, Hansong, Li, Shihao, Ren, Jing, Xia, Feng
- Authors: Liu, Jiaying , Nie, Hansong , Li, Shihao , Ren, Jing , Xia, Feng
- Date: 2021
- Type: Text , Journal article
- Relation: Big Data Research Vol. 25, no. (2021), p.
- Full Text:
- Reviewed:
- Description: COVID-19 has been spreading rapidly around the world. With the growing attention on the deadly pandemic, discussions and research on COVID-19 are rapidly increasing to exchange latest findings with the hope to accelerate the pace of finding a cure. As a branch of information technology, artificial intelligence (AI) has greatly expedited the development of human society. In this paper, we investigate and visualize the on-going advancements of early scientific research on COVID-19 from the perspective of AI. By adopting the Latent Dirichlet Allocation (LDA) model, this paper allocates the research articles into 50 key research topics pertinent to COVID-19 according to their abstracts. We present an overview of early studies of the COVID-19 crisis at different scales including referencing/citation behavior, topic variation and their inner interactions. We also identify innovative papers that are regarded as the cornerstones in the development of COVID-19 research. The results unveil the focus of scientific research, thereby giving deep insights into how the academic society contributes to combating the COVID-19 pandemic. © 2021 Elsevier Inc. **Please note that there are multiple authors for this article therefore only the name of the first 5 including Federation University Australia affiliate “Jing Ren and Feng Xia" is provided in this record**
- Description: COVID-19 has been spreading rapidly around the world. With the growing attention on the deadly pandemic, discussions and research on COVID-19 are rapidly increasing to exchange latest findings with the hope to accelerate the pace of finding a cure. As a branch of information technology, artificial intelligence (AI) has greatly expedited the development of human society. In this paper, we investigate and visualize the on-going advancements of early scientific research on COVID-19 from the perspective of AI. By adopting the Latent Dirichlet Allocation (LDA) model, this paper allocates the research articles into 50 key research topics pertinent to COVID-19 according to their abstracts. We present an overview of early studies of the COVID-19 crisis at different scales including referencing/citation behavior, topic variation and their inner interactions. We also identify innovative papers that are regarded as the cornerstones in the development of COVID-19 research. The results unveil the focus of scientific research, thereby giving deep insights into how the academic society contributes to combating the COVID-19 pandemic. © 2021 Elsevier Inc.
- Authors: Liu, Jiaying , Nie, Hansong , Li, Shihao , Ren, Jing , Xia, Feng
- Date: 2021
- Type: Text , Journal article
- Relation: Big Data Research Vol. 25, no. (2021), p.
- Full Text:
- Reviewed:
- Description: COVID-19 has been spreading rapidly around the world. With the growing attention on the deadly pandemic, discussions and research on COVID-19 are rapidly increasing to exchange latest findings with the hope to accelerate the pace of finding a cure. As a branch of information technology, artificial intelligence (AI) has greatly expedited the development of human society. In this paper, we investigate and visualize the on-going advancements of early scientific research on COVID-19 from the perspective of AI. By adopting the Latent Dirichlet Allocation (LDA) model, this paper allocates the research articles into 50 key research topics pertinent to COVID-19 according to their abstracts. We present an overview of early studies of the COVID-19 crisis at different scales including referencing/citation behavior, topic variation and their inner interactions. We also identify innovative papers that are regarded as the cornerstones in the development of COVID-19 research. The results unveil the focus of scientific research, thereby giving deep insights into how the academic society contributes to combating the COVID-19 pandemic. © 2021 Elsevier Inc. **Please note that there are multiple authors for this article therefore only the name of the first 5 including Federation University Australia affiliate “Jing Ren and Feng Xia" is provided in this record**
- Description: COVID-19 has been spreading rapidly around the world. With the growing attention on the deadly pandemic, discussions and research on COVID-19 are rapidly increasing to exchange latest findings with the hope to accelerate the pace of finding a cure. As a branch of information technology, artificial intelligence (AI) has greatly expedited the development of human society. In this paper, we investigate and visualize the on-going advancements of early scientific research on COVID-19 from the perspective of AI. By adopting the Latent Dirichlet Allocation (LDA) model, this paper allocates the research articles into 50 key research topics pertinent to COVID-19 according to their abstracts. We present an overview of early studies of the COVID-19 crisis at different scales including referencing/citation behavior, topic variation and their inner interactions. We also identify innovative papers that are regarded as the cornerstones in the development of COVID-19 research. The results unveil the focus of scientific research, thereby giving deep insights into how the academic society contributes to combating the COVID-19 pandemic. © 2021 Elsevier Inc.
Understanding serendipity in science : a survey
- Yu, Shuo, Bedru, Hayat, Xinbei, Chu, Yuyuan, Yuan, Xia, Feng
- Authors: Yu, Shuo , Bedru, Hayat , Xinbei, Chu , Yuyuan, Yuan , Xia, Feng
- Date: 2021
- Type: Text , Journal article
- Relation: Data Analysis and Knowledge Discovery Vol. 5, no. 1 (2021), p. 16-35
- Full Text: false
- Reviewed:
- Description: [Objective] This paper summarizes the components and definitions of serendipity, reviews representative supporting technologies and applications of serendipity in science, and discusses challenges and future directions in this field. [Coverage] We searched relevant keywords such as“serendipity”,“novelty”and “diversity”in research repositories such as Microsoft Academic and Google Scholar. A total of 102 well-selected references are finally cited. [Methods] We reviewed serendipitous discoveries in various scenarios, and discussed the concept of serendipity in the context of science. Relevant tools and applications are categorized. [Results] The tools that support serendipity are conducive to scientific research. However, there is no uniform definition of serendipity, thus making it difficult to measure serendipity in science. [Limitations] The factors affecting serendipity in science are complex, and yet to be explored. [Conclusions] Serendipity is one of the indispensable factors for scientific advances. However, many challenges are facing the exploration of serendipity in science, such as lack of metrics and difficulty to control. © 2021, Chinese Academy of Sciences. All rights reserved.
Vehicle trajectory clustering based on dynamic representation learning of internet of vehicles
- Wang, Wei, Xia, Feng, Nie, Hansong, Chen, Zhikui, Gong, Zhiguo
- Authors: Wang, Wei , Xia, Feng , Nie, Hansong , Chen, Zhikui , Gong, Zhiguo
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Transactions on Intelligent Transportation Systems Vol. 22, no. 6 (2021), p. 3567-3576
- Full Text:
- Reviewed:
- Description: With the widely used Internet of Things, 5G, and smart city technologies, we are able to acquire a variety of vehicle trajectory data. These trajectory data are of great significance which can be used to extract relevant information in order to, for instance, calculate the optimal path from one position to another, detect abnormal behavior, monitor the traffic flow in a city, and predict the next position of an object. One of the key technology is to cluster vehicle trajectory. However, existing methods mainly rely on manually designed metrics which may lead to biased results. Meanwhile, the large scale of vehicle trajectory data has become a challenge because calculating these manually designed metrics will cost more time and space. To address these challenges, we propose to employ network representation learning to achieve accurate vehicle trajectory clustering. Specifically, we first construct the k-nearest neighbor-based internet of vehicles in a dynamic manner. Then we learn the low-dimensional representations of vehicles by performing dynamic network representation learning on the constructed network. Finally, using the learned vehicle vectors, vehicle trajectories are clustered with machine learning methods. Experimental results on the real-word dataset show that our method achieves the best performance compared against baseline methods. © 2000-2011 IEEE. **Please note that there are multiple authors for this article therefore only the name of the first 5 including Federation University Australia affiliate “Feng Xia” is provided in this record**
- Authors: Wang, Wei , Xia, Feng , Nie, Hansong , Chen, Zhikui , Gong, Zhiguo
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Transactions on Intelligent Transportation Systems Vol. 22, no. 6 (2021), p. 3567-3576
- Full Text:
- Reviewed:
- Description: With the widely used Internet of Things, 5G, and smart city technologies, we are able to acquire a variety of vehicle trajectory data. These trajectory data are of great significance which can be used to extract relevant information in order to, for instance, calculate the optimal path from one position to another, detect abnormal behavior, monitor the traffic flow in a city, and predict the next position of an object. One of the key technology is to cluster vehicle trajectory. However, existing methods mainly rely on manually designed metrics which may lead to biased results. Meanwhile, the large scale of vehicle trajectory data has become a challenge because calculating these manually designed metrics will cost more time and space. To address these challenges, we propose to employ network representation learning to achieve accurate vehicle trajectory clustering. Specifically, we first construct the k-nearest neighbor-based internet of vehicles in a dynamic manner. Then we learn the low-dimensional representations of vehicles by performing dynamic network representation learning on the constructed network. Finally, using the learned vehicle vectors, vehicle trajectories are clustered with machine learning methods. Experimental results on the real-word dataset show that our method achieves the best performance compared against baseline methods. © 2000-2011 IEEE. **Please note that there are multiple authors for this article therefore only the name of the first 5 including Federation University Australia affiliate “Feng Xia” is provided in this record**
Venue topic model-enhanced joint graph modelling for citation recommendation in scholarly big data
- Wang, Wei, Gong, Zhiguo, Ren, Jing, Xia, Feng, Lv, Zhihan, Wei, Wei
- Authors: Wang, Wei , Gong, Zhiguo , Ren, Jing , Xia, Feng , Lv, Zhihan , Wei, Wei
- Date: 2021
- Type: Text , Journal article
- Relation: ACM Transactions on Asian and Low-Resource Language Information Processing Vol. 20, no. 1 (2021), p.
- Full Text:
- Reviewed:
- Description: Natural language processing technologies, such as topic models, have been proven to be effective for scholarly recommendation tasks with the ability to deal with content information. Recently, venue recommendation is becoming an increasingly important research task due to the unprecedented number of publication venues. However, traditional methods focus on either the author's local network or author-venue similarity, where the multiple relationships between scholars and venues are overlooked, especially the venue-venue interaction. To solve this problem, we propose an author topic model-enhanced joint graph modeling approach that consists of venue topic modeling, venue-specific topic influence modeling, and scholar preference modeling. We first model the venue topic with Latent Dirichlet Allocation. Then, we model the venue-specific topic influence in an asymmetric and low-dimensional way by considering the topic similarity between venues, the top-influence of venues, and the top-susceptibility of venues. The top-influence characterizes venues' capacity of exerting topic influence on other venues. The top-susceptibility captures venues' propensity of being topically influenced by other venues. Extensive experiments on two real-world datasets show that our proposed joint graph modeling approach outperforms the state-of-The-Art methods. © 2020 ACM.
- Authors: Wang, Wei , Gong, Zhiguo , Ren, Jing , Xia, Feng , Lv, Zhihan , Wei, Wei
- Date: 2021
- Type: Text , Journal article
- Relation: ACM Transactions on Asian and Low-Resource Language Information Processing Vol. 20, no. 1 (2021), p.
- Full Text:
- Reviewed:
- Description: Natural language processing technologies, such as topic models, have been proven to be effective for scholarly recommendation tasks with the ability to deal with content information. Recently, venue recommendation is becoming an increasingly important research task due to the unprecedented number of publication venues. However, traditional methods focus on either the author's local network or author-venue similarity, where the multiple relationships between scholars and venues are overlooked, especially the venue-venue interaction. To solve this problem, we propose an author topic model-enhanced joint graph modeling approach that consists of venue topic modeling, venue-specific topic influence modeling, and scholar preference modeling. We first model the venue topic with Latent Dirichlet Allocation. Then, we model the venue-specific topic influence in an asymmetric and low-dimensional way by considering the topic similarity between venues, the top-influence of venues, and the top-susceptibility of venues. The top-influence characterizes venues' capacity of exerting topic influence on other venues. The top-susceptibility captures venues' propensity of being topically influenced by other venues. Extensive experiments on two real-world datasets show that our proposed joint graph modeling approach outperforms the state-of-The-Art methods. © 2020 ACM.
Web of students : class-level friendship network discovery from educational big data
- Guo, Teng, Tang, Tang, Zhang, Dongyu, Li, Jianxin, Xia, Feng
- Authors: Guo, Teng , Tang, Tang , Zhang, Dongyu , Li, Jianxin , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 22nd International Conference on Web Information Systems Engineering, WISE 2021 p. 497-511
- Full Text: false
- Reviewed:
- Description: Classmate friendships are a major aspect of university social experience. Taking classes together is one of the main ways for students to build friendships. Consequently, class-level friendship networks have attracted tremendous attention from researchers. They are also very useful in student support and early intervention. However, these networks are normally invisible for educators. Discovering such an important web of students effectively is a pressing problem. Against this background, we propose a data-driven framework called CANDY which automatically discovers the class-level friendship networks based on educational big data. We first represent features through representation learning methods. Secondly, the data is augmented with the randomly shuffling method. Thirdly, a conditional generative adversarial network model is used to mine the class-level friendship networks. A deep adversarial optimization strategy is proposed here for problems caused by network sparsity. To evaluate the performance of the proposed approach, we build a real-world dataset that contains rich student information. Extensive experiments have been conducted and the results demonstrate the effectiveness of our framework. © 2021, Springer Nature Switzerland AG.
A generative adversarial active learning method for effective outlier detection
- Bah, Mohamed, Zhang, Ji, Yu, Ting, Xia, Feng, Li, Zhao, Zhou, Shuigeng, Wang, Hongzhi
- Authors: Bah, Mohamed , Zhang, Ji , Yu, Ting , Xia, Feng , Li, Zhao , Zhou, Shuigeng , Wang, Hongzhi
- Date: 2022
- Type: Text , Conference paper
- Relation: 34th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2022, Virtual, online, 31 October-2 November 2022, Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI Vol. 2022-October, p. 131-139
- Full Text: false
- Reviewed:
- Description: Outlier detection is an important data mining task, and developing effective methods to detect outliers is challenging in cases where there is insufficient labeled data. Manually labeling the data is labor-intensive and time-consuming. Because of a limited number of labeled samples, the classes are unbalanced, resulting in a class-imbalance problem. Existing methods fail to address these aforementioned issues holistically and fall short in generating quality outlier samples for effective outlier detection accuracy. In this paper, we propose a new solution that tackles these problems. We propose a. Generative Adversarial Active Learning method (DIR-GAAL), which generates Diverse, Informative, and Representative outlier samples through active learning, and employs the mini-max game between the generator and discriminator in a generative adversarial network. We conducted extensive experiments on several benchmark datasets to evaluate the performance of our method. When compared to other benchmark methods, our method consistently demon-strates better outlier detection accuracy without being negatively affected by the class-imbalance problem. © 2022 IEEE.
A reliable image quality assessment metric : evaluation using camera impacts
- Kaur, Roopdeep, Karmakar, Gour, Xia, Feng
- Authors: Kaur, Roopdeep , Karmakar, Gour , Xia, Feng
- Date: 2022
- Type: Text , Journal article
- Relation: Pattern Recognition and Image Analysis Vol. 32, no. 3 (2022), p. 551-560
- Full Text:
- Reviewed:
- Description: Abstract: Image analysis is being applied in many applications including industrial automation with the Industrial Internet of Things and machine vision. The images captured by cameras, especially from the outdoor environment are impacted by various parameters such as lens blur, dirty lens, and lens distortion (barrel distortion). There exist many approaches that assess the impact of camera parameters on the quality of the images. However, most of these techniques do not use important quality assessment metrics such as oriented FAST and rotated BRIEF, and structural content. None of these techniques objectively evaluate the impact of barrel distortion on the image quality using quality assessment metrics such as mean square error, peak signal-to-noise ratio, structural content, oriented FAST, and rotated BRIEF, and structural similarity index. In this paper, besides lens dirtiness and blurring, we also examine the impact of barrel distortion using various types of datasets having different levels of barrel distortion. Analysis shows none of the existing metrics produces quality values consistent with intuitively defined impact levels for lens blur, dirtiness, and barrel distortion. To address the loopholes of existing metrics and make the quality assessment metric more reliable, we propose a new image quality assessment metric that fuses the quality values obtained from different metrics using a decision fusion technique known as the Dempster–Shafer theory. Our proposed metric produces quality values that are more consistent and conform with the perceptually defined camera parameter impact levels. For all the above-mentioned camera impacts, our proposed metric exhibits 100% assessment reliability, which includes an enormous improvement over other metrics. © 2022, Pleiades Publishing, Ltd.
- Authors: Kaur, Roopdeep , Karmakar, Gour , Xia, Feng
- Date: 2022
- Type: Text , Journal article
- Relation: Pattern Recognition and Image Analysis Vol. 32, no. 3 (2022), p. 551-560
- Full Text:
- Reviewed:
- Description: Abstract: Image analysis is being applied in many applications including industrial automation with the Industrial Internet of Things and machine vision. The images captured by cameras, especially from the outdoor environment are impacted by various parameters such as lens blur, dirty lens, and lens distortion (barrel distortion). There exist many approaches that assess the impact of camera parameters on the quality of the images. However, most of these techniques do not use important quality assessment metrics such as oriented FAST and rotated BRIEF, and structural content. None of these techniques objectively evaluate the impact of barrel distortion on the image quality using quality assessment metrics such as mean square error, peak signal-to-noise ratio, structural content, oriented FAST, and rotated BRIEF, and structural similarity index. In this paper, besides lens dirtiness and blurring, we also examine the impact of barrel distortion using various types of datasets having different levels of barrel distortion. Analysis shows none of the existing metrics produces quality values consistent with intuitively defined impact levels for lens blur, dirtiness, and barrel distortion. To address the loopholes of existing metrics and make the quality assessment metric more reliable, we propose a new image quality assessment metric that fuses the quality values obtained from different metrics using a decision fusion technique known as the Dempster–Shafer theory. Our proposed metric produces quality values that are more consistent and conform with the perceptually defined camera parameter impact levels. For all the above-mentioned camera impacts, our proposed metric exhibits 100% assessment reliability, which includes an enormous improvement over other metrics. © 2022, Pleiades Publishing, Ltd.
Abnormal entity-aware knowledge graph completion
- Sun, Ke, Yu, Shuo, Peng, Ciyuan, Li, Xiang, Naseriparsa, Mehdi, Xia, Feng
- Authors: Sun, Ke , Yu, Shuo , Peng, Ciyuan , Li, Xiang , Naseriparsa, Mehdi , Xia, Feng
- Date: 2022
- Type: Text , Conference paper
- Relation: 22nd IEEE International Conference on Data Mining Workshops, ICDMW 2022, Orlando USA, 28 November to 1 December 2022, Proceedings: 22nd IEEE International Conference on Data Mining Workshops Vol. 2022-November, p. 891-900
- Full Text: false
- Reviewed:
- Description: In real-world scenarios, knowledge graphs remain incomplete and contain abnormal information, such as redundan-cies, contradictions, inconsistencies, misspellings, and abnormal values. These shortcomings in the knowledge graphs potentially affect service quality in many applications. Although many approaches are proposed to perform knowledge graph completion, they are incapable of handling the abnormal information of knowledge graphs. Therefore, to address the abnormal information issue for the knowledge graph completion task, we design a novel knowledge graph completion framework called ABET, which specially focuses on abnormal entities. ABET consists of two components: a) abnormal entity prediction and b) knowledge graph completion. Firstly, the prediction component automati-cally predicts the abnormal entities in knowledge graphs. Then, the completion component effectively captures the heterogeneous structural information and the high-order features of neighbours based on different relations. Experiments demonstrate that ABET is an effective knowledge graph completion framework, which has made significant improvements over baselines. We further verify that ABET is robust for knowledge graph completion task with abnormal entities. © 2022 IEEE.
CHIEF : clustering With higher-order motifs in big networks
- Xia, Feng, Yu, Shuo, Liu, Chengfei, Li, Jianxin, Lee, Ivan
- Authors: Xia, Feng , Yu, Shuo , Liu, Chengfei , Li, Jianxin , Lee, Ivan
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Transactions on Network Science and Engineering Vol. 9, no. 3 (2022), p. 990-1005
- Full Text:
- Reviewed:
- Description: 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 $k$-edge-connected subgraphs within the target networks to lower the network scale by optimizing the network structure with maximal $k$-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 $k$. 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.
- Authors: Xia, Feng , Yu, Shuo , Liu, Chengfei , Li, Jianxin , Lee, Ivan
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Transactions on Network Science and Engineering Vol. 9, no. 3 (2022), p. 990-1005
- Full Text:
- Reviewed:
- Description: 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 $k$-edge-connected subgraphs within the target networks to lower the network scale by optimizing the network structure with maximal $k$-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 $k$. 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.
Collaborative filtering with network representation learning for citation recommendation
- Wang, Wei, Tang, Tao, Xia, Feng, Gong, Zhiguo, Chen, Zhikui, Liu, Huan
- 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.
- 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.
Collaborative team recognition : a core plus extension structure
- Yu, Shuo, Alqahtani, Fayez, Tolba, Amr, Lee, Ivan, Jia, Tao, Xia, Feng
- Authors: Yu, Shuo , Alqahtani, Fayez , Tolba, Amr , Lee, Ivan , Jia, Tao , Xia, Feng
- Date: 2022
- Type: Text , Journal article
- Relation: Journal of Informetrics Vol. 16, no. 4 (2022), p.
- Full Text: false
- Reviewed:
- Description: Scientific collaboration is a significant behavior in knowledge creation and idea exchange. To tackle large and complex research questions, a trend of team formation has been observed in recent decades. In this study, we focus on recognizing collaborative teams and exploring inner patterns using scholarly big graph data. We propose a collaborative team recognition (CORE) model with a "core + extension"team structure to recognize collaborative teams in large academic networks. In CORE, we combine an effective evaluation index called the collaboration intensity index with a series of structural features to recognize collaborative teams in which members are in close collaboration relationships. Then, CORE is used to guide the core team members to their extension members. CORE can also serve as the foundation for team-based research. The simulation results indicate that CORE reveals inner patterns of scientific collaboration: senior scholars have broad collaborative relationships and fixed collaboration patterns, which are the underlying mechanisms of team assembly. The experimental results demonstrate that CORE is promising compared with state-of-the-art methods. © 2022 Elsevier Ltd.