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.
Educational big data : predictions, applications and challenges
- Bai, Xiaomei, Zhang, Fuli, Li, Jinzhou, Guo, Teng, Xia, Feng
- Authors: Bai, Xiaomei , Zhang, Fuli , Li, Jinzhou , Guo, Teng , Xia, Feng
- Date: 2021
- Type: Text , Journal article , Review
- Relation: Big Data Research Vol. 26, no. (2021), p.
- Full Text:
- Reviewed:
- Description: Educational big data is becoming a strategic educational asset, exceptionally significant in advancing educational reform. The term educational big data stems from the rapidly growing educational data development, including students' inherent attributes, learning behavior, and psychological state. Educational big data has many applications that can be used for educational administration, teaching innovation, and research management. The representative examples of such applications are student academic performance prediction, employment recommendation, and financial support for low-income students. Different empirical studies have shown that it is possible to predict student performance in the courses during the next term. Predictive research for the higher education stage has become an attractive area of study since it allowed us to predict student behavior. In this survey, we will review predictive research, its applications, and its challenges. We first introduce the significance and background of educational big data. Second, we review the students' academic performance prediction research, such as factors influencing students' academic performance, predicting models, evaluating indices. Third, we introduce the applications of educational big data such as prediction, recommendation, and evaluation. Finally, we investigate challenging research issues in this area. This discussion aims to provide a comprehensive overview of educational big data. © 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 “Feng Xia” is provided in this record**
- Authors: Bai, Xiaomei , Zhang, Fuli , Li, Jinzhou , Guo, Teng , Xia, Feng
- Date: 2021
- Type: Text , Journal article , Review
- Relation: Big Data Research Vol. 26, no. (2021), p.
- Full Text:
- Reviewed:
- Description: Educational big data is becoming a strategic educational asset, exceptionally significant in advancing educational reform. The term educational big data stems from the rapidly growing educational data development, including students' inherent attributes, learning behavior, and psychological state. Educational big data has many applications that can be used for educational administration, teaching innovation, and research management. The representative examples of such applications are student academic performance prediction, employment recommendation, and financial support for low-income students. Different empirical studies have shown that it is possible to predict student performance in the courses during the next term. Predictive research for the higher education stage has become an attractive area of study since it allowed us to predict student behavior. In this survey, we will review predictive research, its applications, and its challenges. We first introduce the significance and background of educational big data. Second, we review the students' academic performance prediction research, such as factors influencing students' academic performance, predicting models, evaluating indices. Third, we introduce the applications of educational big data such as prediction, recommendation, and evaluation. Finally, we investigate challenging research issues in this area. This discussion aims to provide a comprehensive overview of educational big data. © 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 “Feng Xia” is provided in this record**
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.
Big networks : a survey
- Bedru, Hayat, Yu, Shuo, Xiao, Xinru, Zhang, Da, Xia, Feng
- Authors: Bedru, Hayat , Yu, Shuo , Xiao, Xinru , Zhang, Da , Xia, Feng
- Date: 2020
- Type: Text , Journal article , Review
- Relation: Computer Science Review Vol. 37, no. (2020), p.
- Full Text:
- Reviewed:
- Description: A network is a typical expressive form of representing complex systems in terms of vertices and links, in which the pattern of interactions amongst components of the network is intricate. The network can be static that does not change over time or dynamic that evolves through time. The complication of network analysis is different under the new circumstance of network size explosive increasing. In this paper, we introduce a new network science concept called a big network. A big networks is generally in large-scale with a complicated and higher-order inner structure. This paper proposes a guideline framework that gives an insight into the major topics in the area of network science from the viewpoint of a big network. We first introduce the structural characteristics of big networks from three levels, which are micro-level, meso-level, and macro-level. We then discuss some state-of-the-art advanced topics of big network analysis. Big network models and related approaches, including ranking methods, partition approaches, as well as network embedding algorithms are systematically introduced. Some typical applications in big networks are then reviewed, such as community detection, link prediction, recommendation, etc. Moreover, we also pinpoint some critical open issues that need to be investigated further. © 2020 Elsevier Inc.
- Authors: Bedru, Hayat , Yu, Shuo , Xiao, Xinru , Zhang, Da , Xia, Feng
- Date: 2020
- Type: Text , Journal article , Review
- Relation: Computer Science Review Vol. 37, no. (2020), p.
- Full Text:
- Reviewed:
- Description: A network is a typical expressive form of representing complex systems in terms of vertices and links, in which the pattern of interactions amongst components of the network is intricate. The network can be static that does not change over time or dynamic that evolves through time. The complication of network analysis is different under the new circumstance of network size explosive increasing. In this paper, we introduce a new network science concept called a big network. A big networks is generally in large-scale with a complicated and higher-order inner structure. This paper proposes a guideline framework that gives an insight into the major topics in the area of network science from the viewpoint of a big network. We first introduce the structural characteristics of big networks from three levels, which are micro-level, meso-level, and macro-level. We then discuss some state-of-the-art advanced topics of big network analysis. Big network models and related approaches, including ranking methods, partition approaches, as well as network embedding algorithms are systematically introduced. Some typical applications in big networks are then reviewed, such as community detection, link prediction, recommendation, etc. Moreover, we also pinpoint some critical open issues that need to be investigated further. © 2020 Elsevier Inc.
Edge data based trailer inception probabilistic matrix factorization for context-aware movie recommendation
- Chen, Honglong, Li, Zhe, Wang, Zhu, Ni, Zhichen, Li, Junjian, Xu, Ge, Aziz, Abdul, Xia, Feng
- Authors: Chen, Honglong , Li, Zhe , Wang, Zhu , Ni, Zhichen , Li, Junjian , Xu, Ge , Aziz, Abdul , Xia, Feng
- Date: 2022
- Type: Text , Journal article
- Relation: World Wide Web Vol. 25, no. 5 (2022), p. 1863-1882
- Full Text:
- Reviewed:
- Description: The rapid growth of edge data generated by mobile devices and applications deployed at the edge of the network has exacerbated the problem of information overload. As an effective way to alleviate information overload, recommender system can improve the quality of various services by adding application data generated by users on edge devices, such as visual and textual information, on the basis of sparse rating data. The visual information in the movie trailer is a significant part of the movie recommender system. However, due to the complexity of visual information extraction, data sparsity cannot be remarkably alleviated by merely using the rough visual features to improve the rating prediction accuracy. Fortunately, the convolutional neural network can be used to extract the visual features precisely. Therefore, the end-to-end neural image caption (NIC) model can be utilized to obtain the textual information describing the visual features of movie trailers. This paper proposes a trailer inception probabilistic matrix factorization model called Ti-PMF, which combines NIC, recurrent convolutional neural network, and probabilistic matrix factorization models as the rating prediction model. We implement the proposed Ti-PMF model with extensive experiments on three real-world datasets to validate its effectiveness. The experimental results illustrate that the proposed Ti-PMF outperforms the existing ones. © 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
- Authors: Chen, Honglong , Li, Zhe , Wang, Zhu , Ni, Zhichen , Li, Junjian , Xu, Ge , Aziz, Abdul , Xia, Feng
- Date: 2022
- Type: Text , Journal article
- Relation: World Wide Web Vol. 25, no. 5 (2022), p. 1863-1882
- Full Text:
- Reviewed:
- Description: The rapid growth of edge data generated by mobile devices and applications deployed at the edge of the network has exacerbated the problem of information overload. As an effective way to alleviate information overload, recommender system can improve the quality of various services by adding application data generated by users on edge devices, such as visual and textual information, on the basis of sparse rating data. The visual information in the movie trailer is a significant part of the movie recommender system. However, due to the complexity of visual information extraction, data sparsity cannot be remarkably alleviated by merely using the rough visual features to improve the rating prediction accuracy. Fortunately, the convolutional neural network can be used to extract the visual features precisely. Therefore, the end-to-end neural image caption (NIC) model can be utilized to obtain the textual information describing the visual features of movie trailers. This paper proposes a trailer inception probabilistic matrix factorization model called Ti-PMF, which combines NIC, recurrent convolutional neural network, and probabilistic matrix factorization models as the rating prediction model. We implement the proposed Ti-PMF model with extensive experiments on three real-world datasets to validate its effectiveness. The experimental results illustrate that the proposed Ti-PMF outperforms the existing ones. © 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
Decision behavior based private vehicle trajectory generation towards smart cities
- Chen, Qiao, Ma, Kai, Hou, Mingliang, Kong, Xiangjie, Xia, Feng
- Authors: Chen, Qiao , Ma, Kai , Hou, Mingliang , Kong, Xiangjie , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 18th International Conference on Web Information Systems and Applications, WISA 2021 Vol. 12999 LNCS, p. 109-120
- Full Text:
- Reviewed:
- Description: In contrast with the condition that the trajectory dataset of floating cars (taxis) can be easily obtained from the Internet, it is hard to get the trajectory data of social vehicles (private vehicles) because of personal privacy and government policies. This paper absorbs the idea of game theory, considers the influence of individuals in the group, and proposes a decision behavior based dataset generation (DBDG) model of vehicles to predict future inter-regional traffic. In addition, we adopt simulation tools and generative adversarial networks to train the trajectory prediction model so that the private vehicle trajectory dataset conforming to social rules (e.g., collisionless) is generated. Finally, we construct from macroscopic and microscopic perspectives to verify dataset generation methods proposed in this paper. The results show that the generated data not only has high accuracy and is valuable but can provide strong data support for the Internet of Vehicles and transportation research work. © 2021, Springer Nature Switzerland AG.
- Authors: Chen, Qiao , Ma, Kai , Hou, Mingliang , Kong, Xiangjie , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 18th International Conference on Web Information Systems and Applications, WISA 2021 Vol. 12999 LNCS, p. 109-120
- Full Text:
- Reviewed:
- Description: In contrast with the condition that the trajectory dataset of floating cars (taxis) can be easily obtained from the Internet, it is hard to get the trajectory data of social vehicles (private vehicles) because of personal privacy and government policies. This paper absorbs the idea of game theory, considers the influence of individuals in the group, and proposes a decision behavior based dataset generation (DBDG) model of vehicles to predict future inter-regional traffic. In addition, we adopt simulation tools and generative adversarial networks to train the trajectory prediction model so that the private vehicle trajectory dataset conforming to social rules (e.g., collisionless) is generated. Finally, we construct from macroscopic and microscopic perspectives to verify dataset generation methods proposed in this paper. The results show that the generated data not only has high accuracy and is valuable but can provide strong data support for the Internet of Vehicles and transportation research work. © 2021, Springer Nature Switzerland AG.
Heterogeneous graph learning for explainable recommendation over academic networks
- Chen, Xiangtai, Tang, Tao, Ren, Jing, Lee, Ivan, Chen, Honglong, Xia, Feng
- Authors: Chen, Xiangtai , Tang, Tao , Ren, Jing , Lee, Ivan , Chen, Honglong , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 2021 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, WI-IAT 2021, Virtual, Online, 14-17 December 2021, ACM International Conference Proceeding Series p. 29-36
- Full Text:
- Reviewed:
- Description: With the explosive growth of new graduates with research degrees every year, unprecedented challenges arise for early-career researchers to find a job at a suitable institution. This study aims to understand the behavior of academic job transition and hence recommend suitable institutions for PhD graduates. Specifically, we design a deep learning model to predict the career move of early-career researchers and provide suggestions. The design is built on top of scholarly/academic networks, which contains abundant information about scientific collaboration among scholars and institutions. We construct a heterogeneous scholarly network to facilitate the exploring of the behavior of career moves and the recommendation of institutions for scholars. We devise an unsupervised learning model called HAI (Heterogeneous graph Attention InfoMax) which aggregates attention mechanism and mutual information for institution recommendation. Moreover, we propose scholar attention and meta-path attention to discover the hidden relationships between several meta-paths. With these mechanisms, HAI provides ordered recommendations with explainability. We evaluate HAI upon a real-world dataset against baseline methods. Experimental results verify the effectiveness and efficiency of our approach. © 2021 ACM.
- Authors: Chen, Xiangtai , Tang, Tao , Ren, Jing , Lee, Ivan , Chen, Honglong , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 2021 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, WI-IAT 2021, Virtual, Online, 14-17 December 2021, ACM International Conference Proceeding Series p. 29-36
- Full Text:
- Reviewed:
- Description: With the explosive growth of new graduates with research degrees every year, unprecedented challenges arise for early-career researchers to find a job at a suitable institution. This study aims to understand the behavior of academic job transition and hence recommend suitable institutions for PhD graduates. Specifically, we design a deep learning model to predict the career move of early-career researchers and provide suggestions. The design is built on top of scholarly/academic networks, which contains abundant information about scientific collaboration among scholars and institutions. We construct a heterogeneous scholarly network to facilitate the exploring of the behavior of career moves and the recommendation of institutions for scholars. We devise an unsupervised learning model called HAI (Heterogeneous graph Attention InfoMax) which aggregates attention mechanism and mutual information for institution recommendation. Moreover, we propose scholar attention and meta-path attention to discover the hidden relationships between several meta-paths. With these mechanisms, HAI provides ordered recommendations with explainability. We evaluate HAI upon a real-world dataset against baseline methods. Experimental results verify the effectiveness and efficiency of our approach. © 2021 ACM.
Subgraph adaptive structure-aware graph contrastive learning
- Chen, Zhikui, Peng, Yin, Yu, Shuo, Cao, Chen, Xia, Feng
- Authors: Chen, Zhikui , Peng, Yin , Yu, Shuo , Cao, Chen , Xia, Feng
- Date: 2022
- Type: Text , Journal article
- Relation: Mathematics (Basel) Vol. 10, no. 17 (2022), p. 3047
- Full Text:
- Reviewed:
- Description: Graph contrastive learning (GCL) has been subject to more attention and been widely applied to numerous graph learning tasks such as node classification and link prediction. Although it has achieved great success and even performed better than supervised methods in some tasks, most of them depend on node-level comparison, while ignoring the rich semantic information contained in graph topology, especially for social networks. However, a higher-level comparison requires subgraph construction and encoding, which remain unsolved. To address this problem, we propose a subgraph adaptive structure-aware graph contrastive learning method (PASCAL) in this work, which is a subgraph-level GCL method. In PASCAL, we construct subgraphs by merging all motifs that contain the target node. Then we encode them on the basis of motif number distribution to capture the rich information hidden in subgraphs. By incorporating motif information, PASCAL can capture richer semantic information hidden in local structures compared with other GCL methods. Extensive experiments on six benchmark datasets show that PASCAL outperforms state-of-art graph contrastive learning and supervised methods in most cases.
- Authors: Chen, Zhikui , Peng, Yin , Yu, Shuo , Cao, Chen , Xia, Feng
- Date: 2022
- Type: Text , Journal article
- Relation: Mathematics (Basel) Vol. 10, no. 17 (2022), p. 3047
- Full Text:
- Reviewed:
- Description: Graph contrastive learning (GCL) has been subject to more attention and been widely applied to numerous graph learning tasks such as node classification and link prediction. Although it has achieved great success and even performed better than supervised methods in some tasks, most of them depend on node-level comparison, while ignoring the rich semantic information contained in graph topology, especially for social networks. However, a higher-level comparison requires subgraph construction and encoding, which remain unsolved. To address this problem, we propose a subgraph adaptive structure-aware graph contrastive learning method (PASCAL) in this work, which is a subgraph-level GCL method. In PASCAL, we construct subgraphs by merging all motifs that contain the target node. Then we encode them on the basis of motif number distribution to capture the rich information hidden in subgraphs. By incorporating motif information, PASCAL can capture richer semantic information hidden in local structures compared with other GCL methods. Extensive experiments on six benchmark datasets show that PASCAL outperforms state-of-art graph contrastive learning and supervised methods in most cases.
Graduate employment prediction with bias
- Guo, Teng, Xia, Feng, Zhen, Shihao, Bai, Xiaomei, Zhang, Dongyu
- Authors: Guo, Teng , Xia, Feng , Zhen, Shihao , Bai, Xiaomei , Zhang, Dongyu
- Date: 2020
- Type: Text , Conference paper
- Relation: AAAI 2020 - 34th AAAI Conference on Artificial Intelligence p. 670-677
- Full Text:
- Reviewed:
- Description: The failure of landing a job for college students could cause serious social consequences such as drunkenness and suicide. In addition to academic performance, unconscious biases can become one key obstacle for hunting jobs for graduating students. Thus, it is necessary to understand these unconscious biases so that we can help these students at an early stage with more personalized intervention. In this paper, we develop a framework, i.e., MAYA (Multi-mAjor emploYment stAtus) to predict students’ employment status while considering biases. The framework consists of four major components. Firstly, we solve the heterogeneity of student courses by embedding academic performance into a unified space. Then, we apply a generative adversarial network (GAN) to overcome the class imbalance problem. Thirdly, we adopt Long Short-Term Memory (LSTM) with a novel dropout mechanism to comprehensively capture sequential information among semesters. Finally, we design a bias-based regularization to capture the job market biases. We conduct extensive experiments on a large-scale educational dataset and the results demonstrate the effectiveness of our prediction framework. Copyright © 2020, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. **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: Guo, Teng , Xia, Feng , Zhen, Shihao , Bai, Xiaomei , Zhang, Dongyu
- Date: 2020
- Type: Text , Conference paper
- Relation: AAAI 2020 - 34th AAAI Conference on Artificial Intelligence p. 670-677
- Full Text:
- Reviewed:
- Description: The failure of landing a job for college students could cause serious social consequences such as drunkenness and suicide. In addition to academic performance, unconscious biases can become one key obstacle for hunting jobs for graduating students. Thus, it is necessary to understand these unconscious biases so that we can help these students at an early stage with more personalized intervention. In this paper, we develop a framework, i.e., MAYA (Multi-mAjor emploYment stAtus) to predict students’ employment status while considering biases. The framework consists of four major components. Firstly, we solve the heterogeneity of student courses by embedding academic performance into a unified space. Then, we apply a generative adversarial network (GAN) to overcome the class imbalance problem. Thirdly, we adopt Long Short-Term Memory (LSTM) with a novel dropout mechanism to comprehensively capture sequential information among semesters. Finally, we design a bias-based regularization to capture the job market biases. We conduct extensive experiments on a large-scale educational dataset and the results demonstrate the effectiveness of our prediction framework. Copyright © 2020, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. **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**
Lost at starting line : predicting maladaptation of university freshmen based on educational big data
- Guo, Teng, Bai, Xiaomei, Zhen, Shihao, Abid, Shagufta, Xia, Feng
- Authors: Guo, Teng , Bai, Xiaomei , Zhen, Shihao , Abid, Shagufta , Xia, Feng
- Date: 2023
- Type: Text , Journal article
- Relation: Journal of the Association for Information Science and Technology Vol. 74, no. 1 (2023), p. 17-32
- Full Text:
- Reviewed:
- Description: The transition from secondary education to higher education could be challenging for most freshmen. For students who fail to adjust to university life smoothly, their status may worsen if the university cannot offer timely and proper guidance. Helping students adapt to university life is a long-term goal for any academic institution. Therefore, understanding the nature of the maladaptation phenomenon and the early prediction of “at-risk” students are crucial tasks that urgently need to be tackled effectively. This article aims to analyze the relevant factors that affect the maladaptation phenomenon and predict this phenomenon in advance. We develop a prediction framework (MAladaptive STudEnt pRediction, MASTER) for the early prediction of students with maladaptation. First, our framework uses the SMOTE (Synthetic Minority Oversampling Technique) algorithm to solve the data label imbalance issue. Moreover, a novel ensemble algorithm, priority forest, is proposed for outputting ranks instead of binary results, which enables us to perform proactive interventions in a prioritized manner where limited education resources are available. Experimental results on real-world education datasets demonstrate that the MASTER framework outperforms other state-of-art methods. © 2022 The Authors. Journal of the Association for Information Science and Technology published by Wiley Periodicals LLC on behalf of Association for Information Science and Technology.
- Authors: Guo, Teng , Bai, Xiaomei , Zhen, Shihao , Abid, Shagufta , Xia, Feng
- Date: 2023
- Type: Text , Journal article
- Relation: Journal of the Association for Information Science and Technology Vol. 74, no. 1 (2023), p. 17-32
- Full Text:
- Reviewed:
- Description: The transition from secondary education to higher education could be challenging for most freshmen. For students who fail to adjust to university life smoothly, their status may worsen if the university cannot offer timely and proper guidance. Helping students adapt to university life is a long-term goal for any academic institution. Therefore, understanding the nature of the maladaptation phenomenon and the early prediction of “at-risk” students are crucial tasks that urgently need to be tackled effectively. This article aims to analyze the relevant factors that affect the maladaptation phenomenon and predict this phenomenon in advance. We develop a prediction framework (MAladaptive STudEnt pRediction, MASTER) for the early prediction of students with maladaptation. First, our framework uses the SMOTE (Synthetic Minority Oversampling Technique) algorithm to solve the data label imbalance issue. Moreover, a novel ensemble algorithm, priority forest, is proposed for outputting ranks instead of binary results, which enables us to perform proactive interventions in a prioritized manner where limited education resources are available. Experimental results on real-world education datasets demonstrate that the MASTER framework outperforms other state-of-art methods. © 2022 The Authors. Journal of the Association for Information Science and Technology published by Wiley Periodicals LLC on behalf of Association for Information Science and Technology.
Multimodal educational data fusion for students' mental health detection
- Guo, Teng, Zhao, Wenhong, Alrashoud, Mubarak, Tolba, Amr, Firmin, Sally, Xia, Feng
- Authors: Guo, Teng , Zhao, Wenhong , Alrashoud, Mubarak , Tolba, Amr , Firmin, Sally , Xia, Feng
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Access Vol. 10, no. (2022), p. 70370-70382
- Full Text:
- Reviewed:
- Description: Mental health issues can lead to serious consequences like depression, self-mutilation, and worse, especially for university students who are not physically and mentally mature. Not all students with poor mental health are aware of their situation and actively seek help. Proactive detection of mental problems is a critical step in addressing this issue. However, accurate detections are hard to achieve due to the inherent complexity and heterogeneity of unstructured multi-modal data generated by campus life. Against this background, we propose a detection framework for detecting students' mental health, named CASTLE (educational data fusion for mental health detection). Three parts are involved in this framework. First, we utilize representation learning to fuse data on social life, academic performance, and physical appearance. An algorithm, named MOON (multi-view social network embedding), is proposed to represent students' social life in a comprehensive way by fusing students' heterogeneous social relations effectively. Second, a synthetic minority oversampling technique algorithm (SMOTE) is applied to the label imbalance issue. Finally, a DNN (deep neural network) model is utilized for the final detection. The extensive results demonstrate the promising performance of the proposed methods in comparison to an extensive range of state-of-the-art baselines. © 2013 IEEE.
- Authors: Guo, Teng , Zhao, Wenhong , Alrashoud, Mubarak , Tolba, Amr , Firmin, Sally , Xia, Feng
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Access Vol. 10, no. (2022), p. 70370-70382
- Full Text:
- Reviewed:
- Description: Mental health issues can lead to serious consequences like depression, self-mutilation, and worse, especially for university students who are not physically and mentally mature. Not all students with poor mental health are aware of their situation and actively seek help. Proactive detection of mental problems is a critical step in addressing this issue. However, accurate detections are hard to achieve due to the inherent complexity and heterogeneity of unstructured multi-modal data generated by campus life. Against this background, we propose a detection framework for detecting students' mental health, named CASTLE (educational data fusion for mental health detection). Three parts are involved in this framework. First, we utilize representation learning to fuse data on social life, academic performance, and physical appearance. An algorithm, named MOON (multi-view social network embedding), is proposed to represent students' social life in a comprehensive way by fusing students' heterogeneous social relations effectively. Second, a synthetic minority oversampling technique algorithm (SMOTE) is applied to the label imbalance issue. Finally, a DNN (deep neural network) model is utilized for the final detection. The extensive results demonstrate the promising performance of the proposed methods in comparison to an extensive range of state-of-the-art baselines. © 2013 IEEE.
Educational anomaly analytics : features, methods, and challenges
- Guo, Teng, Bai, Xiaomei, Tian, Xue, Firmin, Sally, Xia, Feng
- Authors: Guo, Teng , Bai, Xiaomei , Tian, Xue , Firmin, Sally , Xia, Feng
- Date: 2022
- Type: Text , Journal article , Review
- Relation: Frontiers in Big Data Vol. 4, no. (2022), p.
- Full Text:
- Reviewed:
- Description: Anomalies in education affect the personal careers of students and universities' retention rates. Understanding the laws behind educational anomalies promotes the development of individual students and improves the overall quality of education. However, the inaccessibility of educational data hinders the development of the field. Previous research in this field used questionnaires, which are time- and cost-consuming and hardly applicable to large-scale student cohorts. With the popularity of educational management systems and the rise of online education during the prevalence of COVID-19, a large amount of educational data is available online and offline, providing an unprecedented opportunity to explore educational anomalies from a data-driven perspective. As an emerging field, educational anomaly analytics rapidly attracts scholars from a variety of fields, including education, psychology, sociology, and computer science. This paper intends to provide a comprehensive review of data-driven analytics of educational anomalies from a methodological standpoint. We focus on the following five types of research that received the most attention: course failure prediction, dropout prediction, mental health problems detection, prediction of difficulty in graduation, and prediction of difficulty in employment. Then, we discuss the challenges of current related research. This study aims to provide references for educational policymaking while promoting the development of educational anomaly analytics as a growing field. Copyright © 2022 Guo, Bai, Tian, Firmin and Xia.
- Authors: Guo, Teng , Bai, Xiaomei , Tian, Xue , Firmin, Sally , Xia, Feng
- Date: 2022
- Type: Text , Journal article , Review
- Relation: Frontiers in Big Data Vol. 4, no. (2022), p.
- Full Text:
- Reviewed:
- Description: Anomalies in education affect the personal careers of students and universities' retention rates. Understanding the laws behind educational anomalies promotes the development of individual students and improves the overall quality of education. However, the inaccessibility of educational data hinders the development of the field. Previous research in this field used questionnaires, which are time- and cost-consuming and hardly applicable to large-scale student cohorts. With the popularity of educational management systems and the rise of online education during the prevalence of COVID-19, a large amount of educational data is available online and offline, providing an unprecedented opportunity to explore educational anomalies from a data-driven perspective. As an emerging field, educational anomaly analytics rapidly attracts scholars from a variety of fields, including education, psychology, sociology, and computer science. This paper intends to provide a comprehensive review of data-driven analytics of educational anomalies from a methodological standpoint. We focus on the following five types of research that received the most attention: course failure prediction, dropout prediction, mental health problems detection, prediction of difficulty in graduation, and prediction of difficulty in employment. Then, we discuss the challenges of current related research. This study aims to provide references for educational policymaking while promoting the development of educational anomaly analytics as a growing field. Copyright © 2022 Guo, Bai, Tian, Firmin and Xia.
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
A3Graph : adversarial attributed autoencoder for graph representation learning
- Hou, Mingliang, Wang, Lei, Liu, Jiaying, Kong, Xiangjie, Xia, Feng
- Authors: Hou, Mingliang , Wang, Lei , Liu, Jiaying , Kong, Xiangjie , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 36th Annual ACM Symposium on Applied Computing, SAC 2021 p. 1697-1704
- Full Text:
- Reviewed:
- Description: Recent years have witnessed a proliferation of graph representation techniques in social network analysis. Graph representation aims to map nodes in the graph into low-dimensional vector space while preserving as much information as possible. However, most existing methods ignore the robustness of learned latent vectors, which leads to inferior representation results due to sparse and noisy data in graphs. In this paper, we propose a novel framework, named A3Graph, which aims to improve the robustness and stability of graph representations. Specifically, we first construct an aggregation matrix by the combining positive point-wise mutual information matrix with the attribute matrix. Then, we enforce the autoencoder to reconstruct the aggregation matrix instead of the input attribute matrix. The enhancement autoencoder can incorporate structural and attributed information in a joint learning way to improve the noise-resilient during the learning process. Furthermore, an adversarial learning component is leveraged in our framework to impose a prior distribution on learned representations has been demonstrated as an effective mechanism in improving the robustness and stability in representation learning. Experimental studies on real-world datasets have demonstrated the effectiveness of the proposed A3Graph. © 2021 ACM.
- Authors: Hou, Mingliang , Wang, Lei , Liu, Jiaying , Kong, Xiangjie , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 36th Annual ACM Symposium on Applied Computing, SAC 2021 p. 1697-1704
- Full Text:
- Reviewed:
- Description: Recent years have witnessed a proliferation of graph representation techniques in social network analysis. Graph representation aims to map nodes in the graph into low-dimensional vector space while preserving as much information as possible. However, most existing methods ignore the robustness of learned latent vectors, which leads to inferior representation results due to sparse and noisy data in graphs. In this paper, we propose a novel framework, named A3Graph, which aims to improve the robustness and stability of graph representations. Specifically, we first construct an aggregation matrix by the combining positive point-wise mutual information matrix with the attribute matrix. Then, we enforce the autoencoder to reconstruct the aggregation matrix instead of the input attribute matrix. The enhancement autoencoder can incorporate structural and attributed information in a joint learning way to improve the noise-resilient during the learning process. Furthermore, an adversarial learning component is leveraged in our framework to impose a prior distribution on learned representations has been demonstrated as an effective mechanism in improving the robustness and stability in representation learning. Experimental studies on real-world datasets have demonstrated the effectiveness of the proposed A3Graph. © 2021 ACM.
Network embedding : taxonomies, frameworks and applications
- Hou, Mingliang, Ren, Jing, Zhang, Da, Kong, Xiangjie, Zhang, Dongyu, Xia, Feng
- Authors: Hou, Mingliang , Ren, Jing , Zhang, Da , Kong, Xiangjie , Zhang, Dongyu , Xia, Feng
- Date: 2020
- Type: Text , Journal article , Review
- Relation: Computer Science Review Vol. 38, no. (2020), p.
- Full Text:
- Reviewed:
- Description: Networks are a general language for describing complex systems of interacting entities. In the real world, a network always contains massive nodes, edges and additional complex information which leads to high complexity in computing and analyzing tasks. Network embedding aims at transforming one network into a low dimensional vector space which benefits the downstream network analysis tasks. In this survey, we provide a systematic overview of network embedding techniques in addressing challenges appearing in networks. We first introduce concepts and challenges in network embedding. Afterwards, we categorize network embedding methods using three categories, including static homogeneous network embedding methods, static heterogeneous network embedding methods and dynamic network embedding methods. Next, we summarize the datasets and evaluation tasks commonly used in network embedding. Finally, we discuss several future directions in this field. © 2020 Elsevier Inc.
- Authors: Hou, Mingliang , Ren, Jing , Zhang, Da , Kong, Xiangjie , Zhang, Dongyu , Xia, Feng
- Date: 2020
- Type: Text , Journal article , Review
- Relation: Computer Science Review Vol. 38, no. (2020), p.
- Full Text:
- Reviewed:
- Description: Networks are a general language for describing complex systems of interacting entities. In the real world, a network always contains massive nodes, edges and additional complex information which leads to high complexity in computing and analyzing tasks. Network embedding aims at transforming one network into a low dimensional vector space which benefits the downstream network analysis tasks. In this survey, we provide a systematic overview of network embedding techniques in addressing challenges appearing in networks. We first introduce concepts and challenges in network embedding. Afterwards, we categorize network embedding methods using three categories, including static homogeneous network embedding methods, static heterogeneous network embedding methods and dynamic network embedding methods. Next, we summarize the datasets and evaluation tasks commonly used in network embedding. Finally, we discuss several future directions in this field. © 2020 Elsevier Inc.
Cross network representation matching with outliers
- Hou, Mingliang, Ren, Jing, Febrinanto, Febrinanto, Shehzad, Ahsan, Xia, Feng
- Authors: Hou, Mingliang , Ren, Jing , Febrinanto, Febrinanto , Shehzad, Ahsan , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 21st IEEE International Conference on Data Mining Workshops, ICDMW 2021, Virtual, online, 7-10 December 2021, IEEE International Conference on Data Mining Workshops, ICDMW Vol. 2021-December, p. 951-958
- Full Text:
- Reviewed:
- Description: Research has revealed the effectiveness of network representation techniques in handling diverse downstream machine learning tasks upon graph structured data. However, most network representation methods only seek to learn information in a single network, which fails to learn knowledge across different networks. Moreover, outliers in real-world networks pose great challenges to match distribution shift of learned embeddings. In this paper, we propose a novel joint learning framework, called CrossOSR, to learn network-invariant embeddings across different networks in the presence of outliers in the source network. To learn outlier-aware representations, a modified graph convolutional network (GCN) layer is designed to indicate the potential outliers. To learn more fine-grained information between different domains, a subdomain matching is adopted to align the shift distribution of learned vectors. To learn robust network representations, the learned indicator is utilized to smooth the noise effect from source domain to target domain. Extensive experimental results on three real-world datasets in the node classification task show that the proposed framework yields state-of-the-art cross network representation matching performance with outliers in the source network. © 2021 IEEE.
- Authors: Hou, Mingliang , Ren, Jing , Febrinanto, Febrinanto , Shehzad, Ahsan , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 21st IEEE International Conference on Data Mining Workshops, ICDMW 2021, Virtual, online, 7-10 December 2021, IEEE International Conference on Data Mining Workshops, ICDMW Vol. 2021-December, p. 951-958
- Full Text:
- Reviewed:
- Description: Research has revealed the effectiveness of network representation techniques in handling diverse downstream machine learning tasks upon graph structured data. However, most network representation methods only seek to learn information in a single network, which fails to learn knowledge across different networks. Moreover, outliers in real-world networks pose great challenges to match distribution shift of learned embeddings. In this paper, we propose a novel joint learning framework, called CrossOSR, to learn network-invariant embeddings across different networks in the presence of outliers in the source network. To learn outlier-aware representations, a modified graph convolutional network (GCN) layer is designed to indicate the potential outliers. To learn more fine-grained information between different domains, a subdomain matching is adopted to align the shift distribution of learned vectors. To learn robust network representations, the learned indicator is utilized to smooth the noise effect from source domain to target domain. Extensive experimental results on three real-world datasets in the node classification task show that the proposed framework yields state-of-the-art cross network representation matching performance with outliers in the source network. © 2021 IEEE.
Deep learning : survey of environmental and camera impacts on internet of things images
- Kaur, Roopdeep, Karmakar, Gour, Xia, Feng, Imran, Muhammad
- Authors: Kaur, Roopdeep , Karmakar, Gour , Xia, Feng , Imran, Muhammad
- Date: 2023
- Type: Text , Journal article
- Relation: Artificial Intelligence Review Vol. 56, no. 9 (2023), p. 9605-9638
- Full Text:
- Reviewed:
- Description: Internet of Things (IoT) images are captivating growing attention because of their wide range of applications which requires visual analysis to drive automation. However, IoT images are predominantly captured from outdoor environments and thus are inherently impacted by the camera and environmental parameters which can adversely affect corresponding applications. Deep Learning (DL) has been widely adopted in the field of image processing and computer vision and can reduce the impact of these parameters on IoT images. Albeit, there are many DL-based techniques available in the current literature for analyzing and reducing the environmental and camera impacts on IoT images. However, to the best of our knowledge, no survey paper presents state-of-the-art DL-based approaches for this purpose. Motivated by this, for the first time, we present a Systematic Literature Review (SLR) of existing DL techniques available for analyzing and reducing environmental and camera lens impacts on IoT images. As part of this SLR, firstly, we reiterate and highlight the significance of IoT images in their respective applications. Secondly, we describe the DL techniques employed for assessing the environmental and camera lens distortion impacts on IoT images. Thirdly, we illustrate how DL can be effective in reducing the impact of environmental and camera lens distortion in IoT images. Finally, along with the critical reflection on the advantages and limitations of the techniques, we also present ways to address the research challenges of existing techniques and identify some further researches to advance the relevant research areas. © 2023, The Author(s).
- Authors: Kaur, Roopdeep , Karmakar, Gour , Xia, Feng , Imran, Muhammad
- Date: 2023
- Type: Text , Journal article
- Relation: Artificial Intelligence Review Vol. 56, no. 9 (2023), p. 9605-9638
- Full Text:
- Reviewed:
- Description: Internet of Things (IoT) images are captivating growing attention because of their wide range of applications which requires visual analysis to drive automation. However, IoT images are predominantly captured from outdoor environments and thus are inherently impacted by the camera and environmental parameters which can adversely affect corresponding applications. Deep Learning (DL) has been widely adopted in the field of image processing and computer vision and can reduce the impact of these parameters on IoT images. Albeit, there are many DL-based techniques available in the current literature for analyzing and reducing the environmental and camera impacts on IoT images. However, to the best of our knowledge, no survey paper presents state-of-the-art DL-based approaches for this purpose. Motivated by this, for the first time, we present a Systematic Literature Review (SLR) of existing DL techniques available for analyzing and reducing environmental and camera lens impacts on IoT images. As part of this SLR, firstly, we reiterate and highlight the significance of IoT images in their respective applications. Secondly, we describe the DL techniques employed for assessing the environmental and camera lens distortion impacts on IoT images. Thirdly, we illustrate how DL can be effective in reducing the impact of environmental and camera lens distortion in IoT images. Finally, along with the critical reflection on the advantages and limitations of the techniques, we also present ways to address the research challenges of existing techniques and identify some further researches to advance the relevant research areas. © 2023, The Author(s).
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.
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.
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.