clustering.sc.dp: Optimal Distance-Based Clustering for Multidimensional Data with Sequential Constraint

A dynamic programming algorithm for optimal clustering multidimensional data with sequential constraint. The algorithm minimizes the sum of squares of within-cluster distances. The sequential constraint allows only subsequent items of the input data to form a cluster. The sequential constraint is typically required in clustering data streams or items with time stamps such as video frames, GPS signals of a vehicle, movement data of a person, e-pen data, etc. The algorithm represents an extension of Ckmeans.1d.dp to multiple dimensional spaces. Similarly to the one-dimensional case, the algorithm guarantees optimality and repeatability of clustering. Method clustering.sc.dp can find the optimal clustering if the number of clusters is known. Otherwise, methods findwithinss.sc.dp and backtracking.sc.dp can be used.

AuthorTibor Szkaliczki [aut, cre], J. Song [ctb]
Date of publication2015-05-04 09:27:25
MaintainerTibor Szkaliczki <szkaliczki.tibor@sztaki.mta.hu>
LicenseLGPL (>= 3)
Version1.0

View on CRAN

Files

clustering.sc.dp
clustering.sc.dp/src
clustering.sc.dp/src/clustering.sc.dp_main.cpp
clustering.sc.dp/src/clustering.sc.dp.cpp
clustering.sc.dp/src/clustering.sc.dp.h
clustering.sc.dp/NAMESPACE
clustering.sc.dp/R
clustering.sc.dp/R/clustering.sc.dp.R
clustering.sc.dp/MD5
clustering.sc.dp/DESCRIPTION
clustering.sc.dp/man
clustering.sc.dp/man/print.clustering.sc.dp.Rd clustering.sc.dp/man/backtracking.sc.dp.Rd clustering.sc.dp/man/findwithinss.sc.dp.Rd clustering.sc.dp/man/clustering.sc.dp.Rd

Questions? Problems? Suggestions? or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.