Texture based vein biometrics for human identification : A comparative study
- Bashar, Khayrul, Murshed, Manzur
- Authors: Bashar, Khayrul , Murshed, Manzur
- Date: 2018
- Type: Text , Conference proceedings
- Relation: 42nd IEEE Computer Software and Applications Conference, COMPSAC 2018; Tokyo, Japan; 23rd-27th July 2018 Vol. 2, p. 571-576
- Full Text:
- Reviewed:
- Description: Hand vein biometric is an important modality for human authentication and liveness detection in many applications. Reliable feature extraction is vital to any biometric system. Over the past years, two major categories of vein features, namely vein structures and vein image textures, were proposed for hand dorsal vein based biometric identification. Of them, texture features seem important as it can combine skin micro-textures along with vein properties. In this study, we have performed a comparative study to identify potential texture features and feature-classifier combination that produce efficient vein biometric systems. Seven texture features (HOG, GABOR, GLCM, SSF, DWT, WPT, and LBP) and three multiclass classifiers (LDA, ESVM, and KNN) were explored towards the supervised identification of human from vein images. An experiment with 400 infrared (IR) hand images from 40 adults indicates the superior performance of the histogram of oriented gradients (HOG) and simple local statistical feature (SSF) with LDA and ESVM classifiers in terms of average accuracy (> 90%), average Fscore (> 58%) and average specificity (>93%). The decision-level fusion of the LDA and ESVM classifier with single texture features showed improved performances (by 2.2 to 13.2% of average Fscore) over individual classifier for human identification with IR hand vein images.
- Description: Proceedings - International Computer Software and Applications Conference
- Authors: Bashar, Khayrul , Murshed, Manzur
- Date: 2018
- Type: Text , Conference proceedings
- Relation: 42nd IEEE Computer Software and Applications Conference, COMPSAC 2018; Tokyo, Japan; 23rd-27th July 2018 Vol. 2, p. 571-576
- Full Text:
- Reviewed:
- Description: Hand vein biometric is an important modality for human authentication and liveness detection in many applications. Reliable feature extraction is vital to any biometric system. Over the past years, two major categories of vein features, namely vein structures and vein image textures, were proposed for hand dorsal vein based biometric identification. Of them, texture features seem important as it can combine skin micro-textures along with vein properties. In this study, we have performed a comparative study to identify potential texture features and feature-classifier combination that produce efficient vein biometric systems. Seven texture features (HOG, GABOR, GLCM, SSF, DWT, WPT, and LBP) and three multiclass classifiers (LDA, ESVM, and KNN) were explored towards the supervised identification of human from vein images. An experiment with 400 infrared (IR) hand images from 40 adults indicates the superior performance of the histogram of oriented gradients (HOG) and simple local statistical feature (SSF) with LDA and ESVM classifiers in terms of average accuracy (> 90%), average Fscore (> 58%) and average specificity (>93%). The decision-level fusion of the LDA and ESVM classifier with single texture features showed improved performances (by 2.2 to 13.2% of average Fscore) over individual classifier for human identification with IR hand vein images.
- Description: Proceedings - International Computer Software and Applications Conference
QMET : A new quality assessment metric for no-reference video coding by using human eye traversal
- Podder, Pallab, Paul, Manoranjan, Murshed, Manzur
- Authors: Podder, Pallab , Paul, Manoranjan , Murshed, Manzur
- Date: 2016
- Type: Text , Conference proceedings
- Relation: 2016 International Conference on Image and Vision Computing New Zealand, IVCNZ 2016; Palmerston North, New Zealand; 21st-22nd November 2016 p. 1-6
- Full Text:
- Reviewed:
- Description: The subjective quality assessment (SQA) is an ever demanding approach due to its in-depth interactivity to the human cognition. The addition of no-reference based scheme could equip the SQA techniques to tackle further challenges. Existing widely used objective metrics-peak signal-to-noise ratio (PSNR), structural similarity index (SSIM) or the subjective estimator-mean opinion score (MOS) requires original image for quality evaluation that limits their uses for the situation having no-reference. In this work, we present a no-reference based SQA technique that could be an impressive substitute to the reference-based approaches for quality evaluation. The High Efficiency Video Coding (HEVC) reference test model (HM15.0) is first exploited to generate five different qualities of the HEVC recommended eight class sequences. To assess different aspects of coded video quality, a group of ten participants are employed and their eye-tracker (ET) recorded data demonstrate closer correlation among gaze plots for relatively better quality video contents. Therefore, we innovatively calculate the amount of approximation of smooth eye traversal (ASET) by using distance, angle, and pupil-size feature from recorded gaze trajectory data and develop a new-quality metric based on eye traversal (QMET). Experimental results show that the quality evaluation carried out by QMET is highly correlated to the HM recommended coding quality. The performance of the QMET is also compared with the PSNR and SSIM metrics to justify the effectiveness of each other.
- Description: International Conference Image and Vision Computing New Zealand
- Authors: Podder, Pallab , Paul, Manoranjan , Murshed, Manzur
- Date: 2016
- Type: Text , Conference proceedings
- Relation: 2016 International Conference on Image and Vision Computing New Zealand, IVCNZ 2016; Palmerston North, New Zealand; 21st-22nd November 2016 p. 1-6
- Full Text:
- Reviewed:
- Description: The subjective quality assessment (SQA) is an ever demanding approach due to its in-depth interactivity to the human cognition. The addition of no-reference based scheme could equip the SQA techniques to tackle further challenges. Existing widely used objective metrics-peak signal-to-noise ratio (PSNR), structural similarity index (SSIM) or the subjective estimator-mean opinion score (MOS) requires original image for quality evaluation that limits their uses for the situation having no-reference. In this work, we present a no-reference based SQA technique that could be an impressive substitute to the reference-based approaches for quality evaluation. The High Efficiency Video Coding (HEVC) reference test model (HM15.0) is first exploited to generate five different qualities of the HEVC recommended eight class sequences. To assess different aspects of coded video quality, a group of ten participants are employed and their eye-tracker (ET) recorded data demonstrate closer correlation among gaze plots for relatively better quality video contents. Therefore, we innovatively calculate the amount of approximation of smooth eye traversal (ASET) by using distance, angle, and pupil-size feature from recorded gaze trajectory data and develop a new-quality metric based on eye traversal (QMET). Experimental results show that the quality evaluation carried out by QMET is highly correlated to the HM recommended coding quality. The performance of the QMET is also compared with the PSNR and SSIM metrics to justify the effectiveness of each other.
- Description: International Conference Image and Vision Computing New Zealand
OEE improvement of thermoforming machines through application of TPM at Tibaldi Australasia
- Chundhoo, Vickram, Chattopadhyay, Gopinath, Gunawan, Indra, Ibrahim, Yousef
- Authors: Chundhoo, Vickram , Chattopadhyay, Gopinath , Gunawan, Indra , Ibrahim, Yousef
- Date: 2017
- Type: Text , Conference proceedings , Conference paper
- Relation: 2017 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2017; Singapore, Singapore; 10th-13th December 2017 p. 929-933
- Full Text:
- Reviewed:
- Description: Overall Equipment Effectiveness (OEE) evaluates quantitatively how effectively a manufacturing operation is utilised. Total Productive Maintenance (TPM) was considered by Tibaldi, a leading food manufacturer in Australia for achieving OEE. This research project has identified performance gaps, developed plan and implemented it in Thermoforming area of the business. The developed methodology helped Tibaldi in improving productivity and quality through TPM involving machines, equipment, processes, and employees. This paper demonstrates how this can be achieved by reducing lead time and establishing lean environment. Productivity improvement through the devised methodology led to further enhancement of competitiveness of the organisation for domestic and international markets of processed food manufactured by Tibaldi Australia. Lessons learned from application of TPM in Thermoforming, a key asset area, is rolled out to other sections of the plat and results from this pilot study are presented in this paper.
- Authors: Chundhoo, Vickram , Chattopadhyay, Gopinath , Gunawan, Indra , Ibrahim, Yousef
- Date: 2017
- Type: Text , Conference proceedings , Conference paper
- Relation: 2017 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2017; Singapore, Singapore; 10th-13th December 2017 p. 929-933
- Full Text:
- Reviewed:
- Description: Overall Equipment Effectiveness (OEE) evaluates quantitatively how effectively a manufacturing operation is utilised. Total Productive Maintenance (TPM) was considered by Tibaldi, a leading food manufacturer in Australia for achieving OEE. This research project has identified performance gaps, developed plan and implemented it in Thermoforming area of the business. The developed methodology helped Tibaldi in improving productivity and quality through TPM involving machines, equipment, processes, and employees. This paper demonstrates how this can be achieved by reducing lead time and establishing lean environment. Productivity improvement through the devised methodology led to further enhancement of competitiveness of the organisation for domestic and international markets of processed food manufactured by Tibaldi Australia. Lessons learned from application of TPM in Thermoforming, a key asset area, is rolled out to other sections of the plat and results from this pilot study are presented in this paper.
Data-Driven System Reliability and Failure Behavior Modeling Using FMECA
- Khorshidi, Hadi, Gunawan, Indra, Ibrahim, Yousef
- Authors: Khorshidi, Hadi , Gunawan, Indra , Ibrahim, Yousef
- Date: 2016
- Type: Text , Journal article
- Relation: IEEE Transactions on Industrial Informatics Vol. 12, no. 3 (2016), p. 1253-1260
- Full Text:
- Reviewed:
- Description: System reliability modeling needs a large amount of data to estimate the parameters. In addition, reliability estimation is associated with uncertainty. This paper aims to propose a new method to evaluate the failure behavior and reliability of a large system using failure modes, effects, and criticality analysis (FMECA). Therefore, qualitative data based on the judgment of experts are used when data are not sufficient. The subjective data of failure modes and causes have been aggregated through the system to develop an overall failure index (OFI). This index not only represents the system reliability behavior, but also prioritizes corrective actions based on improvements in system failure. In addition, two optimization models are presented to select optimal actions subject to budget constraint. The associated costs of each corrective action are considered in risk evaluation. Finally, a case study of a manufacturing line is introduced to verify the applicability of the proposed method in industrial environments. The proposed method is compared with conventional FMECA approach. It is shown that the proposed method has a better performance in risk assessment. A sensitivity analysis is provided on the budget amount and the results are discussed. © 2015 IEEE.
- Authors: Khorshidi, Hadi , Gunawan, Indra , Ibrahim, Yousef
- Date: 2016
- Type: Text , Journal article
- Relation: IEEE Transactions on Industrial Informatics Vol. 12, no. 3 (2016), p. 1253-1260
- Full Text:
- Reviewed:
- Description: System reliability modeling needs a large amount of data to estimate the parameters. In addition, reliability estimation is associated with uncertainty. This paper aims to propose a new method to evaluate the failure behavior and reliability of a large system using failure modes, effects, and criticality analysis (FMECA). Therefore, qualitative data based on the judgment of experts are used when data are not sufficient. The subjective data of failure modes and causes have been aggregated through the system to develop an overall failure index (OFI). This index not only represents the system reliability behavior, but also prioritizes corrective actions based on improvements in system failure. In addition, two optimization models are presented to select optimal actions subject to budget constraint. The associated costs of each corrective action are considered in risk evaluation. Finally, a case study of a manufacturing line is introduced to verify the applicability of the proposed method in industrial environments. The proposed method is compared with conventional FMECA approach. It is shown that the proposed method has a better performance in risk assessment. A sensitivity analysis is provided on the budget amount and the results are discussed. © 2015 IEEE.
Cuboid colour image segmentation using intuitive distance measure
- Tania, Sheikh, Murshed, Manzur, Teng, Shyh, Karmakar, Gour
- Authors: Tania, Sheikh , Murshed, Manzur , Teng, Shyh , Karmakar, Gour
- Date: 2018
- Type: Text , Conference proceedings
- Relation: 2018 International Conference on Image and Vision Computing New Zealand, IVCNZ 2018; Auckland, New Zealand; 19th-21st November 2018 Vol. 2018-November, p. 1-6
- Full Text:
- Reviewed:
- Description: In this paper, an improved algorithm for cuboid image segmentation is proposed. To address the two main limitations of the recently proposed cuboid segmentation algorithm, the improved algorithm substitutes colour quantization in HCL colour space with infinity norm distance in RGB colour space along with a different way to impose area thresholding. We also propose a new metric to evaluate the quality of segmentation. Experimental results show that the proposed cuboid segmentation algorithm significantly outperforms the existing cuboid segmentation algorithm in terms of quality of segmentation.
- Description: International Conference Image and Vision Computing New Zealand
- Authors: Tania, Sheikh , Murshed, Manzur , Teng, Shyh , Karmakar, Gour
- Date: 2018
- Type: Text , Conference proceedings
- Relation: 2018 International Conference on Image and Vision Computing New Zealand, IVCNZ 2018; Auckland, New Zealand; 19th-21st November 2018 Vol. 2018-November, p. 1-6
- Full Text:
- Reviewed:
- Description: In this paper, an improved algorithm for cuboid image segmentation is proposed. To address the two main limitations of the recently proposed cuboid segmentation algorithm, the improved algorithm substitutes colour quantization in HCL colour space with infinity norm distance in RGB colour space along with a different way to impose area thresholding. We also propose a new metric to evaluate the quality of segmentation. Experimental results show that the proposed cuboid segmentation algorithm significantly outperforms the existing cuboid segmentation algorithm in terms of quality of segmentation.
- Description: International Conference Image and Vision Computing New Zealand
Multi-label learning with emerging new labels
- Zhu, Yue, Ting, Kaiming, Zhou, Zhi-Hua
- Authors: Zhu, Yue , Ting, Kaiming , Zhou, Zhi-Hua
- Date: 2018
- Type: Text , Journal article
- Relation: IEEE Transactions on Knowledge and Data Engineering Vol. 30, no. 10 (2018), p. 1901-1914
- Full Text:
- Reviewed:
- Description: In a multi-label learning task, an object possesses multiple concepts where each concept is represented by a class label. Previous studies on multi-label learning have focused on a fixed set of class labels, i.e., the class label set of test data is the same as that in the training set. In many applications, however, the environment is dynamic and new concepts may emerge in a data stream. In order to maintain a good predictive performance in this environment, a multi-label learning method must have the ability to detect and classify instances with emerging new labels. To this end, we propose a new approach called Multi-label learning with Emerging New Labels (MuENL). It has three functions: classify instances on currently known labels, detect the emergence of a new label, and construct a new classifier for each new label that works collaboratively with the classifier for known labels. In addition, we show that MuENL can be easily extended to handle sparse high dimensional data streams by simply reducing the original dimensionality, and then applying MuENL on the reduced dimensional space. Our empirical evaluation shows the effectiveness of MuENL on several benchmark datasets and MuENLHD on the sparse high dimensional Weibo dataset.
- Authors: Zhu, Yue , Ting, Kaiming , Zhou, Zhi-Hua
- Date: 2018
- Type: Text , Journal article
- Relation: IEEE Transactions on Knowledge and Data Engineering Vol. 30, no. 10 (2018), p. 1901-1914
- Full Text:
- Reviewed:
- Description: In a multi-label learning task, an object possesses multiple concepts where each concept is represented by a class label. Previous studies on multi-label learning have focused on a fixed set of class labels, i.e., the class label set of test data is the same as that in the training set. In many applications, however, the environment is dynamic and new concepts may emerge in a data stream. In order to maintain a good predictive performance in this environment, a multi-label learning method must have the ability to detect and classify instances with emerging new labels. To this end, we propose a new approach called Multi-label learning with Emerging New Labels (MuENL). It has three functions: classify instances on currently known labels, detect the emergence of a new label, and construct a new classifier for each new label that works collaboratively with the classifier for known labels. In addition, we show that MuENL can be easily extended to handle sparse high dimensional data streams by simply reducing the original dimensionality, and then applying MuENL on the reduced dimensional space. Our empirical evaluation shows the effectiveness of MuENL on several benchmark datasets and MuENLHD on the sparse high dimensional Weibo dataset.
Decision support tools for preventive maintenance intervals and replacement decisions of engineering assets
- Menon, M., Chattopadhyay, Gopinath, Beebe, Raymond
- Authors: Menon, M. , Chattopadhyay, Gopinath , Beebe, Raymond
- Date: 2018
- Type: Text , Conference proceedings
- Relation: 2018 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2018; Bangkok, Thailand; 16th-19th December 2018 Vol. 2019-December, p. 257-261
- Full Text:
- Reviewed:
- Description: Prognostic models for maintenance decisions have inherent limitations due to quality quantity of historical data, assumptions made, and time required in validating models. In this paper, Preventive Maintenance (PM) Intervals, Failure events, cost and maintenance records from Computerized Maintenance Management System (CMMS) are analyzed for reducing downtimes and Operating Expenditure (OPEX). The proposed methodologies for maintenance intervals and replacements with acceptable level of confidence are articulated to asset maintenance of a City Council of Australian Local Government organisation as a case of improved decision making under limited information.
- Description: IEEE International Conference on Industrial Engineering and Engineering Management
- Authors: Menon, M. , Chattopadhyay, Gopinath , Beebe, Raymond
- Date: 2018
- Type: Text , Conference proceedings
- Relation: 2018 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2018; Bangkok, Thailand; 16th-19th December 2018 Vol. 2019-December, p. 257-261
- Full Text:
- Reviewed:
- Description: Prognostic models for maintenance decisions have inherent limitations due to quality quantity of historical data, assumptions made, and time required in validating models. In this paper, Preventive Maintenance (PM) Intervals, Failure events, cost and maintenance records from Computerized Maintenance Management System (CMMS) are analyzed for reducing downtimes and Operating Expenditure (OPEX). The proposed methodologies for maintenance intervals and replacements with acceptable level of confidence are articulated to asset maintenance of a City Council of Australian Local Government organisation as a case of improved decision making under limited information.
- Description: IEEE International Conference on Industrial Engineering and Engineering Management
Deep matrix factorization for trust-aware recommendation in social networks
- Wan, Liangtian, Xia, Feng, Kong, Xiangjie, Hsu, Ching-Hsien, Huang, Runhe, Ma, Jianhua
- Authors: Wan, Liangtian , Xia, Feng , Kong, Xiangjie , Hsu, Ching-Hsien , Huang, Runhe , Ma, Jianhua
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Transactions on Network Science and Engineering Vol. 8, no. 1 (2021), p. 511-528
- Full Text:
- Reviewed:
- Description: Recent years have witnessed remarkable information overload in online social networks, and social network based approaches for recommender systems have been widely studied. The trust information in social networks among users is an important factor for improving recommendation performance. Many successful recommendation tasks are treated as the matrix factorization problems. However, the prediction performance of matrix factorization based methods largely depends on the matrixes initialization of users and items. To address this challenge, we develop a novel trust-aware approach based on deep learning to alleviate the initialization dependence. First, we propose two deep matrix factorization (DMF) techniques, i.e., linear DMF and non-linear DMF to extract features from the user-item rating matrix for improving the initialization accuracy. The trust relationship is integrated into the DMF model according to the preference similarity and the derivations of users on items. Second, we exploit deep marginalized Denoising Autoencoder (Deep-MDAE) to extract the latent representation in the hidden layer from the trust relationship matrix to approximate the user factor matrix factorized from the user-item rating matrix. The community regularization is integrated in the joint optimization function to take neighbours' effects into consideration. The results of DMF are applied to initialize the updating variables of Deep-MDAE in order to further improve the recommendation performance. Finally, we validate that the proposed approach outperforms state-of-the-art baselines for recommendation, especially for the cold-start users. © 2013 IEEE.
- Authors: Wan, Liangtian , Xia, Feng , Kong, Xiangjie , Hsu, Ching-Hsien , Huang, Runhe , Ma, Jianhua
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Transactions on Network Science and Engineering Vol. 8, no. 1 (2021), p. 511-528
- Full Text:
- Reviewed:
- Description: Recent years have witnessed remarkable information overload in online social networks, and social network based approaches for recommender systems have been widely studied. The trust information in social networks among users is an important factor for improving recommendation performance. Many successful recommendation tasks are treated as the matrix factorization problems. However, the prediction performance of matrix factorization based methods largely depends on the matrixes initialization of users and items. To address this challenge, we develop a novel trust-aware approach based on deep learning to alleviate the initialization dependence. First, we propose two deep matrix factorization (DMF) techniques, i.e., linear DMF and non-linear DMF to extract features from the user-item rating matrix for improving the initialization accuracy. The trust relationship is integrated into the DMF model according to the preference similarity and the derivations of users on items. Second, we exploit deep marginalized Denoising Autoencoder (Deep-MDAE) to extract the latent representation in the hidden layer from the trust relationship matrix to approximate the user factor matrix factorized from the user-item rating matrix. The community regularization is integrated in the joint optimization function to take neighbours' effects into consideration. The results of DMF are applied to initialize the updating variables of Deep-MDAE in order to further improve the recommendation performance. Finally, we validate that the proposed approach outperforms state-of-the-art baselines for recommendation, especially for the cold-start users. © 2013 IEEE.
Performance evaluation of a process bus architecture in a zone substation based on IEC 61850-9-2
- Kumar, Shantanu, Das, Narottam, Islam, Syed
- Authors: Kumar, Shantanu , Das, Narottam , Islam, Syed
- Date: 2016
- Type: Text , Conference proceedings , Conference paper
- Relation: IEEE PES Asia-Pacific Power and Energy Engineering Conference, APPEEC 2015; Brisbane, Australia; 15th-18th November 2015 Vol. 2016, p. 1-5
- Full Text:
- Reviewed:
- Description: Ethernet communication has been the back bone of high speed communication in digital substations from protection relaying, control and automation perspective. Major substation manufacturers have been constantly upgrading softwares and adding new features in their Intelligent Electronic Devices (IED's) to carry out multiple functions in process bus devices. This paper presents simulation results with respect to the delay in packets transfer in an Ethernet environment. Understanding the delay in packet transfer of Generic Object Oriented Substation Event (GOOSE) and Sampled Values (SV) shall assist the user in understanding the substation automation, control and protection of substation primary plants such as current transformers (CT's), voltage transformers (VT's), circuit breakers etc. connected in the network during a fault condition Conventional substation uses Merging Units (MU's) to communicate with the IED's featuring IEC 61850-9-2 standard. This standard exhibits transparency and standardization of data communication while addressing issues related to reliability, packet sharing, and maintainability, etc. However, process bus architecture is yet to be widely accepted in the industry and needs further validation due to lack of confidence. This paper evaluates the performance of a digital protection scheme in a zone substation operating at 132kV, featuring IEC 61850-9-2 IED's and using an optimized network engineering tool (OPNET) simulator. Understanding the delay in receiving time critical GOOSE and sampled value SV messages from protection perspective is critical as loss of data could cause malfunction in the protection jeopardizing vital substation plants.
- Authors: Kumar, Shantanu , Das, Narottam , Islam, Syed
- Date: 2016
- Type: Text , Conference proceedings , Conference paper
- Relation: IEEE PES Asia-Pacific Power and Energy Engineering Conference, APPEEC 2015; Brisbane, Australia; 15th-18th November 2015 Vol. 2016, p. 1-5
- Full Text:
- Reviewed:
- Description: Ethernet communication has been the back bone of high speed communication in digital substations from protection relaying, control and automation perspective. Major substation manufacturers have been constantly upgrading softwares and adding new features in their Intelligent Electronic Devices (IED's) to carry out multiple functions in process bus devices. This paper presents simulation results with respect to the delay in packets transfer in an Ethernet environment. Understanding the delay in packet transfer of Generic Object Oriented Substation Event (GOOSE) and Sampled Values (SV) shall assist the user in understanding the substation automation, control and protection of substation primary plants such as current transformers (CT's), voltage transformers (VT's), circuit breakers etc. connected in the network during a fault condition Conventional substation uses Merging Units (MU's) to communicate with the IED's featuring IEC 61850-9-2 standard. This standard exhibits transparency and standardization of data communication while addressing issues related to reliability, packet sharing, and maintainability, etc. However, process bus architecture is yet to be widely accepted in the industry and needs further validation due to lack of confidence. This paper evaluates the performance of a digital protection scheme in a zone substation operating at 132kV, featuring IEC 61850-9-2 IED's and using an optimized network engineering tool (OPNET) simulator. Understanding the delay in receiving time critical GOOSE and sampled value SV messages from protection perspective is critical as loss of data could cause malfunction in the protection jeopardizing vital substation plants.
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.
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.
Development of a risk-based maintenance (RBM) strategy for sewerage pumping station network
- Masud, M., Chattopadhyay, Gopi, Gunawan, Indra
- Authors: Masud, M. , Chattopadhyay, Gopi , Gunawan, Indra
- Date: 2019
- Type: Text , Conference proceedings
- Relation: 2019 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2019 p. 455-458
- Full Text:
- Reviewed:
- Description: Industries have been facing ever-increasing challenges to do more with less under ongoing budget constraints. They are pushing the boundary by challenging the OEM recommended maintenance intervals and relaxing or tightening based on where it is needed. This is also evident in water sector where industries are trying to do targeted maintenance based on balancing costs, performances and risks. The unexpected failures, the down time associated with such failures, the environmental overflows and, the increasing maintenance costs are major challenges all wastewater reticulation and distribution networks. Industries have been working hard to increase the availability of equipment and reduce the life-cycle cost without compromising safety and environmental targets. Risk-based maintenance (RBM) strategy is useful for allocation of maintenance resources where first allocation occurs to the highest risk item and progressively allocated till it reached budget limits. This paper is based on findings from a study covering 186 sewerage pumping stations of Townsville Water in North of Queensland in Australia. This study covered identifying the critical subsystems and mitigating the risks of failure of those subsystems. Implementation of risk based maintenance strategy was useful in further enhancing reliability and reduction of maintenance costs. © 2019 IEEE.
- Description: E1
- Authors: Masud, M. , Chattopadhyay, Gopi , Gunawan, Indra
- Date: 2019
- Type: Text , Conference proceedings
- Relation: 2019 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2019 p. 455-458
- Full Text:
- Reviewed:
- Description: Industries have been facing ever-increasing challenges to do more with less under ongoing budget constraints. They are pushing the boundary by challenging the OEM recommended maintenance intervals and relaxing or tightening based on where it is needed. This is also evident in water sector where industries are trying to do targeted maintenance based on balancing costs, performances and risks. The unexpected failures, the down time associated with such failures, the environmental overflows and, the increasing maintenance costs are major challenges all wastewater reticulation and distribution networks. Industries have been working hard to increase the availability of equipment and reduce the life-cycle cost without compromising safety and environmental targets. Risk-based maintenance (RBM) strategy is useful for allocation of maintenance resources where first allocation occurs to the highest risk item and progressively allocated till it reached budget limits. This paper is based on findings from a study covering 186 sewerage pumping stations of Townsville Water in North of Queensland in Australia. This study covered identifying the critical subsystems and mitigating the risks of failure of those subsystems. Implementation of risk based maintenance strategy was useful in further enhancing reliability and reduction of maintenance costs. © 2019 IEEE.
- Description: E1
Agoraphilic navigation algorithm in dynamic environment with and without prediction of moving objects location
- Hewawasam, Hasitha, Ibrahim, Yousef, Kahandawa, Gayan, Choudhury, Tanveer
- Authors: Hewawasam, Hasitha , Ibrahim, Yousef , Kahandawa, Gayan , Choudhury, Tanveer
- Date: 2019
- Type: Text , Conference proceedings , Conference paper
- Relation: 45th Annual Conference of the IEEE Industrial Electronics Society, IECON 2019 Vol. 2019-October, p. 5179-5185
- Full Text:
- Reviewed:
- Description: This paper presents a summary of research conducted in performance improvement of Agoraphilic Navigation Algorithm under Dynamic Environment (ANADE). The ANADE is an optimistic navigation algorithm which is capable of navigating robots in static as well as in unknown dynamic environments. ANADE has been successfully extended the capacity of original Agoraphilic algorithm for static environment. However, it could identify that ANADE takes costly decisions when it is used in complex dynamic environments. The proposed algorithm in this paper has been successfully enhanced the performance of ANADE in terms of safe travel, speed variation, path length and travel time. The proposed algorithm uses a prediction methodology to estimate future growing free space passages which can be used for safe navigation of the robot. With motion prediction of moving objects, new set of future driving forces were developed. These forces has been combined with present driving force for safe and efficient navigation. Furthermore, the performances of proposed algorithm (Agoraphilic algorithm with prediction) was compared and benched-marked with ANADE (Without predication) under similar environment conditions. From the investigation results, it was observed that the proposed algorithm extends the effective decision making ability in a complex navigation environment. Moreover, the proposed algorithm navigated the robot in a shorter and quicker path with smooth speed variations. © 2019 IEEE.
- Description: E1
- Authors: Hewawasam, Hasitha , Ibrahim, Yousef , Kahandawa, Gayan , Choudhury, Tanveer
- Date: 2019
- Type: Text , Conference proceedings , Conference paper
- Relation: 45th Annual Conference of the IEEE Industrial Electronics Society, IECON 2019 Vol. 2019-October, p. 5179-5185
- Full Text:
- Reviewed:
- Description: This paper presents a summary of research conducted in performance improvement of Agoraphilic Navigation Algorithm under Dynamic Environment (ANADE). The ANADE is an optimistic navigation algorithm which is capable of navigating robots in static as well as in unknown dynamic environments. ANADE has been successfully extended the capacity of original Agoraphilic algorithm for static environment. However, it could identify that ANADE takes costly decisions when it is used in complex dynamic environments. The proposed algorithm in this paper has been successfully enhanced the performance of ANADE in terms of safe travel, speed variation, path length and travel time. The proposed algorithm uses a prediction methodology to estimate future growing free space passages which can be used for safe navigation of the robot. With motion prediction of moving objects, new set of future driving forces were developed. These forces has been combined with present driving force for safe and efficient navigation. Furthermore, the performances of proposed algorithm (Agoraphilic algorithm with prediction) was compared and benched-marked with ANADE (Without predication) under similar environment conditions. From the investigation results, it was observed that the proposed algorithm extends the effective decision making ability in a complex navigation environment. Moreover, the proposed algorithm navigated the robot in a shorter and quicker path with smooth speed variations. © 2019 IEEE.
- Description: E1
Factors affecting the organizational adoption of blockchain technology : an Australian perspective
- Malik, Saleem, Chadhar, Mehmood, Chetty, Madhu
- Authors: Malik, Saleem , Chadhar, Mehmood , Chetty, Madhu
- Date: 2021
- Type: Text , Conference paper
- Relation: 54th Annual Hawaii International Conference on System Sciences, HICSS 2021 Vol. 2020-January, p. 5597-5606
- Full Text:
- Reviewed:
- Description: Blockchain Technology (BCT) is a novel innovation that has the potential to transform industries, for instance, supply chain, energy, finance, and healthcare. However, despite the potential and the wide range of benefits reported, organizational adoption of BCT is low in several countries including Australia. Some studies investigated the adoption of BCT in different countries, however, there is a lack of research that examines the organizational adoption of BCT in Australia. This study fills this gap by exploring the factors, which influence BCT adoption among Australian organizations. To achieve this, we used an interpretative qualitative research approach based on the Technology, Organization, and Environment (TOE) framework and the Institutional Theory. The findings show that organizational adoption of BCT in Australia is influenced by perceived novelty, complexity, cost, and disintermediation feature of BCT; top management knowledge and support; government support, customer pressure, trading partner readiness, and consensus among trading partners. © 2021 IEEE Computer Society. All rights reserved.
- Authors: Malik, Saleem , Chadhar, Mehmood , Chetty, Madhu
- Date: 2021
- Type: Text , Conference paper
- Relation: 54th Annual Hawaii International Conference on System Sciences, HICSS 2021 Vol. 2020-January, p. 5597-5606
- Full Text:
- Reviewed:
- Description: Blockchain Technology (BCT) is a novel innovation that has the potential to transform industries, for instance, supply chain, energy, finance, and healthcare. However, despite the potential and the wide range of benefits reported, organizational adoption of BCT is low in several countries including Australia. Some studies investigated the adoption of BCT in different countries, however, there is a lack of research that examines the organizational adoption of BCT in Australia. This study fills this gap by exploring the factors, which influence BCT adoption among Australian organizations. To achieve this, we used an interpretative qualitative research approach based on the Technology, Organization, and Environment (TOE) framework and the Institutional Theory. The findings show that organizational adoption of BCT in Australia is influenced by perceived novelty, complexity, cost, and disintermediation feature of BCT; top management knowledge and support; government support, customer pressure, trading partner readiness, and consensus among trading partners. © 2021 IEEE Computer Society. All rights reserved.
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.
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.
Graph self-supervised learning : a survey
- Liu, Yixin, Jin, Ming, Pan, Shirui, Zhou, Chuan, Zheng, Yu, Xia, Feng, Yu, Philip
- Authors: Liu, Yixin , Jin, Ming , Pan, Shirui , Zhou, Chuan , Zheng, Yu , Xia, Feng , Yu, Philip
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Transactions on Knowledge and Data Engineering Vol. 35, no. 6 (2022), p. 5879-5900
- Full Text:
- Reviewed:
- Description: Deep learning on graphs has attracted significant interests recently. However, most of the works have focused on (semi-) supervised learning, resulting in shortcomings including heavy label reliance, poor generalization, and weak robustness. To address these issues, self-supervised learning (SSL), which extracts informative knowledge through well-designed pretext tasks without relying on manual labels, has become a promising and trending learning paradigm for graph data. Different from SSL on other domains like computer vision and natural language processing, SSL on graphs has an exclusive background, design ideas, and taxonomies. Under the umbrella of graph self-supervised learning, we present a timely and comprehensive review of the existing approaches which employ SSL techniques for graph data. We construct a unified framework that mathematically formalizes the paradigm of graph SSL. According to the objectives of pretext tasks, we divide these approaches into four categories: generation-based, auxiliary property-based, contrast-based, and hybrid approaches. We further describe the applications of graph SSL across various research fields and summarize the commonly used datasets, evaluation benchmark, performance comparison and open-source codes of graph SSL. Finally, we discuss the remaining challenges and potential future directions in this research field. IEEE
- Authors: Liu, Yixin , Jin, Ming , Pan, Shirui , Zhou, Chuan , Zheng, Yu , Xia, Feng , Yu, Philip
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Transactions on Knowledge and Data Engineering Vol. 35, no. 6 (2022), p. 5879-5900
- Full Text:
- Reviewed:
- Description: Deep learning on graphs has attracted significant interests recently. However, most of the works have focused on (semi-) supervised learning, resulting in shortcomings including heavy label reliance, poor generalization, and weak robustness. To address these issues, self-supervised learning (SSL), which extracts informative knowledge through well-designed pretext tasks without relying on manual labels, has become a promising and trending learning paradigm for graph data. Different from SSL on other domains like computer vision and natural language processing, SSL on graphs has an exclusive background, design ideas, and taxonomies. Under the umbrella of graph self-supervised learning, we present a timely and comprehensive review of the existing approaches which employ SSL techniques for graph data. We construct a unified framework that mathematically formalizes the paradigm of graph SSL. According to the objectives of pretext tasks, we divide these approaches into four categories: generation-based, auxiliary property-based, contrast-based, and hybrid approaches. We further describe the applications of graph SSL across various research fields and summarize the commonly used datasets, evaluation benchmark, performance comparison and open-source codes of graph SSL. Finally, we discuss the remaining challenges and potential future directions in this research field. IEEE
CenGCN : centralized convolutional networks with vertex imbalance for scale-free graphs
- Xia, Feng, Wang, Lei, Tang, Tao, Chen, Xin, Kong, Xiangjie, Oatley, Giles, King, Irwin
- Authors: Xia, Feng , Wang, Lei , Tang, Tao , Chen, Xin , Kong, Xiangjie , Oatley, Giles , King, Irwin
- Date: 2023
- Type: Text , Journal article
- Relation: IEEE Transactions on Knowledge and Data Engineering Vol. 35, no. 5 (2023), p. 4555-4569
- Full Text:
- Reviewed:
- Description: Graph Convolutional Networks (GCNs) have achieved impressive performance in a wide variety of areas, attracting considerable attention. The core step of GCNs is the information-passing framework that considers all information from neighbors to the central vertex to be equally important. Such equal importance, however, is inadequate for scale-free networks, where hub vertices propagate more dominant information due to vertex imbalance. In this paper, we propose a novel centrality-based framework named CenGCN to address the inequality of information. This framework first quantifies the similarity between hub vertices and their neighbors by label propagation with hub vertices. Based on this similarity and centrality indices, the framework transforms the graph by increasing or decreasing the weights of edges connecting hub vertices and adding self-connections to vertices. In each non-output layer of the GCN, this framework uses a hub attention mechanism to assign new weights to connected non-hub vertices based on their common information with hub vertices. We present two variants CenGCN_D and CenGCN_E, based on degree centrality and eigenvector centrality, respectively. We also conduct comprehensive experiments, including vertex classification, link prediction, vertex clustering, and network visualization. The results demonstrate that the two variants significantly outperform state-of-the-art baselines. © 1989-2012 IEEE.
- Authors: Xia, Feng , Wang, Lei , Tang, Tao , Chen, Xin , Kong, Xiangjie , Oatley, Giles , King, Irwin
- Date: 2023
- Type: Text , Journal article
- Relation: IEEE Transactions on Knowledge and Data Engineering Vol. 35, no. 5 (2023), p. 4555-4569
- Full Text:
- Reviewed:
- Description: Graph Convolutional Networks (GCNs) have achieved impressive performance in a wide variety of areas, attracting considerable attention. The core step of GCNs is the information-passing framework that considers all information from neighbors to the central vertex to be equally important. Such equal importance, however, is inadequate for scale-free networks, where hub vertices propagate more dominant information due to vertex imbalance. In this paper, we propose a novel centrality-based framework named CenGCN to address the inequality of information. This framework first quantifies the similarity between hub vertices and their neighbors by label propagation with hub vertices. Based on this similarity and centrality indices, the framework transforms the graph by increasing or decreasing the weights of edges connecting hub vertices and adding self-connections to vertices. In each non-output layer of the GCN, this framework uses a hub attention mechanism to assign new weights to connected non-hub vertices based on their common information with hub vertices. We present two variants CenGCN_D and CenGCN_E, based on degree centrality and eigenvector centrality, respectively. We also conduct comprehensive experiments, including vertex classification, link prediction, vertex clustering, and network visualization. The results demonstrate that the two variants significantly outperform state-of-the-art baselines. © 1989-2012 IEEE.
Deep video anomaly detection : opportunities and challenges
- Ren, Jing, Xia, Feng, Liu, Yemeng, Lee, Ivan
- Authors: Ren, Jing , Xia, Feng , Liu, Yemeng , Lee, Ivan
- 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. 959-966
- Full Text:
- Reviewed:
- Description: Anomaly detection is a popular and vital task in various research contexts, which has been studied for several decades. To ensure the safety of people's lives and assets, video surveillance has been widely deployed in various public spaces, such as crossroads, elevators, hospitals, banks, and even in private homes. Deep learning has shown its capacity in a number of domains, ranging from acoustics, images, to natural language processing. However, it is non-trivial to devise intelligent video anomaly detection systems cause anomalies significantly differ from each other in different application scenarios. There are numerous advantages if such intelligent systems could be realised in our daily lives, such as saving human resources in a large degree, reducing financial burden on the government, and identifying the anomalous behaviours timely and accurately. Recently, many studies on extending deep learning models for solving anomaly detection problems have emerged, resulting in beneficial advances in deep video anomaly detection techniques. In this paper, we present a comprehensive review of deep learning-based methods to detect the video anomalies from a new perspective. Specifically, we summarise the opportunities and challenges of deep learning models on video anomaly detection tasks, respectively. We put forth several potential future research directions of intelligent video anomaly detection system in various application domains. Moreover, we summarise the characteristics and technical problems in current deep learning methods for video anomaly detection. © 2021 IEEE.
- Authors: Ren, Jing , Xia, Feng , Liu, Yemeng , Lee, Ivan
- 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. 959-966
- Full Text:
- Reviewed:
- Description: Anomaly detection is a popular and vital task in various research contexts, which has been studied for several decades. To ensure the safety of people's lives and assets, video surveillance has been widely deployed in various public spaces, such as crossroads, elevators, hospitals, banks, and even in private homes. Deep learning has shown its capacity in a number of domains, ranging from acoustics, images, to natural language processing. However, it is non-trivial to devise intelligent video anomaly detection systems cause anomalies significantly differ from each other in different application scenarios. There are numerous advantages if such intelligent systems could be realised in our daily lives, such as saving human resources in a large degree, reducing financial burden on the government, and identifying the anomalous behaviours timely and accurately. Recently, many studies on extending deep learning models for solving anomaly detection problems have emerged, resulting in beneficial advances in deep video anomaly detection techniques. In this paper, we present a comprehensive review of deep learning-based methods to detect the video anomalies from a new perspective. Specifically, we summarise the opportunities and challenges of deep learning models on video anomaly detection tasks, respectively. We put forth several potential future research directions of intelligent video anomaly detection system in various application domains. Moreover, we summarise the characteristics and technical problems in current deep learning methods for video anomaly detection. © 2021 IEEE.
Blockchain based smart auction mechanism for distributed peer-to-peer energy trading
- Islam, Md Ezazul, Chetty, Madhu, Lim, Suryani, Chadhar, Mehmood, Islam, Syed
- Authors: Islam, Md Ezazul , Chetty, Madhu , Lim, Suryani , Chadhar, Mehmood , Islam, Syed
- Date: 2022
- Type: Text , Conference paper
- Relation: 55th Annual Hawaii International Conference on System Sciences, HICSS 2022, Virtual, online, 3-7 January 2022, Proceedings of the Annual Hawaii International Conference on System Sciences Vol. 2022-January, p. 6013-6022
- Full Text:
- Reviewed:
- Description: Blockchain based framework provides data immutability in a distributed network. In this paper, we investigate the application of blockchain for peer-to-peer (P2P) energy trading. Traditional energy trading systems use simple passing mechanisms and basic pricing methods, thus adversely affect the efficiency and buyers' social welfare. We propose a blockchain based energy trading mechanism that uses smart passing of unspent auction reservations to (a) minimise the time taken to settle an auction (convergence time), (b) maximise the number of auction settlement; and (c) incorporate second-price auction pricing to maximise buyers' social welfare in a distributed double auction environment. The entire mechanism is implemented within Hyperledger Fabric, an open-source blockchain framework, to manage the data and provide smart contracts. Experiments show that our approach minimises the convergence time, maximises the number of auction settlement, and increases the social welfare of buyers compared to existing methods. © 2022 IEEE Computer Society. All rights reserved.
- Authors: Islam, Md Ezazul , Chetty, Madhu , Lim, Suryani , Chadhar, Mehmood , Islam, Syed
- Date: 2022
- Type: Text , Conference paper
- Relation: 55th Annual Hawaii International Conference on System Sciences, HICSS 2022, Virtual, online, 3-7 January 2022, Proceedings of the Annual Hawaii International Conference on System Sciences Vol. 2022-January, p. 6013-6022
- Full Text:
- Reviewed:
- Description: Blockchain based framework provides data immutability in a distributed network. In this paper, we investigate the application of blockchain for peer-to-peer (P2P) energy trading. Traditional energy trading systems use simple passing mechanisms and basic pricing methods, thus adversely affect the efficiency and buyers' social welfare. We propose a blockchain based energy trading mechanism that uses smart passing of unspent auction reservations to (a) minimise the time taken to settle an auction (convergence time), (b) maximise the number of auction settlement; and (c) incorporate second-price auction pricing to maximise buyers' social welfare in a distributed double auction environment. The entire mechanism is implemented within Hyperledger Fabric, an open-source blockchain framework, to manage the data and provide smart contracts. Experiments show that our approach minimises the convergence time, maximises the number of auction settlement, and increases the social welfare of buyers compared to existing methods. © 2022 IEEE Computer Society. All rights reserved.