Scribd Logo
Upload

Welcome to Scribd!

  • Networks As One of The Most Complex Data Are Composed of Nodes and Edges

    Uploaded by

    Ritika Baderia
    6 views1 page
    Networks consist of nodes and edges, including tightly connected community structures that are used in applications like musical rhythm analysis and protein function prediction. Popular unsupervised community detection methods include modularity-based, divisive, and label propagation algorithms, but they do not work well on complex structures with many internal links. Therefore, semi-supervised methods sometimes incorporate prior information, though it is often scarce, so unsupervised self-organizing methods like nonnegative matrix factorization that decompose a network into a low-dimensional subspace are generally preferred.

    Original Description:

    Original Title

    Networks as one of the most complex data are composed of nodes and edges

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Networks consist of nodes and edges, including tightly connected community structures that are used in applications like musical rhythm analysis and protein function prediction. Popular unsupervised community detection methods include modularity-based, divisive, and label propagation algorithms, but they do not work well on complex structures with many internal links. Therefore, semi-supervised methods sometimes incorporate prior information, though it is often scarce, so unsupervised self-organizing methods like nonnegative matrix factorization that decompose a network into a low-dimensional subspace are generally preferred.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views1 page

    Networks As One of The Most Complex Data Are Composed of Nodes and Edges

    Uploaded by

    Ritika Baderia
    Networks consist of nodes and edges, including tightly connected community structures that are used in applications like musical rhythm analysis and protein function prediction. Popular unsupervised community detection methods include modularity-based, divisive, and label propagation algorithms, but they do not work well on complex structures with many internal links. Therefore, semi-supervised methods sometimes incorporate prior information, though it is often scarce, so unsupervised self-organizing methods like nonnegative matrix factorization that decompose a network into a low-dimensional subspace are generally preferred.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Networks as one of the most complex data are composed of nodes

    and edges. Among them is the community structure which has tightly
    connected nodes within. These structures are used in many
    applications such as musical rhythmic pattern extraction, protein
    function predictions, etc. Some popular community detection
    methods are modularity-based algorithms (extremal optimization,
    spectral optimization ) , divisive algorithm ( eg; GN algorithm), label
    propagation algorithm etc, which do not work well with complex
    structures ( structure with many intracommunity links).
    Therefore, to tackle the problem many researches used prior
    information in a semi supervised manner based on spin glass model (
    by Eaton atal) or semi-supervised nonnegative matrix factorization
    model but the prior information is scarce and not easily available for
    which the unsupervised methods are preferred more. These
    unsupervised method are self-organising. The famous nonnegative
    matrix factorization (NMF) presumes that a network can be divided into
    low dimensional subspace

    You might also like