CIKM
2004
Springer
13 years 10 months ago
2004
Springer
In the recent years, the Web has been rapidly “deepened” with the prevalence of databases online. On this deep Web, many sources are structured by providing structured query i...
CIKM
2004
Springer
13 years 10 months ago
2004
Springer
Mining massive temporal data streams for significant trends, emerging buzz, and unusually high or low activity is an important problem with several commercial applications. In th...
CIKM
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we suggest a new approach to analysis and design of IR systems. We argue for design space exploration in constructing IR systems and in analyzing the effects of ind...
CIKM
2004
Springer
13 years 10 months ago
2004
Springer
Query expansion is a well-known technique that has been shown to improve average retrieval performance. This technique has not been used in many operational systems because of the...
CIKM
2004
Springer
13 years 10 months ago
2004
Springer
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
CIKM
2004
Springer
13 years 10 months ago
2004
Springer
The proliferation of XML as a standard for data representation and exchange in diverse, next-generation Web applications has created an emphatic need for effective XML data-integr...
CIKM
2004
Springer
13 years 10 months ago
2004
Springer
Given the recent advancement of microarray technologies, we present a density-based clustering approach for the purpose of co-expressed gene cluster identification. The underlyin...
CIKM
2004
Springer
13 years 10 months ago
2004
Springer
It is crucial in many information systems to organize short text segments, such as keywords in documents and queries from users, into a well-formed topic hierarchy. In this paper,...
CIKM
2004
Springer
13 years 10 months ago
2004
Springer
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
CIKM
2004
Springer
13 years 10 months ago
2004
Springer
