Sciweavers

735 search results - page 70 / 147
» Evaluating Probabilistic Queries over Imprecise Data
Sort
View
ICDM
2007
IEEE
124views Data Mining» more  ICDM 2007»
15 years 6 months ago
Local Probabilistic Models for Link Prediction
One of the core tasks in social network analysis is to predict the formation of links (i.e. various types of relationships) over time. Previous research has generally represented ...
Chao Wang, Venu Satuluri, Srinivasan Parthasarathy
CIKM
2003
Springer
15 years 5 months ago
Queueing analysis of relational operators for continuous data streams
Currently, stream data processing is an active area of research, which includes everything from algorithms and architectures for stream processing to modelling and analysis of var...
Qingchun Jiang, Sharma Chakravarthy
VLDB
1998
ACM
87views Database» more  VLDB 1998»
15 years 4 months ago
Fast High-Dimensional Data Search in Incomplete Databases
We propose and evaluate two indexing schemes for improving the efficiency of data retrieval in high-dimensional databases that are incomplete. These schemes are novel in that the ...
Beng Chin Ooi, Cheng Hian Goh, Kian-Lee Tan
DEBS
2007
ACM
15 years 3 months ago
Temporal order optimizations of incremental joins for composite event detection
Queries for composite events typically involve the four complementary dimensions of event data, event composition, relationships between events (esp. temporal and causal), and acc...
François Bry, Michael Eckert
CIKM
2011
Springer
13 years 12 months ago
A probabilistic method for inferring preferences from clicks
Evaluating rankers using implicit feedback, such as clicks on documents in a result list, is an increasingly popular alternative to traditional evaluation methods based on explici...
Katja Hofmann, Shimon Whiteson, Maarten de Rijke