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.

Sign up for GitHub

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

Jump to bottom

[pyclustering.container.kdtree][ccore.kdtree] Reduce amount of Euclidean distance calculation #379

Closed
annoviko opened this issue Oct 25, 2017 · 2 comments
Closed

[pyclustering.container.kdtree][ccore.kdtree] Reduce amount of Euclidean distance calculation #379

annoviko opened this issue Oct 25, 2017 · 2 comments
Assignees
@annoviko
Labels
Enhancement Tasks related to enhancement and development Investigation Tasks related to investigation of found issues

Comments

@annoviko
Copy link
Owner

annoviko commented Oct 25, 2017 •
edited
Loading

Introduction
Refer to #369 looks like amount of lack calculation during search can be significantly reduced. Investigation is required.

Resources

  1. Presentation about KD-searching - http://andrewd.ces.clemson.edu/courses/cpsc805/references/nearest_search.pdf.
  2. Book - M.Samet. The Design And Analysis Of Spatial Data Structures. 1994.

Description
Use DBSCAN algorithm to test results.
@annoviko annoviko added the Investigation Tasks related to investigation of found issues label Oct 25, 2017
@annoviko annoviko added this to the 0.7 (release point) milestone Oct 25, 2017
@annoviko annoviko self-assigned this Oct 25, 2017
@annoviko annoviko mentioned this issue Oct 25, 2017
Closed
@annoviko annoviko mentioned this issue Oct 26, 2017
Closed
@annoviko annoviko removed this from the 0.7 (release point) milestone Jan 14, 2018
@annoviko annoviko added the Enhancement Tasks related to enhancement and development label Feb 15, 2018
@annoviko
Copy link
Owner Author

Implementation of optimized, balanced KD-tree is required, current implementation is original KD-tree. Optimized KD-tree should be implemented for python and CCORE.

@annoviko annoviko mentioned this issue Jul 19, 2019
Closed
@annoviko
Copy link
Owner Author

Current implementation is optimized and suitable for dynamical insertion and removing nodes, for example, for CURE. But in case DBSCAN and OPTICS there is no need to add new or remove old one nodes, static KD-tree is more suitable because it is balanced and ensure fast search procedure. Therefore new KD-tree should be introduced kdtree_static that will be used by OPTICS and DBSCAN.

This was referenced Feb 14, 2020
Closed
Closed
Closed
annoviko added a commit that referenced this issue Feb 14, 2020
@annoviko
#587, #588, #589 Optimization for DBSCAN, OPTICS, CURE (Python versio…
d53287b 
…n). #586 KD-tree visualizer. #379 Balanced KD-tree to reduce complexity of search procedure.
annoviko added a commit that referenced this issue Feb 18, 2020
@annoviko
#589, #588, #587, #379: Optimized balanced KD-tree for C++ pyclusteri…
2d4a03a 
…ng. DBSCAN, OPTICS, CURE optimization.
annoviko added a commit that referenced this issue Feb 18, 2020
@annoviko
#589, #588, #587, #379: Optimized balanced KD-tree for C++ pyclusteri…
3539259 
…ng. DBSCAN, OPTICS, CURE optimization.
annoviko added a commit that referenced this issue Feb 20, 2020
@annoviko
#589, #588, #587, #379: Correction for GCC compiler.
b51dff1
annoviko added a commit that referenced this issue Feb 21, 2020
@annoviko
#589, #588, #587, #379: Balanced KD-tree and optimization of DBSCA, O…
256f228 
…PTICS, CURE.
annoviko added a commit that referenced this issue Feb 22, 2020
@annoviko
#379: Optimization by binary search of the left element on median.
f88d47c
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@annoviko annoviko

Labels
Enhancement Tasks related to enhancement and development Investigation Tasks related to investigation of found issues
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@annoviko