Research on Random Walk Rough Matching Algorithm of Attribute Sub-Graph

Abstract:

Article Preview

In the analysis of social network, the attribute values of an entity change constantly as time goes by and the corresponding attribute graph changes accordingly. However, the essence of the entity is invariable. The problem is how to discover essence from the change of mining frequent rough matching attribute sub-graph in an attribute graph in this paper. The problem of the attribute sub-graph rough matching is defined and described, then the random walk rough matching algorithm of attribute sub-graph is designed so that the problem of incomplete coincide attribute sub-graph rough matching would be solved. Attribute sub-graph is the expansion of the traditional sub-graph; rough matching problem is the extension of traditional sub-graph matching problem. With the help of the random walk rough matching algorithm of attribute sub-graph, more potential frequent attribute sub-graphs can be discovered, and more valuable information mined.

Info:

Periodical:

Key Engineering Materials (Volumes 474-476)

Edited by:

Garry Zhu

Pages:

297-302

DOI:

10.4028/www.scientific.net/KEM.474-476.297

Citation:

C. Y. Zhang et al., "Research on Random Walk Rough Matching Algorithm of Attribute Sub-Graph", Key Engineering Materials, Vols. 474-476, pp. 297-302, 2011

Online since:

April 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.