Information Architecture: Using Best Merge Method, Category Validity, and Multidimensional Scaling for Open Card Sort Data Analysis

Abstract

Open card sorting is a widely used method in HCI for the design of user-centered Information Architectures (IAs). This article proposes a new algorithm that combines the best merge method (BMM), category validity technique (CVT), and multidimensional scaling (MDS) to explore, analyze and visualize open card sort data. A study involving 20 participants and 41 cards explored the IA redesign of a university’s website. The collected data were analyzed using two popular methods employed in the quantitative analysis of open card sort data (i.e., hierarchical clustering, K-means) and the proposed algorithm. It was found that the latter provides increased IA insights compared to the existing methods. Specifically, the proposed algorithm can expose hidden patterns and relationships amongst cards and identify complexities. We also found that the proposed algorithm produces better initial clusters, which have a direct effect on the final clustering quality.