用于多文档文摘句排序的改进MO算法  

Improved Majority Ordering Algorithm of Multi-Document Summarization Sentence

作　　者：蒋效宇[1] 樊孝忠[1] 陈康[1] 

机构地区：[1]北京理工大学计算机科学技术学院,北京100081

出　　处：《华南理工大学学报（自然科学版）》2008年第9期43-47,70,共6页Journal of South China University of Technology(Natural Science Edition)

基　　金：教育部高等学校博士学科点专项科研项目(20050007023)

摘　　要：针对CO和MO文摘句排序算法的缺陷,提出了一种将局部主题间的内聚度与MO算法相结合进行文摘句排序的新方法.在统计局部主题间相对位置的基础上,建立它们之间的关系有向图并计算其内聚度;排序过程中每从有向图中输出一个顶点,便从剩余顶点中查找与其具有最大内聚度的顶点,若该内聚度大于阈值,则将这两个顶点所代表的局部主题文摘句置于摘要中相邻的位置.实验结果表明,该算法排序生成的文摘更具连贯性和可读性.In order to overcome the shortcomings of the Chronological Ordering and the Majority Ordering methods for summarization sentences, a new ordering algorithm that combines the mutual cohesion among themes and the Majority Ordering method is proposed. Based on the statistical data about the relative position in each pair of themes, a directed graph of the themes is built and the corresponding mutual cohesion is computed. In the ordering process, when a vertex is output from the directed graph, the vertex possessing the greatest cohesion with the vertex is searched from the remaining vertexes. If the cohesion is bigger than the threshold value, the sentences from the two themes corresponding to the two above-mentioned vertexes are placed on adjacent locations in the summarization. Experimental results show that the summarization generated by the proposed ordering algorithm is more coherent and readable.

关 键 词：人工智能 多文档文摘 局部主题 句子排序 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]