登录
首页 » AI-NN-PR » 用C++实现了期望最大化算法,为了简化,矩阵使用对角矩阵

用C++实现了期望最大化算法,为了简化,矩阵使用对角矩阵

于 2022-01-28 发布 文件大小:3.75 kB
0 110
下载积分: 2 下载次数: 1

代码说明:

用C++实现了期望最大化算法,为了简化,矩阵使用对角矩阵-C achieve expectations maximize algorithm, in order to simplify the use of matrix diagonal matrix

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

发表评论


0 个回复

  • 本例是本人写的遗传算法的最简单的一个实现,并且带有一个说明文档。用C语言编写,在TurborC中调试,由于当时在随机数产生上没有种种子,所以极易收敛,有兴趣可以...
    本例是本人写的遗传算法的最简单的一个实现,并且带有一个说明文档。用C语言编写,在TurborC中调试,由于当时在随机数产生上没有种种子,所以极易收敛,有兴趣可以种上种子试一下。-the cases I wrote is the most genetic algorithm to achieve a simple, and with a documented. C language, in which TurborC debugging, because the random number generator not all sons, so vulnerable convergence are interested can plant seeds try.
    2022-05-19 06:58:58下载
    积分:1
  • 自组织系统Kohonen网络模型。对于Kohonen神经网络,竞争是这样进行的:对于“赢”的那个神经元c,在其周围Nc的区域内神经元在不同程度上得到兴奋,而在N...
    自组织系统Kohonen网络模型。对于Kohonen神经网络,竞争是这样进行的:对于“赢”的那个神经元c,在其周围Nc的区域内神经元在不同程度上得到兴奋,而在Nc以外的神经元都被抑制。网络的学习过程就是网络的连接权根据训练样本进行自适应、自组织的过程,经过一定次数的训练以后,网络能够把拓扑意义下相似的输入样本映射到相近的输出节点上。网络能够实现从输入到输出的非线性降维映射结构:它是受视网膜皮层的生物功能的启发而提出的。~..~-Kohonen network model. For Kohonen neural network, competition is this : For the "winner" of neurons c, in its switching around the region neurons in varying degrees, to be excited, and the switching outside the neurons were inhibited. Network learning is a process in the network connecting the right under the training samples for adaptive, self-organizing process, after a certain number of training, network topology can sense similar to the mapping of the input samples similar to the output nodes. Network can be achieved from input to output of nonlinear reduced-dimensional mapping structure : it is subject to retinal cortex of the biological function inspired by. ~ ~ ..
    2022-11-15 05:40:03下载
    积分:1
  • simulated annealing algorithm for TSP
    用模拟退火算法求解TSP问题-simulated annealing algorithm for TSP
    2022-05-10 22:26:09下载
    积分:1
  • 一个vc开发的支持向量机程序,对于初学者很有用.共享以下....
    一个vc开发的支持向量机程序,对于初学者很有用.共享以下.-vc development of a support vector machine procedures, very useful for beginners. Sharing the following.
    2022-04-01 17:06:11下载
    积分:1
  • 神经网络模式识别及其实现,第九章。 内含:HOPFIELD和LAM
    神经网络模式识别及其实现,第九章。 内含:HOPFIELD和LAM -pattern recognition and neural network to achieve, chap. Intron : LAM and HOPFILED
    2022-05-30 02:08:34下载
    积分:1
  • 用VC++编写的遗传算法源程序,可以用内容较多
    用VC++编写的遗传算法源程序,可以用内容较多-very useful, widely,VC++, coding, Genetic algorithm of C++
    2023-08-03 09:30:05下载
    积分:1
  • K-均值聚类算法的编程实现。包括逐点聚类和批处理聚类。K-均值聚类的的时间复杂度是n*k*m,其中n为样本数,k为类别数,m为样本维数。这个时间复杂度是相当客观的。因为如果用每秒10亿次的计算机对50个样本采用穷举法分两类,寻找最优,列举一遍约66.7天,分成3类,则要约3500万年。针对算法局部最优的缺点,本人正在编制模拟退火程序进行改进。希望及早奉给大家,倾听高手教诲。-K-means clustering algorithm programming. Point by point, including clustering and clustering batch. K-means clustering of the time complexity of n* k* m, n samples, several types of k, m sample dimension. The time complexity is a very objective. Because if we use one billion times per second the computer using 50 samples of two exhaustive method to find the optimal set out again about 66.7 days, divided into three categories, offering 3,500 years. Local optimal algorithm against the shortcomings, I was prepared simulated annealing process improvements. Early Feng hope for everyone, listen to the master teachings.
    2022-01-28 00:58:44下载
    积分:1
  • CCE是一个多
    CCE is a multi-instance learning method solving multi-instance problems through adapting multi-instance representation to single-instance algorithms, which is quite different from existing multi-instance learning algorithms which attempt to adapt single-instance algorithms to multi-instance representation
    2022-03-20 08:52:39下载
    积分:1
  • 停车诱导系统中车位预测模型的研究 摘 要 研究城市停车诱导系统的停车车位占有率预测问题。首先提出墓于B P神经网络的车位占有预测模型, 同时将自适应 学...
    停车诱导系统中车位预测模型的研究 摘 要 研究城市停车诱导系统的停车车位占有率预测问题。首先提出墓于B P神经网络的车位占有预测模型, 同时将自适应 学习速率调整法和加入动量项方法用于改善基本B P神经网络, 优化了学习速率, 减少了训练过程的震荡趋势, 改善了网络的收效 隆。以此为基础实现了停车位的智能预测 0最后, 进行了多种方法比对实验-err
    2023-04-04 02:10:03下载
    积分:1
  • LinPacker是一个优化矩形布局的工具,是在具有遗传算法的半无限大小区完成这一操作的。对缩减工厂的库存是有用的。...
    LinPacker是一个优化矩形布局的工具,是在具有遗传算法的半无限大小区完成这一操作的。对缩减工厂的库存是有用的。-LinPacker optimization is a rectangular layout of the tool, with a genetic algorithm in the semi-infinite size of the area to complete the operation. To reduce factory stocks will be useful.
    2022-01-26 03:05:35下载
    积分:1
  • 696518资源总数
  • 105012会员总数
  • 9今日下载