Entropy weighted k-means (ewkm) by Liping Jing, Michael
        K. Ng and Joshua Zhexue Huang (2007)
        <doi:10.1109/TKDE.2007.1048> is a weighted subspace clustering
        algorithm that is well suited to very high dimensional data.
        Weights are calculated as the importance of a variable with
        regard to cluster membership.  The two-level variable
        weighting clustering algorithm tw-k-means (twkm) by Xiaojun
        Chen, Xiaofei Xu, Joshua Zhexue Huang and Yunming Ye (2013)
        <doi:10.1109/TKDE.2011.262> introduces two types of weights,
        the weights on individual variables and the weights on
        variable groups, and they are calculated during the clustering
        process.  The feature group weighted k-means (fgkm) by Xiaojun
        Chen, Yunminng Ye, Xiaofei Xu and Joshua Zhexue Huang (2012)
        <doi:10.1016/j.patcog.2011.06.004> extends this concept by
        grouping features and weighting the group in addition to
        weighting individual features.

Within-subject mediation analysis using structural equation modeling.
    Examine how changes in an outcome variable between two conditions are mediated 
    through one or more variables. Supports within-subject mediation analysis using 
    the 'lavaan' package by Rosseel (2012) <doi:10.18637/jss.v048.i02>, 
    and extends Monte Carlo confidence interval estimation to missing data scenarios 
    using the 'semmcci' package by Pesigan and Cheung (2023) <doi:10.3758/s13428-023-02114-4>.

A weighted selection probability to locate rare variants associated with multiple phenotypes.

A parallel implementation of Weighted Subspace Random Forest.  The
    Weighted Subspace Random Forest algorithm was proposed in the
    International Journal of Data Warehousing and Mining by Baoxun Xu,
    Joshua Zhexue Huang, Graham Williams, Qiang Wang, and Yunming Ye
    (2012) <DOI:10.4018/jdwm.2012040103>.  The algorithm can classify
    very high-dimensional data with random forests built using small
    subspaces.  A novel variable weighting method is used for variable
    subspace selection in place of the traditional random variable
    sampling.This new approach is particularly useful in building
    models from high-dimensional data.