Skip to content
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

Document clustering algorithm #47

Open
ilectra opened this issue Jul 19, 2018 · 0 comments
Open

Document clustering algorithm #47

ilectra opened this issue Jul 19, 2018 · 0 comments
Assignees

Comments

@ilectra
Copy link
Collaborator

ilectra commented Jul 19, 2018

# Check if hit with limits [x1,x2] belongs to the index-th cluster:
# The cluster low and high limits are actually ranges,
# (x1cl_min, x1cl_max) for low, (x2cl_min, x2cl_max) for high.
# The hit belongs to the cluster if BOTH its ends overlap the respective cluster
# ends within the required percentage tolerance:
# x1 within (x1cl_min-overlap_min, x1cl_max+overlap_min) AND
# x2 within (x2cl_min-overlap_min, x2cl_max+overlap_min)
# Note that overlap_min is calculated differently for "inside" and "outside"
# the cluster (min and max cluster length).
@ilectra ilectra self-assigned this Jul 19, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant