System and method for roughening picture

System and method for roughening picture

  • CN 101,324,937 B
  • Filed: 06/15/2007
  • Issued: 05/20/2015
  • Est. Priority Date: 06/15/2007
  • Status: Active Grant
First Claim
Patent Images

1. one kind for carrying out alligatoring to find the network analysis method of community in a network to figure, wherein said network is computer network, described network is modeled as figure, described figure comprises multiple summit, wherein, one is comprised to the computer network of multiple webpage, each webpage can be counted as a summit, hyperlink between each webpage can be counted as limit, and described method comprises:

  • Roughening step, comprising;

    A) the merging modularity yield value between described current vertex and its each adjacent vertex is calculated to a current vertex;

    B) similarity between described current vertex and its each adjacent vertex is calculated;

    C) based on the merging modularity yield value calculated and similarity, determine whether described current vertex can be adjacent vertex merge, and determining to merge when can merge,Refinement step, comprising;

    To the figure refinement of the alligatoring that above-mentioned roughening step obtains, to find the community in described network,Wherein described in modularity value formulae discovery, merge modularity yield value and similarity,Wherein step a) also comprises;

    Calculate the merging modularity yield value Δ

    Q of described current vertex and one of them adjacent vertex described in the following way c;

    the modularity value Q calculating the figure be made up of described current vertex and one of them adjacent vertex described c, the modularity value Q of figure to be made up of described current vertex aand the modularity value Q of the figure to be made up of one of them adjacent vertex described b, and calculate Δ

    Q c=Q c-Q a-Q b, and After calculating described merging modularity yield value to each adjacent vertex of described current vertex, determine to merge the maximum summit of modularity yield value described in each adjacent vertex,Wherein step c) also comprise;

    merging the maximum adjacent vertex of modularity yield value and the maximum adjacent vertex of similarity by obtaining, determining whether described current vertex can be adjacent vertex merge,Wherein step c) also comprise;

    Determine whether the adjacent vertex that described merging modularity yield value is maximum and the maximum adjacent vertex of described similarity are same adjacent vertex;

    If so, then determine that described current vertex can be maximum adjacent vertex with described merging modularity yield value and similarity and merge.

View all claims
    ×
    ×

    Thank you for your feedback

    ×
    ×