图 书 馆
基础的方法对部分集团枚举A Continuous-Based Approach for Partial Clique Enumeration |
|
| 课程网址: | http://videolectures.net/gbr07_bulo_acba/ |
| 主讲教师: | Samuel Rota Bulo |
| 开课单位: | 加州大学 |
| 开课时间: | 2007-07-07 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | In many applications of computer vision and pattern recog- nition which use graph-based knowledge representation, it is of great interest to be able to extract the K largest cliques in a graph, but most methods are geared either towards extracting the single clique of max- imum size, or enumerating all cliques, without following any particular order. In this paper we present a novel approach for partial clique enu- meration, that is, the extraction of the K largest cliques of a graph. Our approach is based on a continuous formulation of the clique problem de- veloped by Motzkin and Straus, and is able to avoid extracting the same clique multiple times. This is done by casting the problem into a game- theoretic framework and iteratively rendering unstable the solutions that have already been extracted. |
| 关 键 词: | 计算机视觉; 模式识别; K最大团图的提取 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2020-06-20：zyk |
| 阅读次数: | 63 |