-
全国电子设计竞赛基础篇
文档,电子设计竞赛相关的一些基础知识,可以下载下来看看(Documents, some basic knowledge related to electronic design competitions, can be downloaded to see)
- 2020-06-22 11:00:01下载
- 积分:1
-
弹幕情感分析
对哔哩哔哩弹幕进行抽取并完成情感倾向的分析和估计(To extract bilibili barrage and complete the analysis and estimation of emotional tendency)
- 2021-03-09 14:59:28下载
- 积分:1
-
privatesubcombo30.zip视觉基本代码。非常好的代码…
PrivateSubCombo30.zip visual basci code. very nice code-PrivateSubCombo30.zip visual basci code. very nice code...
- 2022-07-23 07:22:20下载
- 积分:1
-
c写的贪心算法,利用指针来搜索最短路径,以及可以扩展成一般最短路径的求法...
c写的贪心算法,利用指针来搜索最短路径,以及可以扩展成一般最短路径的求法-c write greedy algorithm, using a pointer to search for the shortest path, as well as the shortest path can be extended into a general law of demand
- 2023-01-15 19:25:04下载
- 积分:1
-
PyLED-master
py语言led控制操作代码,第三方工具。(Py language LED control operation code, third-party tools.)
- 2019-05-26 20:45:25下载
- 积分:1
-
websocket_assistant
websocket client by MFC
- 2018-11-21 23:47:52下载
- 积分:1
-
STM32-IIC--MMA8451
STM32的控制MMA8451三轴加速度芯片的IIC驱动,串口打印数据到电脑显示!(STM32 control MMA8451 the triaxial acceleration chip IIC driver, serial print data to a computer display!)
- 2013-08-24 15:54:18下载
- 积分:1
-
Corrlationdemsion
本压缩包里有计算关联维数的Matlab程序设计,较快。(compression of the bundle is calculated correlation dimension of the Matlab programming, faster.)
- 2021-01-15 10:28:45下载
- 积分:1
-
Multiplexing procedures used quartus operations, can put a lot of signal multipl...
复接程序,用quartus运行的,可以把很多个信号复接在一起,是程序的一部分!-Multiplexing procedures used quartus operations, can put a lot of signal multiplexing together, is part of that process.
- 2022-12-08 04:00:03下载
- 积分:1
-
Clustering
1) 使用凝聚型层次聚类算法(即最小生成树算法)对所有数据点进行聚类,最后聚成3类。相异度定义方法可选择single linkage、complete linkage、average linkage或者average group linkage中任意一种。
2) 使用C-Means算法对所有数据点进行聚类。C=3。
任务2(必做):
使用高斯混合模型(GMM)聚类算法对所有数据点进行聚类。C=3。并请给出得到的混合模型参数(包括比例??、均值??和协方差Σ)。
任务3(全做):
1) 参考数据文件第三列的类标签,使用聚类有效性评价的外部方法Normalized Mutual Information指标,分别计算任务1和任务2聚类结果的有效性。
2) 使用聚类有效性评价的内部方法Xie-Beni指标,分别计算任务1和任务2聚类结果的有效性。(The main results are as follows: 1) the condensed hierarchical clustering algorithm (that is, the minimum spanning tree algorithm) is used to cluster all the data points, and finally it is grouped into three categories. Any of the single linkage,complete linkage,average linkage or average group linkage methods can be selected for the definition of dissimilarity. 2) using C-Means algorithm to cluster all data points. C = 3.)
- 2019-05-16 21:54:22下载
- 积分:1