基于WWW的聚类引擎研究

Today, search engine is the most commonly used tool for Web information retrieval, data mining may discover knowledge in large data. With the era of information and digital of media, Web data mining is becoming one of the hottest topics. By combining information retrieval technology with data mining technology, a prototype system of search engine is designed and implemented in this paper. It can group Web search results in a semantic, online and tree way, in order to help users find relevant Web information easier and faster.     

数字图书馆中基于Java的用户界面组件库研究与开发

It is one of the most important task in digital library to develop a universal and customized user interface for search and retrieval in heterogeneous,distributed environment.In this paper,we briefly introduce working principles and workflow of SiteSearch system developed by OCLC.Based on analyzing the functions of this system,we study and design composing elements and implementation mechanism of the customized interface.By analyzing and illustrating the examples,we develop Java based component library for dynamically generating the customized interface in Chinese information platform of SiteSearch system.Finally,we make some remarks on the difference of develop-ment of this system with other similar systems.     

Understanding the role of human-inspired heuristics for retrieval models

Relevance estimation is one of the core concerns of information retrieval(IR)studies.Although existing retrieval models gained much success in both deepening our understanding of information seeking behavior and building effective retrieval systems,we have to admit that the models work in a rather different manner from how humans make relevance judgments.Users’information seeking behaviors involve complex cognitive processes,however,the majority of these behavior patterns are not considered in existing retrieval models.To bridge the gap between practical user behavior and retrieval model,it is essential to systematically investigate user cognitive behavior during relevance judgement and incorporate these heuristics into retrieval models.In this paper,we aim to formally define a set of basic user reading heuristics during relevance judgement and investigate their corresponding modeling strategies in retrieval models.Further experiments are conducted to evaluate the effectiveness of different reading heuristics for improving ranking performance.Based on a large-scale Web search dataset,we find that most reading heuristics can improve the performance of retrieval model and establish guidelines for improving the design of retrieval models with human-inspired heuristics.Our study sheds light on building retrieval model from the perspective of cognitive behavior.     

Study on ontology-based semantic retrieval model

The information retrieval based on ontology is a hotspot in the domain of information retrieval. According to the study on the existed retrieval model, this paper proposes a new kind of ontology-based semantic retrieval model, which grants semantic to the retrieval entry, the process of retrieval and the organization of data, and consequently improves the precision and recall of information retrieval.     

Consensus control of multi‑manipulator systems based on disturbance observer under Markov switching topologies

In this paper, to solve the consensus control problem of multi-manipulator systems under Markov switching topologies, we propose a distributed consensus control strategy based on disturbance observer. In multi-manipulator systems, external disturbance described by heterogeneous exogenous systems is considered, and all communication topologies are directed. First, a disturbance observer is presented to suppress the influence of unknown external disturbance, and the equivalent compensation is introduced into the control protocol in multi-manipulator systems. Then, a novel control protocol based on neighbor information is designed, which guarantees that multi-manipulator systems reach consensus under Markov switching topologies. Finally, two simulation examples verify the validity of the theoretical result.     

基于Ontology和EM方法的网页分类研究

Works on abstracting semantic information from substantive pages of Web and their usage in search engine can lead to intelligent retrieval ,or other individual services. This paper mainly focuses on some research about analysis of Web page classification infor. Ontology as a base,using TFIDF word weights and Rocchio algorithm is combined with EM to improve accuracy of classifier. It's proved that this EM procedure works well on enhancing the veracity by the usage of unlabeled pages when the samples are limited.     

Geometry Services Construction Based on Ontology towards Cooperative Design in Cloud Environment

APIs of CAD system could be encapsulated to construct web services so as to provide standard access interfaces for web-based cooperative design.However,lack of semantic supporting make integration of heterogeneous modelling system limited to operational level.On the purpose of carrying out cooperative design in a flexible cloud environment,an intelligent and effective support mechanism is needed for mass and complex interaction in cooperative work.Therefore,Ontology-based Geometry Modeling Services Environment (OGMSE) is provided to realize a knowledge-level geometry modeling so as to supported semantic 3D model management and intelligent operation support.First,CAD APIs are encapsulated into web service for web invocation.Then,ontology contained structural semantic and operational semantic is built for management of models and modeling process.Lastly,conception-driven modeling mechanism is built to invocate service according to interaction requirement,thus to realize conception-level cooperative design.Based on an open geometry engine,a prototype system has been developed.The result shows that the approach provides a reference direction for large-scale application on the network.     

Bargaining game theoretic power control in selfish cooperative relay networks

Wireless cooperative communications require appropriate power allocation (PA) between the source and relay nodes. In selfish cooperative communication networks, two partner user nodes could help relaying information for each other, but each user node has the incentive to consume his power solely to decrease its own symbol error rate (SER) at the receiver. In this paper, we propose a fair and efficient PA scheme for the decode-and-forward cooperation protocol in selfish cooperative relay networks. We formulate this PA problem as a two-user cooperative bargaining game, and use Nash bargaining solution (NBS) to achieve a win-win strategy for both partner users. Simulation results indicate that the NBS is fair in that the degree of cooperation of a user only depends on how much contribution its partner can make to decrease its SER at the receiver, and efficient in the sense that the SER performance of both users could be improved through the game.     

基于Web的信息智能获取方法

The increasing stream of Web information available makes it ever more desirable of network users to retrieval interesting information efficiently.Obviously,AI can be made a good use in the information retrieval area.In this paper,the Intelligent Search Engine,Intelligent Browser,Intelligent Agent and Intelligent Information Push are introduced.Then the related key techniques are presented.At last,a framework of Intelligent Information Push System is discussed.     

基于元数据与Z39.50的分布协作式Web信息检索

Web上大量的异质、分布、动态的信息造成了“信息过载”.如何有效地为用户提供Web信息检索已经成为一项重要的研究课题.Web搜索引擎部分地解决了信息检索问题,然而其效果却远远不能令人满意.提出了Web信息检索的分布协作策略以取代传统的集中式信息检索方式;给出了一种新的Web信息检索系统模型,该模型支持对Web文档的元数据进行检索,并采用Z39.50协议作为接口标准,以克服不同信息检索系统之间的访问异构性.在此基础上,设计了一个分布协作式Web信息检索框架,用以帮助用户有效地进行Web信息检索.     

Information retrieval from the World Wide Web: a user-focused approach based on individual experience with search engines

Although search engines are essential tools for finding information on the World Wide Web, the effective use of search engines for information retrieval (IR) is a crucial challenge for any Internet user. Based on the user-focused approach, this study investigates individual information retrieval behaviors using information processing theory. The results show that experience with search engines significantly affects users’ attitudes toward search engines for information retrieval, the query-based service is more popular than the directory-based service, users are not completely satisfied with the precision of retrieved information and the response time of search engines, and users’ motivation is a key factor that predicts their intention to use search engines for information retrieval. Furthermore, this study proposes a conceptual model for investigating individual attitudes toward search engines for information retrieval.     

Web搜索引擎框架研究

Ｗｅｂ搜索引擎是Ｉｎｔｅｒｎｅｔ上非常有用的信息检索工具,但是由于目前搜索引擎检索出的信息量庞大,且一个特定的搜索引擎主要包含某一特定领域的信息,这使得用户很难从某一个搜索引擎获得准确的导航信息。文中提出一个新的Ｗｅｂ搜索引擎框架ＧＳＥ,并提出了一个适合于Ｗｅｂ信息获取与处理的语言ＷＥＲＰＬ。通过ＷＩＲＰＬ可以将多个Ｗｅｂ搜索引擎结合起来,为用户提供一个一致、高效、准确的Ｗｅｂ搜索引擎。     

基于中文搜索引擎网络信息用户行为研究*

为了更好地理解中文搜索用户的检索行为,首先建立一个搜索引擎选择平台,主要是用来生成研究中所需的日志文件;然后从中英文用户的搜索行为差异的角度出发,对日志文件进行深入研究,包括各中文搜索引擎使用率比较以及中文用户输入查询行为的一些规律等。研究结果表明,对准确地评测搜索引擎检索的效果以及未来中文搜索引擎设计的改进都有较好的指导意义。     

Mining the Web's link structure

The Web is a hypertext body of approximately 300 million pages that continues to grow at roughly a million pages per day. Page variation is more prodigious than the data's raw scale: taken as a whole, the set of Web pages lacks a unifying structure and shows far more authoring style and content variation than that seen in traditional text document collections. This level of complexity makes an “off-the-shelf” database management and information retrieval solution impossible. To date, index based search engines for the Web have been the primary tool by which users search for information. Such engines can build giant indices that let you quickly retrieve the set of all Web pages containing a given word or string. Experienced users can make effective use of such engines for tasks that can be solved by searching for tightly constrained key words and phrases. These search engines are, however, unsuited for a wide range of equally important tasks. In particular, a topic of any breadth will typically contain several thousand or million relevant Web pages. How then, from this sea of pages, should a search engine select the correct ones-those of most value to the user? Clever is a search engine that analyzes hyperlinks to uncover two types of pages: authorities, which provide the best source of information on a given topic; and hubs, which provide collections of links to authorities. We outline the thinking that went into Clever's design, report briefly on a study that compared Clever's performance to that of Yahoo and AltaVista, and examine how our system is being extended and updated     

Visualizing Web search results in 3D

The exponential growth in Web sites is making it increasingly difficult to extract useful information on the Internet using existing search engines. Despite a wide range of sophisticated indexing and data retrieval features, search engines often deliver satisfactory results only when users know precisely what they are looking for. Traditional textual interfaces present results as a list of links to Web pages. Because most users are unwilling to explore an extensive list, search engines arbitrarily reduce the number of links returned, aiming also to provide quick response times. Moreover, their proprietary ranking algorithms often do not reflect individual user preferences. Those who need comprehensive general information about a topic or have vague initial requirements instead want a holistic presentation of data related to their queries. To address this need, we have developed Periscope, a 3D search result visualization system that displays all the Web pages found in a synthetic, yet comprehensible format.     

一种基于概念的交互式Web搜索模型

当前基于关键字查询的大多数搜索引擎都没有提供个性化的用户服务，搜索结果主要根据关键字与文档的相似度来排序，这很难满足用户对日益膨胀的信息资源的需求。面对用户越来越难以迅速精确地检索到所需信息的现状，本文提出一种应用于LAN中的基于概念的三层搜索引擎模型：通过用户交互的方式，使得搜索具有个性化、智能化的特点。     

书籍搜索领域Deep Web数据集成系统

随着在线数据库的迅速增长,可以访问的数据库资源大大增多,但它们的信息传统搜索引擎无法获得,它隐藏在网站背后,成为人们快速有效获取信息的障碍。为了获得Deepweb中大量有价值的隐藏信息,需要整合各在线异构数据源,以便在同一领域内比较某一事物的大量相关信息。目前,越来越多的人采取网上买书的消费方式,针对这个消费热点问题,设计了一个书籍搜索领域的Deep Web数据集成系统,提供一个集成的查询接口,使得用户可以方便地进行查找和比对。     

Web信息检索研究进展

Ｗeb上大量、分布、动态的信息造成了“信息过载”,如何在传统信息检索技术的基础上开展针对Ｗeb的检索工作已经成为一基项重要的研究课题,但是,繁多的Ｗeb信息检索系统和各种模糊的概念给用户的选择和研究人员的讨论带来了不便。同时,有关Ｗeb信息检索最新技术的比较完整的分析又十分缺乏。在此,对Ｗeb信息检索技术进行了综述,从Ｗeb信息检索系统的层次化分类（搜索引擎与目录、元搜索引擎、信息检索agent)、一般机制和关键新技术（基于超链的相关度排序、检索结果的联机聚类、基于概念的检索、相关度反馈）等方面加以阐述,以期对感兴趣的同行有参考作用。     

Exploiting Query Repetition and Regularity in an Adaptive Community-Based Web Search Engine

Search engines continue to struggle with the challenges presented by Web search: vague queries, impatient users and an enormous and rapidly expanding collection of unmoderated, heterogeneous documents all make for an extremely hostile search environment. In this paper we argue that conventional approaches to Web search -- those that adopt a traditional, document-centric, information retrieval perspective -- are limited by their refusal to consider the past search behaviour of users during future search sessions. In particular, we argue that in many circumstances the search behaviour of users is repetitive and regular; the same sort of queries tend to recur and the same type of results are often selected. We describe how this observation can lead to a novel approach to a more adaptive form of search, one that leverages past search behaviours as a means to re-rank future search results in a way that recognises the implicit preferences of communities of searchers. We describe and evaluate the I-SPY search engine, which implements this approach to collaborative, community-based search. We show that it offers potential improvements in search performance, especially in certain situations where communities of searchers share similar information needs and use similar queries to express these needs. We also show that I-SPY benefits from important advantages when it comes to user privacy. In short, we argue that I-SPY strikes a useful balance between search personalization and user privacy, by offering a unique form of anonymous personalization, and in doing so may very well provide privacy-conscious Web users with an acceptable approach to personalized search.