Skip to content
This repository has been archived by the owner on Apr 17, 2019. It is now read-only.

Use Levenshtein Distance to find near duplicate BSSIDs #3

Open
jimktrains opened this issue Sep 14, 2014 · 0 comments
Open

Use Levenshtein Distance to find near duplicate BSSIDs #3

jimktrains opened this issue Sep 14, 2014 · 0 comments
Labels
enhancement

Comments

@jimktrains
Copy link

By comparing the BSSIDs at a point in this manner, ones near each other, which are unlikely to be real, can be collapsed or eliminated.
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Assignees
No one assigned
Labels
enhancement
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@jimktrains @colindean