关于「异议判别树:三句话背后的六个隐因」,《异议柔道与定金锁单》给出的定量结论是什么?

结论:第一章的判别树说明,在示意先验下,说「太贵了」的人有 0.734 并不缺钱。

数据口径:书中的顾客群、概率与金额均为示意;全部计算由书中程序生成;本书不构成个人化的法律、财务或投资建议,只讨论守规矩的说服。 第一章的判别树说明,在示意先验下,说「太贵了」的人有 0.734 并不缺钱。

English version

对照数据表

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

prior entropy H(C)2.528 bits
objection P(O) budget value compare timing partner decline H
too expensive0.395 0.266 0.285 0.209 0.038 0.025 0.177 2.25
most probable cause: value (0.285); not budget0.734
let me think0.320 0.070 0.234 0.117 0.281 0.078 0.219 2.40
most probable cause: timing (0.281); not budget0.930
ask my partner0.143 0.053 0.088 0.053 0.105 0.421 0.281 2.14
most probable cause: partner (0.421); not budget0.947
查看完整验算程序
# Chapter 1. p11: Posterior over six hidden causes behind three surface
# objections: "too expensive", "let me think" and "ask my partner".
# Model: a discrete Bayes net, cause C -> objection O. Priors P(C) and
# likelihoods P(O | C) are illustrative, set by the author for a
# mid-priced consultative sale (a course, a renovation, a service plan).
# Output: P(O), P(C | O) for each objection, the most probable cause
# and the uncertainty left, H(C | O), in bits.
import math

CAUSES = ["budget", "value", "compare", "timing", "partner", "decline"]
PRIOR = [0.15, 0.25, 0.15, 0.15, 0.10, 0.20]
# P(objection | cause). Columns: too expensive, let me think,
# ask my partner, any other remark (so that every row adds to one).
LIK = [
    [0.70, 0.15, 0.05, 0.10],
    [0.45, 0.30, 0.05, 0.20],
    [0.55, 0.25, 0.05, 0.15],
    [0.10, 0.60, 0.10, 0.20],
    [0.10, 0.25, 0.60, 0.05],
    [0.35, 0.35, 0.20, 0.10],
]
OBJ = ["too expensive", "let me think", "ask my partner"]

assert abs(math.fsum(PRIOR) - 1.0) < 1e-12
for row in LIK:
    assert abs(math.fsum(row) - 1.0) < 1e-12


def entropy(p):
    return -math.fsum(x * math.log2(x) for x in p if x > 0)


print("prior entropy H(C) = {:.3f} bits".format(entropy(PRIOR)))
print("{:<15}{:>6}".format("objection", "P(O)")
      + "".join("{:>8}".format(c) for c in CAUSES) + "{:>6}".format("H"))
for j, name in enumerate(OBJ):
    joint = [PRIOR[i] * LIK[i][j] for i in range(len(CAUSES))]
    po = math.fsum(joint)
    post = [x / po for x in joint]
    print("{:<15}{:>6.3f}".format(name, po)
          + "".join("{:>8.3f}".format(x) for x in post)
          + "{:>6.2f}".format(entropy(post)))
    top = max(range(len(CAUSES)), key=lambda i: post[i])
    print("   most probable cause: {} ({:.3f}); not budget: {:.3f}".format(
        CAUSES[top], post[top], 1.0 - post[0]))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《顾问式销售异议柔道、价格嫌贵贝叶斯拆解与定金锁单停时协议》第 1 章「异议判别树:三句话背后的六个隐因」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-146 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026146,
  author    = {Fan, Yafu},
  title     = {Consultative Objection Judo, a Bayesian Decomposition of "Too Expensive" and Deposit-Lock Stopping-Time Protocols},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论