| 摘要 |
PROBLEM TO BE SOLVED: To efficiently and accurately manage resources for graph clustering for obtaining information of interest from large and arbitrary data sets.SOLUTION: A first vertex and a second vertex in a graph are identified as candidates for a link between the first and the second vertices. The first and second vertices represent elements in a data set, and a link represents a type and strength of relationship between the first and the second vertices. A link indicator is then determined based on a first link count associated with the first vertex and a second link count associated with the second vertex. The link count indicates a sum of respective weights of links of a vertex. Whether to connect the first and second vertices with a link or not is then determined based on the link indicator's conformity with a link threshold. The link threshold represents a measurement value for determining whether to connect two vertices using a link. |
