-
Notifications
You must be signed in to change notification settings - Fork 873
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Added Hmine algorithm #1020
Added Hmine algorithm #1020
Conversation
Check out this pull request on See visual diffs & provide feedback on Jupyter Notebooks. Powered by ReviewNB |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Awesome, thanks so much for the contribution!
H-Mine is guaranteed to find the same frequent itemsets as apriori and fp-growth, correct? Would it be possible to add a unit test to test for equivalence with the existing algos?
docs/sources/CHANGELOG.md
Outdated
@@ -931,4 +931,11 @@ imput arrays via `transform` and `fit_transform` | |||
|
|||
### Version 0.1.1 (2014-08-13) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think you accidentally added this to the wrong version in the Changelog
PS: Don't worry about the linter above, we can address that (happy to take care of that) at the very end. |
Codecov ReportPatch coverage:
Additional details and impacted files@@ Coverage Diff @@
## master #1020 +/- ##
==========================================
+ Coverage 77.33% 77.46% +0.13%
==========================================
Files 198 200 +2
Lines 11171 11287 +116
Branches 1461 1480 +19
==========================================
+ Hits 8639 8744 +105
- Misses 2318 2324 +6
- Partials 214 219 +5
Help us with your feedback. Take ten seconds to tell us how you rate us. Have a feature suggestion? Share it here. ☔ View full report in Codecov by Sentry. |
showing that algorithms give the same result.
Thanks a lot for the update! I will do my best to review it this weekend! |
I always overlook the isort rules. I am sorry 🥲 |
No worries about that! The style checks are really not a big deal, we can address those at the very end upon merging. |
Hello, will my pull request be merge? I am very excited about this 😊 @rasbt |
Oh I thought it was based on the small example at the top. So you ran the benchmark on a small hands-on dataset if I understand it correctly? I think we can leave things as is unless it's not too large and we can add it to the doc repo. What do you think? |
Yes it was based on the small example above. Since we are testing with small dataset on Doc, it may remain small. I don't think it will be a big problem if we add it this way. |
Ok perfect, then I'd say it's fine as is because the example is already in the notebook. Should be good to merge then, correct? |
Okey sir, please 😊 |
Merged it @fatihsen20 . Thanks again for this awesome PR! |
Code of Conduct
New feature.
Description
In order to enrich the library and to compare the speed and memory costs of certain algorithms, I added the hmine algorithm to the library.
Related issues or pull requests
None
Pull Request Checklist
./docs/sources/CHANGELOG.md
file (if applicable)./mlxtend/*/tests
directories (if applicable)mlxtend/docs/sources/
(if applicable)PYTHONPATH='.' pytest ./mlxtend -sv
and make sure that all unit tests pass (for small modifications, it might be sufficient to only run the specific test file, e.g.,PYTHONPATH='.' pytest ./mlxtend/classifier/tests/test_stacking_cv_classifier.py -sv
)flake8 ./mlxtend