关于「决定与指向:席克—海曼定律与菲茨定律」,《计算美学与界面认知工程》给出的定量结论是什么?

结论:席克 1952 年的 \(\log(n+1)\) 中的 \(+1\) 对应「无信号」备择;海曼 1953 年的熵 \(H = \sum p_i\log_2(1/p_i)\) 不加 1。作者框架中的 \(\sum p_i\log_2(1/p_i + 1)\) 在等概时等于 \(\log_2(n+1)\),不等概时两种定律都不是,应改用海曼熵。席克—海曼定律描述已知目标时的决策,不描述在陌生标签中的搜索,其斜率随练习与相容性而变。菲茨原式在 \(D/W < 1/2\) 时为负,界面中应用香农式。把搜索、决策与指向相加的「最小化」只在写明变量、概率分布与用户类型之后才有意义:在对数式下,最优宽度与点击概率成正比,期望难度等于一个常数加海曼熵;新手的总时间近似线性、熟练用户近似对数,二者的最优设计不同。

数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的模型和假说;书中所有页面、品牌与数据都是虚构或模拟的。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库

A. bitsHick log2(n+1)Hyman Hframeworkframe - H
uniform n = 21.5851.0001.5850.585
uniform n = 42.3222.0002.3220.322
uniform n = 83.1703.0003.1700.170
8 items, Zipf s = 13.1702.6202.8830.263
8 items, Zipf s = 23.1701.6852.2080.523
8 items, one at 0.933.1700.5621.4460.883
2 items, 0.99 / 0.011.5850.0811.0640.983
1 item1.0000.0001.0001.000
B. fits to data generated by Hyman's law (1,600 trials, 8 menus)
Hyman H a = 200.0 ms b = 149.7 ms/bit R^2 = 0.985
framework a = -3.5 ms b = 208.4 ms/bit R^2 = 0.979
Hick log2(n+1) a = 84.8 ms b = 133.6 ms/bit R^2 = 0.491

核心公式

\[RT = a + bH,\qquad H = \sum_{i=1}^{n} p_i\log_2\frac{1}{p_i}.\]
查看完整验算程序
# Three ways of writing the "decision entropy" in the Hick-Hyman law RT = a + b H.
#   Hick (1952):   H = log2(n + 1)           (+1: the extra "no signal" alternative)
#   Hyman (1953):  H = sum p_i log2(1/p_i)   (Shannon entropy, no +1)
#   framework:     H = sum p_i log2(1/p_i + 1)
# A: the three on uniform and skewed menus. B: synthetic choice-RT data generated by
# Hyman's law (a = 200 ms, b = 150 ms/bit, noise sd 20 ms; illustrative values), fitted
# by least squares with each measure as predictor.
import math, random, statistics

def hick(p):  return math.log2(len(p) + 1)
def hyman(p): return sum(q * math.log2(1 / q) for q in p if q > 0)
def frame(p): return sum(q * math.log2(1 / q + 1) for q in p if q > 0)

def zipf(n, s=1.0):
    w = [1 / (k + 1) ** s for k in range(n)]; t = sum(w)
    return [x / t for x in w]

MENUS = [("uniform n = 2", [.5, .5]), ("uniform n = 4", [.25] * 4),
         ("uniform n = 8", [.125] * 8), ("8 items, Zipf s = 1", zipf(8)),
         ("8 items, Zipf s = 2", zipf(8, 2)), ("8 items, one at 0.93", [.93] + [.01] * 7),
         ("2 items, 0.99 / 0.01", [.99, .01]), ("1 item", [1.0])]

def fit(x, y):
    mx, my = statistics.fmean(x), statistics.fmean(y)
    b = sum((u - mx) * (v - my) for u, v in zip(x, y)) / sum((u - mx) ** 2 for u in x)
    a = my - b * mx; ss = sum((v - a - b * u) ** 2 for u, v in zip(x, y))
    return a, b, 1 - ss / sum((v - my) ** 2 for v in y)

if __name__ == "__main__":
    print("A. bits                       Hick log2(n+1)  Hyman H  framework  frame - H")
    for name, p in MENUS:
        print(f"   {name:24s} {hick(p):14.3f} {hyman(p):8.3f} {frame(p):10.3f}"
              f" {frame(p) - hyman(p):10.3f}")
    rng = random.Random(1953); x = {"hick": [], "hyman": [], "frame": []}; y = []
    for name, p in MENUS:
        for _ in range(200):
            y.append(200 + 150 * hyman(p) + rng.gauss(0, 20))
            for k, f in (("hick", hick), ("hyman", hyman), ("frame", frame)):
                x[k].append(f(p))
    print("B. fits to data generated by Hyman's law (1,600 trials, 8 menus)")
    for k, lab in (("hyman", "Hyman H"), ("frame", "framework"),
                   ("hick", "Hick log2(n+1)")):
        a, b, r2 = fit(x[k], y)
        print(f"   {lab:15s} a = {a:6.1f} ms  b = {b:6.1f} ms/bit  R^2 = {r2:.3f}")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《计算美学、视觉显著性图谱与人机界面认知工程》第 2 章「决定与指向:席克—海曼定律与菲茨定律」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23836258

DOI: 10.5281/zenodo.23836258 · 阅读本章所在专著 · 5DL-B-046 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026046,
  author    = {Fan, Yafu},
  title     = {Computational Aesthetics, Visual Saliency Maps and Cognitive Ergonomics in User Interface Design},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.23836258},
  url       = {https://doi.org/10.5281/zenodo.23836258}
}

本书其他章节结论