ant cluster tool box

szfjnu

This is a Matlab toolbox for investigating the application of cluster ensembles to data classification, with the objective of improving the accuracy and/or speed of clustering. The toolbox divides the cluster ensemble problem into four areas, providing functionality for each. These include, (1) synthetic data generation, (2) clustering to generate individual data partitions and similarity matrices, (3) consensus function generation and final clustering to generate ensemble data partitioning, and (4) implementation of accuracy metrics.
+ J6 S6 r& l; ^7 ^- f& Z  BWith regard to data generation, Gaussian data of arbitrary dimension can be generated. The kcenters algorithm can then be used to generate individual data partitions by either, (a) subsampling the data and clustering each subsample, or by (b) randomly initializing the algorithm and generating a clustering for each initialization. In either case an overall similarity matrix can be computed using a consensus function operating on the individual similarity matrices. A final clustering can be performed and performance metrics are provided for evaluation purposes.

szfjnu

This is a Matlab toolbox for investigating the application of cluster ensembles to data classification, with the objective of improving the accuracy and/or speed of clustering. The toolbox divides the cluster ensemble problem into four areas, providing functionality for each. These include, (1) synthetic data generation, (2) clustering to generate individual data partitions and similarity matrices, (3) consensus function generation and final clustering to generate ensemble data partitioning, and (4) implementation of accuracy metrics.
! ]9 b1 i2 C$ p# u: G8 }5 |
With regard to data generation, Gaussian data of arbitrary dimension can be generated. The kcenters algorithm can then be used to generate individual data partitions by either, (a) subsampling the data and clustering each subsample, or by (b) randomly initializing the algorithm and generating a clustering for each initialization. In either case an overall similarity matrix can be computed using a consensus function operating on the individual similarity matrices. A final clustering can be performed and performance metrics are provided for evaluation purposes.
* q2 g/ B4 `2 w' z0 s

liweineng0304

这是什么东西啊？

李子

好吧 有是英文的东西！！！！！

wangsongtao

是不是英文的

坏女孩

..................................

1 z0 \7 D! \/ R4 p% P6 b
  Y0 V% V! A, A! U* G; y5 Z3 `1 w4 s



: U8 \% ~) K- }  ]: t
2 j. W8 _4 u, T/ G; Q


3 E: u1 W: p" o  S; |; U

% g; e/ q- M3 R( Y8 B; `. y3 J! t51koo.net黑客论坛　soyangsyl.com搜羊娱乐新闻网