rasbt / mlxtend / 2012

91%

push

travis-ci

Improve performance of apriori (#619)

* minor performance improvements in apriori

old_combination is sorted, thus its max() is its last element.
Since items_types_in_previous_step is a Numpy array, we can find all
valid elements with a single call, which makes inner loop shorter.

* minor performance improvements in apriori

Let generate_new_combinations return ints instead of tuples,
and collect them with np.fromiter.

Slower with low_memory=True, this will be fixed by next commit.

* improve performance of apriori with low_memory=True

Verbose output has to be modified, since we loop on valid combinations
only.

Performance is now equivalent to better than version with low_memory=False.

Adjust test_fpbase.py output.

* fixes for flake8

* speed up valid_input_check for boolean dataframes

If all columns are boolean, there is nothing to check.

In apriori.py, call valid_input_check.

* add changelog entry

Replace 0/1 by False/True in docstrings of apriori, fpgrowth and fpmax
to promote usage of boolean arrays.

1761 of 2219 branches covered (79.36%)

48 of 48 new or added lines in 3 files covered. (100.0%)

8165 of 8841 relevant lines covered (92.35%)

0.92 hits per line