Relevance Criteria for Data Mining Using Error-Tolerant Graph Matching
In this paper we present a graph based approach for mining geospatial data. The system uses error-tolerant graph matching to find correspondences between the detected image information and the geospatial vector data. Spatial relations between objects are used to find a reliable object-to-object mapping. Graph matching is used as a flexible query mechanism to answer the spatial query. A condition based on the expected graph error has been presented which allows to determine the bounds of error tolerance and in this way characterizes the relevancy of a query solution. We show that the number of null labels is an important measure to determine relevancy. To be able to correctly interpret the matching results in terms of relevancy the derived bounds of error tolerance are essential.
KeywordsPoint Pattern Graph Match Spatial Query Maximum Clique Problem Graph Base Approach
Unable to display preview. Download preview PDF.
- 7.Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol. 4. Kluwer Academic Publishers, Boston (1999)Google Scholar
- 9.Gautama, S., D’Haeyer, J., Philips, W.: Image-based change detection of geographic information using spatial constraints. In: De Caluwe, R., De Tre, G., Bordogna, G. (eds.) Flexible Querying and Reasoning in Spatio-Temporal Databases: Theories and Applications, pp. 351–368. Springer, Heidelberg (2004)Google Scholar
- 10.Hummel, R., Zucker, S.: On the foundations of relaxation labeling processes. IEEE Trans. Pat. Anal. and Mach. Intel. 5(3), 742–776 (1983)Google Scholar
- 11.Li, S.: Markov Random Field Modeling in Computer Vision. Springer, New-York (1995)Google Scholar
- 12.Pelillo, M., Jagota, A.: Feasible and infeasible maxima in a quadratic program for maximum clique. Journal of Artif. Neural Networks 2(4), 411–420 (1995)Google Scholar
- 13.Wilson, R.: Inexact Graph Matching Using Symbolic Constraints. Ph. D. thesis, Department of Computer Science, University of York (1995)Google Scholar