Sciweavers

3133 search results - page 212 / 627
» Representing clusters for retrieval
Sort
View
ICDE
2008
IEEE
153views Database» more  ICDE 2008»
16 years 8 months ago
A Framework for Clustering Uncertain Data Streams
Abstract-- In recent years, uncertain data management applications have grown in importance because of the large number of hardware applications which measure data approximately. F...
Charu C. Aggarwal, Philip S. Yu
ACISICIS
2007
IEEE
16 years 1 months ago
Minimum Message Length Clustering of Spatially-Correlated Data with Varying Inter-Class Penalties
We present here some applications of the Minimum Message Length (MML) principle to spatially correlated data. Discrete valued Markov Random Fields are used to model spatial correl...
Gerhard Visser, David L. Dowe
CN
2010
136views more  CN 2010»
15 years 6 months ago
PCIR: Combining DHTs and peer clusters for efficient full-text P2P indexing
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
CIKM
2009
Springer
15 years 11 months ago
A comparative study of methods for estimating query language models with pseudo feedback
We systematically compare five representative state-of-theart methods for estimating query language models with pseudo feedback in ad hoc information retrieval, including two var...
Yuanhua Lv, ChengXiang Zhai
SIGIR
2008
ACM
15 years 6 months ago
Re-ranking search results using document-passage graphs
We present a novel passage-based approach to re-ranking documents in an initially retrieved list so as to improve precision at top ranks. While most work on passage-based document...
Michael Bendersky, Oren Kurland