You have a small set of vectors and must to find there segments according to your own very smart rule? We got you back!
Our segmentation algorithm mixing RanSac and Brute Force search so you will get the best answers - faster.
Based on the idea of segmentation we wished to take advantage of the Kmeans algorithm but without knowing "K".
In addition, we were not ready to handle hyper-parameters each time. So we take a look on Brute-force and RanSac to create powerfull but not too slow segmentation algorithm.
Installation and Deployment
Add the following packages to your Requirements.txt or install using "pip install" in your system.
Add all the classes (without the test files) to your project file tree and you are ready to start.
- Find segments of vectors without knowning the number of segments in advance.
Copyright (c) 2019 DnC-algo
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.