Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Alan Woodley

dblp:90/6829 · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
0since 2021 · last 2019
0000-0002-3122-0247ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorHuman-computer interaction and ubiquitous computing · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%
Databases, data mining, and information retrieval
1 paper
Data integration and cleaning · 100%
Human-computer interaction and pervasive computing
1 paper
Ubiquitous computing and smart environments · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational social science and digital humanities
social media analysis
0.212016
WIMBY: What's in My Backyard? · ACM Multimedia 2016
Data integration and cleaning › data fusion
multi-source data fusion
0.212016
WIMBY: What's in My Backyard? · ACM Multimedia 2016

Methods — techniques the papers use, named apart from their topics

spatiotemporal analysis · 0.8data fusion · 0.8
YearPublicationVenuePosition
2019 High Resolution Change Detection Using Planet Mosaic
abstract
This paper presents a change detection system using Planet's mosaic dataset. This dataset has higher resolution but fewer bands than data captured from Landsat or Sentinel satellites. Here, an object-based random forest regressor is used to detect vegetation change. The mosaic was separated into individual images, which were then ranked in a list. Results indicate adequate performance with a tradeoff in precision and recall.
Alan Woodley, Connor McLaughlin, Holly Hutson, Shlomo Geva, Timothy Chappell, Wayne Kelly, Dimitri Perrin, Wageeh W. Boles, Lance De Vine
IGARSS1
2019 Parallel K-Tree: A multicore, multinode solution to extreme clustering
Alan Woodley, Ling-Xiang Tang, Shlomo Geva, Richi Nayak, Timothy Chappell
Future Gener. Comput. Syst.1
2016 Using parallel hierarchical clustering to address spatial big data challenges
abstract
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.
Alan Woodley, Ling-Xiang Tang, Shlomo Geva, Richi Nayak, Timothy Chappell
IEEE BigData1
2016 WIMBY: What's in My Backyard?
abstract
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.
Michael Dorkhom, Alan Woodley, Shlomo Geva, Richi Nayak
ACM Multimedia2
2005 ComRank: Metasearch and Automatic Ranking of XML Retrieval System
abstract
Different information retrieval (IR) systems often return very diverse results lists for the same query. This is problematic for users since no one IR system works best for every scenario, and it is difficult for the user to know which system will work best a priori. The challenge of metasearch is to merge results lists from several IR systems, with the goal of outperforming each of the constituent systems. This paper presents ComRank, a metasearch system that discriminates in favour of results that (1) originate by consensus amongst several systems; (2) are highly ranked in their original systems and (3) originate from the better performing systems. Importantly, ComRank determines the `better' performing systems without the need for human judgements. Rather, it uses an automatic assessment process that ranks systems by their pseudo-relevance, as derived from highly ranked results in ComRank's list. We apply our methods to the INEX Collection, which is an unexplored domain for these methods, and show that they are comparable to or better than baseline alternatives
Alan Woodley, Shlomo Geva
CW1
2005 Applying Transformation-Based Error-Driven Learning to Structured Natural Language Queries
abstract
XML information retrieval (XML-IR) systems aim to provide users with highly exhaustive and highly specific results. To interact with XML-IR systems, users must express both their content and structural requirement, in the form of a structured query. Traditionally, these structured queries have been formatted using formal languages such as XPath or NEXI. Unfortunately, formal query languages are very complex and too difficult to be used by experienced, let alone casual users. Therefore, recent research has investigated the idea of specifying users' content and structural needs via natural language queries (NLQs). In previous research we developed NLPX, a natural language interface to an XML-IR system. Here we present additions we have made to NLPX. The additions involve the application of transformation-based error-driven learning (TBL) to structured NLQs, to derive special connotations and group words into an atomic unit of information. TBL has successfully been applied to other areas of natural language processing; however, this paper presents the first time it has been applied to structured NLQs. Here, we investigate the applicability of TBL to NLQs and compare the TBL-based system, with our previous system and a system with a formal language interference. Our results show that TBL is effective for structured NLQs, and that structured NLQs a viable interface tor XML-IR systems
Alan Woodley, Shlomo Geva
CW1