SSSamerkae Somhom

Samerkae Somhom

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Samerkae Somhom has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A Semi-Automated Ontology Framework for Multi-Level Competency Mapping

    by Aomsap Inkong-Ngarm, Jakramate Bootkrajang, Samerkae Somhom, Areerat Trongratsameethong

    Aligning academic transcripts with occupational competency requirements remains challenging because course labels and job-skill terms are semantically ambiguous, role-specific, and difficult to explain. This paper proposes the Ontology Framework for Multi-level Competency Mapping (O4CM), a semi-automated framework integrating a Large Language Model (LLM) ensemble, Human-in-the-Loop (HITL) verification, Sentence-BERT (SBERT) semantic representation, the Path Consistency Index (PCI), and Total Accumulated Competency Score/Normalised Total Accumulated Competency Score (TACS/NTACS) ranking. O4CM was evaluated on a historical job-posting corpus and anonymised transcripts from five university programmes through ablation, sensitivity analysis, baseline comparison, and expert-labelled validation. The LLM ensemble reached high consensus for 21 of 22 Occupational Information Network (O*NET) knowledge-domain mappings (95.45%), each of which was subsequently expert-verified. In a computing-only expert-aligned analysis, the full framework most closely matched expert rankings across three data-domain roles. Within this dataset, ontology-path evidence can support more transparent competency ranking for educational advising and exploratory recruitment screening.

  • Orchids Classification Using Spatial Transformer Network with Adaptive Scaling

    by Watcharin Sarachai, Jakramate Bootkrajang, Jeerayut Chaijaruwanich, Samerkae Somhom


  • An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem

    by Kanokwatt Shiangjen, Jeerayut Chaijaruwanich, Wijak Srisujjalertwaja, Prakarn Unachak, Samerkae Somhom

    This article presents an efficient heuristic placement algorithm, namely, a bidirectional heuristic placement, for solving the two-dimensional rectangular knapsack packing problem. The heuristic demonstrates ways to maximize space utilization by fitting the appropriate rectangle from both sides of the wall of the current residual space layer by layer. The iterative local search along with a shift strategy is developed and applied to the heuristic to balance the exploitation and exploration tasks in the solution space without the tuning of any parameters. The experimental results on many scales of packing problems show that this approach can produce high-quality solutions for most of the benchmark datasets, especially for large-scale problems, within a reasonable duration of computational time.