ABSTRACT
Cases x and cases xi of similarity Scase(x,xi) can be judged by its Euclidean distance to solve:
n ( ,x ) || |x x | ( )−
(2)
However, its biggest drawback is that lack of control strategy, so that it determines very blind and compares with each of the incidents, which will result in taking too much time to calculate some independent similar cases, leading to large amount of calculation. Thus this is an inefficient algorithm. When the database is not very, the speed and accuracy of positioning is less affected, but with the larger regional or precision positioning requirements are higher, the database will gradually become large, the efficiency of the algorithm greatly reduced.
