移动环境下搜索引擎的个性化方法

针对手机等移动设备具有小屏幕、操作不方便和具有惟一标识的特点,提出了适用于移动环境下搜索引擎的个性化搜索的新方法.首先用户的查询历史可以通过惟一的手机号自动记录下来;其次利用用户的查询历史,建立用户描述文件以及基于关键词空间的用户兴趣模型;最后根据用户兴趣模型,采用关键词扩充算法优化用户查询.此方法能够较好地实现移动环境下的个性化搜索,提高检索效率.     

A feedback-based web search engine

Web search engines are very useful information service tools in the Internet. The current web search engines produce search results relating to the search terms and the actual information collected hy them. Since the selections of the search results cannot affect the future ones. they may not cover most people‘s interests. In this paper, feedback informarion produced by the users‘ accessing lists will be represented By the rough set and can reconstruct the query string and influence the search results. And thus the search engines can provide self-adaptability.     

Query expansion based on semantics and statistics in Chinese question answering system

In Chinese question answering system, because there is more semantic relation in questions than that in query words, the precision can be improved by expanding query while using natural language questions to retrieve documents. This paper proposes a new approach to query expansion based on semantics and statistics Firstly automatic relevance feedback method is used to generate a candidate expansion word set. Then the expanded query words are selected from the set based on the semantic similarity and seman- tic relevancy between the candidate words and the original words. Experiments show the new approach is effective for Web retrieval and out-performs the conventional expansion approaches.     

Automatic user goals identification based on anchor text and click-through data

Understanding the underlying goal behind a user＇s Web query has been proved to be helpful to improve the quality of search. This paper focuses on the problem of automatic identification of query types according to the goals. Four novel entropy-based features extracted from anchor data and click-through data are proposed, and a support vector machines （SVM） classifier is used to identify the user＇s goal based on these features. Experi- mental results show that the proposed entropy-based features are more effective than those reported in previous work. By combin- ing multiple features the goals for more than 97% of the queries studied can be correctly identified. Besides these, this paper reaches the following important conclusions： First, anchor-based features are more effective than click-through-based features; Second, the number of sites is more reliable than the number of links; Third, click-distribution- based features are more effective than session-based ones.     

基于用户查询意图的搜索排序算法

目前互联网技术的研究热点是智能化的、个性化的服务,而传统的Web搜索排序算法和已有的个性化排序已经不能满足政府、企业等用户的信息查询需要.本文将研究核心定位到充分理解用户查询偏好上,提出了基于用户偏好的PageRank算法.文中利用用户互反馈技术修正查询关键词,利用语义相关性技术分析用户查询意图,理解用户偏好.改进的算法完善了搜索查询的可靠性依据,能够较好地挖掘用户的偏好主题,贴近用户的查询目的,提高搜索查询效率和用户满意度.     

个性化Web信息代理的研究与开发

介绍了在Web信息检索过程中通过个性化信息代理(Agent)实现个性化信息反馈的工作、提出了信息Agent模型，涉及元搜索引擎的实现和个性化偏好模型的建立，且通过主动服务代理实现个人偏好查询结果的推送．提高了在Web信息检索过程中系统随用户关注程度和关注领域不断变化而调整信息反馈的能力，并在此设计基础上实现了一个原型系统．     

个性化桌面元搜索引擎系统的研究与设计

介绍了一个基于桌面的个性化元搜索引擎的研究策略和实现技术。从个性化策略的描述和系统框架的设计可以得出用户兴趣模型是个性化元搜索系统的基础和关键。基于此开发和设计的桌面个性化元搜索系统才能较好体现个性化的内涵和外延。     

基于少量示例的个性化Web信息自动获取系统

基于关键词的搜索引擎满足了人们一定的需要,但由于其通用的性质,并不能满足用户的个性化需求,为此,设计并实现了一个基于示例的个性化Web信息自动获取系统.该系统采用了一种新的基于少量Web示例网页和语料库词频统计的特征抽取算法和过滤阈值设定方法.实验结果表明,较基于关键词的搜索引擎而言,该系统能充分考虑用户的兴趣偏好(示例),长期、主动地向用户提供更加准确的Web信息获取服务.     

Automatic Web services composition based on SLM

Motivated by the problem of simplifying the manual operation of the composition process, we propose an approach to automatically compose available Web services to fulfill user＇s goal based on the assumption that there are a set of alternative Web services with similar functionality and different QoS properties. A formal model （i.e. semantic links matrix, SLM for short ） is proposed to store semantic links values for the Web services with semantic relationship and QoS of Web services. The SLM provides a search place for a backward-search planning algorithm, at the same time; the QoS criteria make a rational and effective decision among a number of similar Web services. The function and some properties of the algorithm are analyzed. The approach can improve the correctness and flexibility for Web services composition and satisfy the local QoS attribute.     

Research on the User Interest Modeling of Personalized Search Engine

At present, how to enable Search Engine to construct user personal interest model initially, master user＇s personalized information timely and provide personalized services accurately have become the hotspot in the research of Search Engine area. Aiming at the problems of user model＇s construction and combining techniques of manual customization modeling and automatic analytical modeling, a User Interest Model （UIM） is proposed in the paper. On the basis of it, the corresponding establishment and update algorithms of User lnterest Profile （UIP） are presented subsequently. Simulation tests proved that the UIM proposed and corresponding algorithms could enhance the retrieval precision effectively and have superior adaptability.     

一种基于协同推荐的网页排序算法

针对目前搜索结果个性化排序算法中的用户兴趣模型构建难、相关度计算不精确等问题,提出了一种结合用户兴趣模型和协同推荐算法的个性化排序方法.该方法从用户的搜索历史,包括提交查询、点击相关网页等反馈信息来训练用户的兴趣模型,然后采用协同推荐算法获取具有共同兴趣的邻居用户,根据这些邻居对网页的推荐程度和网页与用户的相关程度来排序搜索结果.实验结果表明:该排序算法的平均最小精确度比一般排序算法提高了约0.1,且随着用户邻居数目的增长,最小精确度随之增长.与其他排序算法相比,采用协同推荐算法有助于提高网页与用户兴趣关联程度计算的精确度,从而提高排序的效率,有助于改善用户的搜索体验.     

Automatic Question Answering from Web Documents

A passage retrieval strategy for web-based question answering （QA） systems is proposed in our QA system. It firstly analyzes the question based on semantic patterns to obtain its syntactic and semantic information and then form initial queries. The queries are used to retrieve documents from the World Wide Web （WWW） using the Google search engine. The queries are then rewritten to form queries for passage retrieval in order to improve the precision. The relations between keywords in the question are employed in our query rewrite method. The experimental result on the question set of the TREC-2003 passage task shows that our system performs well for factoid questions.     

A framework for personalized adaptive user interest prediction based on topic model and forgetting mechanism

User interest is not static and changes dynamically. In the scenario of a search engine, this paper presents a personalized adaptive user interest prediction framework. It represents user interest as a topic distribution, captures every change of user interest in the history, and uses the changes to predict future individual user interest dynamically. More specifically, it first uses a personalized user interest representation model to infer user interest from queries in the user’s history data using a topic model; then it presents a personalized user interest prediction model to capture the dynamic changes of user interest and to predict future user interest by leveraging the query submission time in the history data. Compared with the Interest Degree Multi-Stage Quantization Model, experiment results on an AOL Search Query Log query log show that our framework is more stable and effective in user interest prediction.     

利用支持向量回归确定相关Web查询

对用户输入的查询请求,如果搜索引擎系统能给出一个相关查询列表,将有助于用户进行查询修正,进而检索到用户所需要的信息．文中提出了一种利用支持向量回归确定相关Web查询的新方法．对一个给定的Web查询,首先从用户的使用记录中抽取候选查询的5个量化指标：被查询的次数、被查询的用户量、用户在反馈结果中的点击次数、与给定查询间的共有词项个数和点击相同网址（URL）的个数;然后用手工标记部分训练数据,进而建立支持向量回归模型,根据相关度的大小确定相关Web查询．实验结果表明该方法具有较高的准确度．     

支持评价类问题与电影智能搜索的问答系统构建

基于互联网信息,构建了一款支持评价类问题与电影智能搜索的问答系统.通过特征词匹配、情感极性匹配以及句式分析等策略,系统能对评价类问题进行智能回答.借助聚合评论信息的灵活查询策略,利用tag信息查询扩展的用户个性化搜索技术,不仅解决了电影的泛性化搜索问题,并能挖掘用户的潜意识需求.实验证明,该系统在评价类问题回答与电影智能搜索领域,效果优于现有产品.     

一种个性化的主题提取和层次发现算法

从语义相关性角度分析超链归纳主题搜索(HITS) 算法,发现其产生主题漂移的原因在于页面被投影到错误的语义基上,因此提出了一种个性化的主题提取和层次发现算法(PTDHE),通过个人查询日志扩展查询词,构造符合用户需要的个性化根集和基础集合,达到防止主题漂移的目的.PTDHE采用基于最小最大原则的图划分方法,层次地发现与用户查询相关的主题页面集合,利用HITS算法分别计算每个主题页面集合中页面的权威值,返回与查询相关的其他主题权威页面.在14个查询上的实验结果表明,与HITS算法相比,PTDHE算法不仅可以减少2%~66%的主题漂移率,而且可以发现与查询相关的多个主题.     

Web数据库查询结果的自动分类方法

为解决Web数据库查询中出现的多查询结果问题,提出一种Web数据库查询结果自动分类方法.该方法在查询结果上动态生成一个带标签的、分层的分类树.分类树的构建通过两个处理阶段完成:首先在离线阶段分析系统中所有用户的查询历史并聚合语义上相似的查询,然后根据聚合的查询将原始数据划分成多个元组聚类,每个元组聚类对应一种类型的用户偏好;当用户查询到来时,在线查询处理阶段利用第一阶段生成的元组聚类,在查询结果集上为用户生成一个分类树,使得用户能够方便地选择和定位所需信息.实验和分析表明,提出的分类方法能够很好地满足用户个性化查询的需求.     

General attribute based RBAC model for web services

Growing numbers of users and many access policies that involve many different resource attributes in service-oriented environments cause various problems in protecting resource. This paper analyzes the relationships of resource attributes to user attributes based on access policies for Web services, and proposes a general attribute based role-based access control（GARBAC） model. The model introduces the notions of single attribute expression, composite attribute expression, and composition permission, defines a set of elements and relations among its elements and makes a set of rules, assigns roles to user by inputing user＇s attributes values. The model is a general access control model, can support more granularity resource information and rich access control policies, also can be used to wider application for services. The paper also describes how to use the GARBAC model in Web services environments.     

基于本体的个性化检索技术研究

近几年信息检索技术飞速发展,但很多搜索引擎都存在检索精度不高,检索结果不够个性化等问题。本文提出一种基于本体的个性化检索方法,在记录用户手动标注的信息生成一个个性化倒排索引的同时,再将其与本体知识相结合,进一步明确概念和语义关系,使得用户榆入相同或相近的检索词时也能反馈用户曾经标注过的文档信息,从而满足用户的个性化需求。     

A Deep Web Query Interfaces Classification Method Based on RBF Neural Network

This paper proposes a new approach for classification for query interfaces of Deep Web, which extracts features from the form＇s text data on the query interfaces, assisted with the synonym library, and uses radial basic function neural network （RBFNN） algorithm to classify the query interfaces. The applied RBFNN is a kind of effective feed-forward artificial neural network, which has a simple networking structure but features with strength of excellent nonlinear approximation, fast convergence and global convergence. A TEL_8 query interfaces＇ data set from UIUC on-line database is used in our experiments, which consists of 477 query interfaces in 8 typical domains. Experimental results proved that the proposed approach can efficiently classify the query interfaces with an accuracy of 95.67%.