Welcome![Sign In][Sign Up]
Location:
Search - oi

Search list

[Other resourceMyKmeans

Description: 实现聚类K均值算法: K均值算法:给定类的个数K,将n个对象分到K个类中去,使得类内对象之间的相似性最大,而类之间的相似性最小。 缺点:产生类的大小相差不会很大,对于脏数据很敏感。 改进的算法:k—medoids 方法。这儿选取一个对象叫做mediod来代替上面的中心 的作用,这样的一个medoid就标识了这个类。步骤: 1,任意选取K个对象作为medoids(O1,O2,…Oi…Ok)。 以下是循环的: 2,将余下的对象分到各个类中去(根据与medoid最相近的原则); 3,对于每个类(Oi)中,顺序选取一个Or,计算用Or代替Oi后的消耗—E(Or)。选择E最小的那个Or来代替Oi。这样K个medoids就改变了,下面就再转到2。 4,这样循环直到K个medoids固定下来。 这种算法对于脏数据和异常数据不敏感,但计算量显然要比K均值要大,一般只适合小数据量。-achieving K-mean clustering algorithms : K-means algorithm : given the number of Class K, n will be assigned to target K to 000 category, making target category of the similarity between the largest category of the similarity between the smallest. Disadvantages : class size have no great difference for dirty data is very sensitive. Improved algorithms : k-medoids methods. Here a selection of objects called mediod to replace the center of the above, the logo on a medoid this category. Steps : 1, arbitrary selection of objects as K medoids (O1, O2, Ok ... ... Oi). Following is a cycle : 2, the remaining targets assigned to each category (in accordance with the closest medoid principle); 3, for each category (Oi), the order of selection of a Or, calculated Oi Or replace the consumption-E (Or)
Platform: | Size: 1378 | Author: 阿兜 | Hits:

[Other resourceOI

Description: 用多种算法解决0-1背包问题,包括回朔法,动态规划,贪心算法等-algorithm used to solve a variety of 0-1 knapsack problem, including the retrospective method, dynamic programming, greedy algorithm
Platform: | Size: 431086 | Author: 王垂宇 | Hits:

[Other resourcenetstream

Description: 会的人并不很多的网络流算法源程序,打oi时写的
Platform: | Size: 963 | Author: lyy | Hits:

[ELanguagePascal

Description: 基本语法,001尽量学好哦,搞搞OI挺不错的,有兴趣的话和我交流下
Platform: | Size: 9857 | Author: Nelson | Hits:

[Crack Hackassl2

Description: OI模板 很全,pascal 是Amber 大牛写的。
Platform: | Size: 53053 | Author: 张棚 | Hits:

[Other resourceOI

Description: 一套开源oa系统,提供了简单的自定义工作流,上传前经过测试,绝对可以使用(只需要按照说明操作即可)!
Platform: | Size: 15549921 | Author: kqfan | Hits:

[Other resourcenoi_debug

Description: 程序测试机,就是专门用来测试OI竞赛的数据的,省去一个个数据的手功测试的麻烦。只要输入相应的资料便可,程序执行完后会有列表清单,告诉你对了哪些题。
Platform: | Size: 1255 | Author: 江家和 | Hits:

[Other resourcek_medoids

Description: 聚类算法:k—medoids 方法。这儿选取一个对象叫做mediod来代替上面的中心 的作用,这样的一个medoid就标识了这个类。步骤: 1,任意选取K个对象作为medoids(O1,O2,…Oi…Ok)。 以下是循环的: 2,将余下的对象分到各个类中去(根据与medoid最相近的原则); 3,对于每个类(Oi)中,顺序选取一个Or,计算用Or代替Oi后的消耗—E(Or)。选择E最小的那个Or来代替Oi。这样K个medoids就改变了,下面就再转到2。 4,这样循环直到K个medoids固定下来。 这种算法对于脏数据和异常数据不敏感,但计算量显然要比K均值要大,一般只适合小数据量。 这里是MAtlab源代码。
Platform: | Size: 9669 | Author: 烈马 | Hits:

[Other resourceDD_engi

Description: dd牛的usaco源代码!对学习算法,oi的人很有帮助
Platform: | Size: 332048 | Author: ysh | Hits:

[matlabMyKmeans

Description: 实现聚类K均值算法: K均值算法:给定类的个数K,将n个对象分到K个类中去,使得类内对象之间的相似性最大,而类之间的相似性最小。 缺点:产生类的大小相差不会很大,对于脏数据很敏感。 改进的算法:k—medoids 方法。这儿选取一个对象叫做mediod来代替上面的中心 的作用,这样的一个medoid就标识了这个类。步骤: 1,任意选取K个对象作为medoids(O1,O2,…Oi…Ok)。 以下是循环的: 2,将余下的对象分到各个类中去(根据与medoid最相近的原则); 3,对于每个类(Oi)中,顺序选取一个Or,计算用Or代替Oi后的消耗—E(Or)。选择E最小的那个Or来代替Oi。这样K个medoids就改变了,下面就再转到2。 4,这样循环直到K个medoids固定下来。 这种算法对于脏数据和异常数据不敏感,但计算量显然要比K均值要大,一般只适合小数据量。-achieving K-mean clustering algorithms : K-means algorithm : given the number of Class K, n will be assigned to target K to 000 category, making target category of the similarity between the largest category of the similarity between the smallest. Disadvantages : class size have no great difference for dirty data is very sensitive. Improved algorithms : k-medoids methods. Here a selection of objects called mediod to replace the center of the above, the logo on a medoid this category. Steps : 1, arbitrary selection of objects as K medoids (O1, O2, Ok ... ... Oi). Following is a cycle : 2, the remaining targets assigned to each category (in accordance with the closest medoid principle); 3, for each category (Oi), the order of selection of a Or, calculated Oi Or replace the consumption-E (Or)
Platform: | Size: 1024 | Author: 阿兜 | Hits:

[AlgorithmOI

Description: 用多种算法解决0-1背包问题,包括回朔法,动态规划,贪心算法等-algorithm used to solve a variety of 0-1 knapsack problem, including the retrospective method, dynamic programming, greedy algorithm
Platform: | Size: 431104 | Author: 王垂宇 | Hits:

[Data structsnetstream

Description: 会的人并不很多的网络流算法源程序,打oi时写的-The people are not a lot of network flow algorithm source code, written when playing oi
Platform: | Size: 1024 | Author: lyy | Hits:

[ELanguagePascal

Description: 基本语法,001尽量学好哦,搞搞OI挺不错的,有兴趣的话和我交流下-Basic grammar, 001 as much as possible to learn Oh, OI stir up quite well, are interested and I exchange under
Platform: | Size: 9216 | Author: Nelson | Hits:

[Crack Hackassl2

Description: OI模板 很全,pascal 是Amber 大牛写的。-OI template is very wide, pascal is written by Amber Daniudi.
Platform: | Size: 53248 | Author: 张棚 | Hits:

[OAOI

Description: 一套开源oa系统,提供了简单的自定义工作流,上传前经过测试,绝对可以使用(只需要按照说明操作即可)!-Oa set of open source systems, provide a simple custom workflow, From pre-tested, absolutely you can use (just need to follow the instructions)!
Platform: | Size: 15549440 | Author: kqfan | Hits:

[Data structsnoi_debug

Description: 程序测试机,就是专门用来测试OI竞赛的数据的,省去一个个数据的手功测试的麻烦。只要输入相应的资料便可,程序执行完后会有列表清单,告诉你对了哪些题。-Testing machine, is designed to test OI race data, save data in the hands of a reactive test trouble. Enter the appropriate information as long as can be, there will be a list of procedures after the implementation of the list and tell you what title.
Platform: | Size: 1024 | Author: | Hits:

[matlabk_medoids

Description: 聚类算法:k—medoids 方法。这儿选取一个对象叫做mediod来代替上面的中心 的作用,这样的一个medoid就标识了这个类。步骤: 1,任意选取K个对象作为medoids(O1,O2,…Oi…Ok)。 以下是循环的: 2,将余下的对象分到各个类中去(根据与medoid最相近的原则); 3,对于每个类(Oi)中,顺序选取一个Or,计算用Or代替Oi后的消耗—E(Or)。选择E最小的那个Or来代替Oi。这样K个medoids就改变了,下面就再转到2。 4,这样循环直到K个medoids固定下来。 这种算法对于脏数据和异常数据不敏感,但计算量显然要比K均值要大,一般只适合小数据量。 这里是MAtlab源代码。-err
Platform: | Size: 9216 | Author: 烈马 | Hits:

[Data structsDD_engi

Description: dd牛的usaco源代码!对学习算法,oi的人很有帮助-dd cattle usaco source code! Of learning algorithm, oi the people very helpful
Platform: | Size: 331776 | Author: ysh | Hits:

[Special EffectsOI

Description: 单目视觉中的位姿估算代码,基于正交迭代的OI算法,含有主程序和test代码,test代码可以看到位姿估算解的精度(Monocular vision pose estimation code, orthogonal iterative algorithm based OI, containing the main program and test the code, test code can see the accuracy of pose estimation Solutions)
Platform: | Size: 8192 | Author: 勗嘼 | Hits:

[OtherCLJ遗产

Description: 陈立杰(WJMZBMR)现就读于清华大学交叉信息学院,自2010年8月以来,多次在信息学奥赛(OI)中取得令人震惊的好成绩,是OI界的奇迹人物之一。他已经成为了全国最著名、实力最强的信息学奥赛选手。更为重要的是,他几乎没有借助任何外界的力量,完全凭借自己的努力取得了如此好的成绩。 现在这份文件是陈立杰同学留给OI后辈的良心遗产,以供大家宴飨。(Chen Lijie (WJMZBMR) is currently studying at the School of Interdisciplinary Information, Tsinghua University. Since August 2010, he has made astonishing achievements in the Information Olympics (OI), and is one of the miracles of OI. He has become the most famous and powerful informatics Olympian in China. More importantly, he achieved such a good result by virtue of his own efforts, almost without any outside force. Now this document is Chen Lijie's conscientious legacy to OI's descendants for everyone to feast on.)
Platform: | Size: 22573056 | Author: 龙治 | Hits:
« 12 3 4 5 »

CodeBus www.codebus.net