نتایج جستجو برای: false nearest neighbors

تعداد نتایج: 109844  

Journal: :CoRR 2017
George C. Linderman Gal Mishne Yuval Kluger Stefan Steinerberger

If we pick n random points uniformly in [0, 1]d and connect each point to its k−nearest neighbors, then it is well known that there exists a giant connected component with high probability. We prove that in [0, 1]d it suffices to connect every point to cd,1 log logn points chosen randomly among its cd,2 logn−nearest neighbors to ensure a giant component of size n− o(n) with high probability. Th...

Journal: :IEEE Journal of Selected Topics in Signal Processing 2015

Journal: :International Journal of Advanced Computer Science and Applications 2019

Journal: :Celal Bayar Üniversitesi Fen Bilimleri Dergisi 2019

Journal: :Pattern Recognition 2021

Many clustering algorithms fail when clusters are of arbitrary shapes, varying densities, or the data classes unbalanced and close to each other, even in two dimensions. A novel algorithm, DenMune is presented meet this challenge. It based on identifying dense regions using mutual nearest neighborhoods size K, where K only parameter required from user, besides obeying neighbor consistency princ...

Journal: :International Journal of Computing and Digital Systems 2019

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید