Please use this identifier to cite or link to this item: http://dspace2020.uniten.edu.my:8080/handle/123456789/21388
Title: Triangulating the implementation of hierarchical agglomerative clustering on MAR-learning usability data
Authors: Lim K.C.
Selamat A.
Mohamed Zabil M.H.
Yusoff Y.
Selamat M.H.
Alias R.A.
Puteh F.
Mohamed F.
Krejcar O.
#PLACEHOLDER_PARENT_METADATA_VALUE#
#PLACEHOLDER_PARENT_METADATA_VALUE#
#PLACEHOLDER_PARENT_METADATA_VALUE#
#PLACEHOLDER_PARENT_METADATA_VALUE#
#PLACEHOLDER_PARENT_METADATA_VALUE#
#PLACEHOLDER_PARENT_METADATA_VALUE#
#PLACEHOLDER_PARENT_METADATA_VALUE#
#PLACEHOLDER_PARENT_METADATA_VALUE#
#PLACEHOLDER_PARENT_METADATA_VALUE#
Issue Date: 2019
Abstract: This paper presents fractions of research outcome from a bigger project involving machine learning, Hierarchical Agglomerative Clustering (HAC) Algorithms on usability data gathered through performance and self-reported data. This paper highlights the common problems in usability studies where the conventional analysis was frequently utilized while prioritizing usability issues. The utilization of clustering techniques is limited in the area of this study. A previous publication has shown how HAC was used in clustering usability problems in Mobile Augmented Reality (MAR) learning applications. However, there has not been a triangulation effort to confirm the first gathered results due to small datasets. This research presents a methodology adopted from previous studies in confirming earlier usability analysis results. The experiments found consistent evidence approving the feasibility of HAC in clustering and prioritizing Usability performance and self-reported data. © 2019 The authors and IOS Press. All rights reserved.
URI: http://dspace2020.uniten.edu.my:8080/handle/123456789/21388
Appears in Collections:UNITEN Ebook and Article

Files in This Item:
File Description SizeFormat 
This document is not yet available.pdf
  Restricted Access
396.12 kBAdobe PDFView/Open    Request a copy
Show full item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.