改進(jìn)的k均值算法，可以加速運(yùn)行時(shí)間，詳見(jiàn)Using the Triangle Inequality to Accelerate k-meanS
標(biāo)簽： 均值算法
上傳時(shí)間： 2016-05-07
上傳用戶：cxl274287265
The last step in training phase is refinement of the clusters found above. Although DynamicClustering counters all the basic k-meanS disadvantages, setting the intra-cluster similarity r may require experimentation. Also, a cluster may have a lot in common with another, i.e., sequences assigned to it are as close to it as they are to another cluster. There may also be denser sub-clusters within the larger ones.
標(biāo)簽： DynamicClusteri refinement Although clusters
上傳時(shí)間： 2014-01-04
上傳用戶：watch100
尋找k個(gè)聚類中心的算法，也就是對(duì)k-meanS算法初始化進(jìn)行改進(jìn)的一種算法
上傳時(shí)間： 2016-07-02
上傳用戶：z754970244
cskmeanS 聚類算法的一種 1. 分裂法(partitioning methods)：給定一個(gè)有N個(gè)元組或者紀(jì)錄的數(shù)據(jù)集，分裂法將構(gòu)造K個(gè)分組，每一個(gè)分組就代表一個(gè)聚類，K<N。而且這K個(gè)分組滿足下列條件：（1） 每一個(gè)分組至少包含一個(gè)數(shù)據(jù)紀(jì)錄；（2）每一個(gè)數(shù)據(jù)紀(jì)錄屬于且僅屬于一個(gè)分組（注意：這個(gè)要求在某些模糊聚類算法中可以放寬）；對(duì)于給定的K，算法首先給出一個(gè)初始的分組方法，以后通過(guò)反復(fù)迭代的方法改變分組，使得每一次改進(jìn)之后的分組方案都較前一次好，而所謂好的標(biāo)準(zhǔn)就是：同一分組中的記錄越近越好，而不同分組中的紀(jì)錄越遠(yuǎn)越好。使用這個(gè)基本思想的算法有：K-meanS算法、K-MEDOIDS算法、CLARANS算法；
標(biāo)簽： partitioning cskmeanS methods 聚類算法
上傳時(shí)間： 2014-01-16
上傳用戶：songyue1991
聚類算法，k-meanS和dbscan算法
標(biāo)簽： 聚類算法
上傳時(shí)間： 2013-12-13
上傳用戶：Pzj
Host Identity Protocol on Linux is an implemetation of the Host Identity Protocol (HIP) and the related architecture. HIP is a proposal to change the TCP/IP stack to securely support mobility and multi-homing. Additionally, it provides for enhanced security and privacy and advanced network concepts, such as moving networks and mobile ad hoc networks. HIP is "cool", which meanS that as a mobile VPN solution, when your network interfaces go up or down, there is no need to re-establish a secure tunnel.
標(biāo)簽： Identity Protocol Host implemetation
上傳時(shí)間： 2016-09-01
上傳用戶：皇族傳媒
各種分類器的工具包，包括貝葉斯分類器，k-meanS分類器等！
上傳時(shí)間： 2016-10-04
上傳用戶：洛木卓
SSD3: Object-Oriented Programming and Design Introduction This course introduces students to problem solving by meanS of object-oriented design and implementation. Emphasis is on problem analysis and solution design, documentation and implementation. Students use commercial software libraries, and create software projects. Programming assignments are carried out in Java.
標(biāo)簽： Object-Oriented Introduction Programming introduces
上傳時(shí)間： 2016-10-08
上傳用戶：gdgzhym
Because of the poor observability of Inertial Navigation System on stationary base, the estimation error of the azimuth will converge very slowly in initial alignment by meanS of Kalmari filtering, and making the time initial alignment is longer. In this paper, a fast estimation method of the azimuth error is creatively proposed for the initial alignment of INS on stationary base. On the basis of the the fast convergence of the leveling error, the azimuth error can be directly calculated. By meanS of this fast initial alignment method, the time of initial alignment is reduced greatly. The computer simulation results illustrate the efficiency of the method.
標(biāo)簽： observability Navigation estimation stationary
上傳時(shí)間： 2014-01-03
上傳用戶：wuyuying
Programming Windows with MFC isn t a book about C++ rather, it s a book about writing 32-bit Windows applications in C++ using MFC rather than the Windows API as the chief meanS of accessing the operating system s essential features and services.
標(biāo)簽： Windows about book Programming
上傳時(shí)間： 2014-01-07
上傳用戶：zgu489
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
