Machine optimization device, method and system

Machine optimization device, method and system

  • CN 102,317,962 B
  • Filed: 12/11/2009
  • Issued: 03/16/2016
  • Est. Priority Date: 12/12/2008
  • Status: Active Grant
First Claim
Patent Images

1. the Computerized method for advertizer is mated with search terms, described method comprises:

  • There is provided the first bigraph (bipartite graph) data structure, described first bigraph (bipartite graph) data structure has multiple advertizer'"'"'s node and multiple search terms node, and wherein each advertizer'"'"'s node is by the search terms node of edge conjunction to correspondence;

    There is provided profit matrix, described profit matrix has the profit at the every bar edge for described first bigraph (bipartite graph) data structure;

    There is provided the degree distribution data of the degree distribution representing each node, wherein, the degree distribution of each node represents the linking number preference of this node;

    Produce the second bigraph (bipartite graph) data structure, described second bigraph (bipartite graph) data structure comprises the node of described first bigraph (bipartite graph) data structure and multiple dummy node;

    The processor being suitable for performing weight matrix-expand is utilized to produce weight matrix, the value that described weight matrix comprises described profit matrix and the bonus values associated with described dummy node, the described bonus values in described weight matrix be determine based on described degree distribution data and comprise one group of weight of zero value;

    The joint constraint of described first bigraph (bipartite graph) data structure will be corresponded in described second bigraph (bipartite graph) data structure to predetermined extent value, and do not retrain the described dummy node in described second bigraph (bipartite graph) data structure;

    Mate based on described second bigraph (bipartite graph) data structure determination weight limit b, wherein b is arranged to described predetermined extent value;

    Produce the middle bigraph (bipartite graph) data structure with binary weighted value;

    To bear results graphic data structure to remove dummy node by intercepting described middle bigraph (bipartite graph) data structure;

    Select predetermined quantity with advertizer'"'"'s node of each search terms node matching of one group of search terms node interested, described coupling determines based on the result pattern values of advertizer'"'"'s node adjacent with each interested search terms node;

    AndExport the selected advertizer'"'"'s node with each interested search terms node matching.

View all claims
    ×
    ×

    Thank you for your feedback

    ×
    ×