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

Adam Westerski

dblp:77/5994 · also Adam Maciej Westerski · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
2since 2021 · last 2025
0000-0002-1627-8053ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 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.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%

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

TopicWeightPapersLastEvidence papers
Data mining › pattern mining › matrix pattern mining
biclique mining
0.512021
Using Unsupervised Learning for Data-driven Procurement Demand Aggregation · AAAI 2021
Data mining
clustering
0.512021
Using Unsupervised Learning for Data-driven Procurement Demand Aggregation · AAAI 2021
Data mining › clustering › high-dimensional clustering
subspace clustering
0.512021
Using Unsupervised Learning for Data-driven Procurement Demand Aggregation · AAAI 2021

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

unsupervised learning · 1.0bipartite graph model · 1.0
YearPublicationVenuePosition
2025 Synthetic Data for Object Detection with Neural Networks: State-of-the-Art Survey of Domain Randomisation Techniques
abstract
Machine learning relies heavily on access to large and well-maintained datasets. In this article, we focus on Computer Vision and object detection applications to survey past research on automatic generation of annotated datasets that does not require costly and time-consuming human labelling. In specific, we analyse research done in the area of Domain Randomisation applied to Neural Networks predominant in object detection since the last decade. We propose a set of criteria for comparison of previously published works, and utilise these criteria to make conclusions about various trends in the area, similarities/differences and key discoveries made since conception. The purpose of this work is to advise practitioner on leading solutions and help researchers gain better understanding of the landscape. The key takeaways from our analysis show the current state-of-the-art solutions within the mid-quartile range allow object detection with typically about 1%–25% performance decrease in comparison to manually annotated datasets; while the top performant approaches above the upper quartile gain about 2%–32% lead over real data training in their specific application areas. Our survey shows the future outlook is more research into 3D generation techniques, with most innovative yet complex techniques related to end-to-end modifications of entire network architectures to suit synthetic data training.
Adam Westerski, Wee Teck Fong
ACM Trans. Multim. Comput. Commun. Appl.1
2021 Using Unsupervised Learning for Data-driven Procurement Demand Aggregation
abstract
Procurement is an essential operation of every organization regardless of its size or domain. As such, aggregating the demands could lead to better value-for-money due to: (1) lower bulk prices; (2) larger vendor tendering; (3) lower shipping and handling fees; and (4) reduced legal and administration overheads. This paper describes our experience in developing an AI solution for demand aggregation and deploying it in A*STAR, a large governmental research organization in Singapore with procurement expenditure to the scale of hundreds of millions of dollars annually. We formulate the demand aggregation problem using a bipartite graph model depicting the relationship between procured items and target vendors, and show that identifying maximal edge bicliques within that graph would reveal potential demand aggregation patterns. We propose an unsupervised learning methodology for efficiently mining such bicliques using a novel Monte Carlo subspace clustering approach. Based on this, a proof-of-concept prototype was developed and tested with the end users during 2017, and later trialed and iteratively refined, before being rolled out in 2019. The final performance was 71% of past cases transformed into bulk tenders correctly detected by the engine; for new opportunities pointed out by the engine 81% were deemed useful for potential bulk tender contracts in the future. Additionally, per each valid pattern identified, the engine achieved 100% precision (all aggregated purchase orders were correct), and 79% recall (the engine correctly identified 79% of orders that should have been put into the bulk tenders). Overall, the cost savings from the true positive contracts spotted so far are estimated to be S$7 million annually.
Eran Shaham, Adam Westerski, Kanagasabai Rajaraman, Amudha Narayanan, Samuel Ong, Jiayu Wong, Manjeet Singh
AAAI2
2015 Prediction of Enterprise Purchases Using Markov Models in Procurement Analytics Applications
abstract
Procurement is a set of activities and processes related to acquisition of goods and services through purchase orders placed by organization employees,from external contractors. Thisarticle describes practical experiments with procurement dataset of a major governmental organization in Singapore. In particular, we highlight the problems that emerge when trying to implement analytics for prediction of future purchases. The goal of such analytics is to deliver beneficial information to procurement office that plans and manages relationships with external sellers. In the article we describe the characteristics of the procurement dataset specifics and its implications on the future purchase problem that we attempt to solve using Markov chains model. Our analysis showshigh diversity of purchase descriptionsresulting in low ability to detect sequential patterns of purchasing officers. The solution presented in the article is additional dataset preprocessing involving use of hierarchical clustering. Our experiments with various similarity measures show an improvement allowing a practical deployment within our procurement analytics system prepared for the case study governmental organization.
Adam Westerski, Kanagasabai Rajaraman, Jiayu Wong, Henry Chang
KES1
2013 Classifying and comparing community innovation in Idea Management Systems
Adam Westerski, Theodore Dalamagas 0001, Carlos Angel Iglesias
Decis. Support Syst.1
2012 Idea relationship analysis in open innovation crowdsourcing systems
abstract
Idea Management Systems are an implementation of open innovation notion in the Web environment with the use of crowdsourcing techniques. In this area, one of the popular methods for coping with large amounts of data is duplicate detection. With our research, we answer a question if there is room to
Adam Westerski, Carlos Angel Iglesias, Javier Espinosa Garcia
CollaborateCom1
2009 Integrated Environment for Visual Data-Level Mashup Development
Adam Westerski
WISE1