A New, Fast, and Outlier Resistant Hierarchical Clustering Algorithm

A new hierarchical clustering linkage criterion: the Genie algorithm links two clusters in such a way that a chosen economic inequity measure (e.g., the Gini index) of the cluster sizes does not increase drastically above a given threshold. Benchmarks indicate a high practical usefulness of the introduced method: it most often outperforms the Ward or average linkage in terms of the clustering quality while retaining the single linkage speed, see (Gagolewski et al. 2016a , 2016b ) for more details.


               genie package NEWS and CHANGELOG


1.0.4 (2017-04-27)

  • Invalid DOI corrected.

1.0.3 (2017-04-27)

  • [BUILD TIME] Registering native routines and disabling symbol search.

1.0.1 (2016-05-25)

  • Updated documentation and package metadata.

The algorithm's description can now be found in:

Gagolewski M., Bartoszuk M., Cena A., Genie: A new, fast, and outlier-resistant hierarchical clustering algorithm, Information Sciences 363, 2016, pp. 8-23, doi:10.1016/j.ins.2016.05.003

See also:

Gagolewski M., Cena A., Bartoszuk M., Hierarchical clustering via penalty-based aggregation and the Genie approach, In: Torra V. et al. (Eds.), Modeling Decisions for Artificial Intelligence (Lecture Notes in Artificial Intelligence 9880), Springer, 2016, pp. 191-202, doi:10.1007/978-3-319-45656-0_16.

1.0.0 (2016-03-07)

  • Initial release.

Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


1.0.4 by Marek Gagolewski, 3 years ago


Report a bug at http://github.com/gagolews/genie/issues

Browse source code at https://github.com/cran/genie

Authors: Marek Gagolewski [aut, cre] , Maciej Bartoszuk [aut] , Anna Cena [aut]

Documentation:   PDF Manual  

Task views: Cluster Analysis & Finite Mixture Models, Robust Statistical Methods

GPL (>= 3) license

Imports Rcpp

Depends on stats

Suggests datasets, testthat, stringi

Linking to Rcpp

System requirements: OpenMP, C++11

See at CRAN