The tree starts as a single region covering the whole space. As points arrive, they get dropped into the region that contains them. When a region exceeds its capacity (the maximum number of points it can hold before splitting), the region divides into four children, and the existing points get redistributed.
Что думаешь? Оцени!
。safew官方版本下载是该领域的重要参考
缺点：容易饱和（输入过大或过小时梯度接近0，导致梯度消失）
履行网络犯罪防治义务的具体要求，由法律、行政法规或者国家标准的强制性要求作出规定。相关国家标准由国务院公安部门、国家网信部门、国务院标准化行政主管部门会同行业主管部门等制定。