ORCID Profile
0000-0002-0221-6361
Current Organisation
La Trobe 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.
Artificial Intelligence and Image Processing | Pattern Recognition and Data Mining | Data security and protection | Information Systems Development Methodologies | Data and information privacy | Data engineering and data science | Cybersecurity and privacy | Decision Support and Group Support Systems
Information Processing Services (incl. Data Entry and Capture) | Electronic Information Storage and Retrieval Services |
Publisher: IEEE
Date: 10-2008
Publisher: IEEE Comput. Soc
Date: 2000
Publisher: Springer Berlin Heidelberg
Date: 2005
DOI: 10.1007/B106936
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: Elsevier BV
Date: 11-2017
Publisher: Springer Nature Singapore
Date: 2023
Publisher: Springer Berlin Heidelberg
Date: 2004
Publisher: Springer Berlin Heidelberg
Date: 2004
DOI: 10.1007/B96838
Publisher: IEEE
Date: 05-2016
Publisher: Elsevier BV
Date: 10-2008
Publisher: Inderscience Publishers
Date: 2006
Publisher: Springer International Publishing
Date: 2016
Publisher: Elsevier BV
Date: 10-2010
Publisher: Elsevier BV
Date: 07-2013
Publisher: Elsevier BV
Date: 05-2016
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Elsevier BV
Date: 06-2010
Publisher: ACM
Date: 08-11-2010
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: Springer Berlin Heidelberg
Date: 2003
Publisher: ACM
Date: 08-05-2007
Publisher: Springer Berlin Heidelberg
Date: 2007
Publisher: Elsevier BV
Date: 2011
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2016
Publisher: IEEE
Date: 06-2009
Publisher: ACM Press
Date: 2006
DOI: 10.1145/1146847
Publisher: Springer International Publishing
Date: 2016
Publisher: Springer Nature Singapore
Date: 2023
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11610113
Publisher: SAGE Publications
Date: 05-03-2012
Abstract: With the proliferation of XML data, searching XML data using keyword queries has attracted much attention. However, most of the current approaches focus on keyword-based searches over a single XML document. Searching over a system integrating hundreds or even thousands of data sources by sequentially querying every single source is extremely costly, and thus may be impractical. In this article we propose a novel approach for selecting the top-K data sources by relying on their relevance to a given query, to avoid the high cost of searching in numerous, potentially irrelevant data sources. Our approach summarizes the data sources as succinct synopses for the rapid filtering of non-promising sources. We maintain both structural and value distribution information of each data source, and propose a novel ranking function to measure effectively the relevance of the data source to the given query. We conducted experiments with real datasets, and results show that our approach achieves high performances in all evaluation metrics: recall, precision and Spearman’s rank correlation coefficient with different experimental parameters.
Publisher: Springer Science and Business Media LLC
Date: 12-10-2011
Publisher: IEEE
Date: 10-2015
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: Springer Science and Business Media LLC
Date: 21-04-2016
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: Springer Science and Business Media LLC
Date: 23-05-2008
Publisher: Elsevier BV
Date: 11-2013
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2005
DOI: 10.1109/TKDE.2005.35
Publisher: Springer International Publishing
Date: 2021
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: Springer International Publishing
Date: 2016
Publisher: IEEE
Date: 09-2007
DOI: 10.1109/DEXA.2007.81
Publisher: Springer International Publishing
Date: 2007
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Hindawi Limited
Date: 22-11-2021
DOI: 10.1002/INT.22759
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: Springer International Publishing
Date: 2015
Publisher: Elsevier BV
Date: 10-2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2021
Publisher: Elsevier BV
Date: 06-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2021
Publisher: Elsevier BV
Date: 2023
Publisher: Springer Science and Business Media LLC
Date: 26-03-2014
Publisher: Springer International Publishing
Date: 2016
Publisher: IEEE Comput. Sci
Date: 2002
Publisher: Elsevier BV
Date: 11-2013
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2023
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2009
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: ACM
Date: 24-08-2008
Publisher: Springer International Publishing
Date: 2015
Publisher: Springer International Publishing
Date: 2009
Publisher: ACM Press
Date: 2006
Publisher: ACM Press
Date: 2006
Publisher: Springer Berlin Heidelberg
Date: 2003
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: IEEE Comput. Soc
Date: 2002
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: Elsevier BV
Date: 09-2010
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Association for Computing Machinery (ACM)
Date: 2012
Abstract: Combining the Semantic Web and the Ubiquitous Web, Web 3.0 is for things . The Semantic Web enables human knowledge to be machine-readable and the Ubiquitous Web allows Web services to serve any thing, forming a bridge between the virtual world and the real world. By using context, Web services can become smarter—that is, aware of the target things' or applications' physical environments, or situations and respond proactively and intelligently. Existing methods for implementing context-aware Web services on Web 2.0 mainly enumerate different implementations corresponding to different attribute values of the context, in order to improve the Quality of Services (QoS). However, things in the physical world are extremely erse, which poses new problems for Web services: it is difficult to unify the context of things and to implement a flexible smart Web service for things. This article proposes a novel smart Web service based on the context of things, which is implemented using a REpresentational State Transfer for Things (Thing-REST) style, to tackle the two problems. In a smart Web service, the user's description (semantic context) and sensor reports (sensing context) are two channels for acquiring the context of things which are then employed by ontology services to make the context of things machine-readable. With guidance of domain knowledge services, event detection services can analyze things' needs particularly, well through the context of things. We then propose a Thing-REST style to manage the context of things and user context, and to mashup Web services through three structures (i.e., chain, select, and merge) to implement smart Web services. A smart plant watering-service application demonstrates the effectiveness of our method.
Publisher: Springer Nature Switzerland
Date: 2022
Publisher: IEEE
Date: 12-2007
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2003
Publisher: Association for Computing Machinery (ACM)
Date: 07-08-2023
DOI: 10.1145/3613962
Abstract: Data transparency is beneficial to data participants’ awareness, users’ fairness, and research work’s reproducibility. However, when addressing transparency requirements, we cannot ignore data privacy. This paper defines the multi-objective data publishing (MODP) problem, optimizing data privacy and transparency at the same time. Accordingly, we propose a distributed cooperative coevolutionary genetic algorithm (DCCGA) to optimize the MODP problem. In the population of DCCGA, each in idual represents an anonymization solution to MODP. Three modules in DCCGA, i.e., grouping module, cooperative coevolutionary module, and evolving module, are proposed for distributed sub-population update and evaluation, improving DCCGA’s optimization performance and parallel efficiency. Moreover, a matrix-based crossover operator and a matrix-based mutation operator are designed to exchange and adjust anonymization information in the in iduals efficiently. Experimental results demonstrate that the proposed DCCGA outperforms the competitors with respect to solution accuracy, convergence speed, and scalability. Besides, we verify the effectiveness of all the proposed components in DCCGA.
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2022
Publisher: Springer Science and Business Media LLC
Date: 28-02-2012
Publisher: Oxford University Press (OUP)
Date: 11-03-2011
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11610113_28
Publisher: Elsevier BV
Date: 10-2023
Publisher: IEEE Comput. Soc
Date: 2001
Start Date: 07-2018
End Date: 12-2021
Amount: $377,725.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2023
End Date: 12-2025
Amount: $450,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 12-2018
End Date: 11-2022
Amount: $370,000.00
Funder: Australian Research Council
View Funded Activity