How to use vectors produced by TF-IDF as an input for fuzzy c-means?
$begingroup$
I have done text processing with TF-IDF method and as an output got a list of normalized vectors [0, 1] for each document. Such as below:
Document 1
word1:1.0, word2:0.9, ..., word_n:0
Document 2
word2:1.0, word1:0.4, ..., word_n:0
...
etc
The above is basically a list of key-values where key is a term and values are TF-IDF values, where value 1 means that the term matches the document the most compared to other terms in the set.
My question is, to what form should I transform these vectors in order to properly use fuzzy c-means clustering on them? I feel like it should be 2D matrix of something, but can't figure it out.
At the very end I would like to have a trained model which on a given input could say to what documents (based on the membership values) it belongs with the highest chance.
clustering tfidf
New contributor
$endgroup$
add a comment |
$begingroup$
I have done text processing with TF-IDF method and as an output got a list of normalized vectors [0, 1] for each document. Such as below:
Document 1
word1:1.0, word2:0.9, ..., word_n:0
Document 2
word2:1.0, word1:0.4, ..., word_n:0
...
etc
The above is basically a list of key-values where key is a term and values are TF-IDF values, where value 1 means that the term matches the document the most compared to other terms in the set.
My question is, to what form should I transform these vectors in order to properly use fuzzy c-means clustering on them? I feel like it should be 2D matrix of something, but can't figure it out.
At the very end I would like to have a trained model which on a given input could say to what documents (based on the membership values) it belongs with the highest chance.
clustering tfidf
New contributor
$endgroup$
add a comment |
$begingroup$
I have done text processing with TF-IDF method and as an output got a list of normalized vectors [0, 1] for each document. Such as below:
Document 1
word1:1.0, word2:0.9, ..., word_n:0
Document 2
word2:1.0, word1:0.4, ..., word_n:0
...
etc
The above is basically a list of key-values where key is a term and values are TF-IDF values, where value 1 means that the term matches the document the most compared to other terms in the set.
My question is, to what form should I transform these vectors in order to properly use fuzzy c-means clustering on them? I feel like it should be 2D matrix of something, but can't figure it out.
At the very end I would like to have a trained model which on a given input could say to what documents (based on the membership values) it belongs with the highest chance.
clustering tfidf
New contributor
$endgroup$
I have done text processing with TF-IDF method and as an output got a list of normalized vectors [0, 1] for each document. Such as below:
Document 1
word1:1.0, word2:0.9, ..., word_n:0
Document 2
word2:1.0, word1:0.4, ..., word_n:0
...
etc
The above is basically a list of key-values where key is a term and values are TF-IDF values, where value 1 means that the term matches the document the most compared to other terms in the set.
My question is, to what form should I transform these vectors in order to properly use fuzzy c-means clustering on them? I feel like it should be 2D matrix of something, but can't figure it out.
At the very end I would like to have a trained model which on a given input could say to what documents (based on the membership values) it belongs with the highest chance.
clustering tfidf
clustering tfidf
New contributor
New contributor
New contributor
asked 2 days ago
d.dizhevskyd.dizhevsky
1
1
New contributor
New contributor
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Assign a unique column to each word.
All remaining values are zero, obviously.
$endgroup$
add a comment |
$begingroup$
You could create a table from the TF-IDF vectors in which each feature or column represents a word, each row a document and if a word does not appear in a document use 0
as TF-IDF vector value. Then you could apply c-means clustering to this table.
$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
});
}
});
d.dizhevsky is a new contributor. Be nice, and check out our Code of Conduct.
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%2f44127%2fhow-to-use-vectors-produced-by-tf-idf-as-an-input-for-fuzzy-c-means%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Assign a unique column to each word.
All remaining values are zero, obviously.
$endgroup$
add a comment |
$begingroup$
Assign a unique column to each word.
All remaining values are zero, obviously.
$endgroup$
add a comment |
$begingroup$
Assign a unique column to each word.
All remaining values are zero, obviously.
$endgroup$
Assign a unique column to each word.
All remaining values are zero, obviously.
answered 8 hours ago
Anony-MousseAnony-Mousse
4,690623
4,690623
add a comment |
add a comment |
$begingroup$
You could create a table from the TF-IDF vectors in which each feature or column represents a word, each row a document and if a word does not appear in a document use 0
as TF-IDF vector value. Then you could apply c-means clustering to this table.
$endgroup$
add a comment |
$begingroup$
You could create a table from the TF-IDF vectors in which each feature or column represents a word, each row a document and if a word does not appear in a document use 0
as TF-IDF vector value. Then you could apply c-means clustering to this table.
$endgroup$
add a comment |
$begingroup$
You could create a table from the TF-IDF vectors in which each feature or column represents a word, each row a document and if a word does not appear in a document use 0
as TF-IDF vector value. Then you could apply c-means clustering to this table.
$endgroup$
You could create a table from the TF-IDF vectors in which each feature or column represents a word, each row a document and if a word does not appear in a document use 0
as TF-IDF vector value. Then you could apply c-means clustering to this table.
answered 8 hours ago
Franziska W.Franziska W.
8114
8114
add a comment |
add a comment |
d.dizhevsky is a new contributor. Be nice, and check out our Code of Conduct.
d.dizhevsky is a new contributor. Be nice, and check out our Code of Conduct.
d.dizhevsky is a new contributor. Be nice, and check out our Code of Conduct.
d.dizhevsky is a new contributor. Be nice, and check out our Code of Conduct.
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%2f44127%2fhow-to-use-vectors-produced-by-tf-idf-as-an-input-for-fuzzy-c-means%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