-
先验频繁项集挖掘
这是 apriori 算法的数据挖掘工具。 c# 和.NET 2.0,很容易理解,您可以重写它,使它更有效率。
- 2022-04-02 06:52:46下载
- 积分:1
-
数据结构:队列程序
数据结构:队列程序-data structure : queue procedures
- 2022-08-25 11:06:13下载
- 积分:1
-
This is a decision tree classifiers on which the original algorithm C4.5 procedu...
这是一个有关决策树分类器中C4.5算法的原程序-This is a decision tree classifiers on which the original algorithm C4.5 procedures
- 2022-05-21 01:16:40下载
- 积分:1
-
随着市场经济的快速发展,国内医药企业…
随着市场经济的迅猛发展,国内医药企业的竞争也日趋激烈。企业内部的信息管理急需信息化。针对鑫诚药业有限公司的业务情况和企业发展的要求,设计并建立该公司的医药基础信息管理系统。解决企业对于药品信息、员工信息、客户信息以及供应商信息的管理问题。通过该系统,可以快速的获取有关药品、员工、客户及供应商的基础信息。-With the rapid development of market economy, the domestic pharmaceutical enterprises and competition is increasingly fierce. Enterprise information management in urgent need of information technology. Cheng Xin Pharmaceutical Co., Ltd. for the business situation and business requirements of the development, design and build the basis of the company
- 2022-03-10 04:31:35下载
- 积分:1
-
实现一个B*Tree的添加和查找,输入数据为一组字典文件
实现一个B*Tree的添加和查找,输入数据为一组字典文件-achieve a B* Tree Search and the addition, the input data for a group of documents dictionary
- 2022-01-25 20:47:50下载
- 积分:1
-
- 2022-10-22 01:40:06下载
- 积分:1
-
图的建立和图的广度深度优先遍历(有向图和无向图)
图的建立和图的广度深度优先遍历(有向图和无向图)-Map creation and map the breadth of depth-first traversal (with the map and undirected graph)
- 2022-05-29 10:00:23下载
- 积分:1
-
closest point of the problem, realizing the partition method, random number gene...
最接近点对问题,分治法实现,随机生成N个数寻找最短路径的两个点-closest point of the problem, realizing the partition method, random number generation N to find the shortest path to the two points
- 2022-07-13 00:33:28下载
- 积分:1
-
功能:
1.添加单个成绩
2.批量添加成绩
3.通过搜索并修改与删除
4.直接修改
5.可以批量删除
6.可以直接GO到达你想...
功能:
1.添加单个成绩
2.批量添加成绩
3.通过搜索并修改与删除
4.直接修改
5.可以批量删除
6.可以直接GO到达你想到达的页-functions : 1. Add two individual achievements. Batch added three results. Search and amended with the deletion of four. 5 directly alter. Volume 6 can be deleted. GO can reach you directly to the arrival of page
- 2023-05-15 16:55:03下载
- 积分:1
-
The demo program Joseph Central calculus problem, the number n should be arbitra...
本演示程序演算约瑟夫环问题,人数n应为任意的,首先应输入一个值赋给初始报数上限m,程序应能自动保存出列人的序号和将出列的人所持的密码赋给m,再次作为报数上限,如此循环,直至所有人都出列为止。-The demo program Joseph Central calculus problem, the number n should be arbitrary, we must first enter a value assigned to the initial reported that the maximum number of m, the procedure should be able to automatically save a list of the serial number of people and held out the password given to m, again as reported maximum number of such cycles, until all that far out.
- 2023-07-02 18:20:03下载
- 积分:1