Author:
Wang Kexiang,Chang Baobao,Sui Zhifang
Publisher
Springer International Publishing
Reference17 articles.
1. Bertsekas, Dimitri P., and John N. Tsitsiklis. 1989. Parallel and distributed computation: Numerical methods (Vol. 23). Englewood Cliffs, NJ: Prentice Hall.
2. Cheatham, Michelle, and Pascal Hitzler. 2013. String similarity metrics for ontology alignment. In International Semantic Web Conference. Berlin and Heidelberg: Springer. Available at https://link.springer.com/chapter/10.1007/978-3-642-41338-4_19. Accessed 26 April 2017.
3. Cho, Minsu, Jungmin Lee, and Kyoung Mu Lee. 2010. Reweighted random walks for graph matching. In European Conference on Computer Vision. Berlin and Heidelberg: Springer. Available at https://link.springer.com/chapter/10.1007/978-3-642-15555-0_36. Accessed 26 April 2017.
4. Euzenat, Jrme, and Pavel Shvaiko. 2007. Ontology matching (Vol. 18). Heidelberg: Springer.
5. Gold, Steven, and Anand Rangarajan. 1996a. A graduated assignment algorithm for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(4):377–388.