
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Zhiwei Lin, Hui Wang, Sally McClean, "A Multidimensional Sequence Approach to Measuring Tree Similarity," IEEE Transactions on Knowledge and Data Engineering, vol. 24, no. 2, pp. 197208, February, 2012.  
BibTex  x  
@article{ 10.1109/TKDE.2010.239, author = {Zhiwei Lin and Hui Wang and Sally McClean}, title = {A Multidimensional Sequence Approach to Measuring Tree Similarity}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {24}, number = {2}, issn = {10414347}, year = {2012}, pages = {197208}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.239}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  A Multidimensional Sequence Approach to Measuring Tree Similarity IS  2 SN  10414347 SP197 EP208 EPD  197208 A1  Zhiwei Lin, A1  Hui Wang, A1  Sally McClean, PY  2012 KW  All common subsequences KW  approximate tree edit distance KW  dynamic time warping KW  the longest common subsequence KW  tree edit distance KW  tree kernel KW  tree similarity. VL  24 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] F. Aiolli, G. Da San Martino, and A. Sperduti, "Route Kernels for Trees," Proc. 26th Ann. Int'l Conf. Machine Learning, pp. 1724, 2009.
[2] J. Allali and M.F. Sagot, "Novel Tree Edit Operations for rna Secondary Structure Comparison," Lecture Notes in Computer Science, SpringerVerlag, pp. 412425, 2004.
[3] N. Augsten, M. Böhlen, and J. Gamper, "Approximate Matching of Hierarchical Data Using PQGrams," Proc. 31st Int'l Conf. Very Large Data Bases, pp. 301312, 2005.
[4] C. Bahlmann, B. Haasdonk, and H. Burkhardt, "Online Handwriting Recognition with Support Vector Machines" a Kernel Approach," Proc. Eighth IEEE Int'l Workshop Frontiers in Handwriting Recognition (IWFHR '02), p. 49, 2002.
[5] P. Bille, "A Survey on Tree Edit Distance and Related Problems," Theoretical Computer Science, vol. 337, nos. 13, pp. 217239, 2005.
[6] W.A. Chaovalitwongse and P.M. Pardalos, "On the Time Series Support Vector Machine Using Dynamic Time Warping Kernel for Brain Activity Classification," Cybernetics and Systems Analysis, vol. 44, no. 1, pp. 125138, 2008.
[7] S.S. Chawathe, "Comparing Hierarchical Data in External Memory," Proc. 25th Int'l Conf. Very Large Data Bases, pp. 90101, 1999.
[8] W. Che, M. Zhang, A. Aw, C. Tan, T. Liu, and S. Li, "Using a Hybrid Convolution Tree Kernel for Semantic Role Labeling," ACM Trans. Asian Language Information Processing (TALIP), vol. 7, no. 4, pp. 123, 2008.
[9] W. Chen, "New Algorithm for Ordered TreetoTree Correction Problem," J. Algorithms, vol. 40, no. 2, pp. 135158, 2001.
[10] M. Collins and N. Duffy, "Convolution Kernels for Natural Language," Proc. Conf. Advances in Neural Information Processing Systems 14, pp. 625632, 2001.
[11] T. Dalamagas, T. Cheng, K.J. Winkel, and T. Sellis, "A Methodology for Clustering xml Documents by Structure," Information System, vol. 31, no. 3, pp. 187228, 2006.
[12] B. David, "A Short Survey of Document Structure Similarity Algorithms," Proc. Fifth Int'l Conf. Internet Computing, pp. 39, 2004.
[13] E.D. Demaine, S. Mozes, B. Rossman, and O. Weimann, "An Optimal Decomposition Algorithm for Tree Edit Distance," ACM Trans. Algorithms, vol. 6, no. 1, pp. 119, 2009.
[14] C. Elzinga, S. Rahmann, and H. Wang, "Algorithms for Subsequence Combinatorics," Theoretical Computer Science, vol. 409, no. 3, pp. 394404, 2008.
[15] M. Garofalakis and A. Kumar, "Xml Stream Processing using Treeedit Distance Embeddings," ACM Trans. Database Systems, vol. 30, no. 1, pp. 279332, 2005.
[16] T. Gärtner, "A Survey of Kernels for Structured Data," SIGKDD. Explorations, vol. 5, no. 1, pp. 4958, 2003.
[17] S. Gudmundsson, T. Runarsson, Philip, and S. Sigurdsson, "Support Vector Machines and Dynamic Time Warping for Time Series," Proc. IEEE Int'l Joint Conf. Neural Networks, pp. 27722776, 2008.
[18] S. Guha, H.V. Jagadish, N. Koudas, D. Srivastava, and T. Yu, "Approximate xml Joins," Proc. 2002 ACM SIGMOD Int'l Conf. Management of Data, pp. 287298, 2002.
[19] D. Haussler, "Convolution Kernels on Discrete Structures," Technical Report UCSCCRL9910, Dept. of Computer Science, Univ. of California at Santa Cruz, 1999.
[20] S. Hiroshi, N. Kenichi, N. Mitsuru, and S. Shigeki, "Dynamic Timealignment Kernel in Support Vector Machine," Proc. Conf. Neural Information Processing Systems: Natural and Synthetic (NIPS '01), 2001.
[21] D.S. Hirschberg, "A Linear Space Algorithm for Computing Maximal Common Subsequences," Comm. ACM, vol. 18, no. 6, pp. 341343, 1975.
[22] H. Kashima and T. Koyanagi, "Kernels for SemiStructured Data," Proc. 19th Int'l Conf. Machine Learning, pp. 291298, 2002.
[23] E. Keogh, "Exact Indexing of Dynamic Time Warping," Proc. 28th Int'l Conf. Very Large Data Bases, pp. 406417, 2002.
[24] P.N. Klein, "Computing the EditDistance between Unrooted Ordered Trees," Proc. Sixth Ann. European Symp. Algorithms, pp. 91102, 1998.
[25] H. Lei and B. Sun, "A Study on the Dynamic Time Warping in Kernel Machines," Proc. 2007 Third Int'l IEEE Conf. SignalImage Technologies and InternetBased System, pp. 839845, 2007.
[26] D. Lemire, "Faster Retrieval with a TwoPass DynamictimeWarping Lower Bound," Pattern Recognition, vol. 42, no. 9, pp. 21692180, 2009.
[27] C. Leslie, E. Eskin, A. Cohen, J. Weston, and W.S. Noble, "Mismatch String Kernels for SVM Protein Classification," Neural Information Processing Systems, vol. 15, pp. 14411448, 2003.
[28] V. Levenshtein, "Binary Codes Capable of Correcting Deletions, Insertions and Reversals," Soviet Physics Doklady, vol. 10, p. 707, 1966.
[29] A. Moschitti, "Efficient Convolution Kernels for Dependency and Constituent Syntactic Trees," Proc. 17th European Conf. Machine Learning, pp. 318329, Sept. 2006.
[30] A. Moschitti, "Making Tree Kernels Practical for Natural Language Learning," Proc. Eleventh Int'l Conf. European Assoc. Computational Linguistics, 2006.
[31] A. Moschitti, D. Pighin, and R. Basili, "Tree Kernels for Semantic Role Labeling," Computational Linguistics, vol. 34, no. 2, pp. 193224, 2008.
[32] M. Neuhaus and H. Bunke, "Edit DistanceBased Kernel Functions for Structural Pattern Classification," Pattern Recognition, vol. 39, no. 10, pp. 18521863, 2006.
[33] H. Sakoe, "Dynamic Programming Algorithm Optimization for Spoken Word Recognition," IEEE Trans. Acoustics, Speech, and Signal Processing, vol. 26, pp. 4349, 1978.
[34] T. Seidl and H.P. Kriegel, "Optimal MultiStep kNearest Neighbor Search," ACM SIGMOD Record, vol. 27, no. 2, pp. 154165, 1998.
[35] S.M. Selkow, "The TreetoTree Editing Problem," Information Processing Letters, vol. 6, no. 6, pp. 184186, 1977.
[36] K.C. Tai, "The TreetoTree Correction Problem," J. ACM, vol. 26, no. 3, pp. 422433, 1979.
[37] Y. Takahashi, Y. Satoh, H. Suzuki, and S. ichi Sasaki, "Recoginition of Largest Common Structural Fragmaent among a Variety of Chemical Structures," Analytical Sciences, vol. 3, pp. 2328, 1987.
[38] A. Tatsuya, F. Daiji, and A. Takasu, "Approximating Tree Edit Distance through String Edit Distance," Algorithmica, vol. 57, no. 2, pp. 325348, 2010.
[39] K. Tetsuji, H. Kouichi, K. Hisashi, F.K. Kiyoko, and Y. Hiroshi, "A Spectrum Tree Kernel," Trans. Japanese Soc. Artificial Intelligence, vol. 22, no. 2, pp. 140147, 2007.
[40] H. Touzet, "Comparing Similar Ordered Trees in LinearTime," J. Discrete Algorithms, vol. 5, no. 4, pp. 696705, 2007.
[41] H. Wang, "All Common Subsequences," Proc. 20th Int'l Joint Conf. Artifical Intelligence, pp. 635640, 2007.
[42] R. Yang, P. Kalnis, and A.K.H. Tung, "Similarity Evaluation on Treestructured Data," Proc. 2005 ACM SIGMOD Int'l Conf. Management of Data, pp. 754765, 2005.
[43] D. Zhang and W.S. Lee, "Question Classification Using Support Vector Machines," Proc. 26th Ann. Int'l ACM SIGIR Conf. Research and Development in Informaion Retrieval, pp. 2632, 2003.
[44] K. Zhang and D. Shasha, "Simple Fast Algorithms for the Editing Distance between Trees and Related Problems," SIAM J. Computing, vol. 18, no. 6, pp. 12451262, 1989.