A Comparison between Structural and Embedding Methods for Graph Classification
A Comparison between Structural and Embedding Methods for Graph Classification
复制标题
图分类的结构方法和嵌入方法的比较
DOI:
10.1007/978-3-642-34166-3_26
复制
发表时间:
2012
期刊:
影响因子:
--
通讯作者:
F. Serratosa
中科院分区:
文献类型:
--
作者:
Albert Solé;X. Cortés;F. Serratosa
Structural pattern recognition is a well-know research field that has its birth in the early 80s. Throughout 30 years, structures such as graphs have been compared through optimization of functions that directly use attribute values on nodes and arcs. Nevertheless, in the last decade, kernel and embedding methods appeared. These new methods deduct a similarity value and a final labelling between nodes through representing graphs into a multi-dimensional space. It seems that lately kernel and embedding methods are preferred with respect to classical structural methods. However, both approaches have advantages and drawbacks. In this work, we compare structural methods to embedding and kernel methods. Results show that, with the evaluated datasets, some structural methods give slightly better performance and therefore, it is still early to discard classical structural methods for graph pattern recognition.
DOI:
--
发表时间:
2006
期刊:
Proc. of International Conference on Pattern Recognition (ICPR2006)
影响因子:
--
作者:
Duy-Dinh Le;Shin'ichi Satoh
通讯作者:
Shin'ichi Satoh