It can't be done with the current functionality. When I rewrote the code last year, we decided picklability of the object and avoiding dynamic memory management was more important than being able to use it online. Currently, all data is stored in pre-allocated arrays. To use the Ball Tree inline, you'd have to re-write it to store the data in dynamically allocated nodes. This also brings up a lot of complicated tree balancing issues when points are added one-by-one. Jake
Andreas Mueller wrote: > Hi everybody. > I was wondering if there was an online version of the ball-tree. > I want to query an increasingly big set of points. > Is there a method for doing that and is this somehow possible with the > functionality we already have? > > Cheers, > Andy > > ------------------------------------------------------------------------------ > Live Security Virtual Conference > Exclusive live event will cover all the ways today's security and > threat landscape has changed and how IT managers can respond. Discussions > will include endpoint security, mobile security and the latest in malware > threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ > _______________________________________________ > Scikit-learn-general mailing list > [email protected] > https://lists.sourceforge.net/lists/listinfo/scikit-learn-general > ------------------------------------------------------------------------------ Live Security Virtual Conference Exclusive live event will cover all the ways today's security and threat landscape has changed and how IT managers can respond. Discussions will include endpoint security, mobile security and the latest in malware threats. http://www.accelacomm.com/jaw/sfrnl04242012/114/50122263/ _______________________________________________ Scikit-learn-general mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/scikit-learn-general
