(第 26 期)   第十三卷第二期   2019 年 6 月 30 日出刊

不同卡片分類法效益比較之研究

A Study of Effectiveness Comparisons on Different Card Sorting Methods

本文關鍵字:卡片分類法修正型卡片分類法改進修正型卡片分類法資訊架構Card SortingModified Delphi Card SortingRefined Modified Delphi Card SortingInformation Architecture

本文摘要

卡片分類法一直以來是用以引出使用者認知最經濟且有效的方法之一,也因此被視為運用於以使用者為中心網站架構設計最常見的方法。 Nielson 指出卡片分類法最適當的參與人數是 15 人;Paul 則認為傳統卡片分類法在受試人數及分析時間上花費較多,故提出受試者 9 人以線性方式進行之修正型德菲式卡片分類法。為驗證改進 Paul 的方法,謝建成、吳怡青基於德菲法概念提出改進修正型德菲式卡片分類法,共有 9 位受試者,至多進行 3 回合。然而當運用卡片分類法於網站建構時,該選擇何者較為合適?其間效益成本差異如何?本研究擬以演算法分析方法探討比較不同片分類在時間成本與尋獲度效益間之優劣,並以實際實驗數據做為分析佐證,研究結果可作為後續選擇卡片分類運用之參考。

Card sorting has always been recognized as the most economical and effective method used to elicit users’ cognition. Therefore, it has been applied as the most common method to design libraries web information architectures based on user centered concepts. However, according to Nielsen’s study, to conduct card sorting experiments, the most appropriate number of participants is 15 people. Paul proposed that the traditional card sorting method spends more cost at the participant number and analysis time. Thus, he suggested applying the modified Delphi card sorting method to resolve the situation. In the modified Delphi card sorting method, there are about 9 (8~10) participants to conduct experiments in a linear fashion. Beside the seed participant, the rest were to revise the card sorting result made by the preceding participant. The final obtained result is regarded as the one of all of participants. However, Shieh and Wu put forward the refined modified Delphi card sorting method that is similar to the Delphi card sorting method. The refined modified Delphi card sorting method has a total of nine participants. But it limits rounds to at most 3. However, when applying card sorting methods to website construction, which one is appropriate? What are the differences in their effectiveness and cost? This study applied algorithm analysis method to explore the time cost differences between various card sorting methods and their performances in findability. We also conduct corresponding experiments to collect related data as evidence for analysis. The result can be as the reference for the future applications of card sorting methods.
本文附件:

本期同分類其他文章


本刊著作權屬於「中華民國圖書館學會」所有。
Powered By Vanilla Journal - 香草期刊系統 0.256 / 2006 - 2007 © Weizhong Yang