- TravelingSalesmanProblem This file contains my project from Algorithm class on Traveling Salesman Problem. It implements some branch and bound methods to increase it s performance. In the main function you can find that I use Drzewo() function Drzewoopt() functins stand for optimal search using sorted city tabel. Each Drzewo() function represents diffrent way to cut off non optimal solutions with increasing effectivity
- BubbleSorter Bubble sort has worst
- filecutter.tar 一个文件分割器
- bat__algorithm 蝙蝠算法在解决离散的生产调度问题时
- FindFtpFile 列出ftp服务器上的所有文件
- 新建文件夹 提出了一种以目标函数变化量作为评价函数的改进禁忌搜索算法
文件名称:www
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:367kb
-
已下载:1次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
一本将基于近邻传播算法的半监督聚类的算方法书.对于聚类研究的很有帮助-Abstract: A semi-supervised clustering method based on affinity propagation (AP) algorithm is proposed in this
paper. AP takes as input measures of similarity between pairs of data points. AP is an efficient and fast clustering
algorithm for large dataset compared with the existing clustering algorithms, such as K-center clustering. But for the
datasets with complex cluster structures, it cannot produce good clustering results. It can improve the clustering
performance of AP by using the priori known labeled data or pairwise constraints to adjust the similarity matrix.
Experimental results show that such method indeed reaches its goal for complex datasets, and this method
outperforms the comparative methods when there are a large number of pairwise constraints.
paper. AP takes as input measures of similarity between pairs of data points. AP is an efficient and fast clustering
algorithm for large dataset compared with the existing clustering algorithms, such as K-center clustering. But for the
datasets with complex cluster structures, it cannot produce good clustering results. It can improve the clustering
performance of AP by using the priori known labeled data or pairwise constraints to adjust the similarity matrix.
Experimental results show that such method indeed reaches its goal for complex datasets, and this method
outperforms the comparative methods when there are a large number of pairwise constraints.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
基于近邻传播算法的半监督聚类.pdf
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者,仅为网络服务对象提供信息存储空间,仅对用户上载内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。
