登录
首页 » matlab » pu_ju_lei

pu_ju_lei

于 2019-07-01 发布 文件大小:23KB
0 164
下载积分: 1 下载次数: 3

代码说明:

  将数据集转换为拉普拉斯矩阵,然后利用基于图论的谱聚类进行聚类。拉普拉斯矩阵采用高斯核函数,全连接方法计算。谱聚类擅长处理高维数据或非凸数据集。(The data set is transformed into Laplacian matrix, and then clustered by spectral clustering based on graph theory. The Laplacian matrix is calculated by using the Gauss kernel function and the full connection method. Spectral clustering is good at dealing with high-dimensional or non-convex data sets.)

文件列表:

eigs.m, 52045 , 2019-07-01
get_laplace_matrix.m, 242 , 2019-07-01
kmeans.m, 39847 , 2019-07-01
knGauss3.m, 356 , 2019-07-01
plotcluster3.m, 585 , 2019-07-01
pu_julei.m, 342 , 2019-07-01

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

发表评论

0 个回复

  • EM 算法
    用EM算法求解高斯混合模型并可视化,数据是男女生的身高分布,前提是初始化男女生身高各自的均值和方差和比例,然后由EM算法求解,男女生身高的均值方差,以拟合数据。(The EM algorithm is used to solve the Gauss mixture model and visualize. The data is the height distribution of male and female. The premise is to initialize the mean, variance and proportion of the male and female height, then the mean variance of the height of male and female is solved by the EM algorithm, so as to fit the data.)
    2018-07-14 12:46:57下载
    积分:1
  • Archive
    PCA 数据降维 PTYTHON 数据分析/挖掘(PCA dimensionality reduction data mining/analysis)
    2020-06-21 15:40:02下载
    积分:1
  • HMM-homework
    说明:  隐马尔科夫实现,包含forward-hmm, Viterbi-hmm, Baum-Welch-hmm(Hidden Markov implementation, including forward-hmm, Viterbi-hmm, Baum-Welch-hmm)
    2019-04-26 17:02:43下载
    积分:1
  • mlno
    一个833分酒问题的求解,C++编写,简单易读,输出最佳路径解,()
    2018-02-04 15:22:16下载
    积分:1
  • k-means-for-iris
    说明:  利用K均值聚类对鸢尾花样本进行聚类的matlab程序,包含源代码、样本数据、聚类结果(The matlab program of clustering iris samples by K-means clustering, including source code, sample data and clustering results)
    2020-10-17 20:27:27下载
    积分:1
  • 算法
    包含很多知名算法实现,支持向量机,决策树,粗糙集,贝叶斯分类器等,适合学术研究,短评论意见挖掘,文本分类等。
    2022-06-03 05:40:28下载
    积分:1
  • pu_ju_lei
    将数据集转换为拉普拉斯矩阵,然后利用基于图论的谱聚类进行聚类。拉普拉斯矩阵采用高斯核函数,全连接方法计算。谱聚类擅长处理高维数据或非凸数据集。(The data set is transformed into Laplacian matrix, and then clustered by spectral clustering based on graph theory. The Laplacian matrix is calculated by using the Gauss kernel function and the full connection method. Spectral clustering is good at dealing with high-dimensional or non-convex data sets.)
    2019-07-01 16:05:39下载
    积分:1
  • 89245721
    说明:  
    2017-12-09 07:59:44下载
    积分:1
  • 从零开始学Python网络爬虫源代码+教学PPT
    说明:  《从零开始学爬虫》的配套资料(PPT和源码)("Learning Reptiles from Zero" (PPT and Source))
    2019-03-18 22:06:06下载
    积分:1
  • rcitime__type
    二进制粒子群优化算法pso,主程序:swarmpso m 它包括以下子程序: 1  初始化:swarminit m 2  适应值计算函()
    2017-12-09 12:19:17下载
    积分:1
  • 696524资源总数
  • 103920会员总数
  • 65今日下载