登录
首页 » Java » Random-Forest-master

Random-Forest-master

于 2016-04-11 发布 文件大小:566KB
0 285
下载积分: 1 下载次数: 6

代码说明:

  随机森林的代码实现,如何使用学会只用随机森林进行学习(Random forest code implementation, how to use learning to learn only random forest)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • N_feed_back
    生物反馈模拟,对米氏方程进行计算,并作出模拟图(a simulation for feedback)
    2020-10-16 22:17:29下载
    积分:1
  • sanzhuyuan
    平面波展开法计算二维三组元周期结构的带隙特性。(Plane wave expansion method for calculation of two dimensional three groups yuan cycle structure of the band gap characteristic)
    2021-04-17 17:08:52下载
    积分:1
  • wangluotuopu
    功能是将邻接矩阵或关联矩阵变为有向或者无向网络图,有结果显示。(Function is to convert the adjacency matrix or the correlation matrix becomes directed or undirected network diagram, results show.)
    2021-02-06 08:49:56下载
    积分:1
  • 三点求圆心
    说明:  通过三个点坐标,求出圆心坐标。C#代码,主要是算法。(Through the coordinates of three points, the coordinates of the center of the circle are obtained.)
    2020-07-24 07:07:27下载
    积分:1
  • FENZHI
    分支界限费用矩阵的说明文档,非常实用,建议下载哦(Branch line cost matrix documentation, very practical, it is recommended to download Oh)
    2013-09-13 14:24:50下载
    积分:1
  • nonliearvibration
    说明:  非线性振动教程,学习振动的学者们必须看的东西。(Nonlinear vibration tutorial, learning vibration scholars must look at things.)
    2008-11-10 16:15:30下载
    积分:1
  • nsga2code
    nondominated sorting genetic algorithms,nsga2的c语言源代码,比较好。(nondominated sorting genetic algorithms,nsga2 c-language source code better.)
    2010-02-21 21:04:45下载
    积分:1
  • triangulation
    说明:  三角形网格上的线性有限元方法求解Helmholtz问题,多项式重构以及Richardson外推(solve the Helmholtz equation with robin boundary condition on triangulation mesh, PPR and Richardson extrapolation)
    2020-06-16 07:20:01下载
    积分:1
  • na7
    Orthogonal Polynomials Approximation 数值分析,计算正交基多项式的系数 (Given a function f and a set of m >0 distinct points . You are supposed to write a function to approximate f by an orthogonal polynomial using the exact function values at the given m points with a weight assigned to each point . The total error must be no larger than a given tolerance. Format of function int OPA( double (*f)(double t), int m, double x[], double w[], double c[], double*eps ) where the function pointer double (*f)(double t) defines the function f int m is the number of points double x[] contains points double w[] contains the values of a weight function at the given points x[] double c[] contains the coefficients of the approximation polynomial double*eps is passed into the function as the tolerance for the error, and is supposed to be returned as the value of error. The function OPA is supposed to return the degree of the approximation polynomial. Note: a constant Max_n is defined so that if the total error is still not small enough when n = Ma)
    2011-11-27 11:47:21下载
    积分:1
  • smote
    smote过采样方法对不平衡数据集进行人工数据合成(smote oversampling and classification)
    2018-09-08 15:55:42下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载