摘要
卡片分类法是引出用户认知最经济最有效的方法之一,因此被视为以用户为中心的网站结构设计最常见的方法。传统卡片分类法在参与人数及分析时间上花费较多,故提出以线性方式进行的修正型德菲式卡片分类法,后又提出多回合的改进修正型德菲式卡片分类法。为分析三种卡片分类法的优劣,文章以演算法模式分析并利用实际实验收集资料分析验证。结果显示,在考虑时间为主要成本的情况下,改进修正型德菲式卡片分类法是较佳的选择。
Card sorting has always been recognized as the most economical and effective method used to elicit users’cognition.It is the most common method that has been applied to the design of user-centered website architecture in libraries.However,the traditional card sorting method is quite time-consuming and strenuous.Therefore,the author of this paper offers a modified delphi card sorting method in a linear way to address the problems and then restore to a multi-round refined modified delphi card sorting method.Experiments have been done to collect data and an algorithm analysis used to evaluate the three card sorting methods.Results show that the refined modified Delphi card sorting method is the most advanced when time cost is given priority.
出处
《图书馆研究与工作》
2020年第12期23-28,共6页
Library Science Research & Work
关键词
卡片分类法
修正型卡片分类法
改进修正型卡片分类法
演算法
信息结构
成本效益
card sorting
modified delphi card sorting
refined modified delphi card sorting
algorithm
information architecture
cost-effective