Knowledge space theory by Doignon and Falmagne (1999) 
   <doi:10.1007/978-3-642-58625-5> is a set- and order-theoretical
   framework, which proposes mathematical formalisms to operationalize 
   knowledge structures in a particular domain. The 'kst' package provides 
   basic functionalities to generate, handle, and manipulate knowledge 
   structures and knowledge spaces.

Tools for estimate (joint) cumulants and (joint) products of cumulants of a random sample using (multivariate) k-statistics and (multivariate) polykays, unbiased estimators with minimum variance. Tools for generating univariate and multivariate Faa di Bruno's formula and related polynomials, such as Bell polynomials, generalized complete Bell polynomials, partition polynomials and generalized partition polynomials. For more details see Di Nardo E., Guarino G., Senato D. (2009) <arXiv:0807.5008>, <arXiv:1012.6008>.

Knowledge space theory by Doignon and Falmagne (1999) 
   <doi:10.1007/978-3-642-58625-5> is a set- and order-theoretical
   framework which proposes mathematical formalisms to operationalize 
   knowledge structures in a particular domain.  The 'kstIO' package 
   provides basic functionalities to read and write KST data from/to 
   files to be used together with the 'kst', 'kstMatrix', 'pks', or 
   'DAKS' packages.

Knowledge space theory by Doignon and Falmagne (1999)
   <doi:10.1007/978-3-642-58625-5> is a set- and order-theoretical
   framework, which proposes mathematical formalisms to operationalize
   knowledge structures in a particular domain. The 'kstMatrix' package 
   provides basic functionalities to generate, handle, and manipulate 
   knowledge structures and knowledge spaces. Opposed to the 'kst'
   package, 'kstMatrix' uses matrix representations for knowledge
   structures. Furthermore, 'kstMatrix' contains several knowledge spaces
   developed by the research group around Cornelia Dowling through
   querying experts.

A clustering algorithm similar to K-Means is implemented, it has two main advantages, 
    namely (a) The estimator is resistant to outliers, that means that results of estimator are still correct when
    there are atypical values in the sample and (b) The estimator is efficient, roughly speaking, 
    if there are no outliers in the sample, results will be similar to those obtained by a classic algorithm (K-Means).
    Clustering procedure is carried out by minimizing the overall robust scale so-called tau scale.
    (see Gonzalez, Yohai and Zamar (2019) <arxiv:1906.08198>).