Top-k overlapping densest subgraphs

    Data Min. Knowl. Discov., Volume 30, Issue 5, 2016, Pages 1134-1165.

    Cited by: 14|Bibtex|Views15|Links
    EI
    Keywords:
    Community detectionOverlapping communitiesSocial network analysisDense subgraphsDiverse subgraphsMore(1+)

    Abstract:

    Finding dense subgraphs is an important problem in graph mining and has many practical applications. At the same time, while large real-world networks are known to have many communities that are not well-separated, the majority of the existing work focuses on the problem of finding a densest subgraph. Hence, it is natural to consider the...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments