code: function FPGrowth(_support /*, private _confidence: number*/) {
                      var _this = _super.call(this) || this;
                      _this._support = _support;
                      /**
                       * Output of the algorithm: The mined frequent itemsets.
                       */
                      _this._itemsets = [];
                      return _this;
                  }
docs: FPGrowth is an algorithm for frequent item set mining and association rule
  earning over transactional databases.
  It was proposed by Han et al. (2000). FPGrowth is a very fast and memory efficient algorithm. It uses a special internal structure called an FP-Tree.
  
  @param  {number} _support 0 < _support < 1. Minimum support of itemsets to mine.