首页 | 本学科首页   官方微博 | 高级检索  
     

基于LCS的特征树最大相似性匹配网页去噪算法
引用本文:宋鳌,支.基于LCS的特征树最大相似性匹配网页去噪算法[J].电视技术,2011,35(13):44-48,63.
作者姓名:宋鳌  
作者单位:1. 上海交通大学电子工程系图像通信与信息处理研究所,上海200240;上海交通大学上海市数字媒体处理与传输重点实验室,上海200240
2. 上海文广互动电视有限公司,上海,200072
基金项目:国家“863”计划项目,上海市科委资助项目,中国博士后科学基金,上海市博士后基金
摘    要:提出了一种基于LCS的特征树最大相似性匹配网页去噪算法.通过将目标网页和相似网页转化为特征树,并将特征树映射为一个特征节点序列,利用LCS算法能获得最长子序列全局最优解的特点,找出两棵特征树之间的不同节点作为候选集,并对候选集进行聚集评分找出网页重要内容块.给出了算法的原型系统,并对每一个模块的实现做了详尽的描述.

关 键 词:LCS  特征树  网页去噪

Maximum Similarity Matching Algorithm for Noise Reduction in Web Pages Based on LCS
SONG Ao,ZHI Cheng,ZHOU Jun,LUO Chuanfei,AN Ran.Maximum Similarity Matching Algorithm for Noise Reduction in Web Pages Based on LCS[J].Tv Engineering,2011,35(13):44-48,63.
Authors:SONG Ao  ZHI Cheng  ZHOU Jun  LUO Chuanfei  AN Ran
Affiliation:1.Institute of Image Communication and Information Processing,Shanghai Jiao Tong University,Shanghai 200240,China;2.Shanghai Key Laboratory of Digital Media Processing and Transmission,Shanghai Jiao Tong University,Shanghai 200240,China;3.Shanghai Media Group,Co.,Ltd.,Shanghai 200072,China)
Abstract:A maximum similarity matching algorithm for noise reduction in Web pages is presented based on LCS.Parsing target page and similar pages into two characteristic trees,and mapping them to two characteristic node sequences,the LCS algorithm can get the longest sub-sequence which is global optimal solution,and the different characteristic nodes is found out between the two characteristic tree as a candidate set,clustering the candidate set and scoring to identify web page important informative block.In this paper,the algorithm prototype is given,and the implementation of each module is described.
Keywords:LCS  characteristic tree  noise reduction in Web pages
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号