图 书 馆
在中间值和最大公共子图之间的关系的一组图形On the Relation Between the Median and the Maximum Common Subgraph of a Set of Graphs |
|
| 课程网址: | http://videolectures.net/gbr07_ferrer_otrb/ |
| 主讲教师: | Miquel Ferrer |
| 开课单位: | 巴塞罗那自治大学 |
| 开课时间: | 2007-07-12 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Given a set of elements, the median can be a useful concept to get a representative that captures the global information of the set. In the domain of structural pattern recognition, the median of a set of graphs has also been defined and some properties have been derived. In addition, the maximum common subgraph of a set of graphs is a well known concept that has various applications in pattern recognition. The computation of both the median and the maximum common subgraph are highly complex tasks. Therefore, for practical reasons, some strategies are used to reduce the search space and obtain approximate solutions for the median graph. The bounds on the sum of distances of the median graph to all the graphs in the set turns out to be useful in the definition of such strategies. In this paper, we reduce the upper bound of the sum of distances of the median graph and we relate it to the maximum common subgraph. |
| 关 键 词: | 计算机科学; 机器学习; 模式识别 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-11-28：cwx |
| 阅读次数: | 55 |