Finding optimal region of a continuous search spaceTuning Gradient Boosted Classifier's hyperparametrs and balancing itOptimal parameter estimation for a classifier with multiple parametersSales Dataset to determine best model for predicting future salesSpace complexity of classification algorithmsHow to (better) discretize continuous data in decision trees?Non-convex feasible region in a linear programming problemHow does binary cross entropy work?Why do we need a gain ratioSciKit-Learn Decision Tree Overfitting
Unexpected email from Yorkshire Bank
How to back up a running remote server?
Reverse the word in a string with the same order in javascript
Minimum value of 4 digit number divided by sum of its digits
Is it possible to Ready a spell to be cast just before the start of your next turn by having the trigger be an ally's attack?
Feels like I am getting dragged in office politics
In gnome-terminal only 2 out of 3 zoom keys work
Did Henry V’s archers at Agincourt fight with no pants / breeches on because of dysentery?
Examples of non trivial equivalence relations , I mean equivalence relations without the expression " same ... as" in their definition?
Is it possible to measure lightning discharges as Nikola Tesla?
Why does Bran Stark feel that Jon Snow "needs to know" about his lineage?
Was it really necessary for the Lunar Module to have 2 stages?
Illegal assignment from SObject to Contact
Where does the labelling of extrinsic semiconductors as "n" and "p" come from?
Why was Germany not as successful as other Europeans in establishing overseas colonies?
What does YCWCYODFTRFDTY mean?
Toggle Overlays shortcut?
Has any spacecraft ever had the ability to directly communicate with civilian air traffic control?
What's the polite way to say "I need to urinate"?
You look catfish vs You look like a catfish
Lock in SQL Server and Oracle
Can fracking help reduce CO2?
Help, my Death Star suffers from Kessler syndrome!
Will tsunami waves travel forever if there was no land?
Finding optimal region of a continuous search space
Tuning Gradient Boosted Classifier's hyperparametrs and balancing itOptimal parameter estimation for a classifier with multiple parametersSales Dataset to determine best model for predicting future salesSpace complexity of classification algorithmsHow to (better) discretize continuous data in decision trees?Non-convex feasible region in a linear programming problemHow does binary cross entropy work?Why do we need a gain ratioSciKit-Learn Decision Tree Overfitting
$begingroup$
I'm working on a problem in which I've got large table of data with two features and three target columns and I need to find the optimal filter parameters which theoretically would give me:
1) most preferable target distribution, i.e. highest mean & smallest std on positive target columns and the lowest mean and smallest std on negative target columns
2) largest subset possible
the filtering is done on 2 columns only, so four possible parameters, i.e. min/max of each column and there are three columns which determine the 'character' of the target distribution
since the data is already tabular and continuous, I've just set up a grid search and then I scan for the global max, but as I'm doing this in 2D I can only evaluate on one of the three columns which determine actual character of the target distribution. evaluation of the results that this generates are less than optimal.
I have a sense that there is a much better way to formulate the problem, e.g. with decision trees or a probabilistic model perhaps, but I'm at a loss as to how to go about it. and as I'm new to this, I'm not sure even how to research the issue.
Anybody have direction or suggestions about how to better approach this?
decision-trees optimization probabilistic-programming
$endgroup$
add a comment |
$begingroup$
I'm working on a problem in which I've got large table of data with two features and three target columns and I need to find the optimal filter parameters which theoretically would give me:
1) most preferable target distribution, i.e. highest mean & smallest std on positive target columns and the lowest mean and smallest std on negative target columns
2) largest subset possible
the filtering is done on 2 columns only, so four possible parameters, i.e. min/max of each column and there are three columns which determine the 'character' of the target distribution
since the data is already tabular and continuous, I've just set up a grid search and then I scan for the global max, but as I'm doing this in 2D I can only evaluate on one of the three columns which determine actual character of the target distribution. evaluation of the results that this generates are less than optimal.
I have a sense that there is a much better way to formulate the problem, e.g. with decision trees or a probabilistic model perhaps, but I'm at a loss as to how to go about it. and as I'm new to this, I'm not sure even how to research the issue.
Anybody have direction or suggestions about how to better approach this?
decision-trees optimization probabilistic-programming
$endgroup$
add a comment |
$begingroup$
I'm working on a problem in which I've got large table of data with two features and three target columns and I need to find the optimal filter parameters which theoretically would give me:
1) most preferable target distribution, i.e. highest mean & smallest std on positive target columns and the lowest mean and smallest std on negative target columns
2) largest subset possible
the filtering is done on 2 columns only, so four possible parameters, i.e. min/max of each column and there are three columns which determine the 'character' of the target distribution
since the data is already tabular and continuous, I've just set up a grid search and then I scan for the global max, but as I'm doing this in 2D I can only evaluate on one of the three columns which determine actual character of the target distribution. evaluation of the results that this generates are less than optimal.
I have a sense that there is a much better way to formulate the problem, e.g. with decision trees or a probabilistic model perhaps, but I'm at a loss as to how to go about it. and as I'm new to this, I'm not sure even how to research the issue.
Anybody have direction or suggestions about how to better approach this?
decision-trees optimization probabilistic-programming
$endgroup$
I'm working on a problem in which I've got large table of data with two features and three target columns and I need to find the optimal filter parameters which theoretically would give me:
1) most preferable target distribution, i.e. highest mean & smallest std on positive target columns and the lowest mean and smallest std on negative target columns
2) largest subset possible
the filtering is done on 2 columns only, so four possible parameters, i.e. min/max of each column and there are three columns which determine the 'character' of the target distribution
since the data is already tabular and continuous, I've just set up a grid search and then I scan for the global max, but as I'm doing this in 2D I can only evaluate on one of the three columns which determine actual character of the target distribution. evaluation of the results that this generates are less than optimal.
I have a sense that there is a much better way to formulate the problem, e.g. with decision trees or a probabilistic model perhaps, but I'm at a loss as to how to go about it. and as I'm new to this, I'm not sure even how to research the issue.
Anybody have direction or suggestions about how to better approach this?
decision-trees optimization probabilistic-programming
decision-trees optimization probabilistic-programming
asked Apr 9 at 8:57
JedJed
63
63
add a comment |
add a comment |
0
active
oldest
votes
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%2f48945%2ffinding-optimal-region-of-a-continuous-search-space%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 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%2f48945%2ffinding-optimal-region-of-a-continuous-search-space%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