J4 ›› 2008, Vol. 30 ›› Issue (8): 72-74.
• 论文 • 上一篇 下一篇
潘榕 魏慧琴
出版日期:
发布日期:
Online:
Published:
摘要:
本文针对网络信息资源重组问题进行分析,建立简化信息资源重组的二叉树模型,通过该模型中叶结点覆盖集的研究对优选方案进行探讨,得出网络信息发布的优选求解算法 。根据各类信息承载资源的不同要求,该优选算法可对网络信息资源自适应地进行提炼,在发布过程中尽量减少信息失真程度,实现对网络信息资源的优选发布。
关键词: 信息资源重组 优选算法 信息失真
Abstract:
The re-organization of web information resources is information re-organization. Via a research on the leaf-node cover analyzed, and a binary tree model is created tor simplitied set of the model, an optimal selecting method is discussed, with an algorithm for optimal solutions to web information issuance. This algorithm can extract web information resources in an auto-adapted style according to the diverse requirements of different information issua nce devices, so as to reduce the loss of information to a minimum in the process of issuance, and issue the web information resources in an optimal way.
Key words: information resource re-organization, optimum selection algorithm, information loss
潘榕 魏慧琴. 网络信息资源重组发布的优选算法[J]. J4, 2008, 30(8): 72-74.
0 / / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://joces.nudt.edu.cn/CN/
http://joces.nudt.edu.cn/CN/Y2008/V30/I8/72