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







share|improve this question









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♦
    9 hours ago















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







share|improve this question









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♦
    9 hours ago













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







share|improve this question









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






share|improve this question









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.











share|improve this question









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.









share|improve this question




share|improve this question








edited 19 hours ago





















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 20 hours ago









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♦
    9 hours ago


















  • Comments are not for extended discussion; this conversation has been moved to chat.
    – Samuel Liew♦
    9 hours ago
















Comments are not for extended discussion; this conversation has been moved to chat.
– Samuel Liew♦
9 hours ago




Comments are not for extended discussion; this conversation has been moved to chat.
– Samuel Liew♦
9 hours ago

















active

oldest

votes











Your Answer






StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});






cvxbcvbsd fsddfgdfg is a new contributor. Be nice, and check out our Code of Conduct.










 

draft saved


draft discarded


















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























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.










 

draft saved


draft discarded


















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.















 


draft saved


draft discarded














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






































































-

Popular posts from this blog

Xamarin.iOS Cant Deploy on Iphone

Image
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box; } -1 I have a windows laptop and a mac mini my problem is that It wont deploy on iphone if I use Visual Studio Xamarin on windows to install my app, but it works fine with Visual Studio For Mac. Here's what I get after build succeded on Visual Studio Xamarin on windows : 1>------ Build started: Project: FinalCustomerApp.iOS, Configuration: Debug iPhone ------ 1> Connecting to Mac server 192.168.8.100... 1> FinalCustomerApp.iOS -> C:UsersJeremy PaulDesktopFinalCustomerAppFinalCustomerAppFinalCustomerApp.iOSbiniPhoneDebugFinalCustomerApp.iOS.exe 1> Detected signing identity: 1> Code Signing Key: &quo
Read more

Glorious Revolution

Image
"The Bloodless Revolution" redirects here. For a history of the vegetarian movement, see The Bloodless Revolution (book). This article is about the English revolution of 1688. For the revolution of 1868 in Spain, see Glorious Revolution (Spain). For other uses, see Glorious Revolution (disambiguation). Glorious Revolution The Prince of Orange lands at Torbay Date 1688–1689 Location British Isles Also known as Revolution of 1688 War of the English Succession Bloodless Revolution Participants English, Welsh and Scottish society, Dutch forces Outcome Replacement of James II by William III and Mary II Jacobite rising of 1689 Williamite War in Ireland War with France; England and Scotland join Grand Alliance Drafting of the Bill of Rights 1689 Part of a series on the History of England Timeline Prehistoric Britain Roman Britain Sub-Roman Britain Medieval period Economy in the Middle Ages Anglo-Saxon period
Read more

Dulmage-Mendelsohn matrix decomposition in Python

Image
0 Matlab has a function called dmperm that computes the so-called Dulmage–Mendelsohn decomposition of a n x n matrix. From wikipedia, the Dulmage–Mendelsohn is a partition of the vertices of a bipartite graph into subsets, with the property that two adjacent vertices belong to the same subset if and only if they are paired with each other in a perfect matching of the graph. Looking both on scipy and numpy, I could not find this function, nor some similar version. Is it possible to implement it using basic linear algebra operations? Any idea if this is implemented in some Python package? python matlab linear-algebra graph-theory matrix-decomposition share | improve this question
Read more