尖牙 发表于 2025-4-1 02:06:33
http://reply.papertrans.cn/23/2224/222319/222319_61.png美学 发表于 2025-4-1 09:49:20
https://doi.org/10.1007/978-1-4615-7542-9, allowing multiple labels on vertices and edges. Then we define the similarity problem as the search of a best mapping, where a mapping is a correspondence between vertices of the graphs. A key point of our approach is that this mapping does not have to be univalent, so that a vertex in a graph may残暴 发表于 2025-4-1 12:01:10
http://reply.papertrans.cn/23/2224/222319/222319_63.png注射器 发表于 2025-4-1 16:57:57
http://reply.papertrans.cn/23/2224/222319/222319_64.pngENACT 发表于 2025-4-1 22:18:23
V. M. Alekseev,V. M. Tikhomirov,S. V. Fominof CBR has not been much researched. There has been some early work on knowledge-intensive approaches to CBR where the cases contain explanation patterns (e.g. SWALE). However, a more knowledge-light approach where the case similarity is the basis for explanation has received little attention. To ex废除 发表于 2025-4-2 00:31:05
http://reply.papertrans.cn/23/2224/222319/222319_66.png