ORCID Profile
0000-0002-7873-1562
Current Organisation
Macquarie University
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
In Research Link Australia (RLA), "Research Topics" refer to ANZSRC FOR and SEO codes. These topics are either sourced from ANZSRC FOR and SEO codes listed in researchers' related grants or generated by a large language model (LLM) based on their publications.
Other Artificial Intelligence | Information Systems | Computation Theory and Mathematics | Logics And Meanings Of Programs | Data Security | Interorganisational Information Systems and Web Services | Computer Software Not Elsewhere Classified | Knowledge Representation And Machine Learning | Artificial Intelligence and Image Processing | Distributed Computing | Data models storage and indexing | Web Technologies (excl. Web Search) | Programming Languages | Mathematical Logic And Formal Languages | Analysis Of Algorithms And Complexity | Expert Systems | Information Systems Management | Cognitive Science | Recommender systems | Other Information, Computing And Communication Sciences | Decision Support And Group Support Systems | Business Information Management (incl. Records, Knowledge and Information Management, and Intelligence) | Data management and data science | Global Information Systems
Information processing services | Computer software and services not elsewhere classified | Application tools and system utilities | Mathematical sciences | Information Processing Services (incl. Data Entry and Capture) | Application Tools and System Utilities | Communication services not elsewhere classified |
Publisher: Springer International Publishing
Date: 2020
Publisher: Wiley
Date: 20-05-2015
DOI: 10.1002/CPE.3497
Publisher: Springer Science and Business Media LLC
Date: 30-11-2016
DOI: 10.1007/S10916-016-0658-3
Abstract: E-Healthcare is an emerging field that provides mobility to its users. The protected health information of the users are stored at a remote server (Telecare Medical Information System) and can be accessed by the users at anytime. Many authentication protocols have been proposed to ensure the secure authenticated access to the Telecare Medical Information System. These protocols are designed to provide certain properties such as: anonymity, untraceability, unlinkability, privacy, confidentiality, availability and integrity. They also aim to build a key exchange mechanism, which provides security against some attacks such as: identity theft, password guessing, denial of service, impersonation and insider attacks. This paper reviews these proposed authentication protocols and discusses their strengths and weaknesses in terms of ensured security and privacy properties, and computation cost. The schemes are ided in three broad categories of one-factor, two-factor and three-factor authentication schemes. Inter-category and intra-category comparison has been performed for these schemes and based on the derived results we propose future directions and recommendations that can be very helpful to the researchers who work on the design and implementation of authentication protocols.
Publisher: Elsevier BV
Date: 10-2016
Publisher: Springer Science and Business Media LLC
Date: 24-11-2013
Publisher: IEEE
Date: 04-2015
DOI: 10.1109/ITNG.2015.44
Publisher: Oxford University Press (OUP)
Date: 1994
Publisher: Elsevier BV
Date: 08-1992
Publisher: Springer Science and Business Media LLC
Date: 16-01-2020
Publisher: IOP Publishing
Date: 10-2018
Publisher: IEEE
Date: 07-2012
Publisher: Wiley
Date: 08-11-2012
DOI: 10.1002/SEC.646
Publisher: Hindawi Limited
Date: 2016
DOI: 10.1155/2016/6504641
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: Elsevier BV
Date: 06-2020
Publisher: Springer Berlin Heidelberg
Date: 1998
DOI: 10.1007/BFB0057736
Publisher: IEEE
Date: 12-2008
Publisher: IEEE
Date: 06-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2021
Publisher: Inderscience Publishers
Date: 2010
Publisher: Elsevier BV
Date: 08-2021
Publisher: Journal of Artificial Societies and Social Simulation
Date: 2012
DOI: 10.18564/JASSS.2079
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2021
Publisher: International Joint Conferences on Artificial Intelligence Organization
Date: 08-2021
Abstract: Recent years have witnessed the fast development of the emerging topic of Graph Learning based Recommender Systems (GLRS). GLRS mainly employ advanced graph learning approaches to model users’ preferences and intentions as well as items’ characteristics and popularity for Recommender Systems (RS). Differently from other approaches, including content based filtering and collaborative filtering, GLRS are built on graphs where the important objects, e.g., users, items, and attributes, are either explicitly or implicitly connected. With the rapid development of graph learning techniques, exploring and exploiting homogeneous or heterogeneous relations in graphs is a promising direction for building more effective RS. In this paper, we provide a systematic review of GLRS, by discussing how they extract knowledge from graphs to improve the accuracy, reliability and explainability of the recommendations. First, we characterize and formalize GLRS, and then summarize and categorize the key challenges and main progress in this novel research area.
Publisher: Springer International Publishing
Date: 2016
Publisher: Springer International Publishing
Date: 2016
Publisher: Association for the Advancement of Artificial Intelligence (AAAI)
Date: 20-09-2012
Abstract: Trust is one of the most important factors for participants' decision-making in Online Social Networks (OSNs). The trust network from a source to a target without any prior interaction contains some important intermediate participants, the trust relations between the participants, and the social context, each of which has an important influence on trust evaluation. Thus, before performing any trust evaluation, the contextual trust network from a given source to a target needs to be extracted first, where constraints on the social context should also be considered to guarantee the quality of extracted networks. However, this problem has been proved to be NP-Complete. Towards solving this challenging problem, we first propose a complex contextual social network structure which considers social contextual impact factors. These factors have significant influences on both social interaction between participants and trust evaluation. Then, we propose a new concept called QoTN (Quality of Trust Network) and a social context-aware trust network discovery model. Finally, we propose a Social Context-Aware trust Network discovery algorithm (SCAN) by adopting the Monte Carlo method and our proposed optimization strategies. The experimental results illustrate that our proposed model and algorithm outperform the existing methods in both algorithm efficiency and the quality of the extracted trust network.
Publisher: Elsevier BV
Date: 2022
Publisher: Elsevier BV
Date: 04-2016
Publisher: ACM
Date: 08-05-2006
Publisher: Elsevier BV
Date: 07-2018
Publisher: Springer International Publishing
Date: 2021
Publisher: Elsevier BV
Date: 12-2011
Publisher: IEEE
Date: 07-2011
DOI: 10.1109/ICWS.2011.81
Publisher: IEEE
Date: 08-2015
Publisher: Informa UK Limited
Date: 17-01-2017
Publisher: IEEE
Date: 2007
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2019
Publisher: Springer Berlin Heidelberg
Date: 1997
Publisher: Association for Computing Machinery (ACM)
Date: 18-07-2021
DOI: 10.1145/3465401
Abstract: Recommender systems (RSs) have been playing an increasingly important role for informed consumption, services, and decision-making in the overloaded information era and digitized economy. In recent years, session-based recommender systems (SBRSs) have emerged as a new paradigm of RSs. Different from other RSs such as content-based RSs and collaborative filtering-based RSs that usually model long-term yet static user preferences, SBRSs aim to capture short-term but dynamic user preferences to provide more timely and accurate recommendations sensitive to the evolution of their session contexts. Although SBRSs have been intensively studied, neither unified problem statements for SBRSs nor in-depth elaboration of SBRS characteristics and challenges are available. It is also unclear to what extent SBRS challenges have been addressed and what the overall research landscape of SBRSs is. This comprehensive review of SBRSs addresses the above aspects by exploring in depth the SBRS entities (e.g., sessions), behaviours (e.g., users’ clicks on items), and their properties (e.g., session length). We propose a general problem statement of SBRSs, summarize the ersified data characteristics and challenges of SBRSs, and define a taxonomy to categorize the representative SBRS research. Finally, we discuss new research opportunities in this exciting and vibrant area.
Publisher: Emerald
Date: 11-11-2014
DOI: 10.1108/JPBM-04-2014-0557
Abstract: – The purpose of this research is to analyze brand competition in China using the Duplication of Purchase (DoP) law, with important implications for understanding Chinese buyer behavior in comparison with Western buyers. Discovered in the Western markets, the DoP law holds across a variety of product categories. – Multiple sets of new data are examined to extend past research in the application of the DoP law in Chinese buying behavior. This study draws on panel data and self-reported data, utilizing bootstrapping to identify partitions where excess sharing occurs. – This paper finds the DoP law holds across six categories (two personal care, two impulse categories and two durables), as well as over multiple years. Brands in China share customers with other brands in line with the market share of the competitor brand. There were few partitions where brands shared significantly more customers than expected. Partitions occur due to the same umbrella brand or ownership, and geographic location. – Areas for further research include extended replication in other categories, investigating partitions and whether a different consumer path to purchase occurs in China. – DoP can be applied across a wide range of categories in China to understand market structure. New entrants to China can use this approach to understand a category from a consumer behavior perceptive. DoP provides guidelines for marketers to identify competition and allocate resources appropriately. – This research provides a comprehensive, unparalleled examination across six very different categories of brand competition in China. This gives confidence in the robustness and generalizability of the results.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Elsevier BV
Date: 07-2012
Publisher: IEEE Comput. Soc
Date: 2002
Publisher: Springer Berlin Heidelberg
Date: 2000
Publisher: IEEE
Date: 10-2016
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11890393_5
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2021
Publisher: Elsevier BV
Date: 09-2017
Publisher: IEEE
Date: 07-2010
DOI: 10.1109/SCC.2010.47
Publisher: SAGE Publications
Date: 02-07-2019
Abstract: The popularity and broad accessibility of online social networks (OSNs) have facilitated effective communication among people, but such networks also pose potential risks that should not be ignored. Interaction through OSNs is complex and can be unsafe, as in iduals can be contacted by strangers at any time. This makes the notion of trust a crucial issue in the use of OSNs. However, compared with decision-making processes associated with whether to trust a stranger encountered in everyday life, this task is more difficult to address with regard to OSNs due to the lack of face-to-face communication and prior knowledge between people. In this article, trust evaluation is formalised as a classification problem. We demonstrate how user profiles and historical records can be organised into a logical structure based on Bayesian networks to recognise the trustworthy people without the need to build trust relationships in OSNs. This is possible when a more detailed description of features denoted by hidden variables is considered. We compare the performance of our method with those of six other machine learning methods using Facebook and Twitter datasets, and our results show that our method achieves higher values in accuracy, recall and F1 score.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2018
Publisher: Springer Berlin Heidelberg
Date: 2005
DOI: 10.1007/11569596_47
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: Informa UK Limited
Date: 1995
Publisher: IEEE
Date: 2006
DOI: 10.1109/DASC.2006.19
Publisher: Springer International Publishing
Date: 2019
Publisher: IEEE
Date: 06-2012
DOI: 10.1109/ICWS.2012.47
Publisher: IEEE Comput. Soc
Date: 2000
Publisher: Springer International Publishing
Date: 2020
Publisher: Springer Science and Business Media LLC
Date: 08-03-2016
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: Springer Science and Business Media LLC
Date: 18-05-2018
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: IEEE
Date: 07-2013
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2009
Publisher: SAGE Publications
Date: 07-05-2017
Abstract: Social media has enabled information-sharing across massively large networks of people without spending much financial resources and time that are otherwise required in the print and electronic media. Mobile-based social media applications have overwhelmingly changed the information-sharing perspective. However, with the advent of such applications at an unprecedented scale, the privacy of the information is compromised to a larger extent if breach mitigation is not adequate. Since healthcare applications are also being developed for mobile devices so that they also benefit from the power of social media, cybersecurity privacy concerns for such sensitive applications have become critical. This article discusses the architecture of a typical mobile healthcare application, in which customized privacy levels are defined for the in iduals participating in the system. It then elaborates on how the communication across a social network in a multi-cloud environment can be made more secure and private, especially for healthcare applications.
Publisher: Elsevier BV
Date: 10-2015
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2015
Publisher: IEEE
Date: 09-2017
Publisher: IEEE
Date: 2012
Publisher: IEEE
Date: 2001
Publisher: Springer International Publishing
Date: 2019
Publisher: Elsevier BV
Date: 11-2021
Publisher: IEEE
Date: 04-2008
Publisher: IEEE
Date: 07-2010
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: SPIE
Date: 28-05-2014
DOI: 10.1117/12.2052886
Publisher: Elsevier BV
Date: 06-2018
Publisher: Springer Science and Business Media LLC
Date: 04-10-2007
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2006
Publisher: IEEE
Date: 21-03-2022
Publisher: Elsevier BV
Date: 05-2019
Publisher: IEEE
Date: 12-2017
Publisher: IEEE
Date: 09-2010
DOI: 10.1109/NSS.2010.23
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Springer Science and Business Media LLC
Date: 06-08-2022
Publisher: Springer Berlin Heidelberg
Date: 1999
DOI: 10.1007/BFB0095136
Publisher: IEEE Comput. Soc
Date: 2001
Publisher: Springer Science and Business Media LLC
Date: 10-07-2017
Publisher: Wiley
Date: 1993
Publisher: Springer Berlin Heidelberg
Date: 2014
Publisher: ACM
Date: 08-2011
Publisher: IEEE
Date: 09-2014
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: Springer International Publishing
Date: 2019
Publisher: IEEE
Date: 07-2011
Publisher: ACM
Date: 06-09-2005
Publisher: IEEE
Date: 09-2006
Publisher: IEEE
Date: 10-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2013
DOI: 10.1109/TSC.2011.58
Publisher: International Joint Conferences on Artificial Intelligence Organization
Date: 07-2018
Abstract: Cross-Domain Recommendation (CDR) and Cross-System Recommendations (CSR) are two of the promising solutions to address the long-standing data sparsity problem in recommender systems. They leverage the relatively richer information, e.g., ratings, from the source domain or system to improve the recommendation accuracy in the target domain or system. Therefore, finding an accurate mapping of the latent factors across domains or systems is crucial to enhancing recommendation accuracy. However, this is a very challenging task because of the complex relationships between the latent factors of the source and target domains or systems. To this end, in this paper, we propose a Deep framework for both Cross-Domain and Cross-System Recommendations, called DCDCSR, based on Matrix Factorization (MF) models and a fully connected Deep Neural Network (DNN). Specifically, DCDCSR first employs the MF models to generate user and item latent factors and then employs the DNN to map the latent factors across domains or systems. More importantly, we take into account the rating sparsity degrees of in idual users and items in different domains or systems and use them to guide the DNN training process for utilizing the rating data more effectively. Extensive experiments conducted on three real-world datasets demonstrate that DCDCSR framework outperforms the state-of-the-art CDR and CSR approaches in terms of recommendation accuracy.
Publisher: IEEE
Date: 12-2013
DOI: 10.1109/CSE.2013.130
Publisher: SAGE Publications
Date: 17-03-2017
Abstract: The proliferation of social networking services has resulted in a rapid growth of their user base, spanning across the world. The collective information generated from these online platforms is overwhelming, in terms of both the amount of content produced every moment and the ersity of topics discussed. The real-time nature of the information produced by users has prompted researchers to analyse this content, in order to gain timely insight into the current state of affairs. Specifically, the microblogging service Twitter has been a recent focus of researchers to gather information on events occurring in real time. This article presents a survey of a wide variety of event detection methods applied to streaming Twitter data, classifying them according to shared common traits, and then discusses different aspects of the subtasks and challenges involved in event detection. We believe this survey will act as a guide and starting point for aspiring researchers to gain a structured view on state-of-the-art real-time event detection and spur further research in this direction.
Publisher: Elsevier BV
Date: 09-2020
Publisher: IEEE
Date: 09-2015
Publisher: ACM Press
Date: 2010
Publisher: IEEE
Date: 12-2009
Publisher: IEEE
Date: 05-2017
Publisher: Springer Berlin Heidelberg
Date: 2014
Publisher: Elsevier BV
Date: 05-2018
DOI: 10.1016/J.CMPB.2018.02.003
Abstract: The traditional biomedical image retrieval methods as well as content-based image retrieval (CBIR) methods originally designed for non-biomedical images either only consider using pixel and low-level features to describe an image or use deep features to describe images but still leave a lot of room for improving both accuracy and efficiency. In this work, we propose a new approach, which exploits deep learning technology to extract the high-level and compact features from biomedical images. The deep feature extraction process leverages multiple hidden layers to capture substantial feature structures of high-resolution images and represent them at different levels of abstraction, leading to an improved performance for indexing and retrieval of biomedical images. We exploit the current popular and multi-layered deep neural networks, namely, stacked denoising autoencoders (SDAE) and convolutional neural networks (CNN) to represent the discriminative features of biomedical images by transferring the feature representations and parameters of pre-trained deep neural networks from another domain. Moreover, in order to index all the images for finding the similarly referenced images, we also introduce preference learning technology to train and learn a kind of a preference model for the query image, which can output the similarity ranking list of images from a biomedical image database. To the best of our knowledge, this paper introduces preference learning technology for the first time into biomedical image retrieval. We evaluate the performance of two powerful algorithms based on our proposed system and compare them with those of popular biomedical image indexing approaches and existing regular image retrieval methods with detailed experiments over several well-known public biomedical image databases. Based on different criteria for the evaluation of retrieval performance, experimental results demonstrate that our proposed algorithms outperform the state-of-the-art techniques in indexing biomedical images. We propose a novel and automated indexing system based on deep preference learning to characterize biomedical images for developing computer aided diagnosis (CAD) systems in healthcare. Our proposed system shows an outstanding indexing ability and high efficiency for biomedical image retrieval applications and it can be used to collect and annotate the high-resolution images in a biomedical database for further biomedical image research and applications.
Publisher: IEEE
Date: 08-2012
Publisher: Elsevier BV
Date: 06-2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Elsevier BV
Date: 11-2005
Publisher: IOP Publishing
Date: 04-09-2018
Publisher: ACM
Date: 11-1992
Publisher: ACM
Date: 08-09-2015
DOI: 10.1145/2799979
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 15-05-2019
Publisher: Springer Science and Business Media LLC
Date: 12-08-2016
DOI: 10.1038/SREP31350
Abstract: With prevalent attacks in communication, sharing a secret between communicating parties is an ongoing challenge. Moreover, it is important to integrate quantum solutions with classical secret sharing schemes with low computational cost for the real world use. This paper proposes a novel hybrid threshold adaptable quantum secret sharing scheme, using an m -bonacci orbital angular momentum (OAM) pump, Lagrange interpolation polynomials, and reverse Huffman-Fibonacci-tree coding. To be exact, we employ entangled states prepared by m -bonacci sequences to detect eavesdropping. Meanwhile, we encode m -bonacci sequences in Lagrange interpolation polynomials to generate the shares of a secret with reverse Huffman-Fibonacci-tree coding. The advantages of the proposed scheme is that it can detect eavesdropping without joint quantum operations, and permits secret sharing for an arbitrary but no less than threshold-value number of classical participants with much lower bandwidth. Also, in comparison with existing quantum secret sharing schemes, it still works when there are dynamic changes, such as the unavailability of some quantum channel, the arrival of new participants and the departure of participants. Finally, we provide security analysis of the new hybrid quantum secret sharing scheme and discuss its useful features for modern applications.
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11811220_26
Publisher: IEEE
Date: 2009
Publisher: IEEE
Date: 07-2014
Publisher: Springer Science and Business Media LLC
Date: 31-10-2014
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Wiley
Date: 07-2008
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Public Library of Science (PLoS)
Date: 04-02-2016
Publisher: IOP Publishing
Date: 11-2016
Publisher: Springer Science and Business Media LLC
Date: 11-2008
Publisher: Informa UK Limited
Date: 02-02-2010
Publisher: Elsevier BV
Date: 11-1996
Publisher: Elsevier BV
Date: 07-2005
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2019
Publisher: IEEE
Date: 12-2015
Publisher: Springer Berlin Heidelberg
Date: 2000
Publisher: Springer Science and Business Media LLC
Date: 31-03-2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2019
Publisher: Inderscience Publishers
Date: 2011
Publisher: SAGE Publications
Date: 2015
DOI: 10.1155/2015/524038
Abstract: Multimedia applications are gradually becoming an essential—and flourishing—part of our daily lives. The area of wireless sensor networks is not an exception to this trend, as multimedia data have attracted the attention of researchers. Their importance is due to the shift of focus from traditional scalar sensors to sensors equipped with multimedia devices, as well as to the next-generation wireless multimedia sensor networks (WMSNs). The highly sensitive nature of multimedia traffic makes data routing with security even more important in WMSNs. This paper discusses the challenges of secure routing in WMSNs, where most of the proposed works in the literature deal with routing and security as in idual issues. A critical and comprehensive review of state-of-the-art routing and security approaches for WMSNs is presented, followed by the discussion of their limitations and features. It is hoped that this extensive review and discussion ultimately identifies the future research directions and the open challenges of secure routing approaches in WMSNs.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Association for Computing Machinery (ACM)
Date: 03-05-2021
DOI: 10.1145/3447581
Abstract: This survey provides an overview of rule learning systems that can learn the structure of probabilistic rules for uncertain domains. These systems are very useful in such domains because they can be trained with a small amount of positive and negative ex les, use declarative representations of background knowledge, and combine efficient high-level reasoning with the probability theory. The output of these systems are probabilistic rules that are easy to understand by humans, since the conditions for consequences lead to predictions that become transparent and interpretable. This survey focuses on representational approaches and system architectures, and suggests future research directions.
Publisher: IEEE Comput. Soc. Press
Date: 1996
Publisher: IEEE Comput. Soc. Press
Date: 1993
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2018
Publisher: IEEE
Date: 12-2012
Publisher: Springer Berlin Heidelberg
Date: 2007
Publisher: IEEE Comput. Soc
Date: 1998
Publisher: Elsevier BV
Date: 03-2011
Publisher: IEEE
Date: 06-2016
DOI: 10.1109/ICWS.2016.22
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2017
Publisher: IEEE
Date: 2008
Publisher: IEEE Comput. Soc
Date: 1998
Publisher: Springer Science and Business Media LLC
Date: 19-08-2016
Publisher: IEEE
Date: 11-2009
DOI: 10.1109/BIBM.2009.87
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: International Joint Conferences on Artificial Intelligence Organization
Date: 07-2020
Abstract: User purchase behaviours are complex and dynamic, which are usually observed as multiple choice actions across a sequence of shopping baskets. Most of the existing next-basket prediction approaches model user actions as homogeneous sequence data without considering complex and heterogeneous user intentions, impeding deep under-standing of user behaviours from the perspective of human inside drivers and thus reducing the prediction performance. Psychological theories have indicated that user actions are essentially driven by certain underlying intentions (e.g., diet and entertainment). Moreover, different intentions may influence each other while different choices usually have different utilities to accomplish an intention. Inspired by such psychological insights, we formalize the next-basket prediction as an Intention Recognition, Modelling and Accomplishing problem and further design the Intention2Basket (Int2Ba in short) model. In Int2Ba, an Intention Recognizer, a Coupled Intention Chain Net, and a Dynamic Basket Planner are specifically designed to respectively recognize, model and accomplish the heterogeneous intentions behind a sequence of baskets to better plan the next-basket. Extensive experiments on real-world datasets show the superiority of Int2Ba over the state-of-the-art approaches.
Publisher: Springer Berlin Heidelberg
Date: 2000
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Springer Science and Business Media LLC
Date: 28-05-2008
Publisher: IEEE
Date: 10-2006
Publisher: Springer Science and Business Media LLC
Date: 12-07-2019
DOI: 10.1007/S11517-018-1819-Y
Abstract: With the advent of biomedical imaging technology, the number of captured and stored biomedical images is rapidly increasing day by day in hospitals, imaging laboratories and biomedical institutions. Therefore, more robust biomedical image analysis technology is needed to meet the requirement of the diagnosis and classification of various kinds of diseases using biomedical images. However, the current biomedical image classification methods and general non-biomedical image classifiers cannot extract more compact biomedical image features or capture the tiny differences between similar images with different types of diseases from the same category. In this paper, we propose a novel fused convolutional neural network to develop a more accurate and highly efficient classifier for biomedical images, which combines shallow layer features and deep layer features from the proposed deep neural network architecture. In the analysis, it was observed that the shallow layers provided more detailed local features, which could distinguish different diseases in the same category, while the deep layers could convey more high-level semantic information used to classify the diseases among the various categories. A detailed comparison of our approach with traditional classification algorithms and popular deep classifiers across several public biomedical image datasets showed the superior performance of our proposed method for biomedical image classification. In addition, we also evaluated the performance of our method in modality classification of medical images using the ImageCLEFmed dataset. Graphical abstract The graphical abstract shows the fused, deep convolutional neural network architecture proposed for biomedical image classification. In the architecture, we can clearly see the feature-fusing process going from shallow layers and the deep layers.
Publisher: ACM
Date: 02-11-2010
Publisher: Springer Science and Business Media LLC
Date: 28-03-2020
Publisher: Springer Science and Business Media LLC
Date: 21-03-2014
Publisher: Wiley
Date: 11-2011
Publisher: IEEE
Date: 09-2016
Publisher: Springer Science and Business Media LLC
Date: 11-2008
Publisher: IEEE
Date: 04-2018
Publisher: IEEE
Date: 06-2016
DOI: 10.1109/ICWS.2016.15
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2018
Publisher: ACM Press
Date: 1996
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: International Joint Conferences on Artificial Intelligence Organization
Date: 08-2019
Abstract: The emerging topic of sequential recommender systems (SRSs) has attracted increasing attention in recent years. Different from the conventional recommender systems (RSs) including collaborative filtering and content-based filtering, SRSs try to understand and model the sequential user behaviors, the interactions between users and items, and the evolution of users’ preferences and item popularity over time. SRSs involve the above aspects for more precise characterization of user contexts, intent and goals, and item consumption trend, leading to more accurate, customized and dynamic recommendations. In this paper, we provide a systematic review on SRSs. We first present the characteristics of SRSs, and then summarize and categorize the key challenges in this research area, followed by the corresponding research progress consisting of the most recent and representative developments on this topic. Finally, we discuss the important research directions in this vibrant area.
Publisher: IEEE
Date: 12-2010
Publisher: International Joint Conferences on Artificial Intelligence Organization
Date: 08-2019
Abstract: A session-based recommender system (SBRS) suggests the next item by modeling the dependencies between items in a session. Most of existing SBRSs assume the items inside a session are associated with one (implicit) purpose. However, this may not always be true in reality, and a session may often consist of multiple subsets of items for different purposes (e.g., breakfast and decoration). Specifically, items (e.g., bread and milk) in a subsethave strong purpose-specific dependencies whereas items (e.g., bread and vase) from different subsets have much weaker or even no dependencies due to the difference of purposes. Therefore, we propose a mixture-channel model to accommodate the multi-purpose item subsets for more precisely representing a session. Filling gaps in existing SBRSs, this model recommends more erse items to satisfy different purposes. Accordingly, we design effective mixture-channel purpose routing networks (MCPRN) with a purpose routing network to detect the purposes of each item and assign it into the corresponding channels. Moreover, a purpose specific recurrent network is devised to model the dependencies between items within each channel for a specific purpose. The experimental results show the superiority of MCPRN over the state-of-the-art methods in terms of both recommendation accuracy and ersity.
Publisher: IOP Publishing
Date: 26-03-2019
Publisher: IEEE
Date: 07-2014
Publisher: Springer Berlin Heidelberg
Date: 2001
Publisher: IOP Publishing
Date: 04-2015
DOI: 10.1088/0253-6102/63/4/459
Abstract: In this paper, we show that a (2, 3) discrete variable threshold quantum secret sharing scheme of secure direct communication can be achieved based on recurrence using the same devices as in BB84. The scheme is devised by first placing the shares of smaller secret pieces into the shares of the largest secret piece, converting the shares of the largest secret piece into corresponding quantum state sequences, inserting nonorthogonal state particles into the quantum state sequences with the purpose of detecting eavesdropping, and finally sending the new quantum state sequences to the three participants respectively. Consequently, every particle can on average carry up to 1.5-bit messages due to the use of recurrence. The control codes are randomly prepared using the way to generate fountain codes with pre-shared source codes between Alice and Bob, making three participants can detect eavesdropping by themselves without sending classical messages to Alice. Due to the flexible encoding, our scheme is also dynamic, which means that it allows the participants to join and leave freely.
Publisher: Springer Science and Business Media LLC
Date: 07-2013
Publisher: IEEE
Date: 06-2014
Publisher: ACM
Date: 21-06-2010
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: IEEE
Date: 06-2014
DOI: 10.1109/ICWS.2014.58
Publisher: Springer Science and Business Media LLC
Date: 11-2008
Publisher: Association for the Advancement of Artificial Intelligence (AAAI)
Date: 03-04-2020
Abstract: Human behaviors are complex, which are often observed as a sequence of heterogeneous actions. In this paper, we take user choices for shopping baskets as a typical case to study the complexity of user behaviors. Most of existing approaches often model user behaviors in a mechanical way, namely treating a user action sequence as homogeneous sequential data, such as hourly temperatures, which fails to consider the complexity in user behaviors. In fact, users' choices are driven by certain underlying intentions (e.g., feeding the baby or relieving pain) according to Psychological theories. Moreover, the durations of intentions to drive user actions are quite different some of them may be persistent while others may be transient. According to Psychological theories, we develop a hierarchical framework to describe the goal, intentions and action sequences, based on which, we design Intention Nets (IntNet). In IntNet, multiple Action Chain Nets are constructed to model the user actions driven by different intentions, and a specially designed Persistent-Transient Intention Unit models the different intention durations. We apply the IntNet to next-basket prediction, a recent challenging task in recommender systems. Extensive experiments on real-world datasets show the superiority of our Psychology-inspired model IntNet over the state-of-the-art approaches.
Publisher: Elsevier BV
Date: 2013
Publisher: IEEE
Date: 07-2007
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2023
Publisher: Springer Science and Business Media LLC
Date: 22-08-2017
Publisher: IEEE
Date: 11-2016
DOI: 10.1109/LCN.2016.053
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2006
Publisher: BMJ
Date: 13-03-2017
DOI: 10.1136/BMJQS-2016-005867
Abstract: Standard risk screening and assessment forms are frequently used in strategies to prevent harm to older people in hospitals. Little is known about good practices for their use. Scope the preventable harms addressed by standard forms used to screen and assess older people and how standard forms are operationalised in hospitals across Victoria, Australia. Mixed methods study: (1) cross-sectional audit of the standard risk screening and assessment forms used to assess older people at 11 health services in 2015 (2) nine focus groups with a purposive s le of 69 participants at 9 health services. Descriptive analysis examined the number of items on forms, preventable harms assessed and sources of duplication. Qualitative thematic analysis of focus group data identified themes explaining issues commonly affecting how health services used the forms. 152 standard assessment forms from 11 Victorian health services included over 3700 items with 17% duplicated across multiple forms. Assessments of skin integrity and mobility loss (including falls) were consistently included in forms however, nutrition, cognitive state, pain and medication risks were inconsistent and continence, venous thromboembolism risk and hospital acquired infection from invasive devices were infrequent. Qualitative analyses revealed five themes explaining issues associated with current use of assessment forms: (1) comprehensive assessment of preventable harms (2) burden on staff and the older person, (3) interprofessional collaboration, (4) flexibility to in idualise care and (5) information management. Ex les of good practice were identified. Current use of standard risk screening and assessment forms is associated with a high burden and gaps in assessment of several common preventable harms that can increase risk to older people in hospital. Improvement should focus on streamlining forms, increased guidance on interventions to prevent harm and facilitating front-line staff to manage complex decisions.
Publisher: Springer Science and Business Media LLC
Date: 02-02-2008
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2018
Publisher: No publisher found
Date: 2006
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Springer Science and Business Media LLC
Date: 07-06-2011
Publisher: Springer International Publishing
Date: 2022
Publisher: Springer Science and Business Media LLC
Date: 11-08-2018
Publisher: ACM
Date: 30-11-2020
Publisher: MDPI AG
Date: 31-03-2016
DOI: 10.3390/S16040460
Publisher: IEEE
Date: 06-2011
Publisher: Elsevier BV
Date: 10-2015
Publisher: Springer International Publishing
Date: 2018
Publisher: IEEE
Date: 07-2013
Publisher: Springer Science and Business Media LLC
Date: 07-05-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2015
Publisher: IEEE
Date: 2009
DOI: 10.1109/CSE.2009.248
Publisher: Springer International Publishing
Date: 2016
Publisher: Springer-Verlag
Date: 1994
DOI: 10.1007/BFB0014004
Publisher: IEEE
Date: 04-2015
Publisher: Elsevier BV
Date: 04-2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2019
Publisher: Elsevier BV
Date: 06-2015
Publisher: Springer Science and Business Media LLC
Date: 13-04-2017
DOI: 10.1038/SREP46302
Abstract: Quantum cryptography is commonly used to generate fresh secure keys with quantum signal transmission for instant use between two parties. However, research shows that the relatively low key generation rate hinders its practical use where a symmetric cryptography component consumes the shared key. That is, the security of the symmetric cryptography demands frequent rate of key updates, which leads to a higher consumption of the internal one-time-pad communication bandwidth, since it requires the length of the key to be as long as that of the secret. In order to alleviate these issues, we develop a matrix algorithm for fast and simple high-capacity quantum cryptography. Our scheme can achieve secure private communication with fresh keys generated from Fibonacci- and Lucas- valued orbital angular momentum (OAM) states for the seed to construct recursive Fibonacci and Lucas matrices. Moreover, the proposed matrix algorithm for quantum cryptography can ultimately be simplified to matrix multiplication, which is implemented and optimized in modern computers. Most importantly, considerably information capacity can be improved effectively and efficiently by the recursive property of Fibonacci and Lucas matrices, thereby avoiding the restriction of physical conditions, such as the communication bandwidth.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: IEEE
Date: 06-2013
DOI: 10.1109/ICWS.2013.68
Publisher: IEEE
Date: 08-2013
Publisher: Springer Berlin Heidelberg
Date: 2005
DOI: 10.1007/11589990_6
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2023
Publisher: Elsevier BV
Date: 04-2020
Publisher: IEEE Comput. Soc
Date: 1999
Publisher: Elsevier BV
Date: 03-2017
DOI: 10.1016/J.CMPB.2016.12.019
Abstract: Highly accurate classification of biomedical images is an essential task in the clinical diagnosis of numerous medical diseases identified from those images. Traditional image classification methods combined with hand-crafted image feature descriptors and various classifiers are not able to effectively improve the accuracy rate and meet the high requirements of classification of biomedical images. The same also holds true for artificial neural network models directly trained with limited biomedical images used as training data or directly used as a black box to extract the deep features based on another distant dataset. In this study, we propose a highly reliable and accurate end-to-end classifier for all kinds of biomedical images via deep learning and transfer learning. We first apply domain transferred deep convolutional neural network for building a deep model and then develop an overall deep learning architecture based on the raw pixels of original biomedical images using supervised training. In our model, we do not need the manual design of the feature space, seek an effective feature vector classifier or segment specific detection object and image patches, which are the main technological difficulties in the adoption of traditional image classification methods. Moreover, we do not need to be concerned with whether there are large training sets of annotated biomedical images, affordable parallel computing resources featuring GPUs or long times to wait for training a perfect deep model, which are the main problems to train deep neural networks for biomedical image classification as observed in recent works. With the utilization of a simple data augmentation method and fast convergence speed, our algorithm can achieve the best accuracy rate and outstanding classification ability for biomedical images. We have evaluated our classifier on several well-known public biomedical datasets and compared it with several state-of-the-art approaches. We propose a robust automated end-to-end classifier for biomedical images based on a domain transferred deep convolutional neural network model that shows a highly reliable and accurate performance which has been confirmed on several public biomedical image datasets.
Publisher: Elsevier BV
Date: 12-2011
Publisher: Hindawi Limited
Date: 23-09-2018
DOI: 10.1155/2018/1398958
Abstract: With the surging demand on high-quality mobile video services and the unabated development of new network technology, including fog computing, there is a need for a generalized quality of user experience (QoE) model that could provide insight for various network optimization designs. A good QoE, especially when measured as engagement, is an important optimization goal for investors and advertisers. Therefore, many works have focused on understanding how the factors, especially quality of service (QoS) factors, impact user engagement. However, the ergence of user interest is usually ignored or deliberatively decoupled from QoS and/or other objective factors. With an increasing trend towards personalization applications, it is necessary as well as feasible to consider user interest to satisfy aesthetic and personal needs of users when optimizing user engagement. We first propose an Extraction-Inference (E-I) algorithm to estimate the user interest from easily obtained user behaviors. Based on our empirical analysis on a large-scale dataset, we then build a QoS and user Interest based Engagement (QI-E) regression model . Through experiments on our dataset, we demonstrate that the proposed model reaches an improvement in accuracy by 9.99% over the baseline model which only considers QoS factors. The proposed model has potential for designing QoE-oriented scheduling strategies in various network scenarios, especially in the fog computing context.
Publisher: Springer Science and Business Media LLC
Date: 03-11-2015
Publisher: Elsevier BV
Date: 06-2022
DOI: 10.1016/J.YMETH.2021.05.015
Abstract: Automatic medical image segmentation plays an important role as a diagnostic aid in the identification of diseases and their treatment in clinical settings. Recently proposed methods based on Convolutional Neural Networks (CNNs) have demonstrated their potential in image processing tasks, including some medical image analysis tasks. Those methods can learn various feature representations with numerous weight-shared convolutional kernels, however, the missed diagnosis rate of regions of interest (ROIs) is still high in medical image segmentation. Two crucial factors behind this shortcoming, which have been overlooked, are small ROIs from medical images and the limited context information from the existing network models. In order to reduce the missed diagnosis rate of ROIs from medical images, we propose a new segmentation framework which enhances the representative capability of small ROIs (particularly in deep layers) and explicitly learns global contextual dependencies in multi-scale feature spaces. In particular, the local features and their global dependencies from each feature space are adaptively aggregated based on both the spatial and the channel dimensions. Moreover, some visualization comparisons of the learned features from our framework further boost neural networks' interpretability. Experimental results show that, in comparison to some popular medical image segmentation and general image segmentation methods, our proposed framework achieves the state-of-the-art performance on the liver tumor segmentation task with 91.18% Sensitivity, the COVID-19 lung infection segmentation task with 75.73% Sensitivity and the retinal vessel detection task with 82.68% Sensitivity. Moreover, it is possible to integrate (parts of) the proposed framework into most of the recently proposed Fully CNN-based models, in order to improve their effectiveness in medical image segmentation tasks.
Publisher: IEEE Comput. Soc
Date: 2003
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: ACM
Date: 08-03-2009
Publisher: IEEE
Date: 06-2013
DOI: 10.1109/SCC.2013.92
Publisher: IEEE
Date: 02-2007
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: IEEE
Date: 06-2014
DOI: 10.1109/ICWS.2014.24
Publisher: IEEE
Date: 05-2006
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11610496_15
Publisher: Springer Berlin Heidelberg
Date: 2000
Publisher: IEEE
Date: 08-2007
Publisher: IEEE
Date: 08-2008
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: Springer International Publishing
Date: 2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2011
Publisher: IEEE
Date: 1995
Publisher: Springer Science and Business Media LLC
Date: 08-2014
Publisher: SPIE
Date: 10-03-2020
DOI: 10.1117/12.2550511
Publisher: Elsevier BV
Date: 10-2015
Publisher: IEEE
Date: 08-2015
Publisher: IGI Global
Date: 07-2015
Abstract: Cloud computing services have been increasingly considered by businesses as a viable option for reducing IT expenditure. However, there are often associated problems with unmanaged accountability. This paper first analyses the accountability properties of a cloud service and then proposes the accountable cloud service (ACS) model to address those problems. In addition, the authors argue that from an accountability perspective a cloud service is a proactive system that needs to be modeled differently from the traditional reactive systems. They extend traditional structural operational semantics to cater for modeling of actors as well as scenarios of inaction and exception in state transitions. This leads to the creation of a new form of a process algebra called Accountable Process Algebra (APA). They also propose an Obligation Flow Diagram (OFD) as a simple method for conflict resolution and verification for the ACS model. The ACS model enables obligation specification, validation, decomposition, machine-interpretation, monitoring and reasoning, and ultimately facilitates accountability in cloud service consumption. Using Amazon S3 service as a case study, they show how to address those known accountability problems by using our ACS model. Finally the authors discuss the applicability of their model to cloud services in general.
Publisher: Springer Science and Business Media LLC
Date: 2001
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer Science and Business Media LLC
Date: 2020
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Springer Science and Business Media LLC
Date: 11-04-2014
Publisher: IEEE
Date: 12-2018
Publisher: IEEE
Date: 09-2006
Start Date: 2023
End Date: 12-2025
Amount: $420,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2004
End Date: 12-2010
Amount: $480,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 03-2006
End Date: 07-2011
Amount: $72,444.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2018
End Date: 08-2021
Amount: $421,104.00
Funder: Australian Research Council
View Funded ActivityStart Date: 01-2002
End Date: 12-2003
Amount: $50,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 01-2005
End Date: 11-2009
Amount: $284,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 11-2003
End Date: 12-2004
Amount: $20,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2010
End Date: 12-2013
Amount: $180,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 04-2013
End Date: 12-2017
Amount: $210,000.00
Funder: Australian Research Council
View Funded Activity