搜索资源列表
M5PrimeLab
- M5PrimeLab是一种Matlab / Octave工具箱，可以利用M5的方法构建回归树和模型树。M5PrimeLab接受的输入变量是连续的、二进制和明确的,以及管理缺失值。-M5PrimeLab is a Matlab/Octave toolbox for building regression trees and model trees using M5 method. M5PrimeLab accepts input variables to be continuous, binar
Trees-J48-Java-Code
- 决策树算法J48的Java源程序，十大经典算法之一。eclipse环境下导入算法可进行数据分类。-J48 decision tree algorithm of Java source code, one of the top ten classical algorithm. eclipse environment can import data classification algorithms.
TreeRegression
- 树回归：对复杂的关系建模。一般可以分为两种，一种是回归树，一种是模型树， 主要的区别在于对于叶节点的建模方式，回归树使用分段常数，模型树使用线性回归方程。 可以使用剪枝技术对于可能过拟合的树进行剪枝，剪枝一般分为预剪枝和后剪枝。 回归树和模型树都是2元树，每次总是选择最好的分割方式，分成两部分。 这个是自己写的Python语言的CART树回归程序，基本实现了其原理，注释比较多。-Tree Regression: modeling of complex relationshi
Trees
- tree 与数据库连接展示 -tree tree treetree treetree treetree treetree tree
RANDOM FOREST
- Random Forest by Leo 13 Apr 2011 (Updated 11 Apr 2012) Creates an ensemble of cart trees similar to the matlab TreeBagger class. | Watch this File.
zuixiaofei-zuidaliu
- 文件中包括了最优化中的最小树最大流程序以及例子和程序-File included in the most optimal maximum flow procedures and examples of trees and procedures
ROAM
- ROAM implementation in javascr ipt using the three.js framework. This is uses binary triangle trees to dynamically tessellate the mesh in order to obtain level of detail terrain in real time.
treesys
- 利用神经网络分割树木，测量树木信息。可以计算出树木高度，胸径-Using neural network segmentation trees, trees measuring information
Ch03
- 决策树，实例：matlab实现使用决策树顶预测隐形眼镜类型。-Splitting datasets one feature at a time: decision trees
HybridPON
- This paper proposes a power efficient optical access network architecture that reduces OLT power consumption. Several PON trees are aggregated thanks to waveguide optical switches with nano second-order switching speed. The proposed network dynami
6091_Trees.tar
- Solution for the problem 6091 - Trees (ACM-ICPC Live Archive), uses Union-Find.
Roaming-System
- opengl和c++编写的教室场景漫游，教室外面有树木等，走不出教室。-opengl and c++ writing classroom scene roaming, there are trees outside the classroom, get out of the classroom.
RTree_2014
- R-Trees provide Log(n) speed rectangular indexing into multi-dimensional data. Based on his original implementation, I brought it up to date with ANCI specifications and added a nice fix for a degenerate case based on sphere volumes.
Hashing
- We’ll discuss the hash table ADT which supports only a subset of the operations allowed by binary search trees. The implementation of hash tables is called hashing. Hashing is a technique used for performing insertions, deletions and finds in con
tree1.cpp
- TREES PROGRAM IMPLEMENTAION DATA STRUCTRES
resouce
- 实现医院挂号系统及查询；链表及二叉树的构建及使用；用putchar自建输入输出；全排列；奇数魔方.希望站长采纳，谢谢！-Realization hospital registration system and inquiries Construction and use of linked lists and binary trees putchar self with input and output whole arrangement odd-Cube owners hope to
arboles_binarios_de_busqueda[1].2513
- binary search trees for java data structure
ssd5 opt 6
- Calculating "The Sum of Its Parts" Prerequisites, Goals, and Outcomes Prerequisites: Students should have mastered the following prerequisite skills. Trees - Knowledge of tree representation, particularly general hierarchies STL map contain
Algorithm-analysis
- 算法分析中经典例子，例如有Huffman编码、排列树、图等的详细代码。-The classic example of algorithm analysis, for example, Huffman coding, arranged trees, graphs and other details of the code.
TreePquestions
- This is about Data Structures Trees Binary