Principal Curve Algorithms for Partitioning High-Dimensional Data Spaces
文件大小:
1197k
资源说明:Most partitioning algorithms iteratively partition a space into cells that contain underlying linear or nonlinear structures using linear partitioning strategies. The compactness of each cell depends on how well the (locally) linear partitioning strategy approximates the intrinsic structure. To partition a compact structure for complex data in a nonlinear context, this paper proposes a nonlinear partition strategy. This is a principal curve tree (PC-tree), which is implemented iteratively. Given
本源码包内暂不包含可直接显示的源代码文件,请下载源码包。