Shlomo Geva
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Shlomo Geva has a total of 146 co-authors. Here are the top co-authors by number of shared publications:
- Yue Xu
School of Computer Science, Queensland University of Technology, Brisbane, Australia
23 shared publications - Andrew Trotman
University of Otago, Dunedin, New Zealand
16 shared publications - Richi Nayak
School of Computer Science, Queensland University of Technology, Brisbane, Australia
13 shared publications - Alan Woodley
School of Computer Science, Queensland University of Technology, Brisbane 4000, Australia
11 shared publications Jaap Kamps
INEX co-chair & University of Amsterdam
8 shared publicationsChristopher M. De Vries
Queensland University of Technology, Brisbane, Australia
7 shared publications
Latest Publications
- 15 February 2021
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 63 (5) , 1241-1270
Mining discriminative itemsets in data streams using the tilted-time window model
- 15 February 2021
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 63 (5) , 1241-1270
Mining discriminative itemsets in data streams using the tilted-time window model
- Open Access
- 21 December 2018
- Published by Springer Nature in BMC Bioinformatics
- Vol. 19 (S20) , 509
Rapid analysis of metagenomic data using signature-based clustering
Sequencing highly-variable 16S regions is a common and often effective approach to the study of microbial communities, and next-generation sequencing (NGS) technologies provide abundant quantities of data for analysis. However, the speed of existing analysis pipelines may limit our ability to work with these quantities of data. Furthermore, the limited coverage of existing 16S databases may hamper our ability to characterise these communities, particularly in the context of complex or poorly studied environments. In this article we present the SigClust algorithm, a novel clustering method involving the transformation of sequence reads into binary signatures. When compared to other published methods, SigClust yields superior cluster coherence and separation of metagenomic read data, while operating within substantially reduced timeframes. We demonstrate its utility on published Illumina datasets and on a large collection of labelled wound reads sourced from patients in a wound clinic. The temporal analysis is based on tracking the dominant clusters of wound samples over time. The analysis can identify markers of both healing and non-healing wounds in response to treatment. Prominent clusters are found, corresponding to bacterial species known to be associated with unfavourable healing outcomes, including a number of strains of Staphylococcus aureus. SigClust identifies clusters rapidly and supports an improved understanding of the wound microbiome without reliance on a reference database. The results indicate a promising use for a SigClust-based pipeline in wound analysis and prediction, and a possible novel method for wound management and treatment.
- 21 December 2018
- Published by Springer Nature in BMC Bioinformatics
- Vol. 19 (S20) , 509
Open AccessRapid analysis of metagenomic data using signature-based clustering
Sequencing highly-variable 16S regions is a common and often effective approach to the study of microbial communities, and next-generation sequencing (NGS) technologies provide abundant quantities of data for analysis. However, the speed of existing analysis pipelines may limit our ability to work with these quantities of data. Furthermore, the limited coverage of existing 16S databases may hamper our ability to characterise these communities, particularly in the context of complex or poorly studied environments. In this article we present the SigClust algorithm, a novel clustering method involving the transformation of sequence reads into binary signatures. When compared to other published methods, SigClust yields superior cluster coherence and separation of metagenomic read data, while operating within substantially reduced timeframes. We demonstrate its utility on published Illumina datasets and on a large collection of labelled wound reads sourced from patients in a wound clinic. The temporal analysis is based on tracking the dominant clusters of wound samples over time. The analysis can identify markers of both healing and non-healing wounds in response to treatment. Prominent clusters are found, corresponding to bacterial species known to be associated with unfavourable healing outcomes, including a number of strains of Staphylococcus aureus. SigClust identifies clusters rapidly and supports an improved understanding of the wound microbiome without reliance on a reference database. The results indicate a promising use for a SigClust-based pipeline in wound analysis and prediction, and a possible novel method for wound management and treatment.
- 9 October 2018
- Published by Elsevier in Future Generation Computer Systems
- Vol. 99, 333-345
Parallel K-Tree: A multicore, multinode solution to extreme clustering
- 9 October 2018
- Published by Elsevier in Future Generation Computer Systems
- Vol. 99, 333-345
Parallel K-Tree: A multicore, multinode solution to extreme clustering
- 1 April 2017
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 33, 30-44
A greater understanding of social networks privacy requirements: The user perspective
- 1 April 2017
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 33, 30-44
A greater understanding of social networks privacy requirements: The user perspective
- Open Access
- 31 January 2017
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Using web services to fuse remote sensing and multimedia data repositories
Remote sensing data is becoming readily available on the Web. However, remote sensing data is not as widely used as other web data. Here, we explore how a fusion of remote sensing data with web paradigms and data would benefit the remote sensing community. We present a framework to achieve this fusion which extends on previous research by: 1) being generic, so that it can be used in any situation; 2) automatic, so that it requires almost no input from the user, and 3) archival, allowing access to decades of remote sensing and web information. We demonstrate our framework with a proof-of-concept prototype
- 31 January 2017
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Open AccessUsing web services to fuse remote sensing and multimedia data repositories
Remote sensing data is becoming readily available on the Web. However, remote sensing data is not as widely used as other web data. Here, we explore how a fusion of remote sensing data with web paradigms and data would benefit the remote sensing community. We present a framework to achieve this fusion which extends on previous research by: 1) being generic, so that it can be used in any situation; 2) automatic, so that it requires almost no input from the user, and 3) archival, allowing access to decades of remote sensing and web information. We demonstrate our framework with a proof-of-concept prototype
- Open Access
- 5 December 2016
- Published by Association for Computing Machinery (ACM)
- p. 49-56
Effective User Relevance Feedback for Image Retrieval with Image Signatures
Content-based image retrieval (CBIR) has attracted much attention due to the exponential growth of digital image collections that have become available in recent years. Relevance feedback (RF) in the context of search engines is a query expansion technique, which is based on relevance judgments about the top results that are initially returned for a given query. RF can be obtained directly from end users, inferred indirectly from user interactions with a result list, or even assumed (aka pseudo relevance feedback). RF information is used to generate a new query, aiming to re-focus the query towards more relevant results.\ud \ud This paper presents a methodology for use of signature based image retrieval with a user in the loop to improve retrieval performance. The significance of this study is twofold. First, it shows how to effectively use explicit RF with signature based image retrieval to improve retrieval quality and efficiency. Second, this approach provides a mechanism for end users to refine their image queries. This is an important contribution because, to date, there is no effective way to reformulate an image query; our approach provides a solution to this problem.\ud \ud Empirical experiments have been carried out to study the behaviour and optimal parameter settings of this approach. Empirical evaluations based on standard benchmarks demonstrate the effectiveness of the proposed approach in improving the performance of CBIR in terms of recall, precision, speed and scalability
- 5 December 2016
- Published by Association for Computing Machinery (ACM)
- p. 49-56
Open AccessEffective User Relevance Feedback for Image Retrieval with Image Signatures
Content-based image retrieval (CBIR) has attracted much attention due to the exponential growth of digital image collections that have become available in recent years. Relevance feedback (RF) in the context of search engines is a query expansion technique, which is based on relevance judgments about the top results that are initially returned for a given query. RF can be obtained directly from end users, inferred indirectly from user interactions with a result list, or even assumed (aka pseudo relevance feedback). RF information is used to generate a new query, aiming to re-focus the query towards more relevant results.\ud \ud This paper presents a methodology for use of signature based image retrieval with a user in the loop to improve retrieval performance. The significance of this study is twofold. First, it shows how to effectively use explicit RF with signature based image retrieval to improve retrieval quality and efficiency. Second, this approach provides a mechanism for end users to refine their image queries. This is an important contribution because, to date, there is no effective way to reformulate an image query; our approach provides a solution to this problem.\ud \ud Empirical experiments have been carried out to study the behaviour and optimal parameter settings of this approach. Empirical evaluations based on standard benchmarks demonstrate the effectiveness of the proposed approach in improving the performance of CBIR in terms of recall, precision, speed and scalability
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2692-2698
Using parallel hierarchical clustering to address spatial big data challenges
Clustering can help to make large datasets more manageable by grouping together similar objects. However, most clustering approaches are unable to scale to very large datasets (e.g. more than 10 million objects). The K-Tree is a data structure and clustering algorithm that has proven to be scalable with large streaming datasets. Here, we apply the K-Tree to spatial data (satellite images) and extend from a single threaded to a multicore environment. We show that the K-Tree is able to cluster larger dataset more efficiently than baseline approaches.
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2692-2698
Using parallel hierarchical clustering to address spatial big data challenges
Clustering can help to make large datasets more manageable by grouping together similar objects. However, most clustering approaches are unable to scale to very large datasets (e.g. more than 10 million objects). The K-Tree is a data structure and clustering algorithm that has proven to be scalable with large streaming datasets. Here, we apply the K-Tree to spatial data (satellite images) and extend from a single threaded to a multicore environment. We show that the K-Tree is able to cluster larger dataset more efficiently than baseline approaches.
- 1 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Efficient Feature Selection and Nearest Neighbour Search for Hyperspectral Image Classification
Hyperspectral images typically contain hundreds of spectral bands which is one to two orders of magnitude larger than the number of bands in multispectral images. This greater volume of spectral information could lead to discoveries that are not possible with multispectral images; however, overcoming the complexity of the additional information is a computational challenge. Here, we present a solution that uses feature selection, logarithmic nearest neighbor classification and neighborhood spatial analysis to classify the land use of multiple hyperspectral images. Empirical analysis shows that our solution is as accurate as other much more complex approaches and it is orders-of-magnitude more efficient. This ascertains that our solution is scalable to larger datasets while maintaining high accuracy.
- 1 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Efficient Feature Selection and Nearest Neighbour Search for Hyperspectral Image Classification
Hyperspectral images typically contain hundreds of spectral bands which is one to two orders of magnitude larger than the number of bands in multispectral images. This greater volume of spectral information could lead to discoveries that are not possible with multispectral images; however, overcoming the complexity of the additional information is a computational challenge. Here, we present a solution that uses feature selection, logarithmic nearest neighbor classification and neighborhood spatial analysis to classify the land use of multiple hyperspectral images. Empirical analysis shows that our solution is as accurate as other much more complex approaches and it is orders-of-magnitude more efficient. This ascertains that our solution is scalable to larger datasets while maintaining high accuracy.
- Open Access
- 1 October 2016
- Published by Association for Computing Machinery (ACM)
- p. 714-716
WIMBY
Location-aware social media is increasing being used to inform decisions in a spatiotemporal context. However, collecting, fusing, processing and merging information from different social media platforms is a challenge because of diversity of information between different platforms. Here, we present the WIMBY, which is able to access multiple social media platforms to help users answer the question "What's in my Backyard?". In doing so, the WIMBY helps to address the challenge of dealing with diverse social media information. It is believed that the WIMBY can be extended to include more information sources (including other social media platforms) to help inform decision makers in a wider array of applications
- 1 October 2016
- Published by Association for Computing Machinery (ACM)
- p. 714-716
Open AccessWIMBY
Location-aware social media is increasing being used to inform decisions in a spatiotemporal context. However, collecting, fusing, processing and merging information from different social media platforms is a challenge because of diversity of information between different platforms. Here, we present the WIMBY, which is able to access multiple social media platforms to help users answer the question "What's in my Backyard?". In doing so, the WIMBY helps to address the challenge of dealing with diverse social media information. It is believed that the WIMBY can be extended to include more information sources (including other social media platforms) to help inform decision makers in a wider array of applications
- Open Access
- 7 July 2016
- Published by Association for Computing Machinery (ACM)
- p. 873-876
Improving Retrieval Quality Using Pseudo Relevance Feedback in Content-Based Image Retrieval
The increased availability of image capturing devices has enabled collections of digital images to rapidly expand in both size and diversity. This has created a constantly growing need for efficient and effective image browsing, searching, and retrieval tools. Pseudo-relevance feedback (PRF) has proven to be an effective mechanism for improving retrieval accuracy. An original, simple yet effective rank-based PRF mechanism (RB-PRF) that takes into account the initial rank order of each image to improve retrieval accuracy is proposed. This RB-PRF mechanism innovates by making use of binary image signatures to improve retrieval precision by promoting images similar to highly ranked images and demoting images similar to lower ranked images. Empirical evaluations based on standard benchmarks, namely Wang, Oliva & Torralba, and Corel datasets demonstrate the effectiveness of the proposed RB-PRF mechanism in image retrieval
- 7 July 2016
- Published by Association for Computing Machinery (ACM)
- p. 873-876
Open AccessImproving Retrieval Quality Using Pseudo Relevance Feedback in Content-Based Image Retrieval
The increased availability of image capturing devices has enabled collections of digital images to rapidly expand in both size and diversity. This has created a constantly growing need for efficient and effective image browsing, searching, and retrieval tools. Pseudo-relevance feedback (PRF) has proven to be an effective mechanism for improving retrieval accuracy. An original, simple yet effective rank-based PRF mechanism (RB-PRF) that takes into account the initial rank order of each image to improve retrieval accuracy is proposed. This RB-PRF mechanism innovates by making use of binary image signatures to improve retrieval precision by promoting images similar to highly ranked images and demoting images similar to lower ranked images. Empirical evaluations based on standard benchmarks, namely Wang, Oliva & Torralba, and Corel datasets demonstrate the effectiveness of the proposed RB-PRF mechanism in image retrieval