| Wang, J.T.L., Zhang, K., Chirn, G.W.: Algorithms for approximate graph matching. Inf. Sci. Inf. Comput. Sci. 82(1-2) (1995) 45--74 |
....of the search space. Next, we use estimates of the cost contribution of induced graph edges to compute a minimum (estimated)cost edge cover of the pruned induced graph. Finally, we search for a better signature in the neighborhood of this initial edge cover, using techniques similar to those in [WZC95, SWZS94] In Chapter 9, we present experimental results that explore some of these options. We can often further reduce the size of the search space of signatures by using features of the application domain. For example, consider an application comparing structured documents. Such documents are ....
J. Wang, K. Zhang, and G. Chirn. Algorithms for approximate graph matching. Information Sciences, 82:45--74, 1995.
....data in more detail and the work on the three others very briefly. There are more interesting works that do not fit in one of the aforementioned domains. For example, Klienberg [Kle98] uses the link structure of World Wide Web documents to find pages with similar authorities; Wang et al. WZJS94, WZC95] describe algorithms for approximate tree and graph matchings. Time Series Agrawal et al. AFS93] propose an indexing technique for the fast retrieval of similar time sequences. The idea is to use Discrete Fourier Transform (DFT) to map time sequences (stored in a database) into the frequency ....
J. T. Wang, K. Zhang, and G. Chirn. Algorithms for approximate graph matching. Information Sciences, 82:45--74, 1995.
....of the search space. Next, we use estimates of the cost contribution of induced graph edges to compute a minimum (estimated)cost edge cover of the pruned induced graph. Finally, we search for a better signature in the neighborhood of this initial edge cover, using techniques similar to those in [WZC95, SWZS94] In the full version of the paper we will present experimental performance results that compare various pruning heuristics, and that show how parameters such as tree size and depth, and level of homogeneity in the node labels and the shape of the trees, impact the performance and quality ....
J. Wang, K. Zhang, and G. Chirn. Algorithms for approximate graph matching. Information Sciences, 82:45--74, 1995.
....better than the best classifier available today and provide complementary information to them, thus indicating the potential of the proposed methods. 10.2 Future Works The work described here is part of a project for pattern matching and discovery in scientific, program and document databases [73, 74, 89, 90, 91, 95]. Our future works will focus on: ffl Application of our pattern discovery techniques to trees and graphs and using the discovered patterns to do classification of RNA secondary structures (represented as trees) 15, 49, 53, 55] ffl Development of the discovering algorithms for high dimensional ....
J. T. L. Wang, K. Zhang, and G. W. Chirn, "Algorithms for approximate graph matching," Information Sciences, vol. 82, pp. 45--74, 1995.
No context found.
Wang, J.T.L., Zhang, K., Chirn, G.W.: Algorithms for approximate graph matching. Inf. Sci. Inf. Comput. Sci. 82(1-2) (1995) 45--74
No context found.
J.T.L. Wang, K. Zhang, and G.-W. Chirn. Algorithms for approximate graph matching. Information Sciences, 82:45--74, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC