LDA for each target in a binary classification problem
Why must Chinese maps be obfuscated?
Is it acceptable to use working hours to read general interest books?
Is there any pythonic way to find average of specific tuple elements in array?
How bug prioritization works in agile projects vs non agile
Do I need to watch Ant-Man and the Wasp and Captain Marvel before watching Avengers: Endgame?
Are there moral objections to a life motivated purely by money? How to sway a person from this lifestyle?
Unknown code in script
What is the most expensive material in the world that could be used to create Pun-Pun's lute?
What makes accurate emulation of old systems a difficult task?
Negative Resistance
How important is it that $TERM is correct?
Partitioning values in a sequence
Multiple options vs single option UI
Is there really no use for MD5 anymore?
Can a Bard use the Spell Glyph option of the Glyph of Warding spell and cast a known spell into the glyph?
How do I check if a string is entirely made of the same substring?
Cayley's Matrix Notation
What is the term for a person whose job is to place products on shelves in stores?
Apply a different color ramp to subset of categorized symbols in QGIS?
All ASCII characters with a given bit count
"The cow" OR "a cow" OR "cows" in this context
Could moose/elk survive in the Amazon forest?
Co-worker works way more than he should
Can a stored procedure reference the database in which it is stored?
LDA for each target in a binary classification problem
$begingroup$
I have a question around using LDA which may be very foolish but I am still gonna ask anyway.
Problem Statement: To classify documents into complaints and queries
by processing text.
Current Approach: After preprocessing text, I am using LDA
on the entire text with 20 topics
and feed the probabilities to a dataframe and use a classification algorithm to predict the classes.
Which I think is the correct way to use LDA
Second Approach: (This is where the confusion lies): Does it make sense to train complaints and queries separately with 10 topics using LDA and then construct a dataframe with 20 columns(10 from complaints, 10 from queries)
to pass to a classification algorithm.
In the future, this model will have process an incoming text thru both the LDA models and pass the output to a classification algorithm in order to separate complaints and queries.
I don't believe that a second approach is a valid approach but someone has suggested me so and I am trying to understand how this could be valid
. Or is there a way to take 10 topics from each complaint and query from the LDA model and feed them into a dataframe in order to predict if it is a complaint or a query.
classification nlp topic-model lda binary
$endgroup$
add a comment |
$begingroup$
I have a question around using LDA which may be very foolish but I am still gonna ask anyway.
Problem Statement: To classify documents into complaints and queries
by processing text.
Current Approach: After preprocessing text, I am using LDA
on the entire text with 20 topics
and feed the probabilities to a dataframe and use a classification algorithm to predict the classes.
Which I think is the correct way to use LDA
Second Approach: (This is where the confusion lies): Does it make sense to train complaints and queries separately with 10 topics using LDA and then construct a dataframe with 20 columns(10 from complaints, 10 from queries)
to pass to a classification algorithm.
In the future, this model will have process an incoming text thru both the LDA models and pass the output to a classification algorithm in order to separate complaints and queries.
I don't believe that a second approach is a valid approach but someone has suggested me so and I am trying to understand how this could be valid
. Or is there a way to take 10 topics from each complaint and query from the LDA model and feed them into a dataframe in order to predict if it is a complaint or a query.
classification nlp topic-model lda binary
$endgroup$
add a comment |
$begingroup$
I have a question around using LDA which may be very foolish but I am still gonna ask anyway.
Problem Statement: To classify documents into complaints and queries
by processing text.
Current Approach: After preprocessing text, I am using LDA
on the entire text with 20 topics
and feed the probabilities to a dataframe and use a classification algorithm to predict the classes.
Which I think is the correct way to use LDA
Second Approach: (This is where the confusion lies): Does it make sense to train complaints and queries separately with 10 topics using LDA and then construct a dataframe with 20 columns(10 from complaints, 10 from queries)
to pass to a classification algorithm.
In the future, this model will have process an incoming text thru both the LDA models and pass the output to a classification algorithm in order to separate complaints and queries.
I don't believe that a second approach is a valid approach but someone has suggested me so and I am trying to understand how this could be valid
. Or is there a way to take 10 topics from each complaint and query from the LDA model and feed them into a dataframe in order to predict if it is a complaint or a query.
classification nlp topic-model lda binary
$endgroup$
I have a question around using LDA which may be very foolish but I am still gonna ask anyway.
Problem Statement: To classify documents into complaints and queries
by processing text.
Current Approach: After preprocessing text, I am using LDA
on the entire text with 20 topics
and feed the probabilities to a dataframe and use a classification algorithm to predict the classes.
Which I think is the correct way to use LDA
Second Approach: (This is where the confusion lies): Does it make sense to train complaints and queries separately with 10 topics using LDA and then construct a dataframe with 20 columns(10 from complaints, 10 from queries)
to pass to a classification algorithm.
In the future, this model will have process an incoming text thru both the LDA models and pass the output to a classification algorithm in order to separate complaints and queries.
I don't believe that a second approach is a valid approach but someone has suggested me so and I am trying to understand how this could be valid
. Or is there a way to take 10 topics from each complaint and query from the LDA model and feed them into a dataframe in order to predict if it is a complaint or a query.
classification nlp topic-model lda binary
classification nlp topic-model lda binary
asked 1 min ago
ShoaibkhanzShoaibkhanz
1012
1012
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%2f50954%2flda-for-each-target-in-a-binary-classification-problem%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%2f50954%2flda-for-each-target-in-a-binary-classification-problem%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