登录

基于改进K

于 2023-03-31 发布 文件大小:599.24 kB
0 70
下载积分: 2 下载次数: 2

代码说明:

基于改进K-means的压缩IP 由于k-means本身受异常点影响较大,这里采用迭代k-means的方法,降低异常点的影响,减少计算量和提高聚类数目的灵活性。并添加合并异常聚类方法,提高聚类的均匀性-K-means based on improved compression IP As k-means itself is influenced by outliers, where an iterative k-means method to reduce the impact of outliers, reducing the number of cluster computing capacity and enhanced flexibility. And add the combined abnormal clustering method to improve the uniformity of clustering

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

发表评论

0 个回复

  • 我们老师的一个会计有关绩点的一个课件,很好用的
    我们老师的一个会计有关绩点的一个课件,很好用的-Our teacher of an accounting point of a performance-related courseware, good used
    2023-06-16 09:25:03下载
    积分:1
  • Ship version 1.7
    Ship version 1.7--utility to encode, split, and mail binary data and reconstruct the data at the other end (ship will unship).-Ship version 1.7-- utility to encode. split. and mail binary data and reconstruct the data at the other end (ship will unship).
    2022-04-29 12:21:39下载
    积分:1
  • CORDIC algorithm using VHDL realize VLSI realize image processing algorithm tech...
    CORDIC算法的VHDL实现 对于采用VLSI实现图象处理技术的算法中有很大的帮助-CORDIC algorithm using VHDL realize VLSI realize image processing algorithm technology has a great help
    2022-02-25 22:46:20下载
    积分:1
  • To achieve the image compression ratio and lzw encoding to be simple and straigh...
    实现图像的lzw编码 得到压缩比和码长 程序简单明了-To achieve the image compression ratio and lzw encoding to be simple and straightforward procedure code length
    2022-09-11 21:45:03下载
    积分:1
  • ADC0809数字示波器,可以任意改变参数,显示电压
    ADC0809数字示波器,可以任意改变参数,显示电压-ADC0809 digital oscilloscope can be arbitrarily changed parameters, shows voltage
    2022-10-15 13:40:03下载
    积分:1
  • 0_1背包问题使用一个给定n种去的动态规划解法…
    0_1背包问题用动态规划解给定n种物品和一背包。物品i的重量是wi,其价值为vi,背包的容量为c。问应如何选择装入背包中的物品,使得装入背包中物品的总价值最大? 在选择装入背包的物品时,对每种物品i只有两种选择,即装入背包或不装入背包。不能将物品i装入背包多次,也不能只装入部分的物品i。因此,该问题称为0-1背包问题。-0_1 knapsack problem using dynamic programming solution of a given n types of goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.
    2023-04-12 03:25:02下载
    积分:1
  • 哈夫曼压缩程序,实现了文件加读取,对文本文件的压缩率与rar差不多,读学习c/c++的朋友非常有用...
    哈夫曼压缩程序,实现了文件加读取,对文本文件的压缩率与rar差不多,读学习c/c++的朋友非常有用-huffman compression program, which realizes folder access and compressing rate is the same to rar when compressing text file
    2022-07-25 11:00:53下载
    积分:1
  • Splendid fortune, a very interesting little Dongdong. Believe that learning VC++...
    精彩算命,一个很有趣的小东东。相信对初学VC++的有一定的帮助-Splendid fortune, a very interesting little Dongdong. Believe that learning VC++ Have some help in
    2022-06-20 23:12:04下载
    积分:1
  • 简单的通讯录程序,采用struts2+spring2.5+jpa
    简单的通讯录程序,采用struts2+spring2.5+jpa-struts2+spring2.5+jpa
    2022-11-22 19:10:05下载
    积分:1
  • AD-DA转换接口 转换接口 转换接口-AD-DA covertion interface
    2022-07-10 00:09:41下载
    积分:1
  • 696518资源总数
  • 104305会员总数
  • 11今日下载