{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T22:25:10Z","timestamp":1649197510280},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,10,1]],"date-time":"2007-10-01T00:00:00Z","timestamp":1191196800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sc. China"],"published-print":{"date-parts":[[2007,10]]},"DOI":"10.1007\/s11704-007-0043-y","type":"journal-article","created":{"date-parts":[[2007,11,19]],"date-time":"2007-11-19T15:45:05Z","timestamp":1195487105000},"page":"450-458","source":"Crossref","is-referenced-by-count":0,"title":["Towards structural Web Services matching based on Kernel methods"],"prefix":"10.1007","volume":"1","author":[{"given":"Kai","family":"Nan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianjun","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengmin","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","first-page":"333","volume-title":"Proceedings of ISWC","author":"M. Paolucci","year":"2002","unstructured":"Paolucci M, Kawmura T, Payne T, et al. Semantic matching of web services capabilities. In: Proceedings of ISWC. Berlin: Springer, 2002, 333\u2013347"},{"key":"43_CR2","first-page":"151","volume-title":"Proceedings of ACM SIGIR","author":"D. Carmel","year":"2003","unstructured":"Carmel D, Maarek Y S, Mandelbrod M, et al. Searching XML documents via XML fragments. In: Proceedings of ACM SIGIR. New York: ACM Press, 2003, 151\u2013158"},{"key":"43_CR3","unstructured":"Kokash N. A comparison of web service interface similarity measures. Technical Report. University of Trento, DIT-06-025, 2006"},{"key":"43_CR4","first-page":"194","volume-title":"Proceedings of ICSOC","author":"Y. Wang","year":"2003","unstructured":"Wang Y, Stroulia E. Semantic structure matching for assessing web service similarity. In: Proceedings of ICSOC. Berlin: Springer, 2003, 194\u2013207"},{"key":"43_CR5","first-page":"1249","volume-title":"Proceedings of WWW","author":"J. Yu","year":"2007","unstructured":"Yu J, Guo S, Su H, et al. A Kernel based structure matching for web services search. In: Proceedings of WWW. New York: ACM Press, 2007, 1249\u20131250"},{"issue":"10","key":"43_CR6","first-page":"57","volume":"57","author":"S. Cost","year":"1993","unstructured":"Cost S, Salzberg S. A weighted nearest neighbor algorithm for learning with symbolic features. Machine Learning, 1993, 57(10): 57\u201378","journal-title":"Machine Learning"},{"key":"43_CR7","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/243199.243276","volume-title":"Proceedings of SIGIR","author":"L. S. Larkey","year":"1996","unstructured":"Larkey L S, Croft W. Combining classifiers in text categorization. In: Proceedings of SIGIR. New York: ACM Press, 1996, 289\u2013297"},{"issue":"2\u20133","key":"43_CR8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/A:1007692713085","volume":"39","author":"K. Nigam","year":"2000","unstructured":"Nigam K, Mccallum A K, Thrun S, et al. Text classification from labeled and unlabeled documents using EM. Machine Learning, 2000, 39(2\u20133): 103\u2013134","journal-title":"Machine Learning"},{"key":"43_CR9","first-page":"372","volume-title":"Proceedings of VLDB","author":"X. Dong","year":"2004","unstructured":"Dong X, Halevy A, Madhavan J, et al. Similarity search for web services. In: Proceedings of VLDB. San Fransisco: Morgan Kaufmann, 2004, 372\u2013383"},{"key":"43_CR10","first-page":"906","volume-title":"Proceedings of ACM SIGMOD","author":"D. Aumuller","year":"2005","unstructured":"Aumuller D, Do H H, Massmann S, et al. Schema and ontology matching with COMA++. In: Proceedings of ACM SIGMOD. New York: ACM Press, 2005, 906\u2013908"},{"key":"43_CR11","first-page":"49","volume-title":"Proceedings of VLDB","author":"J. Madhavan","year":"2001","unstructured":"Madhavan J, Bernstein P, Rahm E. Generic schema matching with cupid. In: Proceedings of VLDB. San Francisco: Morgan Kaufmann, 2001, 49\u201358"},{"key":"43_CR12","first-page":"117","volume-title":"Proceedings of ICDE","author":"S. Melnik","year":"2002","unstructured":"Melnik S, Garcia-Molina H, Rahm E. Similarity flooding: a versatile graph matching algorithm. In: Proceedings of ICDE. Washington DC: IEEE Computer Society, 2002, 117\u2013128"},{"key":"43_CR13","unstructured":"Flesca S, Manco G, Masciari E, et al. Detecting structural similarities between XML documents. In: Proceedings of WebDB. Wisconsin, 2002, 55\u201360"},{"issue":"1","key":"43_CR14","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/TKDE.2004.1264824","volume":"16","author":"W. Lian","year":"2004","unstructured":"Lian W, Cheung D W I, Mamoulis N, et al. An efficient and scalable algorithm for clustering XML documents by structure. IEEE Transaction on Knowledge and Data Engineering, 2004, 16(1): 82\u201396","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"issue":"16","key":"43_CR15","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"Zhang K, Shasha D. Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal on Computing, 1989, 18(16): 1245\u20131262","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"43_CR16","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/959242.959248","volume":"5","author":"T. Gartner","year":"2003","unstructured":"Gartner T. A survey of kernels for structured data. ACM SIGKDD Explorations Newsletter, 2003, 5(1): 49\u201358","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"43_CR17","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1017\/CBO9780511809682.012","volume-title":"Kernel Methods for Pattern Analysis","author":"J. Shawe-Taylor","year":"2004","unstructured":"Shawe-Taylor J, Cristianini N. Kernel Methods for Pattern Analysis. United Kingdom: Cambridge University Press, 2004, 344\u2013372"},{"key":"43_CR18","unstructured":"Vishwanathan S, Smola A. Fast kernels for string and tree matching. Advances in Neural Information Processing Systems, 2002, 569\u2013576"},{"key":"43_CR19","first-page":"59","volume-title":"Proceedings of ICWS","author":"A. Charfi","year":"2005","unstructured":"Charfi A, Mezini M. Using aspects for security engineering of web service compositions. In: Proceedings of ICWS. Washington DC: IEEE Computer Society, 2005, 59\u201366"},{"issue":"6","key":"43_CR20","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/MIC.2004.58","volume":"8","author":"N. Milanovic","year":"2004","unstructured":"Milanovic N, Malek M. Current solutions for web service composition. Internet Computing, 2004, 8(6): 51\u201359","journal-title":"Internet Computing"},{"issue":"4","key":"43_CR21","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"Hopcroft J E, Karp R M. A n2\/5 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 1973, 2(4): 225\u2013231","journal-title":"SIAM Journal on Computing"},{"key":"43_CR22","first-page":"811","volume-title":"Proceedings of WWW","author":"J. Xu","year":"2005","unstructured":"Xu J, Cao Y, Li H, et al. Ranking definitions with supervised learning methods. In: Proceedings of WWW. New York: ACM Press, 2005, 811\u2013819"},{"key":"43_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04921-1","volume-title":"Algorithms on Trees and Graphs","author":"G. Valiente","year":"2002","unstructured":"Valiente G. Algorithms on Trees and Graphs. New York: Springer-Verlag, 2002"}],"container-title":["Frontiers of Computer Science in China"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-007-0043-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11704-007-0043-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-007-0043-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:00:45Z","timestamp":1559408445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11704-007-0043-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,10]]}},"alternative-id":["43"],"URL":"https:\/\/doi.org\/10.1007\/s11704-007-0043-y","relation":{},"ISSN":["1673-7350","1673-7466"],"issn-type":[{"value":"1673-7350","type":"print"},{"value":"1673-7466","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10]]}}}