Abdulkareem, SA, Augustijn, E-W, Filatova, T, Musial, K & Mustafa, YT 2020, 'Risk perception and behavioral change during epidemics: Comparing models of individual and collective learning.', PLoS One, vol. 15, no. 1, pp. e0226483-e0226483.
View/Download from: Publisher's site
View description>>
Modern societies are exposed to a myriad of risks ranging from disease to natural hazards and technological disruptions. Exploring how the awareness of risk spreads and how it triggers a diffusion of coping strategies is prominent in the research agenda of various domains. It requires a deep understanding of how individuals perceive risks and communicate about the effectiveness of protective measures, highlighting learning and social interaction as the core mechanisms driving such processes. Methodological approaches that range from purely physics-based diffusion models to data-driven environmental methods rely on agent-based modeling to accommodate context-dependent learning and social interactions in a diffusion process. Mixing agent-based modeling with data-driven machine learning has become popularity. However, little attention has been paid to the role of intelligent learning in risk appraisal and protective decisions, whether used in an individual or a collective process. The differences between collective learning and individual learning have not been sufficiently explored in diffusion modeling in general and in agent-based models of socio-environmental systems in particular. To address this research gap, we explored the implications of intelligent learning on the gradient from individual to collective learning, using an agent-based model enhanced by machine learning. Our simulation experiments showed that individual intelligent judgement about risks and the selection of coping strategies by groups with majority votes were outperformed by leader-based groups and even individuals deciding alone. Social interactions appeared essential for both individual learning and group learning. The choice of how to represent social learning in an agent-based model could be driven by existing cultural and social norms prevalent in a modeled society.
Al-Hadhrami, Y & Hussain, FK 2020, 'Real time dataset generation framework for intrusion detection systems in IoT', Future Generation Computer Systems, vol. 108, pp. 414-423.
View/Download from: Publisher's site
View description>>
© 2020 The Internet of Things (IoT) has evolved in the last few years to become one of the hottest topics in the area of computer science research. This drastic increase in IoT applications across different disciplines, such as in health-care and smart industries, comes with a considerable security risk. This is not limited only to attacks on privacy; it can also extend to attacks on network availability and performance. Therefore, an intrusion detection system is essential to act as the first line of defense for the network. IDS systems and algorithms depend heavily on the quality of the dataset provided. Sadly, there has been a lack of work in evaluating and collecting intrusion detection system related datasets that are designed specifically for an IoT ecosystem. Most of the studies published focus on outdated and non-compatible datasets such as the KDD98 dataset. Therefore, in this paper, we aim to investigate the existing datasets and their applications for IoT environments. Then we introduce a real-time data collection framework for building a dataset for intrusion detection system evaluation and testing. The main advantages of the proposed dataset are that it contains features that are explicitly designed for the 6LoWPAN/RPL network, the most widely used protocol in the IoT environment.
Altaee, A, Khlaifat, N, Zhou, J, Huang, Y & Braytee, A 2020, 'Optimization of a Small Wind Turbine for a Rural Area: A Case Study of Deniliquin, New South Wales, Australia', Energies, vol. 13.
View description>>
The performance of a wind turbine is profoundly affected by wind conditions. Small wind turbines usually achieve the demand for electricity in rural areas. The shape of the blade greatly influences the performance of the wind turbine. The present study aims to optimize the performance of a 20 kW horizontal-axis wind turbine (HAWT) under local wind conditions at Deniliquin, New South Wales, Australia. ANSYS Fluent was used to investigate the aerodynamic performance of the 20 KW HAWT. The effects of four Reynolds Averaged Navier Stokes (RANS) turbulence models on predicting the flow over the wind turbine under separation condition were examined. Transition SST model had the best agreement with NREL CER data, which was used to investigate the mechanical output at different rotational speeds and variable pitch angles. Then the aerodynamic shape of the rotor of the wind turbine was optimized to maximize the annual energy production (AEP) in the Deniliquin region. Statistical wind analysis was applied to define the Weibull function and scale parameters which were 2.096 and 5.042 m/s, respectively. HARP_Opt was enhanced with design variables concerning the shape of the blade, rated rotational speed, and pitch angle. Pitch angle remained at 0ᵒ while the rising wind speed improved rotor speed to 148.4482 rpm at rated speed. This optimization improved the AEP rate by 9.068% when compared to the original NREL design.
Anshar, M & Williams, M-A 2020, 'Simplified Pain Matrix Method for Artificial Pain Activation Embedded into Robot Framework', INTERNATIONAL JOURNAL OF SOCIAL ROBOTICS.
View/Download from: Publisher's site
Asad, M, Yang, J, He, J, Shamsolmoali, P & He, X 2020, 'Multi-frame feature-fusion-based model for violence detection', Visual Computer.
View/Download from: Publisher's site
View description>>
© 2020, Springer-Verlag GmbH Germany, part of Springer Nature. Human behavior detection is essential for public safety and monitoring. However, in human-based surveillance systems, it requires continuous human attention and observation, which is a difficult task. Detection of violent human behavior using autonomous surveillance systems is of critical importance for uninterrupted video surveillance. In this paper, we propose a novel method to detect fights or violent actions based on learning both the spatial and temporal features from equally spaced sequential frames of a video. Multi-level features for two sequential frames, extracted from the convolutional neural network’s top and bottom layers, are combined using the proposed feature fusion method to take into account the motion information. We also proposed Wide-Dense Residual Block to learn these combined spatial features from the two input frames. These learned features are then concatenated and fed to long short-term memory units for capturing temporal dependencies. The feature fusion method and use of additional wide-dense residual blocks enable the network to learn combined features from the input frames effectively and yields better accuracy results. Experimental results evaluated on four publicly available datasets: HockeyFight, Movies, ViolentFlow and BEHAVE show the superior performance of the proposed model in comparison with the state-of-the-art methods.
Awan, I, Younas, M & Hussain, F 2020, 'Emerging challenges and frontiers in cloud computing', Concurrency Computation, vol. 32, no. 1.
View/Download from: Publisher's site
Azadi, M, Emrouznejad, A, Ramezani, F & Hussain, FK 2020, 'Efficiency measurement of cloud service providers using network data envelopment analysis', IEEE Transactions on Cloud Computing.
View/Download from: Publisher's site
View description>>
IEEE An increasing number of organizations and businesses around the world use cloud computing services to improve their performance in the competitive marketplace. However, one of the biggest challenges in using cloud computing services is performance measurement and the selection of the best cloud service providers (CSPs) based on quality of service (QoS) requirements (Duan, 2017). To address this shortcoming in this article we propose a network data envelopment analysis (DEA) method in measuring the efficiency of CSPs. When network dimensions are taken into consideration, a more comprehensive analysis is enabled where divisional efficiency is reflected in overall efficiency estimates. This helps managers and decision makers in organizations to make accurate decisions in selecting cloud services. In the current study, variable returns to scale (VRS), the non-oriented network slacks-based measure (SBM) model and input-oriented and output-oriented SBM models are applied to measure the performance of 18 CSPs. The obtained results show the superiority of the network DEA model and they also demonstrate that the proposed model can evaluate and rank CSPs much better than compared to traditional DEA models.
Ben, X, Gong, C, Zhang, P, Yan, R, Wu, Q & Meng, W 2020, 'Coupled Bilinear Discriminant Projection for Cross-View Gait Recognition', IEEE Transactions on Circuits and Systems for Video Technology, vol. 30, no. 3, pp. 734-747.
View/Download from: Publisher's site
View description>>
© 1991-2012 IEEE. A problem that hinders good performance of general gait recognition systems is that the appearance features of gaits are more affected-prone by views than identities, especially when the walking direction of the probe gait is different from the register gait. This problem cannot be solved by traditional projection learning methods because these methods can learn only one projection matrix, and thus for the same subject, it cannot transfer cross-view gait features into similar ones. This paper presents an innovative method to overcome this problem by aligning gait energy images (GEIs) across views with the coupled bilinear discriminant projection (CBDP). Specifically, the CBDP generates the aligned gait matrix features for two views with two sets of bilinear transformation matrices, so that the original GEIs' spatial structure information can be preserved. By iteratively maximizing the ratio of inter-class distance metric to intra-class distance metric, the CBDP can learn the optimal matrix subspace where the GEIs across views are aligned in both horizontal and vertical coordinates. Therefore, the CBDP is also able to avoid the under-sample problem. We also theoretically prove that the upper and lower bounds of the objective function sequence of the CBDP are both monotonically increasing, so the convergence of the CBDP is demonstrated. In the terms of accuracy, the comparative experiments on the CASIA (B) and OU-ISIR gait databases show that our method is superior to the state-of-the-art cross-view gait recognition methods. More impressively, encouraging performance is obtained by our method even in matching a lateral-view gait with a frontal-view gait.
Brodka, P, Musial, K & Jankowski, J 2020, 'Interacting Spreading Processes in Multilayer Networks: A Systematic Review', IEEE ACCESS, vol. 8, pp. 10316-10341.
View/Download from: Publisher's site
Brodka, P, Musial, K & Jankowski, J 2020, 'Interacting Spreading Processes in Multilayer Networks: A Systematic Review', IEEE Access, vol. 8, pp. 10316-10341.
View/Download from: Publisher's site
Buchlak, QD, Esmaili, N, Leveque, JC, Bennett, C, Piccardi, M & Farrokhi, F 2020, 'Ethical thinking machines in surgery and the requirement for clinical leadership', American Journal of Surgery.
View/Download from: Publisher's site
Buchlak, QD, Esmaili, N, Leveque, JC, Farrokhi, F, Bennett, C, Piccardi, M & Sethi, RK 2020, 'Machine learning applications to clinical decision support in neurosurgery: an artificial intelligence augmented systematic review', Neurosurgical Review.
View/Download from: Publisher's site
View description>>
© 2019, Springer-Verlag GmbH Germany, part of Springer Nature. Machine learning (ML) involves algorithms learning patterns in large, complex datasets to predict and classify. Algorithms include neural networks (NN), logistic regression (LR), and support vector machines (SVM). ML may generate substantial improvements in neurosurgery. This systematic review assessed the current state of neurosurgical ML applications and the performance of algorithms applied. Our systematic search strategy yielded 6866 results, 70 of which met inclusion criteria. Performance statistics analyzed included area under the receiver operating characteristics curve (AUC), accuracy, sensitivity, and specificity. Natural language processing (NLP) was used to model topics across the corpus and to identify keywords within surgical subspecialties. ML applications were heterogeneous. The densest cluster of studies focused on preoperative evaluation, planning, and outcome prediction in spine surgery. The main algorithms applied were NN, LR, and SVM. Input and output features varied widely and were listed to facilitate future research. The accuracy (F(2,19) = 6.56, p < 0.01) and specificity (F(2,16) = 5.57, p < 0.01) of NN, LR, and SVM differed significantly. NN algorithms demonstrated significantly higher accuracy than LR. SVM demonstrated significantly higher specificity than LR. We found no significant difference between NN, LR, and SVM AUC and sensitivity. NLP topic modeling reached maximum coherence at seven topics, which were defined by modeling approach, surgery type, and pathology themes. Keywords captured research foci within surgical domains. ML technology accurately predicts outcomes and facilitates clinical decision-making in neurosurgery. NNs frequently outperformed other algorithms on supervised learning tasks. This study identified gaps in the literature and opportunities for future neurosurgical ML research.
Cao, L, Yuan, G, Leung, T & Zhang, W 2020, 'Special issue on AI and FinTech: The challenge ahead', IEEE Intelligent Systems, vol. 35, no. 2, pp. 3-6.
View/Download from: Publisher's site
Cao, Z, Ding, W, Wang, YK, Hussain, FK, Al-Jumaily, A & Lin, CT 2020, 'Effects of repetitive SSVEPs on EEG complexity using multiscale inherent fuzzy entropy', Neurocomputing, vol. 389, pp. 198-206.
View/Download from: Publisher's site
View description>>
© 2019 Elsevier B.V. Multiscale inherent fuzzy entropy is an objective measurement of electroencephalography (EEG) complexity, reflecting the habituation of brain systems. Entropy dynamics are generally believed to reflect the ability of the brain to adapt to a visual stimulus environment. In this study, we explored repetitive steady-state visual evoked potential (SSVEP)-based EEG complexity by assessing multiscale inherent fuzzy entropy with relative measurements. We used a wearable EEG device with Oz and Fpz electrodes to collect EEG signals from 40 participants under the following three conditions: a resting state (closed-eyes (CE) and open-eyes (OE) stimulation with five 15-Hz CE SSVEPs and stimulation with five 20-Hz OE SSVEPs. We noted monotonic enhancement of occipital EEG relative complexity with increasing stimulus times in CE and OE conditions. The occipital EEG relative complexity was significantly higher for the fifth SSVEP than for the first SSEVP (FDR-adjusted p < 0.05). Similarly, the prefrontal EEG relative complexity tended to be significantly higher in the OE condition compared to that in the CE condition (FDR-adjusted p < 0.05). The results also indicate that multiscale inherent fuzzy entropy is superior to other competing multiscale-based entropy methods. In conclusion, EEG relative complexity increases with stimulus times, a finding that reflects the strong habituation of brain systems. These results suggest that multiscale inherent fuzzy entropy is an EEG pattern with which brain complexity can be assessed using repetitive SSVEP stimuli.
Carmichael, CL, Wang, J, Nguyen, T, Kolawole, O, Benyoucef, A, De Maziere, C, Milne, AR, Samuel, S, Gillinder, K, Hediyeh-zadeh, S, Vo, ANQ, Huang, Y, Knezevic, K, McInnes, WRL, Shields, BJ, Mitchell, H, Ritchie, ME, Lammens, T, Lintermans, B, Van Vlierberghe, P, Wong, NC, Haigh, K, Thoms, JAI, Toulmin, E, Curtis, DJ, Oxley, EP, Dickins, RA, Beck, D, Perkins, A, McCormack, MP, Davis, MJ, Berx, G, Zuber, J, Pimanda, JE, Kile, BT, Goossens, S & Haigh, JJ 2020, 'The EMT modulator SNAI1 contributes to AML pathogenesis via its interaction with LSD1', BLOOD, vol. 136, no. 8, pp. 957-973.
View/Download from: Publisher's site
Casanovas, M, Torres-Martínez, A & Merigó, JM 2020, 'Multi-person and multi-criteria decision making with the induced probabilistic ordered weighted average distance', Soft Computing, vol. 24, no. 2, pp. 1435-1446.
View/Download from: Publisher's site
View description>>
© 2019, Springer-Verlag GmbH Germany, part of Springer Nature. This paper presents a new approach for selecting suppliers of products or services, specifically with respect to complex decisions that require evaluating different business characteristics to ensure their suitability and to meet the conditions defined in the recruitment process. To address this type of problem, this study presents the multi-person multi-criteria induced ordered weighted average distance (MP-MC-IOWAD) operator, which is an extension of the OWA operators that includes the notion of distances to multiple criteria and expert valuations. Thus, this work introduces new distance measures that can aggregate the information with probabilistic information and consider the attitudinal character of the decision maker. Further extensions are developed using probabilities to form the induced probabilistic ordered weighted average distance (IPOWAD) operator. An example in the management of insurance policies is presented, where the selection of insurance companies is very complex and requires the consideration of subjective criteria by experts in decision making.
Chen, Q, Qiao, YL, Hu, F, Li, Y, Tan, K, Zhu, M & Zhang, C 2020, 'Community detection in complex network based on APT method', Pattern Recognition Letters, vol. 138, pp. 193-200.
View/Download from: Publisher's site
View description>>
© 2020 Elsevier B.V. Community detection is a significant methodology in network science. Traditional methods show limitations in dealing with multi-scale and high-dimensional complex data. As one of the most popular unsupervised algorithms, affinity propagation algorithm (AP) has been widely applied in community detection. However, its negative Euclidean similarity and inflexible parameter may lead to high time or memory consumption and excessive detection. Thus, this article presents a novel affinity propagation algorithm in t-distribution (APT), integrated with manifold learning, for detecting community structure. In APT algorithm, the data is compressed by dimensionality reduction, and joint probability is applied to construct the similarity matrix. Further, based on optimized modularity, parameters are adjusted to improve the accuracy. Experiments show that APT has better adaptability and universality than AP algorithm. In contrast to other mainstream algorithms, our algorithm can extract more meaningful communities from multi-scale and high-dimensional networks.
Chen, Y, An, P, Huang, X, Yang, C, Liu, D & Wu, Q 2020, 'Light Field Compression Using Global Multiplane Representation and Two-Step Prediction', IEEE Signal Processing Letters, vol. 27, pp. 1135-1139.
View/Download from: Publisher's site
View description>>
© 1994-2012 IEEE. Due to its spatio-angular structure, light field image allows for a wealth of post-processing techniques like digital refocusing and depth estimation. In order to compress the data of the two domains, the current proposal intends to embed the disparity-based view synthesis method into the decoder. However, predicting each view separately or in local groups means bringing more computational burden to the decoder and destroying the light field structure. Since disparity contains the relationship between all light rays in the light field, the proposed solution is to predict a disparity-based global representation as the first step. In the second step, all the views can be predicted easily based on this representation. In this letter, we use the recently proposed multiplane as the form of this global representation. The experimental results show the effectiveness of the proposed solution, and the better RD performance compared to other schemes especially under low bitrates.
Chomsiri, T, He, XS, Nanda, P & Tan, Z 2020, 'Hybrid Tree-rule Firewall for High Speed Data Transmission', IEEE Transactions on Cloud Computing.
View/Download from: Publisher's site
View description>>
Traditional firewalls employ listed rules in both configuration and process phases to regulate network traffic. However, configuring a firewall with listed rules may create rule conflicts, and slows down the firewall. To overcome this problem, we have proposed a Tree-rule firewall in our previous study. Although the Tree-rule firewall guarantees no conflicts within its rule set and operates faster than traditional firewalls, keeping track of the state of network connections using hashing functions incurs extra computational overhead. In order to reduce this overhead, we propose a hybrid Tree-rule firewall in this paper. This hybrid scheme takes advantages of both Tree-rule firewalls and traditional listed-rule firewalls. The GUIs of our Tree-rule firewalls are utilized to provide a means for users to create conflict-free firewall rules, which are organized in a tree structure and called 'tree rules'. These tree rules are later converted into listed rules that share the merit of being conflict-free. Finally, in decision making, the listed rules are used to verify against packet header information. The rules which have matched with most packets are moved up to the top positions by the core firewall. The mechanism applied in this hybrid scheme can significantly improve the functional speed of a firewall.
Cui, L, He, X, Li, K & Tu, J 2020, 'Market Sentiment and Paradigm Shifts in Equity Return Forecasting', Management Science.
Cui, L, Wu, J, Pi, D, Zhang, P & Kennedy, P 2020, 'Dual Implicit Mining-Based Latent Friend Recommendation', IEEE Transactions on Systems Man and Cybernetics: Systems.
View/Download from: Publisher's site
View description>>
IEEE The latent friend recommendation in online social media is interesting, yet challenging, because the user-item ratings and the user-user relationships are both sparse. In this paper, we propose a new dual implicit mining-based latent friend recommendation model that simultaneously considers the implicit interest topics of users and the implicit link relationships between the users in the local topic cliques. Specifically, we first propose an algorithm called all reviews from a user and all tags from their corresponding items to learn the implicit interest topics of the users and their corresponding topic weights, then compute the user interest topic similarity using a symmetric Jensen-Shannon divergence. After that, we adopt the proposed weighted local random walk with restart algorithm to analyze the implicit link relationships between the users in the local topic cliques and calculate the weighted link relationship similarity between the users. Combining the user interest topic similarity with the weighted link relationship similarity in a unified way, we get the final latent friend recommendation list. The experiments on real-world datasets demonstrate that the proposed method outperforms the state-of-the-art latent friend recommendation methods under four different types of evaluation metrics.
Curiskis, SA, Drake, B, Osborn, TR & Kennedy, PJ 2020, 'An evaluation of document clustering and topic modelling in two online social networks: Twitter and Reddit', Information Processing and Management, vol. 57, no. 2.
View/Download from: Publisher's site
View description>>
© 2019 Elsevier Ltd Methods for document clustering and topic modelling in online social networks (OSNs) offer a means of categorising, annotating and making sense of large volumes of user generated content. Many techniques have been developed over the years, ranging from text mining and clustering methods to latent topic models and neural embedding approaches. However, many of these methods deliver poor results when applied to OSN data as such text is notoriously short and noisy, and often results are not comparable across studies. In this study we evaluate several techniques for document clustering and topic modelling on three datasets from Twitter and Reddit. We benchmark four different feature representations derived from term-frequency inverse-document-frequency (tf-idf) matrices and word embedding models combined with four clustering methods, and we include a Latent Dirichlet Allocation topic model for comparison. Several different evaluation measures are used in the literature, so we provide a discussion and recommendation for the most appropriate extrinsic measures for this task. We also demonstrate the performance of the methods over data sets with different document lengths. Our results show that clustering techniques applied to neural embedding feature representations delivered the best performance over all data sets using appropriate extrinsic evaluation measures. We also demonstrate a method for interpreting the clusters with a top-words based approach using tf-idf weights combined with embedding distance measures.
Dai, M, Xiao, G, Cheng, S, Wang, D & He, X 2020, 'Structural correlation filters combined with a Gaussian particle filter for hierarchical visual tracking', Neurocomputing.
View/Download from: Publisher's site
View description>>
© 2020 Visual tracking is a key problem for many computer vision applications such as human-computer interaction, intelligent medical diagnosis, navigation and traffic control management. Most of the existing tracking methods are mainly based on correlation filters. However, boundary effect, scale estimation and template updating have not been fully resolved. Herein, this paper presents a new hierarchical tracking method combining structural correlation filters with a Gaussian Particle Filter (GPF), named KCF-GPF. Weak KCF classifiers are constructed via a Lukas-Kanade (LK) method and the preliminary target location is presented as a weighted sum of these classifiers. Specially, a facile weight strategy is implemented to estimate the reliability of each weak classifier. On the basis of the preliminary target location, the GPF using features from a Convolutional Neural Network (CNN) is employed to predict the location and scale of a target. Extensive experiments with the OTB-2013 and the OTB-2015 databases demonstrate that the proposed algorithm performs favourably against state-of-the-art trackers.
Dong, X, Gong, Y & Cao, L 2020, 'e-RNSP: An Efficient Method for Mining Repetition Negative Sequential Patterns.', IEEE Transactions on Cybernetics.
View/Download from: Publisher's site
View description>>
Negative sequential patterns (NSPs), which capture both frequent occurring and nonoccurring behaviors, become increasingly important and sometimes play a role irreplaceable by analyzing occurring behaviors only. Repetition sequential patterns capture repetitions of patterns in different sequences as well as within a sequence and are very important to understand the repetition relations between behaviors. Though some methods are available for mining NSP and repetition positive sequential patterns (RPSPs), we have not found any methods for mining repetition NSP (RNSP). RNSP can help the analysts to further understand the repetition relationships between items and capture more comprehensive information with repetition properties. However, mining RNSP is much more difficult than mining NSP due to the intrinsic challenges of nonoccurring items. To address the above issues, we first propose a formal definition of repetition negative containment. Then, we propose a method to convert repetition negative containment to repetition positive containment, which fast calculates the repetition supports by only using the corresponding RPSP's information without rescanning databases. Finally, we propose an efficient algorithm, called e-RNSP, to mine RNSP efficiently. To the best of our knowledge, e-RNSP is the first algorithm to efficiently mine RNSP. Intensive experimental results on the first four real and synthetic datasets clearly show that e-RNSP can efficiently discover the repetition negative patterns; results on the fifth dataset prove the effectiveness of RNSP which are captured by the proposed method; and the results on the rest 16 datasets analyze the impacts of data characteristics on mining process.
Du, X, Yin, H, Chen, L, Wang, Y, Yang, Y & Zhou, X 2020, 'Personalized Video Recommendation Using Rich Contents from Videos', IEEE Transactions on Knowledge and Data Engineering.
View/Download from: Publisher's site
View description>>
IEEE Video recommendation has become an essential way of helping people explore the massive videos and discover the ones that may be of interest to them. In the existing video recommender systems, the models make the recommendations based on the user-video interactions and single specific content features. When the specific content features are unavailable, the performance of the existing models will seriously deteriorate. Inspired by the fact that rich contents (e.g., text, audio, motion, and so on) exist in videos, in this paper, we explore how to use these rich contents to overcome the limitations caused by the unavailability of the specific ones. Specifically, we propose a novel general framework that incorporates arbitrary single content feature with user-video interactions, named as collaborative embedding regression (CER) model, to make effective video recommendation in both in-matrix and out-of-matrix scenarios. Our extensive experiments on two real-world large-scale datasets show that CER beats the existing recommender models with any single content feature and is more time efficient. In addition, we propose a priority-based late fusion (PRI) method to gain the benefit brought by the integrating the multiple content features. The corresponding experiment shows that PRI brings real performance improvement to the baseline and outperforms the existing fusion methods.
Dun, MD, Mannan, A, Rigby, CJ, Butler, S, Toop, HD, Beck, D, Connerty, P, Sillar, J, Kahl, RGS, Duchatel, RJ, Germon, Z, Faulkner, S, Chi, M, Skerrett-Byrne, D, Murray, HC, Flanagan, H, Almazi, JG, Hondermarck, H, Nixon, B, De Iuliis, G, Chamberlain, J, Alvaro, F, de Bock, CE, Morris, JC, Enjeti, AK & Verrills, NM 2020, 'Shwachman–Bodian–Diamond syndrome (SBDS) protein is a direct inhibitor of protein phosphatase 2A (PP2A) activity and overexpressed in acute myeloid leukaemia', Leukemia.
View/Download from: Publisher's site
Fachrunnisa, O & Hussain, FK 2020, 'A methodology for creating sustainable communities based on dynamic factors in virtual environments', International Journal of Electronic Business, vol. 15, no. 2, pp. 133-159.
View/Download from: Publisher's site
View description>>
Copyright © 2020 Inderscience Enterprises Ltd. A virtual community is one of communities that exist in an internet economy; however, little research has been conducted on how to make it sustainable. We propose a methodology for creating sustainable virtual communities which depends on the community’s respond to the dynamic factors in its environment such as number of members, shared contents and interaction rules. The methodology proposes the use of iterative negotiation and a panel of expert agents to assess the quality of service (QoS) delivered. This QoS assessment is based on an interaction agreement between the community members and expert agent as the administrator’s representative. The administrators use this QoS assessment to determine whether an individual’s membership will be renewed or terminated after a certain period of time. We present a metric to measure the sustainability index and demonstrate the validity of the methodology by engineering a prototype setup and running simulations under various operational conditions.
Fan, X, Xiang, C, Chen, X, Song, X, Yang, P, Gong, L, Nanda, P & He, X 2020, 'BuildSenSys: Reusing Building Sensing Data for Traffic Prediction with Cross-domain Learning', IEEE Transactions on Mobile Computing.
View/Download from: Publisher's site
View description>>
With the rapid development of smart cities, smart buildings are generating a massive amount of building sensing data by
the equipped sensors. Indeed, building sensing data provides a promising way to enrich a series of data-demanding and
cost-expensive urban mobile applications. In this paper, as a preliminary exploration, we study how to reuse building sensing data to
predict traffic volume on nearby roads. Compared with existing studies, reusing building sensing data has considerable merits of
cost-efficiency and high-reliability. Nevertheless, it is non-trivial to achieve accurate prediction on such cross-domain data with two
major challenges. First, relationships between building sensing data and traffic data are not unknown as prior, and the spatio-temporal
complexities impose more difficulties to uncover the underlying reasons behind the above relationships. Second, it is even more
daunting to accurately predict traffic volume with dynamic building-traffic correlations, which are cross-domain, non-linear, and
time-varying. To address the above challenges, we design and implement BuildSenSys, a first-of-its-kind system for nearby traffic
volume prediction by reusing building sensing data. Our work consists of two parts, i.e., Correlation Analysis and Cross-domain
Learning. First, we conduct a comprehensive building-traffic analysis based on multi-source datasets, disclosing how and why building
sensing data is correlated with nearby traffic volume. Second, we propose a novel recurrent neural network for traffic volume prediction
based on cross-domain learning with two attention mechanisms. Specifically, a cross-domain attention mechanism captures the
building-traffic correlations and adaptively extracts the most relevant building sensing data at each predicting step. Then, a temporal
attention mechanism is employed to model the temporal dependencies of data across historical time intervals. The extensive
experimental studies demonstrate that BuildSenSys outp...
Fan, X, Xiang, C, Gong, L, He, X, Qu, Y, Amirgholipour, S, Xi, Y, Nanda, P & He, X 2020, 'Deep learning for intelligent traffic sensing and prediction: recentadvances and future challenges', CCF Transactions on Pervasive Computing and Interaction.
View description>>
With the emerging concepts of smart cities and intelligent transportation systems, accurate traffic sensing and prediction
have become critically important to support urban management and traffic control. In recent years, the rapid uptake of the
Internet of Vehicles and the rising pervasiveness of mobile services have produced unprecedented amounts of data to serve
traffic sensing and prediction applications. However, it is significantly challenging to fulfill the computation demands by the
big traffic data with ever-increasing complexity and diversity. Deep learning, with its powerful capabilities in representation
learning and multi-level abstractions, has recently become the most effective approach in many intelligent sensing systems.
In this paper, we present an up-to-date literature review on the most advanced research works in deep learning for intelligent
traffic sensing and prediction.
Gao, G, Yu, Y, Xie, J, Yang, J, Yang, M & Zhang, J 2020, 'Constructing multilayer locality-constrained matrix regression framework for noise robust face super-resolution', Pattern Recognition.
View/Download from: Publisher's site
View description>>
© 2020 Representation learning methods have attracted considerable attention for learning-based face super-resolution in recent years. Conventional methods perform local models learning on low-resolution (LR) manifold and face reconstruction on high-resolution (HR) manifold respectively, leading to unsatisfactory reconstruction performance when the acquired LR face images are severely degraded (e.g., noisy, blurred). To tackle this issue, this paper proposes an efficient multilayer locality-constrained matrix regression (MLCMR) framework to learn the representation of the input LR patch and meanwhile preserve the manifold of the original HR space. Particularly, MLCMR uses nuclear norm regularization to capture the structural characteristic of the representation residual and applies an adaptive neighborhood selection scheme to find the HR patches that are compatible with its neighbors. Also, MLCMR iteratively applies the manifold structure of the desired HR space to induce the representation weights learning in the LR space, aims at reducing the inconsistency gap between different manifolds. Experimental results on widely used FEI database and real-world faces have demonstrated that compared with several state-of-the-art face super-resolution approaches, our proposed approach has the capability of obtaining better results both in objective metrics and visual quality.
Hua, W, Sui, Y, Wan, Y, Liu, G & Xu, G 2020, 'FCCA: Hybrid Code Representation for Functional Clone Detection Using Attention Networks', IEEE Transactions on Reliability, pp. 1-15.
View/Download from: Publisher's site
Huang, L, Yang, Q, Wu, J, Huang, Y, Wu, Q & Xu, J 2020, 'Generated Data With Sparse Regularized Multi-Pseudo Label for Person Re-Identification', IEEE SIGNAL PROCESSING LETTERS, vol. 27, pp. 391-395.
View/Download from: Publisher's site
Huang, Y, Xu, J, Wu, Q, Zhong, Y, Zhang, P & Zhang, Z 2020, 'Beyond Scalar Neuron: Adopting Vector-Neuron Capsules for Long-Term Person Re-Identification', IEEE Transactions on Circuits and Systems for Video Technology, pp. 1-1.
View/Download from: Publisher's site
Hwang, H & Ryan, L 2020, 'Statistical strategies for the analysis of massive data sets.', Biometrical Journal: journal of mathematical methods in biosciences.
View/Download from: Publisher's site
View description>>
The advent of the big data age has changed the landscape for statisticians. Public and private organizations alike these days are interested in capturing and analyzing complex customer data in order to improve their service and drive efficiency gains. However, the large volume of data involved often means that standard statistical methods fail and new ways of thinking are needed. Although great gains can be obtained through the use of more advanced computing environments or through developing sophisticated new statistical algorithms that handle data in a more efficient way, there are also many simpler things that can be done to handle large data sets in an efficient and intuitive manner. These include the use of distributed analysis methodologies, clever subsampling, data coarsening, and clever data reductions that exploit concepts such as sufficiency. These kinds of strategies represent exciting opportunities for statisticians to remain front and center in the data science world.
Jafarizadeh, S, Tofigh, F, Lipman, J & Abolhasan, M 2020, 'Optimizing synchronizability in networks of coupled systems', AUTOMATICA, vol. 112.
View/Download from: Publisher's site
Jin, D, Zhang, B, Song, Y, He, D, Feng, Z, Chen, S, Li, W & Musial, K 2020, 'ModMRF: A modularity-based Markov Random Field method for community detection', Neurocomputing, vol. 405, pp. 218-228.
View/Download from: Publisher's site
View description>>
© 2020 Elsevier B.V. Complex networks are widely used in the research of social and biological fields. Analyzing real community structure in networks is the key to the study of complex networks. Modularity optimization is one of the most popular techniques in community detection. However, due to its greedy characteristic, it leads to a large number of incorrect partitions and more communities than in reality. Existing methods use the modularity as a Hamiltonian at the finite temperature to solve the above problem. Nevertheless, modularity is not formalized as a statistical model in the method, which makes many statistical inference methods limited and cannot be used. Moreover, the method uses the sum-product version of belief propagation (BP) and its performance is not as good as the max-sum version, since it calculates per-variable marginal probabilities rather than the joint probability. To address these issues, we propose a novel Markov Random Field (MRF) method by formalizing modularity as an energy function based on the rich structures of MRF to represent properties and constraints of this problem, and use the max-sum BP to infer model parameters. In order to analyze our method and compare it with existing methods, we conducted experiments on both real-world and synthetic networks with ground-truth of communities, showing that the new method outperforms the state-of-the-art methods.
Khuat, TT & Le, MH 2020, 'Evaluation of Sampling-Based Ensembles of Classifiers on Imbalanced Data for Software Defect Prediction Problems', SN Computer Science, vol. 1, no. 2.
View/Download from: Publisher's site
Khuat, TT, Ruta, D & Gabrys, B 2020, 'Hyperbox-based machine learning algorithms: a comprehensive survey', SOFT COMPUTING.
View/Download from: Publisher's site
Kieu, LM, Ou, Y, Truong, LT & Cai, C 2020, 'A class-specific soft voting framework for customer booking prediction in on-demand transport', Transportation Research Part C: Emerging Technologies, vol. 114, pp. 377-390.
View/Download from: Publisher's site
View description>>
© 2020 Elsevier Ltd Customer booking prediction is essential for On-Demand Transport services, especially for those in rural and suburban areas where the demand is low, variable and often regarded as unpredictable. Existing literature tends to focus more on the prediction of demand for traffic, classical public transport, and urban On-Demand Transport service such as taxi, Uber or Lyft, in areas with higher and less variable demand, in which popular time-series prediction methods can be employed. This paper proposes an ensemble learning framework to predict the customer booking behaviour and demand using the observed data of a suburban On-Demand Transport service where data scarcity is a challenge. The proposed method, which is called as Class-specific Soft Voting, is found to be the most accurate prediction method when compared to popular supervised classification methods such as Logistic Regression, Random Forest, Support Vector Machine and other ensemble techniques.
Laengle, S, Lobos, V, Merigó, JM, Herrera-Viedma, E, Cobo, MJ & De Baets, B 2020, 'Forty years of Fuzzy Sets and Systems: A bibliometric analysis', Fuzzy Sets and Systems.
View/Download from: Publisher's site
View description>>
© 2020 Elsevier B.V. Fuzzy Sets and Systems is a leading international journal in computer science and applied mathematics that was created in 1978. In 2018, the journal celebrated its 40th anniversary. The aim of this study is to present a bibliometric overview of the leading trends occurring in the journal between 1978 and 2016 by analysing the most productive and influential authors, institutions and countries as well as the publication and citation structure. Additionally, this work presents a graphical visualization of the bibliographic data by using the visualization of similarities (VOS) viewer and the science mapping analysis tool (SciMAT) software. The results show the strong growth of fuzzy set theory over time and a huge diversity of publications from all over the world, especially from Europe, North America and East Asia.
Laengle, S, Merigó, JM, Modak, NM & Yang, JB 2020, 'Bibliometrics in operations research and management science: a university analysis', Annals of Operations Research.
View/Download from: Publisher's site
View description>>
© 2018, Springer Science+Business Media, LLC, part of Springer Nature. Many universities around the World have made important contributions in the field of operations research and management science. This article presents the most productive and influential universities between 1991 and 2015. For doing so, we use the Web of Science database in order to search for the information which is usually regarded as the most relevant for scientific research. The results show the country of origin of the leading universities being mainly from North America and Asia and especially from USA and China. The Centre National de la Recherche Scientifique (CNRS) of France is the most productive university while the Massachusetts Institute of Technology (MIT) of USA is the most influential one. The temporal evolution shows that USA is trailing its dominancy while China progressing quickly. The evaluation also reveals that Asian universities outperform North American universities during the last 5 years.
Lai, S, Fan, X, Ye, Q, Tan, Z, Zhang, Y, He, X & Nanda, P 2020, 'FairEdge: A Fairness-Oriented Task Offloading Scheme for Iot Applications in Mobile Cloudlet Networks', IEEE Access, vol. 8, pp. 13516-13526.
View/Download from: Publisher's site
Lee, JYL, Green, PJ & Ryan, LM 2020, 'Analysis of grouped data using conjugate generalized linear mixed models', Biometrika, vol. 107, no. 1, pp. 231-237.
View/Download from: Publisher's site
View description>>
© 2019 Biometrika Trust. This article concerns a class of generalized linear mixed models for two-level grouped data, where the random effects are uniquely indexed by groups and are independent. We derive necessary and sufficient conditions for the marginal likelihood to be expressed in explicit form. These models are unified under the conjugate generalized linear mixed models framework, where conjugate refers to the fact that the marginal likelihood can be expressed in closed form, rather than implying inference via the Bayesian paradigm. The proposed framework allows simultaneous conjugacy for Gaussian, Poisson and gamma responses, and thus can accommodate both unit-and group-level covariates. Only group-level covariates can be incorporated for the binomial distribution. In a simulation of Poisson data, our framework outperformed its competitors in terms of computational time, and was competitive in terms of robustness against misspecification of the random effects distributions.
Li, J, Liu, M, Xue, Z, Fan, X & He, X 2020, 'RTVD: A Real-Time Volumetric Detection Scheme for DDoS in the Internet of Things', IEEE ACCESS, vol. 8, pp. 36191-36201.
View/Download from: Publisher's site
Li, X, Cao, Y, Li, Q, Shang, Y, Li, Y, Liu, Y & Xu, G 2020, 'RLINK: Deep reinforcement learning for user identity linkage', World Wide Web.
View/Download from: Publisher's site
View description>>
© 2020, The Author(s). User identity linkage is a task of recognizing the identities of the same user across different social networks (SN). Previous works tackle this problem via estimating the pairwise similarity between identities from different SN, predicting the label of identity pairs or selecting the most relevant identity pair based on the similarity scores. However, most of these methods fail to utilize the results of previously matched identities, which could contribute to the subsequent linkages in following matching steps. To address this problem, we transform user identity linkage into a sequence decision problem and propose a reinforcement learning model to optimize the linkage strategy from the global perspective. Our method makes full use of both the social network structure and the history matched identities, meanwhile explores the long-term influence of processing matching on subsequent decisions. We conduct extensive experiments on real-world datasets, the results show that our method outperforms the state-of-the-art methods.
Liu, C, Zhu, L, He, X & Chen, J 2020, 'Enabling Privacy-Preserving Shortest Distance Queries on Encrypted Graph Data', IEEE Transactions on Dependable and Secure Computing.
View/Download from: Publisher's site
View description>>
IEEE When coming to perform shortest distance queries on encrypted graph data outsourced in external storage infrastructure such as cloud, a significant challenge is how to compute the shortest distance in an accurate, efficient and secure way. This issue is addressed by a recent work, which makes use of somewhat homomorphic encryption (SWHE) to encrypt distance values output by a 2-hop cover labeling (2HCL) scheme. However, it may import large errors and even yield negative results. Besides, SWHE would be too time-consuming for normal clients. In this paper, we propose GENOA, a novel Graph ENcryption scheme for shOrtest distAnce queries. GENOA employs only efficient symmetric-key primitives while significantly enhances the accuracy compared to the prior work. As a reasonable trade-off, it additionally reveals the order information among queried distance values in the 2HCL index. We theoretically prove the accuracy and security of GENOA under rigorous cryptographic model. Detailed experiments on eight real-world graphs demonstrate that GENOA is efficient and can produce almost exact results.
Liu, Q, Do, TDT & Cao, L 2020, 'Answer Keyword Generation for Community Question Answering by Multi-aspect Gamma-Poisson Matrix Completion', IEEE Intelligent Systems.
View/Download from: Publisher's site
View description>>
IEEE Community question answering (CQA) recommends appropriate answers to existing and new questions. Such answer recommendation is challenging since CQA data is often sparse and decentralized and lacks sufficient information to generate suitable answers to existing questions. Matching answers to new questions is more challenging in modeling Q/A sparsity, generating answers to cold-start/novel questions, and integrating metadata about Q/A into models, etc. This paper addresses these issues by a novel statistical model to automatically generate answer keywords in CQA with multi-aspect Gamma-Poisson matrix completion (MAGIC). MAGIC is the first trial in CQA to model multiple aspects of Q/A sentence information in CQA by involving Q/A metadata, Q/A sparsity, and both lexical and semantic Q/A information in a hierarchical Gamma-Poisson model. MAGIC can efficiently generate answer keywords for both existing and new questions against nonnegative matrix factorization (MF), probability MF, and relevant Poisson factorization models w.r.t. recommending appropriate and informative answer keywords.
Liu, W, Chang, X, Chen, L, Phung, D, Zhang, X, Yang, Y & Hauptmann, AG 2020, 'Pair-based uncertainty and diversity promoting early active learning for person re-identification', ACM Transactions on Intelligent Systems and Technology, vol. 11, no. 2.
View/Download from: Publisher's site
View description>>
© 2020 Association for Computing Machinery. The effective training of supervised Person Re-identification (Re-ID) models requires sufficient pairwise labeled data. However, when there is limited annotation resource, it is difficult to collect pairwise labeled data. We consider a challenging and practical problem called Early Active Learning, which is applied to the early stage of experiments when there is no pre-labeled sample available as references for human annotating. Previous early active learning methods suffer from two limitations for Re-ID. First, these instance-based algorithms select instances rather than pairs, which can result in missing optimal pairs for Re-ID. Second, most of these methods only consider the representativeness of instances, which can result in selecting less diverse and less informative pairs. To overcome these limitations, we propose a novel pair-based active learning for Re-ID. Our algorithm selects pairs instead of instances from the entire dataset for annotation. Besides representativeness, we further take into account the uncertainty and the diversity in terms of pairwise relations. Therefore, our algorithm can produce the most representative, informative, and diverse pairs for Re-ID data annotation. Extensive experimental results on five benchmark Re-ID datasets have demonstrated the superiority of the proposed pair-based early active learning algorithm.
Liu, X, Song, W, Musial, K, Zhao, X, Zuo, W & Yang, B 2020, 'Semi-supervised stochastic blockmodel for structure analysis of signed networks', Knowledge-Based Systems, vol. 195.
View/Download from: Publisher's site
View description>>
© 2020 Elsevier B.V. Finding hidden structural patterns is a critical problem for all types of networks, including signed networks. Among all of the methods for structural analysis of complex network, stochastic blockmodel (SBM) is an important research tool because it is flexible and can generate networks with many different types of structures. However, most existing SBM learning methods for signed networks are unsupervised, leading to poor performance in terms of finding hidden structural patterns, especially when handling noisy and sparse networks. Learning SBM in a semi-supervised way is a promising avenue for overcoming the above difficulty. In this type of model, a small number of labelled nodes and a large number of unlabelled nodes, coupled with their network structures, are simultaneously used to train SBM. We propose a novel semi-supervised signed stochastic blockmodel and its learning algorithm based on variational Bayesian inference, with the goal of discovering both assortative (the nodes connect more densely in same clusters than that in different clusters) and disassortative (the nodes link more sparsely in same clusters than that in different clusters) structures from signed networks. The proposed model is validated through a number of experiments wherein it compared with the state-of-the-art methods using both synthetic and real-world data. The carefully designed tests, allowing to account for different scenarios, show our method outperforms other approaches existing in this space. It is especially relevant in the case of noisy and sparse networks as they constitute the majority of the real-world networks.
Liu, Y, Lan, C, Blumenstein, M & Li, J 2020, 'Bi-level error correction for PacBio long reads', IEEE/ACM Transactions on Computational Biology and Bioinformatics.
View/Download from: Publisher's site
View description>>
IEEE The latest sequencing technologies such as the Pacific Biosciences (PacBio) and Oxford Nanopore machines can generate long reads at the length of thousands of nucleic bases which is much longer than the reads at the length of hundreds generated by Illumina machines. However, these long reads are prone to much higher error rates, for example 15%, making downstream analysis and applications very difficult. Error correction is a process to improve the quality of sequencing data. Hybrid correction strategies have been recently proposed to combine Illumina reads of low error rates to fix sequencing errors in the noisy long reads with good performance. In this paper, we propose a new method named Bicolor, a bi-level framework of hybrid error correction for further improving the quality of PacBio long reads. At the first level, our method uses a de Bruijn graph-based error correction idea to search paths in pairs of solid < formula > < tex > $k$ < /tex > < /formula > -mers iteratively with an increasing length of < formula > < tex > $k$ < /tex > < /formula > -mer. At the second level, we combine the processed results under different parameters from the first level. In particular, a multiple sequence alignment algorithm is used to align those similar long reads, followed by a voting algorithm which determines the final base at each position of the reads. We compare the superior performance of Bicolor with three state-of-the-art methods on three real data sets. Results demonstrate that Bicolor always achieves the highest identity ratio. Bicolor also achieves a higher alignment ratio ( < formula > < tex > $ & #x003E; 1.3\%$ < /tex > < /formula > ) and a higher number of aligned reads than the current methods on two data sets. On the third data set, our method is closely competitive to the current methods in terms of number of aligned reads and genome coverage. The C++ source codes of our algorithm are freely available at https://github.com/yuansliu/Bicolor.
Makhdoom, I, Zhou, I, Abolhasan, M, Lipman, J & Ni, W 2020, 'PrivySharing: A blockchain-based framework for privacy-preserving and secure data sharing in smart cities', COMPUTERS & SECURITY, vol. 88.
View/Download from: Publisher's site
Maldonado, S, Merigo, J & Miranda, J 2020, 'IOWA-SVM: A Density-Based Weighting Strategy for SVM Classification via OWA Operators', IEEE TRANSACTIONS ON FUZZY SYSTEMS, vol. 28, no. 9, pp. 2143-2150.
View/Download from: Publisher's site
Malik, N, Nanda, P, He, X & Liu, RP 2020, 'Vehicular networks with security and trust management solutions: proposed secured message exchange via blockchain technology', Wireless Networks, vol. 26, no. 6, pp. 4207-4226.
View/Download from: Publisher's site
View description>>
© 2020, Springer Science+Business Media, LLC, part of Springer Nature. In vehicular ad hoc networks (VANET), effective trust establishment with authentication is an important requirement. Trust management among communicating vehicles is significant for secure message transmission; however, very less contributions have been made towards evaluating the trustworthiness of the node. This research work intends to introduce a new trust management system in VANET with two major phases: secured message transmission and node trustability prediction. The security assured message passing is carried out by incorporating the privacy preservation model under the data sanitization process. The key used for the sanitization process is optimally tuned by a new hybrid algorithm termed Sea Lion Explored-Whale Optimization Algorithm, which is the combination of Whale Optimization Algorithm and Sea Lion Optimization Algorithm, respectively. The blockchain technology is assisted to handle the key generated by the nodes. Subsequently, the trustability of the node is evaluated under novel specifics “two-level evaluation process” with a rule-based and machine learning-based evaluation process. Finally, the performance of the proposed model is verified and proved over other conventional methods for certain measures.
Martínez-López, FJ, Merigó, JM, Gázquez-Abad, JC & Ruiz-Real, JL 2020, 'Industrial marketing management: Bibliometric overview since its foundation', Industrial Marketing Management, vol. 84, pp. 19-38.
View/Download from: Publisher's site
View description>>
© 2019 Elsevier Inc. Industrial Marketing Management (IMM) is an outstanding journal in the field of business-to-business marketing. This paper focuses on this journal, with an extensive bibliometric analysis of IMM from its foundation in 1971 to 2017, the last year analyzed in this study. It identifies, among others, the annual evolution of publications, the most influential countries, the most relevant authors, the most prominent institutions supporting research, as well as the citations of IMM papers in major marketing, but also other, business and management journals. To do so, this research uses the Web of Science Core Collection and Scopus databases, and analyzes a wide range of bibliometric indicators, including the total number of publications and citations, citations per paper, the h-index, m-value and citation thresholds, and also develops a graphical analysis of the bibliographical material using the visualization of similarities (VOS) viewer software. Finally, by applying a cluster analysis by fractional accounting, this research identifies trends and proposes future topics and research lines, such as: trust, innovation, performance, relationship marketing, the future role of new technologies in industrial marketing research, online marketing and corporate image.
Modak, NM, Lobos, V, Merigó, JM, Gabrys, B & Lee, JH 2020, 'Forty years of computers & chemical engineering: A bibliometric analysis', Computers and Chemical Engineering, vol. 141.
View/Download from: Publisher's site
View description>>
© 2020 Elsevier Ltd Computers & Chemical Engineering (CCE) is one of the premier international journals in the field of chemical engineering. CCE published its first issue in 1977 and completed forty years in 2016. More than four decades of continuous and successful journey influenced us to celebrate its contribution through a comprehensive bibliometric study. Using the Web of Science Core Collection database we depict trends of the journal in terms of papers, topics, authors, institutions, and countries. Networks visualization of co-citation of journals and authors, bibliographic coupling institutions and countries, and co-occurrence of author keywords are prepared using the visualization of similarities (VOS) viewer software. The present analysis explores publication and citation patterns of the journal. Professor Ignacio E. Grossmann, Carnegie Mellon University, and USA respectively appear as the most productive and influential author, institution, and country in CCE publications. Optimization based research topics received most attention in CCE publications.
Nanda, P, He, X & Yang, LT 2020, 'Security, Trust and Privacy in Cyber (STPCyber): Future trends and challenges', Future Generation Computer Systems, vol. 109, pp. 446-449.
View/Download from: Publisher's site
View description>>
© 2020 Today's world experiences massively interconnected devices to share information across variety of platforms between traditional computers (machines), Smart IoT devices used across smart homes, smart interconnected vehicles etc. and of course the social networks apps such as Facebook, Linkdn, twitter etc. We experience the growth has been skyrocketing and the trend will continue exponentially to the future. At one end, we find life becomes easier with such developments and at the other end; we experience more and more cyber threats on our privacy, security and trustworthiness with organizations holding our data. In this special issue, we summarize contributions by authors in advanced topics related to security, trust and privacy based on a range of applications and present a selection of the most recent research efforts in these areas.
Naseem, U, Razzak, I, Musial, K & Imran, M 2020, 'Transformer based Deep Intelligent Contextual Embedding for Twitter sentiment analysis', Future Generation Computer Systems, vol. 113, pp. 58-69.
View/Download from: Publisher's site
View description>>
© 2020 Elsevier B.V. Along with the emergence of the Internet, the rapid development of handheld devices has democratized content creation due to the extensive use of social media and has resulted in an explosion of short informal texts. Although a sentiment analysis of these texts is valuable for many reasons, this task is often perceived as a challenge given that these texts are often short, informal, noisy, and rich in language ambiguities, such as polysemy. Moreover, most of the existing sentiment analysis methods are based on clean data. In this paper, we present DICET, a transformer-based method for sentiment analysis that encodes representation from a transformer and applies deep intelligent contextual embedding to enhance the quality of tweets by removing noise while taking word sentiments, polysemy, syntax, and semantic knowledge into account. We also use the bidirectional long- and short-term memory network to determine the sentiment of a tweet. To validate the performance of the proposed framework, we perform extensive experiments on three benchmark datasets, and results show that DICET considerably outperforms the state of the art in sentiment classification.
Naseer, A, Rani, M, Naz, S, Razzak, MI, Imran, M & Xu, G 2020, 'Refining Parkinson’s neurological disorder identification through deep transfer learning', Neural Computing and Applications, vol. 32, no. 3, pp. 839-854.
View/Download from: Publisher's site
View description>>
© 2019, Springer-Verlag London Ltd., part of Springer Nature. Parkinson’s disease (PD), a multi-system neurodegenerative disorder which affects the brain slowly, is characterized by symptoms such as muscle stiffness, tremor in the limbs and impaired balance, all of which tend to worsen with the passage of time. Available treatments target its symptoms, aiming to improve the quality of life. However, automatic diagnosis at early stages is still a challenging medicine-related task to date, since a patient may have an identical behavior to that of a healthy individual at the very early stage of the disease. Parkinson’s disease detection through handwriting data is a significant classification problem for identification of PD at the infancy stage. In this paper, a PD identification is realized with help of handwriting images that help as one of the earliest indicators for PD. For this purpose, we proposed a deep convolutional neural network classifier with transfer learning and data augmentation techniques to improve the identification. Two approaches like freeze and fine-tuning of transfer learning are investigated using ImageNet and MNIST dataset as source task independently. A trained network achieved 98.28% accuracy using fine-tuning-based approach using ImageNet and PaHaW dataset. Experimental results on benchmark dataset reveal that the proposed approach provides better detection of Parkinson’s disease as compared to state-of-the-art work.
Pan, S, Hu, R, Fung, S-F, Long, G, Jiang, J & Zhang, C 2020, 'Learning Graph Embedding with Adversarial Training Methods', IEEE Transactions on Cybernetics, vol. 50, no. 6, pp. 2475-2487.
View/Download from: Publisher's site
View description>>
Graph embedding aims to transfer a graph into vectors to facilitate subsequent graph-analytics tasks like link prediction and graph clustering. Most approaches on graph embedding focus on preserving the graph structure or minimizing the reconstruction errors for graph data. They have mostly overlooked the embedding distribution of the latent codes, which unfortunately may lead to inferior representation in many cases. In this article, we present a novel adversarially regularized framework for graph embedding. By employing the graph convolutional network as an encoder, our framework embeds the topological information and node content into a vector representation, from which a graph decoder is further built to reconstruct the input graph. The adversarial training principle is applied to enforce our latent codes to match a prior Gaussian or uniform distribution. Based on this framework, we derive two variants of the adversarial models, the adversarially regularized graph autoencoder (ARGA) and its variational version, and adversarially regularized variational graph autoencoder (ARVGA), to learn the graph embedding effectively. We also exploit other potential variations of ARGA and ARVGA to get a deeper understanding of our designs. Experimental results that compared 12 algorithms for link prediction and 20 algorithms for graph clustering validate our solutions.
Poostchi, H & Piccardi, M 2020, 'BiLSTM-SSVM: Training the BiLSTM with a Structured Hinge Loss for Named-Entity Recognition', IEEE Transactions on Big Data, pp. 1-1.
View/Download from: Publisher's site
Razzak, I, Saris, RA, Blumenstein, M & Xu, G 2020, 'Integrating joint feature selection into subspace learning: A formulation of 2DPCA for outliers robust feature selection.', Neural networks : the official journal of the International Neural Network Society, vol. 121, pp. 441-451.
View/Download from: Publisher's site
View description>>
Since the principal component analysis and its variants are sensitive to outliers that affect their performance and applicability in real world, several variants have been proposed to improve the robustness. However, most of the existing methods are still sensitive to outliers and are unable to select useful features. To overcome the issue of sensitivity of PCA against outliers, in this paper, we introduce two-dimensional outliers-robust principal component analysis (ORPCA) by imposing the joint constraints on the objective function. ORPCA relaxes the orthogonal constraints and penalizes the regression coefficient, thus, it selects important features and ignores the same features that exist in other principal components. It is commonly known that square Frobenius norm is sensitive to outliers. To overcome this issue, we have devised an alternative way to derive objective function. Experimental results on four publicly available benchmark datasets show the effectiveness of joint feature selection and provide better performance as compared to state-of-the-art dimensionality-reduction methods.
Razzak, I, Zafar, K, Imran, M & Xu, G 2020, 'Randomized nonlinear one-class support vector machines with bounded loss function to detect of outliers for large scale IoT data', Future Generation Computer Systems, vol. 112, pp. 715-723.
View/Download from: Publisher's site
View description>>
© 2020 Elsevier B.V. Exponential growth of large scale data industrial internet of things is evident due to the enormous deployment of IoT data acquisition devices. Detection of unusual patterns from large scale IoT data is important though challenging task. Recently, one-class support vector machines is extensively being used for anomaly detection. It tries to find an optimal hyperplane in high dimensional data that best separates the data from anomalies with maximum margin. However, the hinge loss of traditional one-class support vector machines is unbounded, which results in larger loss caused by outliers affecting its performance for anomaly detection. Furthermore, existing methods are computationally complex for larger data. In this paper, we present novel anomaly detection for large scale data by using randomized nonlinear features in support vector machines with bounded loss function rather than finding optimized support vectors with unbounded loss function. Extensive experimental evaluation on ten benchmark datasets shows the robustness of the proposed approach against outliers such as 0.8239, 0.7921, 0.7501, 0.6711, 0.6692, 0.4789, 0.6462, 0.6812, 0.7271 and 0.7873 accuracy for Gas Sensor Array, Human Activity Recognition, Parkinson's, Hepatitis, Breast Cancer, Blood Transfusion, Heart, ILPD and Wholesale Customers datasets respectively. In addition to this, introduction of randomized nonlinear feature helps to considerably decrease the computational complexity and space complexity from O(N3) to O(Bkn) and O(N2) to O(Bkn). Thus, very attractive for larger datasets.
Razzak, MI, Imran, M & Xu, G 2020, 'Big data analytics for preventive medicine', Neural Computing and Applications, vol. 32, no. 9, pp. 4417-4451.
View/Download from: Publisher's site
View description>>
© 2019, Springer-Verlag London Ltd., part of Springer Nature. Medical data is one of the most rewarding and yet most complicated data to analyze. How can healthcare providers use modern data analytics tools and technologies to analyze and create value from complex data? Data analytics, with its promise to efficiently discover valuable pattern by analyzing large amount of unstructured, heterogeneous, non-standard and incomplete healthcare data. It does not only forecast but also helps in decision making and is increasingly noticed as breakthrough in ongoing advancement with the goal is to improve the quality of patient care and reduces the healthcare cost. The aim of this study is to provide a comprehensive and structured overview of extensive research on the advancement of data analytics methods for disease prevention. This review first introduces disease prevention and its challenges followed by traditional prevention methodologies. We summarize state-of-the-art data analytics algorithms used for classification of disease, clustering (unusually high incidence of a particular disease), anomalies detection (detection of disease) and association as well as their respective advantages, drawbacks and guidelines for selection of specific model followed by discussion on recent development and successful application of disease prevention methods. The article concludes with open research challenges and recommendations.
Saki, M, Abolhasan, M & Lipman, J 2020, 'A Novel Approach for Big Data Classification and Transportation in Rail Networks', IEEE Transactions on Intelligent Transportation Systems, pp. 1-11.
View/Download from: Publisher's site
Salik, B, Yi, H, Hassan, N, Santiappillai, N, Vick, B, Connerty, P, Duly, A, Trahair, T, Woo, AJ, Beck, D, Liu, T, Spiekermann, K, Jeremias, I, Wang, J, Kavallaris, M, Haber, M, Norris, MD, Liebermann, DA, D'Andrea, RJ, Murriel, C & Wang, JY 2020, 'Targeting RSPO3-LGR4 Signaling for Leukemia Stem Cell Eradication in Acute Myeloid Leukemia', Cancer Cell, vol. 38, no. 2, pp. 263-278.e6.
View/Download from: Publisher's site
View description>>
© 2020 Elsevier Inc. Signals driving aberrant self-renewal in the heterogeneous leukemia stem cell (LSC) pool determine aggressiveness of acute myeloid leukemia (AML). We report that a positive modulator of canonical WNT signaling pathway, RSPO-LGR4, upregulates key self-renewal genes and is essential for LSC self-renewal in a subset of AML. RSPO2/3 serve as stem cell growth factors to block differentiation and promote proliferation of primary AML patient blasts. RSPO receptor, LGR4, is epigenetically upregulated and works through cooperation with HOXA9, a poor prognostic predictor. Blocking the RSPO3-LGR4 interaction by clinical-grade anti-RSPO3 antibody (OMP-131R10/rosmantuzumab) impairs self-renewal and induces differentiation in AML patient-derived xenografts but does not affect normal hematopoietic stem cells, providing a therapeutic opportunity for HOXA9-dependent leukemia.
Shu, Y, Li, Q, Liu, S & Xu, G 2020, 'Learning with privileged information for photo aesthetic assessment', NEUROCOMPUTING, vol. 404, pp. 304-316.
View/Download from: Publisher's site
Shukla, N, Merigó, JM, Lammers, T & Miranda, L 2020, 'Half a century of computer methods and programs in biomedicine: A bibliometric analysis from 1970 to 2017.', Computer methods and programs in biomedicine, vol. 183, pp. 105075-105075.
View/Download from: Publisher's site
View description>>
BACKGROUND AND OBJECTIVE:Computer Methods and Programs in Biomedicine (CMPB) is a leading international journal that presents developments about computing methods and their application in biomedical research. The journal published its first issue in 1970. In 2020, the journal celebrates the 50th anniversary. Motivated by this event, this article presents a bibliometric analysis of the publications of the journal during this period (1970-2017). METHODS:The objective is to identify the leading trends occurring in the journal by analysing the most cited papers, keywords, authors, institutions and countries. For doing so, the study uses the Web of Science Core Collection database. Additionally, the work presents a graphical mapping of the bibliographic information by using the visualization of similarities (VOS) viewer software. This is done to analyze bibliographic coupling, co-citation and co-occurrence of keywords. RESULTS:CMPB is identified as a leading and core journal for biomedical researchers. The journal is strongly connected to IEEE Transactions on Biomedical Engineering and IEEE Transactions on Medical Imaging. Paper from Wang, Jacques, Zheng (published in 1995) is its most cited document. The top author in this journal is James Geoffrey Chase and the top contributing institution is Uppsala U (Sweden). Most of the papers in CMPB are from the USA followed by the UK and Italy. China and Taiwan are the only Asian countries to appear in the top 10 publishing in CMPB. A keyword co-occurrences analysis revealed strong co-occurrences for classification, picture archiving and communication system (PACS), heart rate variability, survival analysis and simulation. Keywords analysis for the last decade revealed that machine learning for a variety of healthcare problems (including image processing and analysis) dominated other research fields in CMPB. CONCLUSIONS:It can be concluded that CMPB is a world-renowned publication outlet for biomedical researchers which has b...
Taccola, G, Gad, P, Culaclii, S, Ichiyama, RM, Liu, W & Edgerton, VR 2020, 'Using EMG to deliver lumbar dynamic electrical stimulation to facilitate cortico-spinal excitability.', Brain Stimulation, vol. 13, no. 1, pp. 20-34.
View/Download from: Publisher's site
View description>>
BACKGROUND:Potentiation of synaptic activity in spinal networks is reflected in the magnitude of modulation of motor responses evoked by spinal and cortical input. After spinal cord injury, motor evoked responses can be facilitated by pairing cortical and peripheral nerve stimuli. OBJECTIVE:To facilitate synaptic potentiation of cortico-spinal input with epidural electrical stimulation, we designed a novel neuromodulation method called dynamic stimulation (DS), using patterns derived from hind limb EMG signal during stepping. METHODS:DS was applied dorsally to the lumbar enlargement through a high-density epidural array composed of independent platinum-based micro-electrodes. RESULTS:In fully anesthetized intact adult rats, at the interface array/spinal cord, the temporal and spatial features of DS neuromodulation affected the entire lumbosacral network, particularly the most rostral and caudal segments covered by the array. DS induced a transient (at least 1 min) increase in spinal cord excitability and, compared to tonic stimulation, generated a more robust potentiation of the motor output evoked by single pulses applied to the spinal cord. When sub-threshold pulses were selectively applied to a cortical motor area, EMG responses from the contralateral leg were facilitated by the delivery of DS to the lumbosacral cord. Finally, based on motor-evoked responses, DS was linked to a greater amplitude of motor output shortly after a calibrated spinal cord contusion. CONCLUSION:Compared to traditional tonic waveforms, DS amplifies both spinal and cortico-spinal input aimed at spinal networks, thus significantly increasing the potential and accelerating the rate of functional recovery after a severe spinal lesion.
Tang, Q, Yang, J, Jia, W, He, X, Zhang, Q & Liu, H 2020, 'A GMS-Guided Approach for 2D Feature Correspondence Selection', IEEE ACCESS, vol. 8, pp. 36919-36929.
View/Download from: Publisher's site
Thanh, TK & Bogdan, G 2020, 'A comparative study of general fuzzy min -max neural networks for pattern classification problems', NEUROCOMPUTING, vol. 386, pp. 110-125.
View/Download from: Publisher's site
Tofigh, F, Amiri, M, Shariati, N, Lipman, J & Abolhasan, M 2020, 'Crowd Estimation Using Electromagnetic Wave Power-Level Measurements: A Proof of Concept', IEEE Transactions on Vehicular Technology, vol. 69, no. 1, pp. 784-792.
View/Download from: Publisher's site
Tofigh, F, Amiri, M, Shariati, N, Lipman, J & Abolhasan, M 2020, 'Polarization-Insensitive Metamaterial Absorber for Crowd Estimation Based on Electromagnetic Energy Measurements', IEEE Transactions on Antennas and Propagation, vol. 68, no. 3, pp. 1458-1467.
View/Download from: Publisher's site
View description>>
© 2020 IEEE. Noninvasive crowd estimation has remained a challenging issue among researchers. Methods such as image analysis and Wi-Fi/Bluetooth probing can always be used to identify and track people. Lately, authors have introduced a noninvasive method for crowd estimation based on ambient RF energy measurements. In this article, a polarization-insensitive multilayer metamaterial absorber is introduced to measure the variation in the available RF energy levels for crowd estimation purposes. The proposed dual-band absorber is designed to absorb and transfer the maximum of the available Wi-Fi energy to a lumped element to enable proper and accurate measurements. To evaluate the design, the proposed structure is fabricated as an array, and its performance is tested, proving perfect absorption at the desired frequencies, 2.4 and 5 GHz.
Usman, M, Jan, MA, He, X & Chen, J 2020, 'A Mobile Multimedia Data Collection Scheme for Secured Wireless Multimedia Sensor Networks', IEEE Transactions on Network Science and Engineering.
View/Download from: Publisher's site
View description>>
IEEE Wireless Multimedia Sensor Networks (WMSNs) produce an enormous amount of big multimedia data. Due to large size, Multimedia Sensor Nodes (MSNs) cannot store generated multimedia data for a long time. In this scenario, mobile sinks can be utilized for data collection. However, due to vulnerable nature of wireless networks, there is a need for an efficient security scheme to authenticate both MSNs and mobile sinks. In this paper, we propose a scheme to protect an underlying WMSN during mobile multimedia data collection. The proposed scheme is a two-layer scheme. At the first layer, all MSNs are distributed into small clusters, where each cluster is represented by a single Cluster Head (CH). At the second layer, all CHs verify identities of mobile sinks before sharing multimedia data. Authentication at both layers ensures a secure data exchange. We evaluate the performance of proposed scheme through extensive simulation results. The simulation results prove that the proposed scheme performs better as compared to existing state-of-the-art approaches in terms of resilience and handshake duration. The proposed scheme is also analyzed in terms of authentication rate, data freshness, and packet delivery ratio, and has shown a better performance.
Usman, M, Jan, MA, He, X & Nanda, P 2020, 'QASEC: A secured data communication scheme for mobile Ad-hoc networks', Future Generation Computer Systems.
View/Download from: Publisher's site
View description>>
© 2018 Elsevier B.V. Mobile Adhoc NETworks (MANETs) are valuable for various applications due to an efficient, flexible, low-cost and dynamic infrastructure. In these networks, proper utilization of network resources is desirable to maintain Quality of Service (QoS). In multi-hop end-to-end communication, intermediate nodes may eavesdrop on data in transit. As a result, a secured and reliable data delivery from source to destination is required. In this paper, we propose a novel scheme, known as QASEC, to achieve better throughput by securing end-to-end communication in MANETs. The QoS is maintained through an optimal link selection from a queue of available transmission links. The end-to-end communication is secured by authentication. A simple secret-key based symmetric encryption is deployed for interacting nodes. Our proposed QASEC scheme prevents the malicious nodes from data exchange with legitimate intermediate nodes on any established path between the source and the destination. Experimental results show that QASEC performs better in terms of packet-loss rate, jitter and end-to-end delay. Furthermore, QASEC is efficient against various attacks and has a much better performance in terms of associated costs, such as key generation, encryption, and storage and communication.
Usman, M, Jan, MA, Jolfaei, A, Xu, M, He, X & Chen, J 2020, 'A Distributed and Anonymous Data Collection Framework Based on Multilevel Edge Computing Architecture', IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, vol. 16, no. 9, pp. 6114-6123.
View/Download from: Publisher's site
Verhoeven, D, Musial, K, Palmer, S, Taylor, S, Abidi, S, Zemaityte, V & Simpson, L 2020, 'Controlling for openness in the male-dominated collaborative networks of the global film industry.', PLoS One, vol. 15, no. 6, pp. e0234460-e0234460.
View/Download from: Publisher's site
View description>>
Studies of gender inequality in film industries have noted the persistence of male domination in creative roles (usually defined as director, producer, writer) and the slow pace of reform. Typical policy remedies are premised on aggregate counts of women as a proportion of overall industry participation. Network science offers an alternative way of identifying and proposing change mechanisms, as it puts emphasis on relationships instead of individuals. Preliminary work on applying network analysis to understand inequality in the film industry has been undertaken. However, in this study we offer a comprehensive approach that enables us to not only understand what inequality in the film industry looks like through the lens of network science but also how we can attempt to address this issue. We offer a data-driven simulation framework that investigates various what-if scenarios when it comes to network evolution. We then assess each of these scenarios with respect to its potential to address gender inequality in the film industry. As suggested by previous studies, inequality is exacerbated when industry networks are most closed. We review evidence from three different national film industries on network relationships in creative teams and identify a high proportion of men who only work with other men. In response to this observation, we test several mechanisms through which industry structures may generate higher levels of openness. Our results reveal that the most critical factor for improving network openness is not simply the statistical improvement of the number of women in a network, nor the removal of men who do not work with women. The most likely behavioural changes to a network will involve the production of connections between women and powerful men.
Wang, D, Zhang, X, Yu, D, Xu, G & Deng, S 2020, 'CAME: Content- and Context-Aware Music Embedding for Recommendation', IEEE Transactions on Neural Networks and Learning Systems, pp. 1-14.
View/Download from: Publisher's site
Wang, H, Lian, D, Zhang, Y, Qin, L, He, X, Lin, Y & Lin, X 2020, 'Binarized Graph Neural Network.', CoRR, vol. abs/2004.11147.
Wang, H, Wu, J, Zhu, X, Chen, Y & Zhang, C 2020, 'Time-Variant Graph Classification', IEEE Transactions on Systems Man and Cybernetics: Systems, vol. 50, no. 8, pp. 2883-2896.
View/Download from: Publisher's site
View description>>
IEEE Graphs are commonly used to represent objects, such as images and text, for pattern classification. In a dynamic world, an object may continuously evolve over time, and so does the graph extracted from the underlying object. These changes in graph structure with respect to the temporal order present a new representation of the graph, in which an object corresponds to a set of time-variant graphs. In this paper, we formulate a novel time-variant graph classification task and propose a new graph feature, called a graph-shapelet pattern, for learning and classifying time-variant graphs. Graph-shapelet patterns are compact and discriminative graph transformation subsequences. A graph-shapelet pattern can be regarded as a graphical extension of a shapelet--a class of discriminative features designed for vector-based temporal data classification. To discover graph-shapelet patterns, we propose to convert a time-variant graph sequence into time-series data and use the discovered shapelets to find graph transformation subsequences as graph-shapelet patterns. By converting each graph-shapelet pattern into a unique tokenized graph transformation sequence, we can measure the similarity between two graph-shapelet patterns and therefore classify time-variant graphs. Experiments on both synthetic and real-world data demonstrate the superior performance of the proposed algorithms.
Wang, Q, Huang, Y, Jia, W, He, X, Blumenstein, M, Lyu, S & Lu, Y 2020, 'FACLSTM: ConvLSTM with focused attention for scene text recognition', Science China Information Sciences, vol. 63, no. 2.
View/Download from: Publisher's site
View description>>
© 2020, Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature. Scene text recognition has recently been widely treated as a sequence-to-sequence prediction problem, where traditional fully-connected-LSTM (FC-LSTM) has played a critical role. Owing to the limitation of FC-LSTM, existing methods have to convert 2-D feature maps into 1-D sequential feature vectors, resulting in severe damages of the valuable spatial and structural information of text images. In this paper, we argue that scene text recognition is essentially a spatiotemporal prediction problem for its 2-D image inputs, and propose a convolution LSTM (ConvLSTM)-based scene text recognizer, namely, FACLSTM, i.e., focused attention ConvLSTM, where the spatial correlation of pixels is fully leveraged when performing sequential prediction with LSTM. Particularly, the attention mechanism is properly incorporated into an efficient ConvLSTM structure via the convolutional operations and additional character center masks are generated to help focus attention on right feature areas. The experimental results on benchmark datasets IIIT5K, SVT and CUTE demonstrate that our proposed FACLSTM performs competitively on the regular, low-resolution and noisy text images, and outperforms the state-of-the-art approaches on the curved text images with large margins.
Wang, S & Cao, L 2020, 'Inferring Implicit Rules by Learning Explicit and Hidden Item Dependency', IEEE Transactions on Systems Man and Cybernetics: Systems.
View/Download from: Publisher's site
View description>>
IEEE Revealing complex relations between entities (e.g., items within or between transactions) is of great significance for business optimization, prediction, and decision making. Such relations include not only co-occurrence-based explicit relations but also nonco-occurrence-based implicit ones. Explicit relations have been substantially studied by rule mining-based approaches, including association rule mining and causal rule discovery. In contrast, implicit relations have received much less attention but could be more actionable. In this paper, we focus on the implicit relations between items which rarely or never co-occur while each of them co-occurs with other identical items (link items) with a high probability. A framework integrates both explicit and hidden item dependencies and a corresponding efficient algorithm IRRMiner captures such implicit relations with implicit rule inference. Experimental results show that IRRMiner not only infers implicit rules of various sizes consisting of both frequent and infrequent items effectively, it also runs at least four times faster than IARMiner, a typical indirect association rule mining algorithm which can only mine size-2 indirect association rules between frequent items. IRRMiner is applied to make recommendations and shows that the identified implicit rules can increase recommendation reliability.
Wang, S, Cao, L, Hu, L, Berkovsky, S, Huang, X, Xiao, L & Lu, W 2020, 'Jointly Modeling Intra- and Inter-transaction Dependencies with Hierarchical Attentive Transaction Embeddings for Next-item Recommendation', IEEE Intelligent Systems.
View/Download from: Publisher's site
View description>>
IEEE A transaction-based recommender system (TBRS) attempts to predict the next item by modeling dependencies in transactional data. Generally, two kinds of dependency considered are intra-transaction dependency and inter-transaction dependency. Most existing TBRSs recommend next item by only modeling the intra-transaction dependency within the current transaction while ignoring inter-transaction dependency with recent transactions that may also affect the next item. However, not all recent transactions are relevant to the current one and next items, such that the relevant ones should be prioritized. In this paper, we propose a novel hierarchical attentive transaction embedding (HATE) model to tackle these issues. Specifically, a two-level attention mechanism integrates both item embeddings and transaction embeddings to build an attentive context representation incorporating both intra- and inter-transaction dependencies and to recommend the next item. Experimental evaluations using two real-world datasets of shopping transactions show that HATE significantly outperforms the state-of-the-art methods in terms of recommendation accuracy.
Wang, W, Zhang, Y, Sui, Y, Wan, Y, Zhao, Z, Wu, J, Yu, P & Xu, G 2020, 'Reinforcement-Learning-Guided Source Code Summarization via Hierarchical Attention', IEEE Transactions on Software Engineering, pp. 1-1.
View/Download from: Publisher's site
Wang, Y, Zhang, C, Wang, S, Yu, PS, Bai, L, Cui, L & Xu, G 2020, 'Generative temporal link prediction via self-tokenized sequence modeling', World Wide Web, vol. 23, no. 4, pp. 2471-2488.
View/Download from: Publisher's site
View description>>
© 2020, Springer Science+Business Media, LLC, part of Springer Nature. We formalize networks with evolving structures as temporal networks and propose a generative link prediction model, Generative Link Sequence Modeling (GLSM), to predict future links for temporal networks. GLSM captures the temporal link formation patterns from the observed links with a sequence modeling framework and has the ability to generate the emerging links by inferring from the probability distribution on the potential future links. To avoid overfitting caused by treating each link as a unique token, we propose a self-tokenization mechanism to transform each raw link in the network to an abstract aggregation token automatically. The self-tokenization is seamlessly integrated into the sequence modeling framework, which allows the proposed GLSM model to have the generalization capability to discover link formation patterns beyond raw link sequences. We compare GLSM with the existing state-of-art methods on five real-world datasets. The experimental results demonstrate that GLSM obtains future positive links effectively in a generative fashion while achieving the best performance (2-10% improvements on AUC) among other alternatives.
Wu, Z, Li, G, Shen, S, Lian, X, Chen, E & Xu, G 2020, 'Constructing dummy query sequences to protect location privacy and query privacy in location-based services', World Wide Web.
View/Download from: Publisher's site
View description>>
© 2020, Springer Science+Business Media, LLC, part of Springer Nature. Location-based services (LBS) have become an important part of people’s daily life. However, while providing great convenience for mobile users, LBS result in a serious problem on personal privacy, i.e., location privacy and query privacy. However, existing privacy methods for LBS generally take into consideration only location privacy or query privacy, without considering the problem of protecting both of them simultaneously. In this paper, we propose to construct a group of dummy query sequences, to cover up the query locations and query attributes of mobile users and thus protect users’ privacy in LBS. First, we present a client-based framework for user privacy protection in LBS, which requires not only no change to the existing LBS algorithm on the server-side, but also no compromise to the accuracy of a LBS query. Second, based on the framework, we introduce a privacy model to formulate the constraints that ideal dummy query sequences should satisfy: (1) the similarity of feature distribution, which measures the effectiveness of the dummy query sequences to hide a true user query sequence; and (2) the exposure degree of user privacy, which measures the effectiveness of the dummy query sequences to cover up the location privacy and query privacy of a mobile user. Finally, we present an implementation algorithm to well meet the privacy model. Besides, both theoretical analysis and experimental evaluation demonstrate the effectiveness of our proposed approach, which show that the location privacy and attribute privacy behind LBS queries can be effectively protected by the dummy queries generated by our approach.
Wu, Z, Pan, S, Chen, F, Long, G, Zhang, C & Yu, PS 2020, 'A Comprehensive Survey on Graph Neural Networks', IEEE Transactions on Neural Networks and Learning Systems, pp. 1-21.
View/Download from: Publisher's site
Wu, Z, Pan, S, Long, G, Jiang, J, Chang, X & Zhang, C 2020, 'Connecting the Dots: Multivariate Time Series Forecasting with Graph Neural Networks', Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 753-763.
View/Download from: Publisher's site
View description>>
© 2020 ACM. Modeling multivariate time series has long been a subject that has attracted researchers from a diverse range of fields including economics, finance, and traffic. A basic assumption behind multivariate time series forecasting is that its variables depend on one another but, upon looking closely, it is fair to say that existing methods fail to fully exploit latent spatial dependencies between pairs of variables. In recent years, meanwhile, graph neural networks (GNNs) have shown high capability in handling relational dependencies. GNNs require well-defined graph structures for information propagation which means they cannot be applied directly for multivariate time series where the dependencies are not known in advance. In this paper, we propose a general graph neural network framework designed specifically for multivariate time series data. Our approach automatically extracts the uni-directed relations among variables through a graph learning module, into which external knowledge like variable attributes can be easily integrated. A novel mix-hop propagation layer and a dilated inception layer are further proposed to capture the spatial and temporal dependencies within the time series. The graph learning, graph convolution, and temporal convolution modules are jointly learned in an end-to-end framework. Experimental results show that our proposed model outperforms the state-of-the-art baseline methods on 3 of 4 benchmark datasets and achieves on-par performance with other approaches on two traffic datasets which provide extra structural information.
Wu, Z, Wang, R, Li, Q, Lian, X, Xu, G, Chen, E & Liu, X 2020, 'A Location Privacy-Preserving System Based on Query Range Cover-Up or Location-Based Services', IEEE Transactions on Vehicular Technology, vol. 69, no. 5, pp. 5244-5254.
View/Download from: Publisher's site
View description>>
© 1967-2012 IEEE. Location-based service (LBS) has been widely used in various fields of industry, and become a vital part of people's daily life. However, while providing great convenience for users, LBS results in a serious threat on users' location privacy, due to its more and more untrusted server-side. In this article, we propose a location privacy-preserving system for LBS by constructing 'cover-up ranges' to protect the query ranges associated with a location query sequence. Firstly, we present a client-based system framework for location privacy protection in LBS, which requires no compromise to the accuracy and usability of LBS. Secondly, based on the framework, we introduce a location privacy model to formulate the constraints that ideal cover-up ranges should satisfy, so as to improve the efficiency of location services and the security of location privacy. Finally, we describe an implementation algorithm to well meet the location privacy model. Both theoretical analysis and experimental evaluation demonstrate the effectiveness of our system, which can improve the security of users' location privacy on the untrusted server-side, without compromising the accuracy and usability of LBS.
Xi, Y, Zheng, J, He, X, Jia, W, Li, H, Xie, Y, Feng, M & Li, X 2020, 'Beyond context: Exploring semantic similarity for small object detection in crowded scenes', Pattern Recognition Letters.
View/Download from: Publisher's site
View description>>
© 2019 Small object detection in crowded scene aims to find those tiny targets with very limited resolution from crowded scenes. Due to very little information available on tiny objects, it is often not suitable to detect them merely based on the information presented inside their bounding boxes, resulting low accuracy. In this paper, we propose to exploit the semantic similarity among all predicted objects’ candidates to boost the performance of detectors when handling tiny objects. For this purpose, we construct a pairwise constraint to depict such semantic similarity and propose a new framework based on Discriminative Learning and Graph-Cut techniques. Experiments conducted on three widely used benchmark datasets demonstrate the improvement over the state-of-the-art approaches gained by applying this idea.
Xi, Y, Zheng, J, Jia, W, He, X, Li, H, Ren, Z & Lam, K-M 2020, 'See Clearly in the Distance: Representation Learning GAN for Low Resolution Object Recognition', IEEE ACCESS, vol. 8, pp. 53203-53214.
View/Download from: Publisher's site
Xiong, F, Wang, X, Pan, S, Yang, H, Wang, H & Zhang, C 2020, 'Social Recommendation With Evolutionary Opinion Dynamics', IEEE Transactions on Systems Man and Cybernetics: Systems, vol. 50, no. 10, pp. 3804-3816.
View/Download from: Publisher's site
View description>>
IEEE When users in online social networks make a decision, they are often affected by their neighbors. Social recommendation models utilize social information to reveal the impact of neighbors on user preferences, and this impact is often described by the linear superposition of neighbor preferences or by global trust propagation. Further exploration needs to be undertaken to determine whether the influence pattern of other users from online interaction behaviors is adequately described. In this paper, we introduce evolutionary opinion dynamics from the field of statistical physics into recommender systems, characterizing the impact of other users. We propose an opinion dynamic model by evolutionary game theory. To describe online user interactions, we define the strategies during an interaction between two users, and present the payoff for each strategy in terms of errors of estimated ratings. Therefore, user behaviors are associated with their preferences and ratings. In addition, we measure user influence according to their topological roles in the social network. We incorporate evolutionary opinion dynamics and user influence into the recommendation framework for the prediction of unknown ratings. Experiment results on two real-world datasets demonstrate that our method outperforms state-of the-art models in terms of accuracy, and it also performs well for cold-start users. Our method reduces the divergence of user preferences, in accordance with online opinion interactions. Furthermore, our method has approximate computational complexity with matrix factorization, and results in less computation than state-of-the-art models. Our method is quite general, and indicates that studies in social physics, statistics, and other research fields may be involved in recommendation to improve the performance.
Yan, Y, Tan, M, Tsang, I, Yang, Y, Shi, Q & Zhang, C 2020, 'Fast and Low Memory Cost Matrix Factorization: Algorithm, Analysis and Case Study', IEEE Transactions on Knowledge and Data Engineering, vol. 32, no. 2, pp. 288-301.
View/Download from: Publisher's site
View description>>
IEEE Matrix factorization has been widely applied to various applications. With the fast development of storage and internet technologies, we have been witnessing a rapid increase of data. In this paper, we propose new algorithms for matrix factorization with the emphasis on efficiency. In addition, most existing methods of matrix factorization only consider a general smooth least square loss. Differently, many real-world applications have distinctive characteristics. As a result, different losses should be used accordingly. Therefore, it is beneficial to design new matrix factorization algorithms that are able to deal with both smooth and non-smooth losses. To this end, one needs to analyze the characteristics of target data and use the most appropriate loss based on the analysis. We particularly study two representative cases of low-rank matrix recovery, i.e., collaborative filtering for recommendation and high dynamic range imaging. To solve these two problems, we respectively propose a stage-wise matrix factorization algorithm by exploiting manifold optimization techniques. From our theoretical analysis, they are both are provably guaranteed to converge to a stationary point. Extensive experiments on recommender systems and high dynamic range imaging demonstrate the satisfactory performance and efficiency of our proposed method on large-scale real data.
Yao, L, Kusakunniran, W, Wu, Q, Zhang, J, Tang, Z & Yang, W 2020, 'Robust gait recognition using hybrid descriptors based on Skeleton Gait Energy Image', Pattern Recognition Letters.
View/Download from: Publisher's site
View description>>
© 2019 Gait features have been widely applied in human identification. The commonly-used representations for gait recognition can be roughly classified into two categories: model-free features and model-based features. However, due to the view variances and clothes changes, model-free features are sensitive to the appearance changes. For model-based features, there is great difficulty in extracting the underlying models from gait sequences. Based on the confidence maps and the part affinity fields produced by a two-branch multi-stage CNN network, a new model-based representation, Skeleton Gait Energy Image (SGEI), has been proposed in this paper. Another contribution is that a hybrid representation has been produced, which uses SGEI to remedy the deficiency of model-free features, Gait Energy Image (GEI) for instance. The experimental performances indicate that our proposed methods are more robust to the cloth changes, and contribute to increasing the robustness of gait recognition in the unconstrained environments with view variances and clothes changes.
Yao, Y, Shen, F, Xie, G, Liu, L, Zhu, F, Zhang, J & Shen, HT 2020, 'Exploiting Web Images for Multi-Output Classification: From Category to Subcategories', IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, vol. 31, no. 7, pp. 2348-2360.
View/Download from: Publisher's site
Yao, Y, Zhang, J, Shen, F, Liu, L, Zhu, F, Zhang, D & Shen, HT 2020, 'Towards automatic construction of diverse, high-quality image datasets', IEEE Transactions on Knowledge and Data Engineering, vol. 32, no. 6, pp. 1199-1211.
View/Download from: Publisher's site
View description>>
© 1989-2012 IEEE. The availability of labeled image datasets has been shown critical for high-level image understanding, which continuously drives the progress of feature designing and models developing. However, constructing labeled image datasets is laborious and monotonous. To eliminate manual annotation, in this work, we propose a novel image dataset construction framework by employing multiple textual queries. We aim at collecting diverse and accurate images for given queries from the Web. Specifically, we formulate noisy textual queries removing and noisy images filtering as a multi-view and multi-instance learning problem separately. Our proposed approach not only improves the accuracy but also enhances the diversity of the selected images. To verify the effectiveness of our proposed approach, we construct an image dataset with 100 categories. The experiments show significant performance gains by using the generated data of our approach on several tasks, such as image classification, cross-dataset generalization, and object detection. The proposed method also consistently outperforms existing weakly supervised and web-supervised approaches.
Zhang, D, Yin, J, Zhu, X & Zhang, C 2020, 'Network Representation Learning: A Survey', IEEE Transactions on Big Data, vol. 6, no. 1, pp. 3-28.
View/Download from: Publisher's site
Zhang, P, Xu, J, Wu, Q, Huang, Y & Zhanga, J 2020, 'Top-Push Constrained Modality-Adaptive Dictionary Learning for Cross-Modality Person Re-Identification', IEEE Transactions on Circuits and Systems for Video Technology, pp. 1-1.
View/Download from: Publisher's site
Zhang, X, Zhao, Z, Zheng, Y & Li, J 2020, 'Prediction of Taxi Destinations Using a Novel Data Embedding Method and Ensemble Learning', IEEE Transactions on Intelligent Transportation Systems, vol. 21, no. 1, pp. 68-78.
View/Download from: Publisher's site
Zhao, X, Guo, J, Nie, F, Chen, L, Li, Z & Zhang, H 2020, 'Joint Principal Component and Discriminant Analysis for Dimensionality Reduction', IEEE Transactions on Neural Networks and Learning Systems, vol. 31, no. 2, pp. 433-444.
View/Download from: Publisher's site
View description>>
© 2012 IEEE. Linear discriminant analysis (LDA) is the most widely used supervised dimensionality reduction approach. After removing the null space of the total scatter matrix St via principal component analysis (PCA), the LDA algorithm can avoid the small sample size problem. Most existing supervised dimensionality reduction methods extract the principal component of data first, and then conduct LDA on it. However, 'most variance' is very often the most important, but not always in PCA. Thus, this two-step strategy may not be able to obtain the most discriminant information for classification tasks. Different from traditional approaches which conduct PCA and LDA in sequence, we propose a novel method referred to as joint principal component and discriminant analysis (JPCDA) for dimensionality reduction. Using this method, we are able to not only avoid the small sample size problem but also extract discriminant information for classification tasks. An iterative optimization algorithm is proposed to solve the method. To validate the efficacy of the proposed method, we perform extensive experiments on several benchmark data sets in comparison with some state-of-the-art dimensionality reduction methods. A large number of experimental results illustrate that the proposed method has quite promising classification performance.
Zhe, T, Huang, L, Wu, Q, Zhang, J, Pei, C & Li, L 2020, 'Inter-Vehicle Distance Estimation Method Based on Monocular Vision Using 3D Detection', IEEE Transactions on Vehicular Technology, vol. 69, no. 5, pp. 4907-4919.
View/Download from: Publisher's site
View description>>
© 1967-2012 IEEE. Most autonomous vehicles build their perception systems on expensive sensors, such as LIDAR, RADAR, and high-precision Global Positioning System (GPS). However, cameras can provide richer sensing at a considerably lower cost, this makes them a more appealing alternative. A driving assistance system (DAS) based on monocular vision has gradually become a research hotspot, and inter-vehicle distance estimation based on monocular vision is an important technology in DAS. There are still constrains in the existing methods for estimating the inter-vehicle distance based on monocular vision, such as low accuracy when distance is larger, unstable accuracy for different types vehicles, and significantly poor performance on distance estimation for severely occluded vehicles. To improve the accuracy and robustness of ranging results, this study proposes a monocular vision end-to-end inter-vehicle distance estimation method based on 3D detection. The actual area of the rare view of the vehicle and the corresponding projection area in the image are obtained by 3D detection method. An area-distance geometric model is then established on the basis of the camera projection principle to recover distance. Our method shows its potential in complex traffic scenarios by testing the test set data provided on the real-world computer vision benchmark, KITTI. The experimental results have superior performance than the existing published methods. Moreover, the accuracy of occluded vehicle ranging results can reach approximately 98%, while the accuracy deviation between vehicles with different visual angles is less than 2%.
Zheng, C, Zhang, Q, Long, G, Zhang, C, Young, SD & Wang, W 2020, 'Measuring Time-Sensitive and Topic-Specific Influence in Social Networks with LSTM and Self-Attention', IEEE Access, vol. 8, pp. 82481-82492.
View/Download from: Publisher's site
View description>>
© 2013 IEEE. Influence measurement in social networks is vital to various real-world applications, such as online marketing and political campaigns. In this paper, we investigate the problem of measuring time-sensitive and topic-specific influence based on streaming texts and dynamic social networks. A user's influence can change rapidly in response to a new event and vary on different topics. For example, the political influence of Douglas Jones increased dramatically after winning the Alabama special election, and then rapidly decreased after the election week. During the same period, however, Douglas Jones' influence on sports remained low. Most existing approaches can only model the influence based on static social network structures and topic distributions. Furthermore, as popular social networking services embody many features to connect their users, multi-Typed interactions make it hard to learn the roles that different interactions play when propagating information. To address these challenges, we propose a Time-sensitive and Topic-specific Influence Measurement (TTIM) method, to jointly model the streaming texts and dynamic social networks. We simulate the influence propagation process with a self-Attention mechanism to learn the contributions of different interactions and track the influence dynamics with a matrix-Adaptive long short-Term memory. To the best of our knowledge, this is the first attempt to measure time-sensitive and topic-specific influence. Furthermore, the TTIM model can be easily adapted to supporting online learning which consumes constant training time on newly arrived data for each timestamp. We comprehensively evaluate the proposed TTIM model on five datasets from Twitter and Reddit. The experimental results demonstrate promising performance compared to the state-of-The-Art social influence analysis models and the potential of TTIM in visualizing influence dynamics and topic distribution.
Zhou, I, Lipman, J, Abolhasan, M, Shariati, N & Lamb, DW 2020, 'Frost Monitoring Cyber-Physical System: A Survey on Prediction and Active Protection Methods', IEEE INTERNET OF THINGS JOURNAL, vol. 7, no. 7, pp. 6514-6527.
View/Download from: Publisher's site
Zhu, C, Cao, L & Yin, J 2020, 'Unsupervised Heterogeneous Coupling Learning for Categorical Representation', IEEE Transactions on Pattern Analysis and Machine Intelligence, pp. 1-1.
View/Download from: Publisher's site
Zuo, Y, Wu, Q, Fang, Y, An, P, Huang, L & Chen, Z 2020, 'Multi-Scale Frequency Reconstruction for Guided Depth Map Super-Resolution via Deep Residual Network', IEEE Transactions on Circuits and Systems for Video Technology, vol. 30, no. 2, pp. 297-306.
View/Download from: Publisher's site
View description>>
© 1991-2012 IEEE. The depth maps obtained by the consumer-level sensors are always noisy in the low-resolution (LR) domain. Existing methods for the guided depth super-resolution, which are based on the pre-defined local and global models, perform well in general cases (e.g., joint bilateral filter and Markov random field). However, such model-based methods may fail to describe the potential relationship between RGB-D image pairs. To solve this problem, this paper proposes a data-driven approach based on the deep convolutional neural network with global and local residual learning. It progressively upsamples the LR depth map guided by the high-resolution intensity image in multiple scales. A global residual learning is adopted to learn the difference between the ground truth and the coarsely upsampled depth map, and the local residual learning is introduced in each scale-dependent reconstruction sub-network. This scheme can restore the depth structure from coarse to fine via multi-scale frequency synthesis. In addition, batch normalization layers are used to improve the performance of depth map denoising. Our method is evaluated in noise-free and noisy cases. A comprehensive comparison against 17 state-of-the-art methods is carried out. The experimental results show that the proposed method has faster convergence speed as well as improved performances based on the qualitative and quantitative evaluations.
Al-Hadhrami, Y & Hussain, FK 2020, 'A Machine Learning Architecture Towards Detecting Denial of Service Attack in IoT', Advances in Intelligent Systems and Computing, pp. 417-429.
View/Download from: Publisher's site
View description>>
© 2020, Springer Nature Switzerland AG. Internet of thing is part of our everyday life nowadays. Where millions of devices contented to the internet to collect and share data. Although IoT devices are evolving quickly to the consumer market where smart devices and sensors are becoming one of the main components of many households, IoT sensors and actuators have been also heavily used in the industry where thousands of devices are used to collect and share data for different purposes. With the rapid development of the Internet of Things in different areas, IoT is facing difficulty in securing overall availability of the network due to its heterogeneous nature. There are many types of vulnerability in IoT that can be mitigated with further research, however, in this paper, we have concentrated on distributed denial of Service attack (DDoS) on IoT. In this paper, we propose a machine learning architecture to detect DDoS attacks in IoT networks. The architecture collects IoT network traffic and analyzes the traffic through passing to machine learning model for attack detection. We propose the use of real-time data collection tool to dynamically monitor the network.
Al-Hadhrami, Y, Al-Hadhrami, N & Hussain, FK 2020, 'Data exportation framework for IoT simulation based devices', Advances in Intelligent Systems and Computing, pp. 212-222.
View/Download from: Publisher's site
View description>>
© Springer Nature Switzerland AG 2020. Internet of things (IoT) is part of everyday life nowadays. Millions of devices are connected to the internet to collect and share data. Although IoT devices are evolving quickly in the consumer market where smart devices and sensors are becoming one of the main components of many households, IoT sensors and actuators are also heavily used in the industry where thousands of devices are used to collect and share data for different purposes. A need for an IoT simulation tool is necessary for development purposes and testing before deployments. One of the widely used tools among IoT researchers is the open-source tool Cooja simulator. Cooja has limitations—one is the lack of a way to export collected data as a data set for further processing. Therefore, this study introduces an extension tool to present and export the data into different forms.
Almansor, EH & Hussain, FK 2020, 'Modeling the Chatbot Quality of Services (CQoS) Using Word Embedding to Intelligently Detect Inappropriate Responses', Advances in Intelligent Systems and Computing, pp. 60-70.
View/Download from: Publisher's site
View description>>
© 2020, Springer Nature Switzerland AG. The rapid growth of intelligent chatbots as conversational agents with the assistance of artificial intelligence has recently attracted much research attention. The major role of a chatbot is to generate appropriate responses to the user, however sometimes the chatbot fails to understand the user’s meaning. Therefore, detecting inappropriate responses from a chatbot is a critical issue. Several studies based on annotated datasets have investigated the problem of inappropriate responses from a chatbots perspective without considering the user’s perspective. Understanding the context of the conversation is an important point in determining whether a response is appropriate or inappropriate. Sentiment analysis is a natural language processing task that supports mining in user behavior. Therefore, we propose an intelligent framework that combines automated sentiment scoring and a word embedding model to detect the quality of chatbot responses considering the end-user’s point of view. We find our model achieves higher quality results than logistic regression.
Almansor, EH & Hussain, FK 2020, 'Survey on Intelligent Chatbots: State-of-the-Art and Future Research Directions', Advances in Intelligent Systems and Computing, pp. 534-543.
View/Download from: Publisher's site
View description>>
© 2020, Springer Nature Switzerland AG. Human-computer interaction (HCI) is an area of interest which plays a major role in understanding the interaction between humans and machines. Dialogue systems or conversational systems including chatbots, voice control interfaces and personal assistants are examples of HCI application that have been developed to interact with users using natural language. Chatbots can help customers find useful information for their needs. Thus, numerous organizations are using chatbots to automate their customer service. Thus, the needs for using artificial intelligence has been increasing due to the needs of automated services. However, devolving smart bots that can respond at the human level is challenging. In this paper, we survey the state-of-art chatbot approaches from based on the ability to generate appropriate responses perspective. After summarizing the review from this aspect, we identify the research issues and challenges in chatbots. The findings of this research will highlight directions for future work.
Almansor, EH, Al-Ani, A & Hussain, FK 2020, 'Transferring Informal Text in Arabic as Low Resource Languages: State-of-the-Art and Future Research Directions', Advances in Intelligent Systems and Computing, pp. 176-187.
View/Download from: Publisher's site
View description>>
© 2020, Springer Nature Switzerland AG. Rapid growth in internet technology lead to increase the usage of social media platforms which make communication between users easier. Through the communication users used their daily languages which considered as non-standard language. The non-slandered text contains lots of noise, such as abbreviations, slang which used more in English languages and dialect words which are widely used in Arabic language. These texts face challenging using any natural language processing tools. Therefore, these texts need to be treated and transferred to be similar to their standard form. According to that the normalization and translation approach have been used to transfer the informal text. However, using these approach need large label or parallel datasets. While high resource languages such as English have enough parallel datasets, low resource languages such as Arabic is lack of enough parallel dataset. Therefore, in this paper we focus on the Arabic and Arabic dialects as a low resource language in the era of transferring non-stander text using normalization and translation approach.
Amirbagheri, K, Merigó, JM & Yang, JB 2020, 'A bibliometric analysis of leading countries in supply chain management research', Advances in Intelligent Systems and Computing, pp. 182-192.
View/Download from: Publisher's site
View description>>
© 2020, Springer Nature Switzerland AG. Supply chain management as a newly comer discipline has attracted many attentions of the scholars to do an investigation based on its prominent level of importance for the economy and its influence on the management of the organizations. So, the key point is to understand the trends among the countries throughout the time to have a powerful insight about this issue. To this end, this work does a comprehensive analysis from 1990 to 2017. The purpose of this study is to analyze the leading countries and understand thoroughly their trends during the time. The work has dedicated to three sections. In the first one the countries have studied globally to give a comprehensive overview to academics. Next, the performance of the countries is studied in three periods to understand better the changes of each during the time. Finally, some individual journals and groups of journals are also investigated. The results show that the USA is the leader of the countries while China has experienced an enormous growth and it is predictable that with this trend can reach to the top of the list.
Amiri, M, Tofigh, F, Shariati, N, Lipman, J & Abolhasan, M 2020, 'Ultra Wideband Dual Polarization Metamaterial Absorber for 5G frequency spectrum', 14th European Conference on Antennas and Propagation, EuCAP 2020.
View/Download from: Publisher's site
View description>>
© 2020 EurAAP. Implementing 5G technology contributes to improve communication quality and facilitate several interesting applications in daily life such as Internet of things. Despite outstanding features of 5G, the amount of ambient electromagnetic waves will be increased significantly in the environment, which may be undesired. Ultra-wideband metamaterial perfect absorber is a promising solution to collect these undesired signals. Using lumped elements in absorber structure to increase the absorption bandwidth leads to design and fabrication process complexity. In this paper, a low profile polarization angle selective metamaterial absorber has been designed to absorb signals in the frequency range of 21.79 GHz to 53.23 GHz with more than 90% efficiency. The relative absorption bandwidth of the final structure is 83.81%. Moreover, the final structure is reasonably insensitive facing different incident angle up to 40 degree.
Biddle, R, Joshi, A, Liu, S, Paris, C & Xu, G 2020, 'Leveraging Sentiment Distributions to Distinguish Figurative from Literal Health Reports on Twitter', The Web Conference 2020 - Proceedings of the World Wide Web Conference, WWW 2020, pp. 1217-1227.
View/Download from: Publisher's site
View description>>
© 2020 ACM. Harnessing data from social media to monitor health events is a promising avenue for public health surveillance. A key step is the detection of reports of a disease (referred to as ĝ€?health mention classification') amongst tweets that mention disease words. Prior work shows that figurative usage of disease words may prove to be challenging for health mention classification. Since the experience of a disease is associated with a negative sentiment, we present a method that utilises sentiment information to improve health mention classification. Specifically, our classifier for health mention classification combines pre-trained contextual word representations with sentiment distributions of words in the tweet. For our experiments, we extend a benchmark dataset of tweets for health mention classification, adding over 14k manually annotated tweets across diseases. We also additionally annotate each tweet with a label that indicates if the disease words are used in a figurative sense. Our classifier outperforms current SOTA approaches in detecting both health-related and figurative tweets that mention disease words. We also show that tweets containing disease words are mentioned figuratively more often than in a health-related context, proving to be challenging for classifiers targeting health-related tweets.
Chen, Y, An, P, Huang, X, Meng, C & Wu, Q 2019, 'Modified baseline for light field stitching', 2019 IEEE International Conference on Visual Communications and Image Processing, VCIP 2019, Australia.
View/Download from: Publisher's site
View description>>
© 2019 IEEE. In traditional 2D image stitching, the baseline method usually means global homography via Direct Linear Transformation (DLT) on inliers. In this paper, a modified baseline method for light field (LF) stitching is proposed to stitch two LFs. The depth map and the center sub-Aperture image (SAI) are used to filter the feature points of the entire LF. The global 4D homography is then calculated by DLT to align all SAIs corresponding to the same angular domain coordinates of two LFs. Finally, the improved Markov Random Field (MRF) energy considering the global LF is used to find the seam of 2D SAIs instead of computational 4D graph cut. Experimental results show that the proposed method can effectively stitch the 4D LFs, and preserve the consistency of the angular and spatial domains of the stitched LF compared with implementing 2D image stitching to the corresponding SAIs. Moreover, the method proposed in this paper can easily extend all advanced 2D image stitching methods to 4D LF, so that the acquired LF can have larger field of view and wider applications.
Chen, Y, Gao, C, Su, Z, He, X & Liu, N 2020, 'Scale-Aware Rolling Fusion Network for Crowd Counting', Proceedings - IEEE International Conference on Multimedia and Expo, London.
View/Download from: Publisher's site
View description>>
© 2020 IEEE. Due to wide application prospects and various challenges such as large scale variation, inter-occlusion between crowd people and background noise, crowd counting is receiving increasing attention. In this paper, we propose a scale-aware rolling fusion network (SRF-Net) for crowd counting, which focuses on dealing with scale variation in highly congested noisy scenes. SRF-Net is a two-stage architecture that consists of a band-pass stage and a rolling guidance stage. Compared with the existing methods, SRF-Net achieves better results in retaining appropriate multi-level features and capturing multi-scale features, thus improving the quality of density estimation maps in crowded scenarios with large scale variation. We evaluate our method on three popular crowd counting datasets (ShanghaiTech, UCF-CC-50 and UCF-QNRF), and extensive experiments show its outperformance over the state-of-the-art approaches.
Dasgupta, A, Gill, A & Hussain, F 2019, 'A Review of General Data Protection Regulation for Supply Chain Ecosystem', https://link.springer.com/chapter/10.1007/978-3-030-22263-5_44, International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, Springer, Sydney, Australia.
View/Download from: Publisher's site
View description>>
The data-intensive digital supply chain management (SCM) ecosystems seem to be impacted by the recent changes in the regulations and advancement in technologies such as Artificial Intelligence, Big Data, Analytics, Networking, IoT including proliferation of less expensive hardware devices. There is limited guidance available on how to govern the logistics sector, particularly from a regulatory compliance perspective. Through this paper, we investigate the impact of General Data Protection Regulation (GDPR) on digitized SCM. The key questions are: What are the GPDR specific legal obligations? What is the best approach to manage data access, quality, privacy, security and ownership effectively in SCM? This research paper aims to assist researchers and practitioners to understand the impact of GDPR on SCM, provide the 4I (Identify, Insulate, Inspect, Improve) Framework and its applicability to streamline the GDPR compliance activities.
Dawson, NJ, Rizoiu, M-A, Johnston, B & Williams, M-A 1970, 'Adaptively selecting occupations to detect skill shortages from online job ads', IEEE International Conference on Big Data (IEEE Big Data 2019), IEEE International Conference on Big Data, Los Angeles, CA, USA, pp. 1-7.
View description>>
Labour demand and skill shortages have historically been difficult to assess given the high costs of conducting representative surveys and the inherent delays of these indicators. This is particularly consequential for fast developing skills and occupations, such as those relating to Data Science and Analytics (DSA). This paper develops a data-driven solution to detecting skill shortages from online job advertisements (ads) data. We first propose a method to generate sets of highly similar skills based on a set of seed skills from job ads. This provides researchers with a novel method to adaptively select occupations based on granular skills data. Next, we apply this adaptive skills similarity technique to a dataset of over 6.7 million Australian job ads in order to identify occupations with the highest proportions of DSA skills. This uncovers 306,577 DSA job ads across 23 occupational classes from 2012-2019. Finally, we propose five variables for detecting skill shortages from online job ads: (1) posting frequency; (2) salary levels; (3) education requirements; (4) experience demands; and (5) job ad posting predictability. This contributes further evidence to the goal of detecting skills shortages in real-time. In conducting this analysis, we also find strong evidence of skills shortages in Australia for highly technical DSA skills and occupations. These results provide insights to Data Science researchers, educators, and policy-makers from other advanced economies about the types of skills that should be cultivated to meet growing DSA labour demands in the future.
Gil-Doménech, D, Berbegal-Mirabent, J & Merigó, JM 2020, 'STEM education: A bibliometric overview', Advances in Intelligent Systems and Computing, pp. 193-205.
View/Download from: Publisher's site
View description>>
© 2020, Springer Nature Switzerland AG. In the recent years, STEM (science, technology, engineering and mathematics) education has received increasing attention, and many calls for a fundamental change in this field have emerged. In this context, the analysis of the evolution and development of this scientific domain results crucial. In order to do so, the present study presents a bibliometric overview of the academic research developed in STEM education over the last years. The work uses the Web of Science database and a wide range of bibliometric indicators including the number of publications and citations, the h-index, and citation thresholds. The article also develops a graphical visualisation of the bibliographic data using the visualisation of similarities (VOS) viewer software. Results indicate that the amount of works addressing this topic has substantially increased in the recent years, although the number of citations has not experienced a similar growth rate. Also, when analysing journals and research areas, it can be deduced that the research on STEM education is diverse. The bibliometric analysis performed provides a rigorous and comprehensive view of research on STEM education that might be useful for those researchers interested in advancing future knowledge in this area.
Huang, Y, Wu, Q, Xu, J & Zhong, Y 2019, 'SBSGAN: Suppression of Inter-Domain Background Shift for Person Re-Identification', 2019 IEEE/CVF International Conference on Computer Vision (ICCV), IEEE International Conference on Computer Vision, IEEE, Seoul, South Korea.
View/Download from: Publisher's site
View description>>
Cross-domain person re-identification (re-ID) is challenging due to the bias between training and testing domains. We observe that if backgrounds in the training and testing datasets are very different, it dramatically introduces difficulties to extract robust pedestrian features, and thus compromises the cross-domain person re-ID performance. In this paper, we formulate such problems as a background shift problem. A Suppression of Background Shift Generative Adversarial Network (SBSGAN) is proposed to generate images with suppressed backgrounds. Unlike simply removing backgrounds using binary masks, SBSGAN allows the generator to decide whether pixels should be preserved or suppressed to reduce segmentation errors caused by noisy foreground masks. Additionally, we take ID-related cues, such as vehicles and companions into consideration. With high-quality generated images, a Densely Associated 2-Stream (DA-2S) network is introduced with Inter Stream Densely Connection (ISDC) modules to strengthen the complementarity of the generated data and ID-related cues. The experiments show that the proposed method achieves competitive performance on three re-ID datasets, i.e., Market-1501, DukeMTMC-reID, and CUHK03, under the cross-domain person re-ID scenario.
Ian Zhou, Negin.Shariati 2020, 'A Blockchain-based File-sharing System for Academic Paper Review', IEEE International Conference on Signal Processing and Communication Systems, ICSPCS, IEEE, Australia.
View/Download from: Publisher's site
Ikram, MA, Sharma, N, Raza, M & Hussain, FK 2020, 'Dynamic Ranking System of Cloud SaaS Based on Consumer Preferences - Find SaaS M2NFCP', Advances in Intelligent Systems and Computing, pp. 1000-1010.
View/Download from: Publisher's site
View description>>
© 2020, Springer Nature Switzerland AG. Software as a Service (SaaS) is a type of software application that runs and operates over a cloud computing infrastructure. SaaS has grown more dramatically compared to other cloud services delivery models (i.e. PaaS and IaaS) in terms of the number of available services. This rapid growth in SaaS brings a lot of challenges for consumers in selecting the optimum services. The aim of this article is to propose a ranking system for SaaS based on consumer’s preferences called Find SaaS M2NFCP. The proposed ranking system is based on measuring the shortest distance to the minimum and maximum of the selected consumer’s non-functional preferences. In addition, linguistic terms are taken into account to weight the most important non-functional preferences. The proposed system is evaluated against traditional SaaS ranking systems using data collected from online CRM SaaS and achieved improved results.
Khan, S & Hussain, FK 2020, 'A soa based sla negotiation and formulation architecture for personalized service delivery in sdn', Advances in Intelligent Systems and Computing, pp. 108-119.
View/Download from: Publisher's site
View description>>
© Springer Nature Switzerland AG 2020. Supporting end-to-end personalized Quality of Services (QoS) delivery in existing network architecture is an ongoing issue. Software Defined Networking (SDN) model has emerged in response to the limitations of traditional network. Integrating Software Defined Network (SDN) architecture with Service Oriented Architecture (SOA) brings new concept for future service oriented delivery in SDN services. Researchers from both academic and industry are working to resolve the QoS limitations of service delivery, however; most of the proposed solutions are application oriented and unable to provide a reliable personalized QoS delivery in future service oriented SDN. This research propose a reliable Service Level Agreement (SLA) oriented Service Negotiation framework that would be able to provide reputation based personalized service delivery and assist in QoS management in SDN for informed decision making. Moreover, potential benefits of the proposed framework are also discussed in this paper in social, scientific and business aspects.
Khan, S & Hussain, FK 2020, 'Evaluation of SLA Negotiation for Personalized SDN Service Delivery', Advances in Intelligent Systems and Computing, pp. 579-590.
View/Download from: Publisher's site
View description>>
© 2020, Springer Nature Switzerland AG. Ensuring the quality of services (QoS) is crucial in a service-oriented business model. A service level agreement (SLA) is an important agreement between a consumer and a provider and is a key element in ensuring QoS. Service negotiation occurs in an initial stage of the SLA where service requirements are agreed upon to avoid conflict situations. Guaranteeing QoS is one of the key challenges in software defined networking (SDN). Several intelligent solutions have been proposed, however most of them are application focused and are unable to provide personalized and reliable QoS delivery in SDN. This paper presents a reputation data-driven SLA negotiation framework that provides personalized and reliable service delivery in SDN and assists in QoS management for informed decision making. In addition, a fuzzy inference system (FIS) is used to implement the framework and the results are discussed in this paper.
Kieu, TB, Pham, SB, Phan, XH & Piccardi, M 2020, 'A Submodular Approach for Reference Recommendation', Communications in Computer and Information Science, pp. 3-14.
View/Download from: Publisher's site
View description>>
© 2020, Springer Nature Singapore Pte Ltd. Choosing appropriate references for a given topic is an important, yet challenging task. The pool of potential candidates is typically very large, in the order of tens of thousands, and growing by the day. For this reason, this paper proposes an approach for automatically providing a reference list for a given manuscript. The approach is based on an original submodular inference function which balances relevance, coverage and diversity in the reference list. Experiments are carried out using an ACL corpus as a source for the references and evaluated by MAP, MRR and precision-recall. The results show the remarkable comparative performance of the proposed approach.
Kitto, K, Sarathy, N, Gromov, A, Liu, M, Musial, K & Shum, SB 2020, 'Towards Skills-based Curriculum Analytics: Can we automate the recognition of prior learning?', LAK20: THE TENTH INTERNATIONAL CONFERENCE ON LEARNING ANALYTICS & KNOWLEDGE, 10th International Conference on Learning Analytics and Knowledge (LAK), ASSOC COMPUTING MACHINERY, ELECTR NETWORK, pp. 171-180.
View/Download from: Publisher's site
Kocbek, S & Gabrys, B 2019, 'Automated machine learning techniques in prognostics of railway track defects', IEEE International Conference on Data Mining Workshops, ICDMW, China, pp. 777-784.
View/Download from: Publisher's site
View description>>
© 2019 IEEE. The readiness and usefulness of Automated Machine Learning (AutoML) methods in classification of railway track defects is explored. Safety of railway networks is the top priority in the railroad industry, and track defects are a common cause of train accidents and service disruptions around the world. Effective classification and prediction of these defects based on historical inspection data can help in planning maintenance activities before critical defects occur. This increases safety of the network and lowers costs of the maintenance. The experimental analysis carried out on data from an international predictive modelling competition has shown that the proposed AutoML approaches resulted in an improved performance in comparison to the competition winning solutions and have an excellent potential for building robust predictive models in railway industry.
Li, L, Liu, Z, Zhang, J & Zhou, X 2019, 'Learn Image Object Co-segmentation with Multi-scale Feature Fusion', 2019 IEEE International Conference on Visual Communications and Image Processing, VCIP 2019, IEEE Visual Communications and Image Processing, IEEE, Sydney, Australia.
View/Download from: Publisher's site
View description>>
© 2019 IEEE. Image object co-segmentation aims to segment common objects in a group of images. This paper proposes a novel neural network, which extracts multi-scale convolutional features at multiple layers via a modified VGG network and fuses them both within and across images as the intra-image and the inter-image features. Then these two kinds of features are further fused at each scale as the multi-scale co-features of common objects, and finally the multi-scale co-features are summed up and upsampled to obtain the co-segmentation results. To simplify the network and reduce the rapidly rising resource cost along with the inputs, the reduced input size, less downsampling and dilation convolution are adopted in the proposed model. Experimental results on the public dataset demonstrate that the proposed model achieves a comparable performance to the state-of-The-Art co-segmentation methods while the computation cost has been effectively reduced.
Li, Z, Zou, Y, Wang, G & Zhang, J 2019, 'Scale-Informed Density Estimation for Dense Crowd Counting', 2019 IEEE International Conference on Visual Communications and Image Processing, VCIP 2019, IEEE Visual Communications and Image Processing, IEEE, Sydney, Australia.
View/Download from: Publisher's site
View description>>
© 2019 IEEE. Dense crowd counting (DCC) remains challenging due to the scale variation and occlusion. Several deep learning based DCC methods have achieved the state-of-Arts on public datasets. However, experimental results show that the scale variation is still the main factor to hinder the DCC performance. In this work, we propose a scale-informed dense crowd counting method focusing on handling the negative effect caused by scale variation. More specifically, we propose a method to obtain the scale information of the patch from its GT density maps via estimating the mean value of the Gaussian kernel width and then a scale-classifier is deigned and trained accordingly. Moreover, with the estimated scale information, two sub-nets are dedicatedly deigned to learn the density maps for large-scale head patch and small-scale patch separately. Experimental results validate the performance of our proposed method which achieves the best performance on three dense crowd datasets.
Liu, L, Zhou, T, Long, G, Jiang, J & Zhang, C 2019, 'Attribute Propagation Network for Graph Zero-shot Learning', Association for the Advancement of Artificial Intelligence, New York, pp. 1-8.
Mulet-Forteza, C, Mauleón-Méndez, E, Merigó, JM & Genovart-Balaguer, J 2020, 'Leading universities in tourism and hospitality research: A bibliometric overview', Advances in Intelligent Systems and Computing, pp. 142-152.
View/Download from: Publisher's site
View description>>
© 2020, Springer Nature Switzerland AG. This study presents an overview of the most influential and productive institutions around the world in the tourism, leisure and hospitality field. The research uses a bibliometric approach to examine all the journals indexed in the Web of Science database in these fields. Results show a strong influence of the USA institutions, although institutions from other countries also achieve an important and significant position in these fields. Results also consider the temporal evolution of the leading universities and the most productive institutions in the tourism, leisure and hospitality field.
Naji, M, Braytee, A, Al-Ani, A, Anaissi, A, Goyal, M & Kennedy, PJ 2020, 'Design of airport security screening using queueing theory augmented with particle swarm optimisation', Service Oriented Computing and Applications, pp. 119-133.
View/Download from: Publisher's site
View description>>
© 2020, Springer-Verlag London Ltd., part of Springer Nature. Designing an efficient and reliable airport security screening system is a critical and challenging task. It is an essential element of airline and passenger safety which aims to provide the expected level of confidence and to ensure the safety of passengers and the aviation industry. In recent years, security at airports has gone through noticeable improvements with the utilisation of advanced technology and highly trained security officers. However, for many airports, it is important to find the best compromise between the capacity of the security area, the number of passengers and the number of screening machines and officers to maintain a high level of security and to ensure that the cost and waiting times for passengers and airlines are at acceptable levels. This paper proposes a novel method based on queueing theory augmented with particle swarm optimisation (QT-PSO) to predict passenger waiting times in a security screening context. This model consists of multiple servers operating in parallel and takes into consideration the complete scenario such as normal, slow and express lanes. Such an approach has the potential to be a reliable model that is able to assimilate variations in the number of passengers, security officers and security machines on the service time. To evaluate our proposed method, we collected real-world security screening data from an Australian airport from December to March for the two consecutive years of 2016 and 2017. The results show that our proposed QT-PSO method is superior to predict the average waiting time of passengers compared to the state of the art.
Naji, M, Braytee, A, Anaissi, A, Sianaki, OA & Al-Ani, A 2020, 'Optimizing the Waiting Time for Airport Security Screening Using Multiple Queues and Servers', Advances in Intelligent Systems and Computing, pp. 496-507.
View/Download from: Publisher's site
View description>>
© 2020, Springer Nature Switzerland AG. Airport security screening processes are essential to ensure the safety of passengers and the aviation industry. Security at airports has improved noticeably in recent years through the utilisation of state-of-the-art technologies and highly trained security officers. However, maintaining a high level of security can be costly to operate and implement and can cause delays for passengers and airlines. In optimising a security process it is essential to strike a balance between time delays, security and reduced operation cost. This paper uses queueing theory as a method to study the impact of queue formation and the size of the security area on the average waiting time for the case of multi-lane parallel servers. An experiment is conducted to validate the proposed approach.
Nanda, A, Nanda, P, Obaidat, M, He, X & Puthal, D 2019, 'A Novel Multi-Path Anonymous Randomized Key Distribution Scheme for Geo Distributed Networks', IEEE eXpress Conference Publishing, IEEE ComSoc, IEEE GLOBECOM, IEEE, Hilton Waikoloa Village, Hawaii, USA.
View/Download from: Publisher's site
View description>>
A major concern in distributed networks is the ability to provide acceptable levels of security. This is achieved by using encryption and authentication mechanisms that depend on encryption keys. However, given the ever-expanding nature of the network, it is difficult to keep setting up authorities that can aid the key-exchange process. This paper presents a novel
solution to the challenge of exchanging keys of a large, distributed network without the need to set up additional authorities. The key-exchange scheme presented takes advantage of features such as packet anonymity, random selection and a multi-path approach for the exchange process. The paper also discusses the effectiveness of the proposed scheme against various
threat scenarios.
Naseem, U & Musial, K 2019, 'DICE: Deep intelligent contextual embedding for twitter sentiment analysis', Proceedings of the International Conference on Document Analysis and Recognition, ICDAR, International Conference on Document Analysis and Recognition, IEEE, Sydney, Australia, pp. 953-958.
View/Download from: Publisher's site
View description>>
© 2019 IEEE. The sentiment analysis of the social media-based short text (e.g., Twitter messages) is very valuable for many good reasons, explored increasingly in different communities such as text analysis, social media analysis, and recommendation. However, it is challenging as tweet-like social media text is often short, informal and noisy, and involves language ambiguity such as polysemy. The existing sentiment analysis approaches are mainly for document and clean textual data. Accordingly, we propose a Deep Intelligent Contextual Embedding (DICE), which enhances the tweet quality by handling noises within contexts, and then integrates four embeddings to involve polysemy in context, semantics, syntax, and sentiment knowledge of words in a tweet. DICE is then fed to a Bi-directional Long Short Term Memory (BiLSTM) network with attention to determine the sentiment of a tweet. The experimental results show that our model outperforms several baselines of both classic classifiers and combinations of various word embedding models in the sentiment analysis of airline-related tweets.
Naseem, U & Musial-Gabrys, K 2019, 'Deep Intelligent Contextual Embedding for Twitter Sentiment Analysis', International Conference on Document Analysis and Recognition, IEEE, Sydney, Australia.
View/Download from: Publisher's site
View description>>
The sentiment analysis of the social media-based short text (e.g., Twitter messages) is very valuable for many good reasons, explored increasingly in different communities such as text analysis, social media analysis, and recommendation. However, it is challenging as tweet-like social media text is often short, informal and noisy, and involves language ambiguity such as polysemy. The existing sentiment analysis approaches are mainly for document and clean textual data. Accordingly, we propose a Deep Intelligent Contextual Embedding (DICE), which enhances the tweet quality by handling noises within contexts, and then integrates four embeddings to involve polysemy in context, semantics, syntax, and sentiment knowledge of words in a tweet. DICE is then fed to a Bi-directional Long Short Term Memory (BiLSTM) network with attention to determine the sentiment of a tweet. The experimental results show that our model outperforms several baselines of both classic classifiers and combinations of various word embedding models in the sentiment analysis of airline-related tweets.
Nguyen, TD, Maszczyk, T, Musial, K, Zöller, MA & Gabrys, B 2020, 'AVATAR - Machine Learning Pipeline Evaluation Using Surrogate Model', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 352-365.
View/Download from: Publisher's site
View description>>
© 2020, The Author(s). The evaluation of machine learning (ML) pipelines is essential during automatic ML pipeline composition and optimisation. The previous methods such as Bayesian-based and genetic-based optimisation, which are implemented in Auto-Weka, Auto-sklearn and TPOT, evaluate pipelines by executing them. Therefore, the pipeline composition and optimisation of these methods requires a tremendous amount of time that prevents them from exploring complex pipelines to find better predictive models. To further explore this research challenge, we have conducted experiments showing that many of the generated pipelines are invalid, and it is unnecessary to execute them to find out whether they are good pipelines. To address this issue, we propose a novel method to evaluate the validity of ML pipelines using a surrogate model (AVATAR). The AVATAR enables to accelerate automatic ML pipeline composition and optimisation by quickly ignoring invalid pipelines. Our experiments show that the AVATAR is more efficient in evaluating complex pipelines in comparison with the traditional evaluation approaches requiring their execution.
Peng, X, Long, G, Shen, T, Wang, S, Jiang, J & Zhang, C 2020, 'BiteNet: Bidirectional Temporal Encoder Network to Predict Medical Outcomes', 20th IEEE International Conference on Data Mining (ICDM), IEEE International Conference on Data Mining, Sorrento, Italy.
View description>>
Electronic health records (EHRs) are longitudinal records of a patient's interactions with healthcare systems. A patient's EHR data is organized as a three-level hierarchy from top to bottom: patient journey - all the experiences of diagnoses and treatments over a period of time; individual visit - a set of medical codes in a particular visit; and medical code - a specific record in the form of medical codes. As EHRs begin to amass in millions, the potential benefits, which these data might hold for medical research and medical outcome prediction, are staggering - including, for example, predicting future admissions to hospitals, diagnosing illnesses or determining the efficacy of medical treatments. Each of these analytics tasks requires a domain knowledge extraction method to transform the hierarchical patient journey into a vector representation for further prediction procedure. The representations should embed a sequence of visits and a set of medical codes with a specific timestamp, which are crucial to any downstream prediction tasks. Hence, expressively powerful representations are appealing to boost learning performance. To this end, we propose a novel self-attention mechanism that captures the contextual dependency and temporal relationships within a patient's healthcare journey. An end-to-end bidirectional temporal encoder network (BiteNet) then learns representations of the patient's journeys, based solely on the proposed attention mechanism. We have evaluated the effectiveness of our methods on two supervised prediction and two unsupervised clustering tasks with a real-world EHR dataset. The empirical results demonstrate the proposed BiteNet model produces higher-quality representations than state-of-the-art baseline methods.
Tao, Q, Luo, X, Wang, H & Xu, R 2019, 'Enhancing relation extraction using syntactic indicators and sentential contexts', Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI, USA, pp. 1574-1580.
View/Download from: Publisher's site
View description>>
© 2019 IEEE. State-of-the-art methods for relation extraction consider the sentential context by modeling the entire sentence. However, syntactic indicators, certain phrases or words like prepositions that are more informative than other words and may be beneficial for identifying semantic relations. Other approaches using fixed text triggers capture such information but ignore the lexical diversity. To leverage both syntactic indicators and sentential contexts, we propose an indicator-aware approach for relation extraction. Firstly, we extract syntactic indicators under the guidance of syntactic knowledge. Then we construct a neural network to incorporate both syntactic indicators and the entire sentences into better relation representations. By this way, the proposed model alleviates the impact of noisy information from entire sentences and breaks the limit of text triggers. Experiments on the SemEval-2010 Task 8 benchmark dataset show that our model significantly outperforms the state-of-the-art methods.
Tonkin, M, Vitale, J, Herse, S, Raza, SA, Madhisetty, S, Kang, L, Vu, TD, Johnston, B & Williams, MA 2019, 'Privacy First: Designing Responsible and Inclusive Social Robot Applications for in the Wild Studies', 2019 28th IEEE International Conference on Robot and Human Interactive Communication (RO-MAN), IEEE International Conference on Robot and Human Interactive Communication, IEEE, New Delhi, India.
View/Download from: Publisher's site
View description>>
Deploying social robots applications in public spaces for conducting in the wild studies is a significant challenge but critical to the advancement of social robotics. Real world environments are complex, dynamic, and uncertain. Human-Robot interactions can be unstructured and unanticipated. In addition, when the robot is intended to be a shared public resource, management issues such as user access and user privacy arise, leading to design choices that can impact on users' trust and the adoption of the designed system. In this paper we propose a user registration and login system for a social robot and report on people's preferences when registering their personal details with the robot to access services. This study is the first iteration of a larger body of work investigating potential use cases for the Pepper social robot at a government managed centre for startups and innovation. We prototyped and deployed a system for user registration with the robot, which gives users control over registering and accessing services with either face recognition technology or a QR code. The QR code played a critical role in increasing the number of users adopting the technology. We discuss the need to develop social robot applications that responsibly adhere to privacy principles, are inclusive, and cater for a broad spectrum of people.
Torres-Martínez, A, Gil-Lafuente, AM & Merigó, JM 2020, 'The OWA operator with boxplot method in time series', Advances in Intelligent Systems and Computing, pp. 13-21.
View/Download from: Publisher's site
View description>>
© 2020, Springer Nature Switzerland AG. This paper presents an aggregation model for time series with the OWA operator, using as arguments representative values calculated from the quantiles of a data set and particularly with the values of the boxplot graph. The application of the OWA operator in this model allows forecasting time series including the optimistic or pessimistic attitude of the analysts, through the weighting vector. To illustrate the boxplot-OWA operator model, results are presented with data from the IBEX 35 for different periods of time in 2017.
Ubaid, A, Dong, F & Hussain, FK 2020, 'Framework for Feature Selection in Health Assessment Systems', Advances in Intelligent Systems and Computing, pp. 313-324.
View/Download from: Publisher's site
View description>>
© 2020, Springer Nature Switzerland AG. Anomaly detection in health assessment systems has gained much attention in the recent past. Various feature selection techniques have been proposed for successful anomaly detection. However, these methods do not cater for the need to select features in health assessment systems. Most of the present techniques are data dependent and do not offer an option for incorporating domain information. This paper proposes a novel domain knowledge-driven feature selection framework named domain-driven selective wrapping (DSW) that can help in the selection of a correlated feature subset. The proposed framework uses an expert’s domain knowledge for the selection of subsets. The framework uses a custom-designed logic-driven anomaly detection block (LDAB) as a wrapper. The experiment results show that the proposed framework is able to select feature subsets more efficiently than traditional sequential selection methods and is very successful in detecting anomalies.
Ubaid, A, Hussain, FK & Charles, J 2020, 'Machine Learning-Based Regression Models for Price Prediction in the Australian Container Shipping Industry: Case Study of Asia-Oceania Trade Lane', Advances in Intelligent Systems and Computing, pp. 52-59.
View/Download from: Publisher's site
View description>>
© 2020, Springer Nature Switzerland AG. The objective of this paper is to train a data-driven price prediction model for container pricing based on demand and supply for the Australian container shipping industry. The sourcing of demand, supply and pricing data has been done from Australian ports, Sea-Intelligence maritime analysis and the Shanghai Freight Index (SCFI) respectively. Data-driven prediction have been realized by applying three different regression models that include support vector regression (SVR), random forest regression (RFR) and gradient booster regression (GBR) over the gathered datasets after initial feature engineering. A comparison of research outcomes shows that GBR outperforms all the other models by offering a test accuracy of 84%.
Vicedo, P, Gil, H, Oltra-Badenes, R & Merigó, JM 2020, 'Critical success factors on ERP implementations: A bibliometric analysis', Advances in Intelligent Systems and Computing, pp. 169-181.
View/Download from: Publisher's site
View description>>
© 2020, Springer Nature Switzerland AG. This work presents a bibliometric analysis of the influential authors, institutions, papers and countries on the field of Enterprise Resource Planning implementations and their Critical Success Factors based on the Web of Science database with 301 articles belonging to 86 Universities and Institutions from 48 different countries. The research has been conducted from 1999 to end of 2017.
Wan, Y, Shu, J, Sui, Y, Xu, G, Zhao, Z, Wu, J & Yu, P 2019, 'Multi-modal attention network learning for semantic source code retrieval', Proceedings - 2019 34th IEEE/ACM International Conference on Automated Software Engineering, ASE 2019, IEEE/ACM International Conference on Automated Software Engineering, IEEE, San Diego, CA, USA, pp. 13-25.
View/Download from: Publisher's site
View description>>
© 2019 IEEE. Code retrieval techniques and tools have been playing a key role in facilitating software developers to retrieve existing code fragments from available open-source repositories given a user query (e.g., a short natural language text describing the functionality for retrieving a particular code snippet). Despite the existing efforts in improving the effectiveness of code retrieval, there are still two main issues hindering them from being used to accurately retrieve satisfiable code fragments from large-scale repositories when answering complicated queries. First, the existing approaches only consider shallow features of source code such as method names and code tokens, but ignoring structured features such as abstract syntax trees (ASTs) and control-flow graphs (CFGs) of source code, which contains rich and well-defined semantics of source code. Second, although the deep learning-based approach performs well on the representation of source code, it lacks the explainability, making it hard to interpret the retrieval results and almost impossible to understand which features of source code contribute more to the final results. To tackle the two aforementioned issues, this paper proposes MMAN, a novel Multi-Modal Attention Network for semantic source code retrieval. A comprehensive multi-modal representation is developed for representing unstructured and structured features of source code, with one LSTM for the sequential tokens of code, a Tree-LSTM for the AST of code and a GGNN (Gated Graph Neural Network) for the CFG of code. Furthermore, a multi-modal attention fusion layer is applied to assign weights to different parts of each modality of source code and then integrate them into a single hybrid representation. Comprehensive experiments and analysis on a large-scale real-world dataset show that our proposed model can accurately retrieve code snippets and outperforms the state-of-the-art methods.
Wang, Q, Jia, W, He, X, Lu, Y, Blumenstein, M, Huang, Y & Lyu, S 2019, 'DeepText: Detecting text from the wild with multi-ASPP-assembled deeplab', Proceedings of the International Conference on Document Analysis and Recognition, ICDAR, International Conference on Document Analysis and Recognition, IEEE, Sydney, Australia, pp. 208-213.
View/Download from: Publisher's site
View description>>
© 2019 IEEE. In this paper, we address the issue of scene text detection in the way of direct regression and successfully adapt an effective semantic segmentation model, DeepLab v3+ [1], for this application. In order to handle texts with arbitrary orientations and sizes and improve the recall of small texts, we propose to extract features of multiple scales by inserting multiple Atrous Spatial Pyramid Pooling (ASPP) layers to the DeepLab after the feature maps with different resolutions. Then, we set multiple auxiliary IoU losses at the decoding stage and make auxiliary connections from the intermediate encoding layers to the decoder to assist network training and enhance the discrimination ability of lower encoding layers. Experiments conducted on the benchmark scene text dataset ICDAR2015 demonstrate the superior performance of our proposed network, named as DeepText, over the state-of-the-art approaches.
Wang, X, Li, Q, Zhang, W, Xu, G, Liu, S & Zhu, W 2020, 'Joint Relational Dependency Learning for Sequential Recommendation', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 168-180.
View/Download from: Publisher's site
View description>>
© Springer Nature Switzerland AG 2020. Sequential recommendation leverages the temporal information of users’ transactions as transition dependencies for better inferring user preference, which has become increasingly popular in academic research and practical applications. Short-term transition dependencies contain the information of partial item orders, while long-term transition dependencies infer long-range user preference, the two dependencies are mutually restrictive and complementary. Although some work investigates unifying both long-term and short-term dependencies for better performance, they still neglect the fact that short-term interactions are multi-folds, which are either individual-level interactions or union-level interactions. Existing sequential recommendations mainly focus on user’s individual (i.e., individual-level) interactions but ignore the important collective influence at union-level. Since union-level interactions can reflect that human decisions are made based on multiple items he/she has already interacted, ignoring such interactions can result in the disability of capturing the collective influence between items. To alleviate this issue, we proposed a Joint Relational Dependency learning (JRD-L) for sequential recommendation that exploits both long-term and short-term preferences at individual-level and union-level. Specifically, JRD-L combines long-term user preferences with short-term interests by measuring short-term pair relations at individual-level and union-level. Moreover, JRD-L can alleviate the sparsity problem of union-level interactions by adding more descriptive details to each item, which is carried by individual-level relations. Extensive numerical experiments demonstrate JRD-L outperforms state-of-the-art baselines for the sequential recommendation.
Wang, Z, Li, Q, Li, G & Xu, G 2019, 'Polynomial representation for persistence diagram', Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, Long Beach, CA, USA, pp. 6116-6125.
View/Download from: Publisher's site
View description>>
© 2019 IEEE. Persistence diagram (PD) has been considered as a compact descriptor for topological data analysis (TDA). Unfortunately, PD cannot be directly used in machine learning methods since it is a multiset of points. Recent efforts have been devoted to transforming PDs into vectors to accommodate machine learning methods. However, they share one common shortcoming: the mapping of PDs to a feature representation depends on a pre-defined polynomial. To address this limitation, this paper proposes an algebraic representation for PDs, i.e., polynomial representation. In this work, we discover a set of general polynomials that vanish on vectorized PDs and extract the task-adapted feature representation from these polynomials. We also prove two attractive properties of the proposed polynomial representation, i.e., stability and linear separability. Experiments also show that our method compares favorably with state-of-the-art TDA methods.
Wu, J, Yao, L, Huang, Y, Xu, J, Wu, Q & Huang, L 2019, 'Improving Person Re-Identification Performance Using Body Mask Via Cross-Learning Strategy', 2019 IEEE International Conference on Visual Communications and Image Processing, VCIP 2019, IEEE Visual Communications and Image Processing, IEEE, Sydney, Australia.
View/Download from: Publisher's site
View description>>
© 2019 IEEE. The task of person re-identification (re-id) is to find the same pedestrian across non-overlapping cameras. Normally, the performance of person re-id can be affected by background clutters. However, existing segmentation algorithms are hard to obtain perfect foreground person images. To effectively leverage the body (foreground) cue, and in the meantime pay attention to discriminative information in the background (e.g., companion or vehicle), we propose to use a cross-learning strategy to take both foreground and other discriminative information into account. In addition, since currently existing foreground segmentation result always involves noise, we use Label Smoothing Regularization (LSR) to strengthen the generalization capability during our learning process. In experiments, we pick up two state-of-The-Art person re-id methods to verify the effectiveness of our proposed cross-learning strategy. Our experiments are carried out on two publicly available person re-id datasets. Obvious performance improvements can be observed on both datasets.
Yin, J, Liu, S, Li, Q & Xu, G 2019, 'Prediction and Analysis of Rumour's Impact on Social Media', BESC 2019 - 6th International Conference on Behavioral, Economic and Socio-Cultural Computing, Proceedings, International Conference on Behavioral, Economic and Socio-Cultural Computing, IEEE, Beijing, China.
View/Download from: Publisher's site
View description>>
© 2019 IEEE. Rumour, as an important form of social communication, has been run through the whole evolutionary history of mankind. People maliciously disseminate rumours in order to increase awareness, slander others or cause panic, etc. To eliminate this issue, many researchers resort to detecting rumours on social media. However, rumour detection is not sufficient to eliminate the negative impact, which also requires official institutions to provide the refutations. In practice, the number of rumours on social media is too large, there is no need to refute some rumours with little or no concern. Therefore, we need to evaluate the impact of the rumours in advance. In this paper, we devise a rumour influence prediction model RISM (Rumour Impact on Social Media) based on a popular rumour intensity formula to predict the impact of a newborn rumour. Extensive numerical experiments are carried out on the real rumour data that are collected from Toutiao.com, which demonstrate the effectiveness of our proposed RISM model.
Zhao, M, Shu, Y, Liu, S & Xu, G 2019, 'Electricity Price Forecast using Meteorology data: A study in Australian Energy Market', BESC 2019 - 6th International Conference on Behavioral, Economic and Socio-Cultural Computing, Proceedings, International Conference on Behavioral, Economic and Socio-Cultural Computing, IEEE, Beijing, China.
View/Download from: Publisher's site
View description>>
© 2019 IEEE. Electricity price as a fundamental cost for each family which is an essential segment in the electricity market. The adjustment of electricity price can present the change in electricity supply and demand relationship. For the electricity supply companies, an appropriate defined electricity price can eventually determine the level of profit. On the other hand, an accurate prediction can help to seize opportunities in the electricity market. In this paper, we aim to predict the electricity price with more confident accuracy by leveraging data mining techniques. Our experiment on 12 months of electricity prices as well as climate data in the New South Wales has achieved a promising prediction result.
Zheng, C, Cai, Y, Xu, J, Leung, HF & Xu, G 2020, 'A boundary-aware neural model for nested named entity recognition', EMNLP-IJCNLP 2019 - 2019 Conference on Empirical Methods in Natural Language Processing and 9th International Joint Conference on Natural Language Processing, Proceedings of the Conference, pp. 357-366.
View description>>
© 2019 Association for Computational Linguistics In natural language processing, it is common that many entities contain other entities inside them. Most existing works on named entity recognition (NER) only deal with flat entities but ignore nested ones. We propose a boundary-aware neural model for nested NER which leverages entity boundaries to predict entity categorical labels. Our model can locate entities precisely by detecting boundaries using sequence labeling models. Based on the detected boundaries, our model utilizes the boundary-relevant regions to predict entity categorical labels, which can decrease computation cost and relieve error propagation problem in layered sequence labeling model. We introduce multitask learning to capture the dependencies of entity boundaries and their categorical labels, which helps to improve the performance of identifying entities. We conduct our experiments on nested NER datasets and the experimental results demonstrate that our model outperforms other state-of-the-art methods.
Zhong, Y, Huang, Y, Dutkiewicz, E, Wu, Q & Jiang, T 2020, 'Differential Evolution FPA-SVM for Target Classification in Foliage Environment Using Device-Free Sensing', Lecture Notes in Electrical Engineering, pp. 553-560.
View/Download from: Publisher's site
View description>>
© 2020, Springer Nature Singapore Pte Ltd. Target classification in foliage environment is a challenging task in realistic due to the high-clutter background and unsettled weather. To detect a particular target, e.g., human, under such an environment, is an indispensable technique with significant application value. Traditional method such as computer vision techniques is hardly leveraged since the working condition is limited. Therefore, in this paper, we attempt to tackle human detection by using the radio frequency (RF) signal with a device-free sensing. To this end, we propose a differential evolution flower pollination algorithm support vector machine (DEFPA-SVM) approach to detect human among other targets, e.g., iron cupboard and wooden board. This task can be formally described as a target classification problem. In our experiment, the proposed DEFPA-SVM can effectively attain the best performance compared to other classical multi-target classification models and achieve a faster convergent speed than the traditional FPA-SVM.
Zhou, K, Luo, X, Wang, H & Xu, R 2019, 'Multi-task learning for relation extraction', Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI, USA, pp. 1480-1487.
View/Download from: Publisher's site
View description>>
© 2019 IEEE. Distantly supervised relation extraction leverages knowledge bases to label training data automatically. However, distant supervision may introduce incorrect labels, which harm the performance. Many efforts have been devoted to tackling this problem, but most of them treat relation extraction as a simple classification task. As a result, they ignore useful information that comes from related tasks, i.e., dependency parsing and entity type classification. In this paper, we first propose a novel Multi-Task learning framework for Relation Extraction (MTRE). We employ dependency parsing and entity type classification as auxiliary tasks and relation extraction as the target task. We learn these tasks simultaneously from training instances to take advantage of inductive transfer between auxiliary tasks and the target task. Then we construct a hierarchical neural network, which incorporates dependency and entity representations from auxiliary tasks into a more robust relation representation against the noisy labels. The experimental results demonstrate that our model improves the predictive performance substantially over single-task learning baselines.