Mixing
Clustering on Highly Connected Networkx Undirected Graph
I am working on an HR project where I have to take employee skills and relate them in such a way that I can create a skills taxonomy. I chose to create an undirected network graph where any time two skills are taken together in an employee's skill-set, it draws an edge between them and the weight of it is how many times those related skills are taken by employees.
There are about 8000 nodes and millions of connections in that graph. My next task is to cluster that graph in such a way that I can see what skills are similar.
The problem is that all the algorithms (ex: connected subgraph components, clustering etc) provided in NetworkX only work for 2000 nodes. When I try to increase the number of nodes, I don't get clear results.
Is there a way I can cluster on 8000 very connected nodes? Any suggestions? I am working in Python.
python networkx graph-theory
edited Nov 26 '18 at 16:43
shindig_
2816
asked Nov 20 '18 at 16:28
sanobar lalasanobar lala
62
add a comment |
I am working on an HR project where I have to take employee skills and relate them in such a way that I can create a skills taxonomy. I chose to create an undirected network graph where any time two skills are taken together in an employee's skill-set, it draws an edge between them and the weight of it is how many times those related skills are taken by employees.
There are about 8000 nodes and millions of connections in that graph. My next task is to cluster that graph in such a way that I can see what skills are similar.
The problem is that all the algorithms (ex: connected subgraph components, clustering etc) provided in NetworkX only work for 2000 nodes. When I try to increase the number of nodes, I don't get clear results.
Is there a way I can cluster on 8000 very connected nodes? Any suggestions? I am working in Python.
python networkx graph-theory
edited Nov 26 '18 at 16:43
shindig_
2816
asked Nov 20 '18 at 16:28
sanobar lalasanobar lala
62
add a comment |
I am working on an HR project where I have to take employee skills and relate them in such a way that I can create a skills taxonomy. I chose to create an undirected network graph where any time two skills are taken together in an employee's skill-set, it draws an edge between them and the weight of it is how many times those related skills are taken by employees.
There are about 8000 nodes and millions of connections in that graph. My next task is to cluster that graph in such a way that I can see what skills are similar.
The problem is that all the algorithms (ex: connected subgraph components, clustering etc) provided in NetworkX only work for 2000 nodes. When I try to increase the number of nodes, I don't get clear results.
Is there a way I can cluster on 8000 very connected nodes? Any suggestions? I am working in Python.
python networkx graph-theory
edited Nov 26 '18 at 16:43
shindig_
2816
asked Nov 20 '18 at 16:28
sanobar lalasanobar lala
62
I am working on an HR project where I have to take employee skills and relate them in such a way that I can create a skills taxonomy. I chose to create an undirected network graph where any time two skills are taken together in an employee's skill-set, it draws an edge between them and the weight of it is how many times those related skills are taken by employees.
There are about 8000 nodes and millions of connections in that graph. My next task is to cluster that graph in such a way that I can see what skills are similar.
The problem is that all the algorithms (ex: connected subgraph components, clustering etc) provided in NetworkX only work for 2000 nodes. When I try to increase the number of nodes, I don't get clear results.
Is there a way I can cluster on 8000 very connected nodes? Any suggestions? I am working in Python.
python networkx graph-theory
python networkx graph-theory
edited Nov 26 '18 at 16:43
shindig_
2816
asked Nov 20 '18 at 16:28
sanobar lalasanobar lala
62
edited Nov 26 '18 at 16:43
shindig_
2816
asked Nov 20 '18 at 16:28
sanobar lalasanobar lala
62
edited Nov 26 '18 at 16:43
shindig_
2816
edited Nov 26 '18 at 16:43
shindig_
2816
edited Nov 26 '18 at 16:43
shindig_
2816
2816
asked Nov 20 '18 at 16:28
sanobar lalasanobar lala
62
asked Nov 20 '18 at 16:28
sanobar lalasanobar lala
62
asked Nov 20 '18 at 16:28
sanobar lalasanobar lala
62
62
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
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: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
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%2fstackoverflow.com%2fquestions%2f53397381%2fclustering-on-highly-connected-networkx-undirected-graph%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 Stack Overflow!
- 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.
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%2fstackoverflow.com%2fquestions%2f53397381%2fclustering-on-highly-connected-networkx-undirected-graph%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
