登录
首页 » 算法 » 基于成对约束的k均值算法

基于成对约束的k均值算法

于 2022-08-09 发布 文件大小:147.46 kB
0 240
下载积分: 2 下载次数: 1

代码说明:

使用Java语言实现K-means算法和改进的K-means算法,其中CKmeans是基于成对约束COP-k均值算法。该算法结合了不容错过的链接,可以在这两种类型的约束“监管”的数据对象不-Link的限制进行划分。文件中letterfont.dta为数据集。

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

发表评论

0 个回复

  • 蚁群作为一种新的智能计模式, 由于其离散性本质而在组合优化问题上取得 巨大成 功,但这也限制了它在连续问题求解中的应用。...
    蚁群算法作为一种新的智能计算模式, 由于其离散性本质而在组合优化问题上取得 巨大成 功,但这也限制了它在连续问题求解中的应用。-Ant colony algorithm as a new kind of intelligent computing model because of its nature discrete combinatorial optimization problems in on a great success, but it also limits the problem to solve for the application.
    2022-02-04 11:07:14下载
    积分:1
  • 一个薄板样条模型(thin plate spline)matlab源代码
    一个薄板样条模型(thin plate spline)matlab源代码-A thin plate spline model (thin plate spline) matlab source code
    2022-01-25 17:42:11下载
    积分:1
  • 各种内部排序的集合,很经典的代码。
    各种内部排序算法的集合,很经典的代码。-internal algorithm assembly, classic code.
    2023-08-27 23:25:03下载
    积分:1
  • 哲学家就餐问题的两种实现
    哲学家就餐问题的两种算法实现-Two philosophers eat algorithm
    2022-01-26 01:36:10下载
    积分:1
  • Integration of the circular restricted three
    Integration of the circular restricted three-body problem with burlish stoer routine. Using Numerical recipes in C (routines mmid, bsstep, odeint and pzextr
    2022-05-29 06:04:31下载
    积分:1
  • opencl dct
    此算法有很好的表现。有人想要研究 opencl 使用这将会非常简单。与该应用程序有很多的命令。输入-h 以显示所有的命令。例如,-t 是打印的时间它成本。— — 设备 gpu 是选择 gpu 为执行设备。内核是非常简单易懂。我们可以使用 opencl 加速应用程序。使用 opencl 将是主要趋势。而且我很运气的 sdk 开发的惠顾。我们做大量的测试。和修复一些 bug。和优化内核。它是非常酷。
    2022-04-19 19:53:20下载
    积分:1
  • 机器学习logstic回归的c语言实现
    本人在学习机器学习的相关算法,正在编写c语言程序,这是logistic回归的代码,数据基于《机器学习实战》这本书。
    2022-05-25 06:36:41下载
    积分:1
  • 有限差分二维拉普拉斯方程VC++.rar
    有限差分法计算二维拉普拉斯方程,有限差分法计算二维拉普拉斯方程,有限差分法计算二维拉普拉斯方程,有限差分法计算二维拉普拉斯方程,有限差分法计算二维拉普拉斯方程,有限差分法计算二维拉普拉斯方程,有限差分法计算二维拉普拉斯方程,有限差分法计算二维拉普拉斯方程,有限差分法计算二维拉普拉斯方程,有限差分法计算二维拉普拉斯方程,有限差分法计算二维拉普拉斯方程,
    2022-07-27 08:42:02下载
    积分:1
  • A program to demonstrate the optimization process of ant colony optimization for...
    A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.
    2022-02-19 22:51:42下载
    积分:1
  • 水下节点移动模型
    应用背景 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS"" AND  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF  * SUCH DAMAGE.关键技术 * Redistribution and use in source
    2022-07-11 11:23:16下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载