知识卡片
句子关系图经过多次信息取舍
结构图:
flowchart LR
A[明确范围的正文] --> B[分句及词向量均值]
B --> C[零向量处理和归一]
C --> D[成对相似度]
D --> E[统一合法节点及两端标签]
E --> F[阈值或近邻筛边]
F --> G[无向图及可视化布局]
每一步都会改变覆盖、成本或图形;二维布局用于探索,不能当原始语义关系的精确测量。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
- · 用词嵌入推理
原书出处 · 1 处
- · 查看原书依据
6.4.6 Making connections In this section, we are going to construct what is known as a graph.57 The graph data structure is ideal for representing relations in data. At its core, a graph can be characterized as having entities (nodes or vertices) that are connected together by relationships or edges. Social networks are great examples of where the graph data structure is ideal to store
参考来源
- 位置:《Natural Language Processing in Action, Second Edition》第06章《用词嵌入推理》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Natural Language Processing in Action, Second Edition/_epub-src/OEBPS/Text/chapter-6.html)
- 结论依据:摘录中关于句子关系图经过多次信息取舍的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:6.4.6 Making connections In this section, we are going to construct what is known as a graph.57 The graph data structure is ideal for representing relations in data. At its core, a graph can be characterized as having entities (nodes or vertices) that are connected together by relationships or edges. Social networks are great examples of where the graph data structure is ideal to store