关于「反例与假相关的清洗:巴纳姆效应、多重检验与数据窥探」,《离散周期网络与占位熵》给出的定量结论是什么?

结论:巴纳姆效应说明「觉得准」不是证据:福勒的学生给一份人人相同的笼统描述打出约 4.3 分(满分 5 分)。卡尔森 1985 年的双盲检验中,占星师的第一选择命中约 34%,与随机的三分之一无异;埃特尔的重新分析有争议,迪恩与凯利的综述与时间双胞胎研究同样是阴性的;对干支命理,作者没有找到同类检验。在不含任何效应的纯噪声中,176 次检验平均产生 8.8 个「显著」模式,每一段历史都有「发现」;前半段最显著的模式在后半段平均 \(t = 0.00\)。数据窥探要用「全部被考虑过的模型」作零分布来校正;零分布还必须尊重时间结构,否则对连续的标签,假阳性率可以翻倍。下一章回到这些规则的文献出处。

数据口径:本书是教学与研究用的数学模型,不是投资、交易、税务或法律建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(17 段程序,全部核对)、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.00, 176, 8.8

tests per history176; histories: 2000
mean 'significant' patterns at p < 0.05, uncorrected8.8
share of histories with at least one discovery:
uncorrected 100%, Bonferroni 3.6%, Benjamini-Hochberg 3.7%
best pattern in the first 48 years: mean |t|2.85
same pattern in the last 48 years: mean t = +0.00; still t > 1.96 in 2.5%
查看完整验算程序
# Pattern mining on PURE NOISE: 96 x 12 = 1,152 independent N(0, 1) months. Every value
# of seven calendar labels is tested against all other months (normal-approximation
# t test): 176 tests per history.
import math, random
from statistics import NormalDist
YEARS, Y0 = 96, 6                       # first year = index 6 in the cycle (Geng-Wu)
PHI = NormalDist().cdf

def labels(T):
    y, m = divmod(T, 12)
    yk = (y + Y0) % 60; mk = (12 * (y + Y0) + m + 2) % 60
    return {"year stem": yk % 10, "year branch": yk % 12, "year cycle no.": yk,
            "month stem": mk % 10, "month branch": mk % 12, "month cycle no.": mk,
            "offset d": (mk % 12 - yk % 12) % 12}

LAB = [labels(T) for T in range(12 * YEARS)]

def tests(x, idx):
    """Return list of (name, t, p) for every class of every label over months idx."""
    out = []
    for fam in LAB[0]:
        groups = {}
        for i in idx:
            groups.setdefault(LAB[i][fam], []).append(x[i])
        tot, n = sum(x[i] for i in idx), len(idx)
        ss = sum(x[i] ** 2 for i in idx)
        for c, g in groups.items():
            k = len(g); m1 = sum(g) / k; m0 = (tot - sum(g)) / (n - k)
            var = (ss - tot * tot / n) / (n - 1)
            t = (m1 - m0) / math.sqrt(var * (1 / k + 1 / (n - k)))
            out.append((f"{fam} {c}", t, 2 * (1 - PHI(abs(t)))))
    return out

def bh(ps, q=0.05):
    s = sorted(ps); m = len(ps)
    k = max([i + 1 for i, p in enumerate(s) if p <= q * (i + 1) / m], default=0)
    return k

def experiment(H=2000, seed=1995):
    """H pure-noise histories: discoveries per history and the best in-sample pattern."""
    rng = random.Random(seed); counts, best_in, best_out = [], [], []
    fw_bonf = fw_bh = 0
    for h in range(H):
        x = [rng.gauss(0, 1) for _ in range(12 * YEARS)]
        res = tests(x, range(12 * YEARS)); ps = [p for _, _, p in res]; m = len(ps)
        counts.append(sum(p < 0.05 for p in ps))
        fw_bonf += any(p < 0.05 / m for p in ps); fw_bh += bh(ps) > 0
        half = 12 * YEARS // 2
        second = {nm: t for nm, t, _ in tests(x, range(half, 12 * YEARS))}
        first = [r for r in tests(x, range(half)) if r[0] in second]
        name, t1, _ = max(first, key=lambda r: abs(r[1])); t2 = second[name]
        best_in.append(abs(t1)); best_out.append(t2 * (1 if t1 > 0 else -1))
    return m, counts, fw_bonf, fw_bh, best_in, best_out

if __name__ == "__main__":
    H = 2000
    m, counts, fw_bonf, fw_bh, best_in, best_out = experiment(H)
    raw = sum(counts); fw_raw = sum(c > 0 for c in counts)
    print(f"tests per history: {m}; histories: {H}")
    print(f"mean 'significant' patterns at p < 0.05, uncorrected: {raw / H:.1f}")
    print("share of histories with at least one discovery:")
    print(f"   uncorrected {fw_raw / H:.0%}, Bonferroni {fw_bonf / H:.1%},"
          f" Benjamini-Hochberg {fw_bh / H:.1%}")
    print(f"best pattern in the first 48 years: mean |t| = {sum(best_in) / H:.2f}")
    print(f"same pattern in the last 48 years:  mean t = {sum(best_out) / H:+.2f};"
          f" still t > 1.96 in {sum(t > 1.96 for t in best_out) / H:.1%}")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《离散周期网络中的双尺度重整化、占位数分布熵与推力波叠加定理》第 6 章「反例与假相关的清洗:巴纳姆效应、多重检验与数据窥探」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23796761

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

BibTeX
@book{fan2026037,
  author    = {Fan, Yafu},
  title     = {Two-Scale Renormalization, Occupancy Entropy and Thrust-Wave Superposition in Discrete Cyclical Networks},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.23796761},
  url       = {https://doi.org/10.5281/zenodo.23796761}
}

本书其他章节结论