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

Samuel Ong

dblp:77/5657 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 1

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
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
AAAI5
2008 Secure Certification for ePortfolios
abstract
Students often build up portfolios of their achievements as they study and present them when they apply for jobs or for further study. Of increasing interest is the concept of an online "ePortfolio" which enables greater power and flexibility in displaying achievements. However, the issue of cheating needs to be addressed, especially where certificates of attainment are being presented. An eCertification project, named ldquoeCertrdquo, has recently been run at Southampton in order to explore these issues. This paper documents how we approach the validation of applicants' claims of attainment.
Lisha Chen-Wilson, Patrick Newcombe, Piers Royce, Samuel Ong, Timothy Wonnacott, Gary B. Wills, David Argles
ICALT4