Web Retrieval

With increasingly higher numbers of non-English language web searchers the problems of efficient handling of non-English Web documents and user queries are becoming major issues for search engines. The main aim of this review paper is to make researchers aware of the existing problems in monolingual non-English Web retrieval by providing an overview of open issues. A significant number of

After our previous works on modelling a database of newspapers and designing a specially suited retrieval language, we are now developing an application to automatically acquire, summarize and store newspaper documents published in distinct web resources. This paper describes the current implementation of the acquisition process which includes the recognison of document types and the abstraction of the recognised document values. The network agents in charge of such a process are called gatherers, accordingly to the terminology used in successful web retrieval systems such as Harvest. To implement gatherers we have combined a context free grammar with some web traversing techniques, which are available in most of the current PROLOG systems (e.g. Sicstus with the library PiLLoW). 1 Introduction The soaring availability of periodical publications in the Internet is making necessary new methods for the management of these kind of documents [Ara96], as well as large specific digital lib...

It is generally believed that propagated anchor text is very impor-tant for effective Web search as offered by the commercial search engines. “Google Bombs” are a notable illustration of this. How-ever, many years of TREC Web retrieval research failed to establish the ...

In this paper we present a set of techniques for grouping and aggregating queries and search results, in the context of an Internet “search engine.” (1) In the case of the initial grouping of the queries, we consider the Fuzzy c-Means and Kohonen SOM techniques. It is proposed that FCM may be more adequate than k-Means for the grouping of certain data types. We evaluate how we can use FCM to calculate the fuzzy membership grades for a set of Web queries and their corresponding results. (2) In the case of the aggregation of data from different information  sources (the clustering techniques), we will consider weighted ordered weighted averaging (WOWA). WOWA is used to choose the most adequate cluster and to identify the historical query in that cluster, which is most similar to a new query. We will see that the WOWA operator offers a wide flexibility for data processing.

In the ocean of Web data, Web search engines are the primary way to access content. As the data is on the order of petabytes, current search engines are very large centralized systems based on replicated clusters. Web data, however, is always evolving. The number of Web sites continues to grow rapidly and there are currently more than 20 billion indexed pages. In the near future, centralized systems are likely to become ineffective against such a load, thus suggesting the need of fully distributed search engines. Such ...

The Internet has been changing the access and transmission of GIS data, applications and visualizations. Online GIS combines the advantages of both GIS and the Internet. Geographic information can be distributed in a variety of forms on the Internet. Moreover as the Internet technology takes progress, web-based GIS applications also change. This paper focuses on development and implementation of a web-based GIS application for earthquake information. In this study, a dynamic map browser type of web- mapping applications was designed for interacting with the earthquake information. This method provides users easy access to GIS data and basic functions on the Internet with low technological requirements. The user is not required to learn anything beyond the basics about how to interact with the system as well. In the study, a GIS application and a web site was developed to serve the system on the Internet. By integrating various data from different sources, this study aims to provide ...

In the ocean of Web data, Web search engines are the primary way to access content. As the data is on the order of petabytes, current search engines are very large centralized systems based on replicated clusters. Web data, however, is always evolving. The number of Web sites continues to grow rapidly and there are currently more than 20 billion indexed pages. In the near future, centralized systems are likely to become ineffective against such a load, thus suggesting the need of fully distributed search engines. Such ...

 We present a study of the role of user profiles using fuzzy logic in web retrieval processes. Flexibility for user interaction and for adaptation in profile construction becomes an important issue. We focus our study on user profiles, including creation, modification, storage, clustering and interpretation. We also consider the role of fuzzy logic and other soft computing techniques to improve user profiles. Extended profiles contain additional information related to the user that can be used to personalize and customize the retrieval process as well as the web site. Web mining processes can be carried out by means of fuzzy clustering of these extended profiles and fuzzy rule construction. Fuzzy inference can be used in order to modify queries and extract knowledge from profiles with marketing purposes within a web framework. An architecture of a portal that could support web mining technology is also presented.

Based on recent studies, the most common queries in Web searches involve one or two keywords. While most Web search engines perform very well for a single-keyword query, their precisions is not as good for queries involving two or more keywords. Search results often contain a large number of pages that are only weakly relevant to either of the keywords. One solution is to focus on the proximity of keywords in the search results. Filtering keywords by semantic relationships could also be used. We developed a method to improve the precison of Web retrieval based on the semantic relationships between and proximity of keywords for two-keyword queries. We have implemented a system that re-ranks Web search results based on three measures: first-appearance term distance, minimum term distance, and local appearance density. Furthermore, the system enables the user to assign weights to the new rank and original ranks so that the result can be presented in order of the combined rank. We built a prototype user interface in which the user can dynamically change the weights on two different ranks. The result of the experiment showed that our method improves the precision of Web search results for two-keyword queries.