Machine learning algorithm that uses the Pearson or Spearman correlation?
$begingroup$
I've come across linear and multiple regression, SVM, random forests. Does any know of a machine learning algorithm that uses the Pearson correlation or Spearman correlation?
Best,
Dave
machine-learning correlation
asked Jan 16 at 22:58
Dave NguyenDave Nguyen
1
$endgroup$
bumped to the homepage by Community♦ 14 mins 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've come across linear and multiple regression, SVM, random forests. Does any know of a machine learning algorithm that uses the Pearson correlation or Spearman correlation?
Best,
Dave
machine-learning correlation
asked Jan 16 at 22:58
Dave NguyenDave Nguyen
1
$endgroup$
bumped to the homepage by Community♦ 14 mins 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've come across linear and multiple regression, SVM, random forests. Does any know of a machine learning algorithm that uses the Pearson correlation or Spearman correlation?
Best,
Dave
machine-learning correlation
asked Jan 16 at 22:58
Dave NguyenDave Nguyen
1
$endgroup$
I've come across linear and multiple regression, SVM, random forests. Does any know of a machine learning algorithm that uses the Pearson correlation or Spearman correlation?
Best,
Dave
machine-learning correlation
machine-learning correlation
asked Jan 16 at 22:58
Dave NguyenDave Nguyen
1
asked Jan 16 at 22:58
Dave NguyenDave Nguyen
1
asked Jan 16 at 22:58
Dave NguyenDave Nguyen
1
asked Jan 16 at 22:58
Dave NguyenDave Nguyen
1
asked Jan 16 at 22:58
Dave NguyenDave Nguyen
1
1
bumped to the homepage by Community♦ 14 mins 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♦ 14 mins 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$
I do not think this exists. I suppose an algorithm could use pearson coefficients as starting coefficients, but honestly it seems like a waste of computational resources. Here are some reasons that occur to me as to why it is a bad idea:
- Pearson and Spearman correlations become decreasingly meaningful as
the number of dimensions increase. I commonly work with millions of dimensions...Spearman correlations for individual features? - In sparse matrices, these coefficients mean next to nothing as there will be only a very slight correlations between a feature and the target. Usually, it is a multi dimensional relationship that we are trying to find (lots of caveats placed here :P)
- Pearson and Spearman correlations assume certain parameters which are not usually true in ML applications ie homoscedasticity, linearity, normality, etc.
For the above and many other reasons imho it doesn't serve any purpose to use these anywhere in ML algorithms.
answered Jan 17 at 4:01
Joe BJoe B
689
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
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%2f44126%2fmachine-learning-algorithm-that-uses-the-pearson-or-spearman-correlation%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$
I do not think this exists. I suppose an algorithm could use pearson coefficients as starting coefficients, but honestly it seems like a waste of computational resources. Here are some reasons that occur to me as to why it is a bad idea:
- Pearson and Spearman correlations become decreasingly meaningful as
the number of dimensions increase. I commonly work with millions of dimensions...Spearman correlations for individual features? - In sparse matrices, these coefficients mean next to nothing as there will be only a very slight correlations between a feature and the target. Usually, it is a multi dimensional relationship that we are trying to find (lots of caveats placed here :P)
- Pearson and Spearman correlations assume certain parameters which are not usually true in ML applications ie homoscedasticity, linearity, normality, etc.
For the above and many other reasons imho it doesn't serve any purpose to use these anywhere in ML algorithms.
answered Jan 17 at 4:01
Joe BJoe B
689
$endgroup$
add a comment |
$begingroup$
I do not think this exists. I suppose an algorithm could use pearson coefficients as starting coefficients, but honestly it seems like a waste of computational resources. Here are some reasons that occur to me as to why it is a bad idea:
- Pearson and Spearman correlations become decreasingly meaningful as
the number of dimensions increase. I commonly work with millions of dimensions...Spearman correlations for individual features? - In sparse matrices, these coefficients mean next to nothing as there will be only a very slight correlations between a feature and the target. Usually, it is a multi dimensional relationship that we are trying to find (lots of caveats placed here :P)
- Pearson and Spearman correlations assume certain parameters which are not usually true in ML applications ie homoscedasticity, linearity, normality, etc.
For the above and many other reasons imho it doesn't serve any purpose to use these anywhere in ML algorithms.
answered Jan 17 at 4:01
Joe BJoe B
689
$endgroup$
add a comment |
$begingroup$
I do not think this exists. I suppose an algorithm could use pearson coefficients as starting coefficients, but honestly it seems like a waste of computational resources. Here are some reasons that occur to me as to why it is a bad idea:
- Pearson and Spearman correlations become decreasingly meaningful as
the number of dimensions increase. I commonly work with millions of dimensions...Spearman correlations for individual features? - In sparse matrices, these coefficients mean next to nothing as there will be only a very slight correlations between a feature and the target. Usually, it is a multi dimensional relationship that we are trying to find (lots of caveats placed here :P)
- Pearson and Spearman correlations assume certain parameters which are not usually true in ML applications ie homoscedasticity, linearity, normality, etc.
For the above and many other reasons imho it doesn't serve any purpose to use these anywhere in ML algorithms.
answered Jan 17 at 4:01
Joe BJoe B
689
$endgroup$
I do not think this exists. I suppose an algorithm could use pearson coefficients as starting coefficients, but honestly it seems like a waste of computational resources. Here are some reasons that occur to me as to why it is a bad idea:
- Pearson and Spearman correlations become decreasingly meaningful as
the number of dimensions increase. I commonly work with millions of dimensions...Spearman correlations for individual features? - In sparse matrices, these coefficients mean next to nothing as there will be only a very slight correlations between a feature and the target. Usually, it is a multi dimensional relationship that we are trying to find (lots of caveats placed here :P)
- Pearson and Spearman correlations assume certain parameters which are not usually true in ML applications ie homoscedasticity, linearity, normality, etc.
For the above and many other reasons imho it doesn't serve any purpose to use these anywhere in ML algorithms.
answered Jan 17 at 4:01
Joe BJoe B
689
answered Jan 17 at 4:01
Joe BJoe B
689
answered Jan 17 at 4:01
Joe BJoe B
689
answered Jan 17 at 4:01
Joe BJoe B
689
689
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%2f44126%2fmachine-learning-algorithm-that-uses-the-pearson-or-spearman-correlation%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
