Find closest vector
up vote
-1
down vote
favorite
We have a list of vectors with dimensions greater than two(dimension can be 10, 32, 64 or 15) and an arbitrary vector at the input,
it is required to find from the list of vectors the closest to the input vector (for example: 10000 and 10001 are close vectors, but 10111 and 10000 are not close vectors), but without complete passage through the list. I know several Nearest neighbor search algorithms that allow us to find the closest similar element: kd-trees, Voronoi diagram , but they are aimed at finding elements in a plane or in 3-dimensional space. Are there any algorithms, which allow to find the nearest vector, which dimension greater then 2?
algorithm search
asked yesterday
cvxbcvbsd fsddfgdfg
11
New contributor
cvxbcvbsd fsddfgdfg is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
up vote
-1
down vote
favorite
We have a list of vectors with dimensions greater than two(dimension can be 10, 32, 64 or 15) and an arbitrary vector at the input,
it is required to find from the list of vectors the closest to the input vector (for example: 10000 and 10001 are close vectors, but 10111 and 10000 are not close vectors), but without complete passage through the list. I know several Nearest neighbor search algorithms that allow us to find the closest similar element: kd-trees, Voronoi diagram , but they are aimed at finding elements in a plane or in 3-dimensional space. Are there any algorithms, which allow to find the nearest vector, which dimension greater then 2?
algorithm search
asked yesterday
cvxbcvbsd fsddfgdfg
11
New contributor
cvxbcvbsd fsddfgdfg is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Comments are not for extended discussion; this conversation has been moved to chat.
– Samuel Liew♦
yesterday
add a comment |
up vote
-1
down vote
favorite
up vote
-1
down vote
favorite
We have a list of vectors with dimensions greater than two(dimension can be 10, 32, 64 or 15) and an arbitrary vector at the input,
it is required to find from the list of vectors the closest to the input vector (for example: 10000 and 10001 are close vectors, but 10111 and 10000 are not close vectors), but without complete passage through the list. I know several Nearest neighbor search algorithms that allow us to find the closest similar element: kd-trees, Voronoi diagram , but they are aimed at finding elements in a plane or in 3-dimensional space. Are there any algorithms, which allow to find the nearest vector, which dimension greater then 2?
algorithm search
asked yesterday
cvxbcvbsd fsddfgdfg
11
New contributor
cvxbcvbsd fsddfgdfg is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
We have a list of vectors with dimensions greater than two(dimension can be 10, 32, 64 or 15) and an arbitrary vector at the input,
it is required to find from the list of vectors the closest to the input vector (for example: 10000 and 10001 are close vectors, but 10111 and 10000 are not close vectors), but without complete passage through the list. I know several Nearest neighbor search algorithms that allow us to find the closest similar element: kd-trees, Voronoi diagram , but they are aimed at finding elements in a plane or in 3-dimensional space. Are there any algorithms, which allow to find the nearest vector, which dimension greater then 2?
algorithm search
algorithm search
asked yesterday
cvxbcvbsd fsddfgdfg
11
New contributor
cvxbcvbsd fsddfgdfg is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked yesterday
cvxbcvbsd fsddfgdfg
11
New contributor
cvxbcvbsd fsddfgdfg is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited yesterday
asked yesterday
cvxbcvbsd fsddfgdfg
11
New contributor
cvxbcvbsd fsddfgdfg is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked yesterday
cvxbcvbsd fsddfgdfg
11
asked yesterday
cvxbcvbsd fsddfgdfg
11
11
New contributor
cvxbcvbsd fsddfgdfg is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
cvxbcvbsd fsddfgdfg is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
cvxbcvbsd fsddfgdfg is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Comments are not for extended discussion; this conversation has been moved to chat.
– Samuel Liew♦
yesterday
add a comment |
Comments are not for extended discussion; this conversation has been moved to chat.
– Samuel Liew♦
yesterday
Comments are not for extended discussion; this conversation has been moved to chat.
– Samuel Liew♦
yesterday
Comments are not for extended discussion; this conversation has been moved to chat.
– Samuel Liew♦
yesterday
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
cvxbcvbsd fsddfgdfg is a new contributor. Be nice, and check out our Code of Conduct.
cvxbcvbsd fsddfgdfg is a new contributor. Be nice, and check out our Code of Conduct.
cvxbcvbsd fsddfgdfg is a new contributor. Be nice, and check out our Code of Conduct.
cvxbcvbsd fsddfgdfg is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53237791%2ffind-closest-vector%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Comments are not for extended discussion; this conversation has been moved to chat.
– Samuel Liew♦
yesterday