智能化搜索是当今制作搜索引擎的一个流行发展方向 ,它能够根据用户所输入的一系列关键词 ,发现他们的兴趣所在 ,从而找到那些能使用户感兴趣的网页。粗糙集理论这一处理含糊问题的新型数学工具 ,为此提供了一个完备的理论基础。首先对 Rough集理论中的基本概念进行了描述 ,然后引用了 Rough集中的上、下近似集及其近似精度的理论 ,利用简化的 WWW模型 ,将所搜索到的网页形成一棵用户兴趣树 ,再对此棵树上的网页结点进行约简 ,从而能够使呈现在用户面前的网页页面尽量准确 Intelligent search is a popular development for today’s search engine, finding interesting pages based on a series of key words entered by the user to find out what they are interested in. Rough set theory, a new mathematical tool that deals with ambiguity, provides a complete theoretical basis. Firstly, the basic concepts in Rough set theory are described. Then, the theory of upper and lower approximation sets and their approximate accuracy in Rough set is introduced. By using the simplified WWW model, the searched web page is formed into a user interest tree, Then the tree nodes on the page to be reduced, so as to be able to render the page presented in front of the user as accurate as possible