Sorting Points According to Their Closeness Centralities
碩士 === 元智大學 === 資訊工程學系 === 103 === This paper proves that given an n-point metric space (X ,D), w:S→(0,1], ϵ>0 and S⊆X with ∑_(x∈S) (w(x))⁄(|S|)=Θ(1), an ordering x_1, x_2, ⋯, x_n of the elements of X can be computed in O(n ((log_2 n ))⁄ϵ^2 ) time such that Pr[∀1≤i<j≤n,∑_(y∈S) w(y)⋅D(x_i,y)<...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Online Access: | http://ndltd.ncl.edu.tw/handle/87429664681313069870 |