未验证 提交 af7ae58e 编写于 作者: rictjo's avatar rictjo 提交者: GitHub

Update README.md

上级 7ff91e79
......@@ -789,8 +789,8 @@ We study the results below
```
We see that the only difference for these two examples are how the unclustered indices are treated. In our method they are set to the identity distance value of zero while scipy attributes them the lowest non diagonal value in the distance matrix.
## 14.2 Connectivity construction
Now we employ the `connectivity` algorithm for construction. In the below code segment the first loop calls the function directly and the second calls the `impetuous.hierarchy_matrix` function
## 14.2 Connectivity hierarchy construction
Now we employ the `connectivity` algorithm for construction of the hierarchy. In the below code segment the first loop calls the function directly and the second calls the `impetuous.hierarchy_matrix` function
```
import impetuous.hierarchical as imph
from impetuous.clustering import connectivity
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册