Coder Social home page Coder Social logo

Comments (4)

girwin1 avatar girwin1 commented on August 15, 2024 1

Thank you. This is what I did in the end. I think I initially misunderstood how this worked. My concern was that new nodes might be forced into partitions where they did not really belong. But now i realise new nodes will only form part of an existing cluster if that is better than creating a new one.

This has been a really neat module.

from leidenalg.

vtraag avatar vtraag commented on August 15, 2024

Have you already considered using "Fixed Nodes"?

from leidenalg.

girwin1 avatar girwin1 commented on August 15, 2024

Thank you for responding. That's what I'm trying.

For a multiplex graph, I guess it doesn't matter which graph you choose to be G (in the "Fixed Nodes" example), as the partitions are the same across the layers?

As for new nodes, are completely unconnected nodes disregarded? And then you can control the sensitivity for assigning new nodes with the resolution parameter?

Or would you assign all new (connected) nodes to a partition then exclude those below a certain modularity as a separate step?

from leidenalg.

vtraag avatar vtraag commented on August 15, 2024

For a multiplex graph, I guess it doesn't matter which graph you choose to be G (in the "Fixed Nodes" example), as the partitions are the same across the layers?

Yes, indeed. Note that the argument is_membership_fixed is an argument of optimise_partition_multiplex, not of any particular partition of any layer/graph.

As for new nodes, are completely unconnected nodes disregarded? And then you can control the sensitivity for assigning new nodes with the resolution parameter?

New nodes are not disregarded, they are simply not fixed. You should make sure that they are assigned some cluster when you create a new graph and initial partition of that new graph.

Or would you assign all new (connected) nodes to a partition then exclude those below a certain modularity as a separate step?

I am not entirely sure if I understand what you mean here. Personally, I would just assign each new node simply to a new community, such that each new node is a singleton (and unrelated to any existing community). Then by keeping the existing ones fixed, the algorithm will automatically find a way to assign the new nodes to the existing communities (or keep them separate if that is better).

from leidenalg.

Related Issues (20)

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.