Pattern vectors from algebraic graph theory
Graph structures have proven computationally cumbersome for pattern analysis. The reason for this is that, before graphs can be converted to pattern vectors, correspondences must be established between the nodes of structures which are potentially of different size. To overcome this problem, in this...
| Publié dans: | IEEE transactions on pattern analysis and machine intelligence. - 1998. - 27(2005), 7 vom: 01. Juli, Seite 1112-24 |
|---|---|
| Auteur principal: | |
| Autres auteurs: | , |
| Format: | Article |
| Langue: | English |
| Publié: |
2005
|
| Accès à la collection: | IEEE transactions on pattern analysis and machine intelligence |
| Sujets: | Comparative Study Evaluation Study Journal Article Research Support, Non-U.S. Gov't |