IPM
2006
13 years 11 months ago
2006
The Web and especially major Web search engines are essential tools in the quest to locate online information for many people. This paper reports results from research that examin...
IPM
2006
13 years 11 months ago
2006
Ecommerce is developing into a fast-growing channel for new business, so a strong presence in this domain could prove essential to the success of numerous commercial organizations...
IPM
2006
13 years 11 months ago
2006
A bibliography is traditionally characterized by the judgments, bounded by explicit selection criteria, made by a single compiler. Because these criteria concern the attributes as...
IPM
2006
13 years 11 months ago
2006
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
IPM
2006
13 years 11 months ago
2006
The aim of this paper was to analyze users
IPM
2006
13 years 11 months ago
2006
In this paper, we propose a new learning method for extracting bilingual word pairs from parallel corpora in various languages. In cross-language information retrieval, the system...
IPM
2006
13 years 11 months ago
2006
How to merge and organise query results retrieved from different resources is one of the key issues in distributed information retrieval. Some previous research and experiments su...
IPM
2006
13 years 11 months ago
2006
Similarity calculations and document ranking form the computationally expensive parts of query processing in ranking-based text retrieval. In this work, for these calculations, 11...
IPM
2006
13 years 11 months ago
2006
This paper examines several different approaches to exploiting structural information in semi-structured document categorization. The methods under consideration are designed for ...
IPM
2006
13 years 11 months ago
2006
In this paper, we propose a new algorithm, which incorporates the relationships of concept-based thesauri into the document categorization using the k-NN classifier (k-NN). k-NN i...