Optimal Distance-Based Clustering for Multidimensional Data with Sequential Constraint (clustering.sc.dp)
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.

Fast Nearest Neighbour Search (Wraps ANN Library) Using L1 Metric (RANN.L1)
Finds the k nearest neighbours for every point in a given dataset in O(N log N) time using Arya and Mount’s ANN library (v1.1.3). There is support for approximate as well as exact searches, fixed radius searches and ‘bd’ as well as ‘kd’ trees. The distance is computed using the L1 (Manhattan, taxicab) metric. Please see package ‘RANN’ for the same functionality using the L2 (Euclidean) metric.

Convex Hierarchical Testing of Interactions (hiertest)
Implementation of the convex hierarchical testing (CHT) procedure introduced in Bien, Simon, and Tibshirani (2015) Convex Hierarchical Testing of Interactions. Annals of Applied Statistics. Vol. 9, No. 1, 27-42.