Giter Club home page Giter Club logo

Comments (2)

marinkaz avatar marinkaz commented on May 18, 2024

Dear Naarkhoo,

that is actually expected behaviour. Please see the paper by Brunet et al. on cophenetic correlation coefficient-based measure.

To compute the cophenetic correlation scores (coph_cor is the name of the method in Nimfa), one need the consensus matrix. Consensus matrix is the average connectivity matrix over many runs. The last thing is crucial here.

If you call model.estimate_rank method, the factorization is repeated several times (depending on n_run parameter), each run produces a distinct connectivity matrix and these are then used for estimating the consensus matrix.

If you call fit.summary() then the cophenetic measure is computed based on single current factorized model, which has only one connectivity matrix and the consensus matrix is then trivial: all of its entries are equal to 1. Notice that the entries in consensus matrix range from 0 to 1 and reflect the probability that samples i and j are clustered together. Entries equal to 1 indicate perfectly stable clustering and no varying among the runs (obviously, as we have only one factorized model there aren't any variations here). In short, fit.summary() returns perfect stability (cophenetic = 1) because we have access to matrix factors from a single run and based on that data alone the stability of clustering is perfect. That is, its estimation is useless and factorization should be repeated several times.

  • See Nimfa's documentation on estimate_rank method at http://nimfa.biolab.si/nimfa.models.nmf.html. There is a note that estimate_rank tracks matrix factors because it needs them for computing cophentic correlation coefficient.
  • See paper 'Metagenes and molecular pattern discovery using matrix factorization' by Brunet et al., which describes the method implemented in Nimfa for evaluating the stability of clustering using cophenetic correlation coefficient. Method of Brunet et al. is computed s the Pearson correlation of two distance matrices: the distance between samples induced by the consensus matrix, and the distance between samples induced by the linkage used in the reordering of of consensus matrix.

from nimfa.

naarkhoo avatar naarkhoo commented on May 18, 2024

Thanks, Now, It makes a lot of sense. I will look into those paper.

from nimfa.

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.