近似子图匹配Approximate subgraph matching |
|
课程网址: | http://videolectures.net/diversiweb2011_trampus_asm/ |
主讲教师: | Mitja Trampuš |
开课单位: | 约瑟夫·斯特凡学院 |
开课时间: | 2011-04-22 |
课程语种: | 英语 |
中文简介: | 提出了一种基于近似图匹配的主题变化检测方法。文本项表示为语义图, 并基于节点和边缘标签的分类近似匹配。最佳匹配子图用作对项目进行对齐和比较的模板。该方法应用于使用 wordnet 作为预定义分类的新闻报道。在真实世界数据上的图解实验表明, 该方法很有希望。 |
课程简介: | The paper presents an approach to detection of topic variations based on approximate graph matching. Text items are represented as semantic graphs and approximately matched based on a taxonomy of node and edge labels. Best-matching subgraphs are used as a template against which to align and compare the articles. The proposed approach is applied on news stories using WordNet as the predefined taxonomy. Illustrative experiments on real-world data show that the approach is promising. |
关 键 词: | 计算机科学; Web挖掘; 近似子图 |
课程来源: | 视频讲座网 |
最后编审: | 2020-07-28:yumf |
阅读次数: | 78 |