sequential clustering with minimum distance
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty height:90px;width:728px;box-sizing:border-box;
I have a problem where I want to cluster a group of items. Say I have a list of items l
l = [1, 2, 3, 4, 5, 6, 7, 8]
Say I will sequentially go through this list and select a "center" and if the next item in the sequence is within some distance threshold (as per some function) I assign that item to the center if not the item becomes a new center.
Another condition I have is each item should be allocated to the center with the least distance while being within the threshold too.
I can think of a n^2algorithm to do this. But is there a better solution?
cluster-analysis
asked Nov 16 '18 at 11:58
user77005user77005
4242618
add a comment |
I have a problem where I want to cluster a group of items. Say I have a list of items l
l = [1, 2, 3, 4, 5, 6, 7, 8]
Say I will sequentially go through this list and select a "center" and if the next item in the sequence is within some distance threshold (as per some function) I assign that item to the center if not the item becomes a new center.
Another condition I have is each item should be allocated to the center with the least distance while being within the threshold too.
I can think of a n^2algorithm to do this. But is there a better solution?
cluster-analysis
asked Nov 16 '18 at 11:58
user77005user77005
4242618
add a comment |
I have a problem where I want to cluster a group of items. Say I have a list of items l
l = [1, 2, 3, 4, 5, 6, 7, 8]
Say I will sequentially go through this list and select a "center" and if the next item in the sequence is within some distance threshold (as per some function) I assign that item to the center if not the item becomes a new center.
Another condition I have is each item should be allocated to the center with the least distance while being within the threshold too.
I can think of a n^2algorithm to do this. But is there a better solution?
cluster-analysis
asked Nov 16 '18 at 11:58
user77005user77005
4242618
I have a problem where I want to cluster a group of items. Say I have a list of items l
l = [1, 2, 3, 4, 5, 6, 7, 8]
Say I will sequentially go through this list and select a "center" and if the next item in the sequence is within some distance threshold (as per some function) I assign that item to the center if not the item becomes a new center.
Another condition I have is each item should be allocated to the center with the least distance while being within the threshold too.
I can think of a n^2algorithm to do this. But is there a better solution?
cluster-analysis
cluster-analysis
asked Nov 16 '18 at 11:58
user77005user77005
4242618
asked Nov 16 '18 at 11:58
user77005user77005
4242618
asked Nov 16 '18 at 11:58
user77005user77005
4242618
asked Nov 16 '18 at 11:58
user77005user77005
4242618
asked Nov 16 '18 at 11:58
user77005user77005
4242618
4242618
add a comment |
add a comment |
0
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',
autoActivateHeartbeat: false,
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
);
);
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
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53337465%2fsequential-clustering-with-minimum-distance%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
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
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53337465%2fsequential-clustering-with-minimum-distance%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
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
Required, but never shown
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
Required, but never shown
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
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
