Build complex HTML or 'LaTeX' tables using 'kable()' from 'knitr' 
    and the piping syntax from 'magrittr'. Function 'kable()' is a light weight 
    table generator coming from 'knitr'. This package simplifies the way to 
    manipulate the HTML or 'LaTeX' codes generated by 'kable()' and allows 
    users to construct complex tables and customize styles using a readable 
    syntax.

Implementation of various kernel adaptive methods in nonparametric curve
    estimation like density estimation as introduced in Stute and Srihera (2011)
    <doi:10.1016/j.spl.2011.01.013> and Eichner and Stute (2013)
    <doi:10.1016/j.jspi.2012.03.011> for pointwise estimation, and like regression
    as described in Eichner and Stute (2012) <doi:10.1080/10485252.2012.760737>.

Search and download data from the API for Japanese Diet Proceedings (see the reference at <https://kokkai.ndl.go.jp/api.html>).

A toolkit for absolute and relative dating and analysis of
    chronological patterns. This package includes functions for
    chronological modeling and dating of archaeological assemblages from
    count data. It provides methods for matrix seriation. It also allows
    to compute time point estimates and density estimates of the
    occupation and duration of an archaeological site.

'Rcpp' implementation of the multivariate Kalman filter for state space models that can handle missing values and exogenous data in the observation and state equations. There is also a function to handle time varying parameters.
  Kim, Chang-Jin and Charles R. Nelson (1999) "State-Space Models with Regime Switching: Classical and Gibbs-Sampling Approaches with Applications" <doi:10.7551/mitpress/6444.001.0001><http://econ.korea.ac.kr/~cjkim/>.

Implements methods for clustering mixed-type data,
  specifically combinations of continuous and nominal data. Special attention
  is paid to the often-overlooked problem of equitably balancing the
  contribution of the continuous and categorical variables. This package
  implements KAMILA clustering, a novel method for clustering
  mixed-type data in the spirit of k-means clustering. It does not require
  dummy coding of variables, and is efficient enough to scale to rather large
  data sets. Also implemented is Modha-Spangler clustering, which uses a
  brute-force strategy to maximize the cluster separation simultaneously in the
  continuous and categorical variables. For more information, see Foss, Markatou,
  Ray, & Heching (2016) <doi:10.1007/s10994-016-5575-7> and Foss & Markatou
  (2018) <doi:10.18637/jss.v083.i13>.