How to find unknown number of clusters in circular data?
$begingroup$
I have some 1 dimensional data. Each record in the data is a specific time of the day. In order to cluster it I projected the data onto a circle of radius 1 unit. Now I need to find clusters in this data. The number of clusters are unknown and it is preferred to find clusters with high density of records in them. By density I mean that a large volume of records should be packed in a small space.
How should I go about finding clusters in the above mentioned data?
clustering unsupervised-learning
$endgroup$
bumped to the homepage by Community♦ 1 min ago
This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
add a comment |
$begingroup$
I have some 1 dimensional data. Each record in the data is a specific time of the day. In order to cluster it I projected the data onto a circle of radius 1 unit. Now I need to find clusters in this data. The number of clusters are unknown and it is preferred to find clusters with high density of records in them. By density I mean that a large volume of records should be packed in a small space.
How should I go about finding clusters in the above mentioned data?
clustering unsupervised-learning
$endgroup$
bumped to the homepage by Community♦ 1 min ago
This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
add a comment |
$begingroup$
I have some 1 dimensional data. Each record in the data is a specific time of the day. In order to cluster it I projected the data onto a circle of radius 1 unit. Now I need to find clusters in this data. The number of clusters are unknown and it is preferred to find clusters with high density of records in them. By density I mean that a large volume of records should be packed in a small space.
How should I go about finding clusters in the above mentioned data?
clustering unsupervised-learning
$endgroup$
I have some 1 dimensional data. Each record in the data is a specific time of the day. In order to cluster it I projected the data onto a circle of radius 1 unit. Now I need to find clusters in this data. The number of clusters are unknown and it is preferred to find clusters with high density of records in them. By density I mean that a large volume of records should be packed in a small space.
How should I go about finding clusters in the above mentioned data?
clustering unsupervised-learning
clustering unsupervised-learning
asked Jun 16 '18 at 11:35
SidSid
1011
1011
bumped to the homepage by Community♦ 1 min ago
This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
bumped to the homepage by Community♦ 1 min ago
This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Instead of projecting into the circle and thus making your problem 2d, why don't you just use a cyclic distance measure?
This problem should be straightforward by doing kernel density estimation on the (cyclic) time of day. Then find the peaks, which are your clusters.
$endgroup$
add a comment |
Your Answer
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "557"
};
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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%2fdatascience.stackexchange.com%2fquestions%2f33249%2fhow-to-find-unknown-number-of-clusters-in-circular-data%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Instead of projecting into the circle and thus making your problem 2d, why don't you just use a cyclic distance measure?
This problem should be straightforward by doing kernel density estimation on the (cyclic) time of day. Then find the peaks, which are your clusters.
$endgroup$
add a comment |
$begingroup$
Instead of projecting into the circle and thus making your problem 2d, why don't you just use a cyclic distance measure?
This problem should be straightforward by doing kernel density estimation on the (cyclic) time of day. Then find the peaks, which are your clusters.
$endgroup$
add a comment |
$begingroup$
Instead of projecting into the circle and thus making your problem 2d, why don't you just use a cyclic distance measure?
This problem should be straightforward by doing kernel density estimation on the (cyclic) time of day. Then find the peaks, which are your clusters.
$endgroup$
Instead of projecting into the circle and thus making your problem 2d, why don't you just use a cyclic distance measure?
This problem should be straightforward by doing kernel density estimation on the (cyclic) time of day. Then find the peaks, which are your clusters.
answered Jun 19 '18 at 7:06
Anony-MousseAnony-Mousse
5,195625
5,195625
add a comment |
add a comment |
Thanks for contributing an answer to Data Science Stack Exchange!
- 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.
Use MathJax to format equations. MathJax reference.
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%2fdatascience.stackexchange.com%2fquestions%2f33249%2fhow-to-find-unknown-number-of-clusters-in-circular-data%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