We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent a0e9ca9 commit 3fb0d6fCopy full SHA for 3fb0d6f
README.md
@@ -74,3 +74,6 @@ gSpan算法属于图挖掘算法领域。,主要用于频繁子图的挖掘,
74
75
* ### Chameleon
76
两阶段聚类算法。与CABDDCC算法相反,最后是通过对小簇集合的合并,形成最终的结果,在第一阶段主要是通过K近邻的思想形成小规模的连通图,第二阶段通过RI(相对互连性)和RC(相对近似性)来选一个最佳的簇进行合并。[详细介绍链接](http://blog.csdn.net/androidlushangderen/article/details/44569077)
77
+
78
+* ### RandomForest
79
+随机森林算法。算法思想是决策树+boosting.
0 commit comments