A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
A PCA approach for fast retrieval of structural patterns in attributed graphs
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)
Attributed graph (AG) is a useful data structure for representing complex patterns in a wide range of applications such as computer vision, image database retrieval, and other knowledge representation tasks where similar or exact corresponding structural patterns must be found. Existing methods for attributed graph matching (AGM) often suffer from the combinatorial problem whereby the execution cost for finding an exact or similar match is exponentially related to the number of nodes the AGdoi:10.1109/3477.956043 pmid:18244846 fatcat:7pjvdd2cjnatfllkm7bpzwtf74