Research on random walk rough matching algorithm of attribute sub-graph

Key Engineering Materials

Volumn 474-476, Issue , 2011, Pages 297-302

  Zhang, Chunying ^a,b   Guo, Jingfeng ^a   Chen, Xiao ^b  

^a YANSHAN UNIVERSITY   (China)

^b HEBEI UNITED UNIVERSITY   (China)

Author keywords

Attribute sub graph; Frequent attribute sub graph; Random walk; Rough matching

Indexed keywords

RANDOM PROCESSES;

ATTRIBUTE GRAPHS; ATTRIBUTE VALUES; MATCHING ALGORITHM; MATCHING PROBLEMS; RANDOM WALK; ROUGH MATCHING; SUBGRAPHS;

PATTERN MATCHING;

EID: 79955791780     PISSN: 10139826     EISSN: 16629795     Source Type: Book Series    
DOI: 10.4028/www.scientific.net/KEM.474-476.297     Document Type: Conference Paper

References (6)

1. Jing fengguo, Chunying Zhang, Xiao Chen. Attribute Graph and Its Structure[J]. ICIC Express Letters, (2010) (ICIC-EL10-1014).
2. Jingfeng Guo, Dandan Hao, Chao Zheng. A Entity distinguish algorithm based on attribute relation graph[J] . ICIC Express Letters, (2010).
3. Hanghang Tong, Brian Gallagher, Christos Faloutsos, Tina Eliassi-Rad. Fast Best-Effort Pattern Matching in Large Attributed Graphs. ACM, (2006).
4. Wei Zheng, Zhaokun Wang, Zhang Liu, Jianmin Wang. A multi-label classification algorithm based on random walk[J]. NDBC (2010) 10-22.
5. Yuli Lei, Yang Li. The entity recognition method of markov random walk similarity based on the weight. (2010), 34(1), p. 26-30.
6. Dmitri V.Kalashnikov, Sharad Mehrotra, Zhaoqi Chen. Exploiting relationships for domain-independent data cleaning. SDM, (2005).