Heuristic evaluation
Summary
Heuristic evaluation is a form of usability inspection where usability specialists judge whether each element of a user interface follows a list of established usability heuristics. Expert evaluation is similar, but does not use specific heuristics.
Usually two to three analysts evaluate the system with reference to established guidelines or principles, noting down their observations and often ranking them in order of severity. The analysts are usually experts in human factors or HCI, but others, less experienced have also been shown to report valid problems.
A heuristic or expert evaluation can be conducted at various stages of the development lifecycle, although it is preferable to have already performed some form of context analysis to help the experts focus on the circumstances of actual or intended product usage.
Benefits
The method provides quick and relatively cheap feedback to designers. The results generate good ideas for improving the user interface. The development team will also receive a good estimate of how much the user interface can be improved.
There is a general acceptance that the design feedback provided by the method is valid and useful. It can also be obtained early on in the design process, whilst checking conformity to established guidelines helps to promote compatibility with similar systems.
It is beneficial to carry out a heuristic evaluation on early prototypes before actual users are brought in to help with further testing.
Usability problems found are normally restricted to aspects of the interface that are reasonably easy to demonstrate: use of colours, lay-out and information structuring, consistency of the terminology, consistency of the interaction mechanisms. It is generally agreed that problems found by inspection methods and by performance measures overlap to some degree, although both approaches will find problems not found by the other.
The method can seem overly critical as designers may only get feedback on the problematic aspects of the interface as the method is normally not used for the identification of the 'good' aspects.
Method
This method is to identify usability problems based on established human factors principles. The method will provide recommendations for design improvements. However, as the method relies on experts, the output will naturally emphasise interface functionality and design rather than the properties of the interaction between an actual user and the product.
Planning
The panel of experts must be established in good time for the evaluation. The material and the equipment for the demonstration should also be in place. All analysts need to have sufficient time to become familiar with the product in question along with intended task scenarios. They should operate by an agreed set of evaluative criteria.
Running
The experts should be aware of any relevant contextual information relating to the intended user group, tasks and usage of the product. A heuristics briefing can be held to ensure agreement on a relevant set of criteria for the evaluation although this might be omitted if the experts are familiar with the method and operate by a known set of criteria.
The experts then work with the system preferably using mock tasks and record their observations as a list of problems. If two or more experts are assessing the system, they should not communicate with one another until the assessment is complete. After the assessment period, the analysts can collate the problem lists and the individual items can be rated for severity and/or safety criticality.
Reporting
A list of identified problems, which may be prioritised with regard to severity and/or safety criticality is produced.
In terms of summative output the number of found problems, the estimated proportion of found problems compared to the theoretical total, and the estimated number of new problems expected to be found by including a specified number of new experts in the evaluation can also be provided.
A report detailing the identified problems is written and fed back to the development team. The report should clearly define the ranking scheme used if the problem lists have been prioritised.
More Information
Nielsen, Jakob. How to Conduct a Heuristic Evaluation
Variations
Three to five experts are recommended for a thorough evaluation. A quick review by one expert (often without reference to specific heuristics) is usual before a user-based evaluation to identify potential problems.
If usability experts are not available, other project members can be trained to use the method, which is useful in sensitising project members to usability issues.
Background Reading
Bias, R.G. and Mayhew, D.J. (Eds.). Cost justifying usability. Academic Press, 1994, pp.251-254.
Nielsen, J. (1992). Finding usability problems through heuristic evaluation. Proc. ACM CHI'92 (Monterey, CA, 3-7 May), pp. 373-380.
Nielsen, J. & Landauer, T. K. (1993). A Mathematical Model of Finding of Usability Problems. Proc. INTERCHI '93 (Amsterdam NL 24-29 April),
相关推荐
启发式评估十条可用性原则,启发式评估(heuristic evaluationx) ⼗十条可⽤用性原则:
mi349_heuristic_evaluation
用于解决TSP的启发式算法的matlab程序,包含模拟退火算法与遗传算法。
本资源包含SAP-PPDS 自开发启发式的配置和开发两部分内容,完整版示例代码,代码也有详细的注释,超级稀有!
人工智能英文PPT第3章 Heuristic Search 启发式搜索 启发式搜索就是带有信息的搜索 Heuristic or informed search exploits additional knowledge about the problem that helps direct search to more promising ...
基于次声波匹配显示的孔雀元启发式搜索算法_A Meta-Heuristic Search Algorithm based on Infrasonic Mating Displays in Peafowls.pdf
这个是我的一次作业,使用prolog编写的颜色板游戏。 算法用的是启发式搜索的A算法。code可以作为用A算法写prolog程序的样本,只需要略作修改。
heuristic-algorithm 启发式算法总结 分别用遗传算法,粒子群算法,模拟退火算法实现了一些demo
任意维度欧几里得斯坦纳最小树的启发式欧几里得斯坦纳最小树 (ESTP) 问题寻求一个总边长最小的网络,该网络跨越一组 n 个端点,同时允许插入额外的点(斯坦纳点)以减少网络的总长度。 该软件使用启发式方法为任何...
一种改进的启发式蚁群算法(论文) An Improved Heuristic Ant-Clustering Algorithm
启发式测试策略模型(HeuristicTestStrategyModel,简称HTSM)是测试专家JamesBach提出的一组帮助测试设计的指南(guideline)。本文将介绍HTSM的内容与应用。 启发式测试策略模型(HeuristicTestStrategyModel,简称...
一个是基于经典的最短路径树的组播算法(shortest path tree algorithm,SPTA),另一个是基于能量函数的组播启发式算法(energy function based heuristic algorithm,EFHA)。这两个算法都在考虑了认知无线电网络...
为图形(对称)TSP 实现的著名 Lin-Kernighan 启发式算法的 java 实现。 特征 它实现了与 Shen Lin 和 Brian Kernighan 在其原始论文“An Effective Heuristic Algorithm for the Traveling-Salesman Problem”中...
HeuristicAlgorithm(补分启发式算法,包括神经网络、模拟退火、遗传算法)实例+数据 先看是否需要再下载:https://blog.csdn.net/qq_17623363/article/details/104778300
基于启发式算法(Heuristic Algorithm, HA)与修复遗传算法(Repairing Genetic Algorithm, RGA)相结合的文化基因算法(Memetic Algorithm, MA)是一种较为迅速的最优算法
旅行_推销员_启发式TSP启发式和元启发式类的启发式的一些实现1.建设性启发式: Clarke-Wright节省启发式的Python实现。 集线器节点是文件的第一个。 <<<<<<< HEAD 编译示例: python3 tp1.py ....
A heuristic particle swarm optimization,A heuristic particle swarm optimization
工程优化中的元启发式和进化算法,元启发式算法是独立于问题的算法,一般起源于自然观测,常见有遗传算法,粒子群优化等,本书对于目前性能最好的一系列算法基本进行介绍。
了解多目标启发一些超启发的代码合集工程参考
ckc-启发式 电容性顶点K中心问题的建设性启发法 第一次需要使用conanfile.txt中包含的相应库来安装conan软件包管理器。 安装柯南和库 pip3 install conan 重新加载本地路径 source ~/.profile GCC编译器> = 5.1的...