civiccc / civiccc/suggestomatic
Calculate correct best suggestions instead of heuristic
- Dominant language
- Python
- Stars
- 16
- Forks
- 1
- PR merge metrics
- No merged PRs in 30d
Description
The current scoring mechanism has a percentage threshold that must be exceeded by (intersections / set_a_members_length) for the result to be scored. This is really not fair to all sets (large ones in particular). A more fair solution would be to calculate the results for every comparison, and keep the best scoring. My guess is that this would take a bit longer than the current version, but the results would be much better.
Contributor guide
No contributing guide indexed for this repository
Research direction
No file or test is named. Start by locating the current scoring mechanism and its percentage-threshold comparison, then trace how results are selected; done means comparisons produce the best-scoring result rather than relying on the threshold, with the changed behavior verified by tests.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- machine-learning
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 30/100