Sciweavers

2018 search results - page 380 / 404
» Magnitude-preserving ranking algorithms
Sort
View
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
14 years 8 months ago
Probabilistic author-topic models for information discovery
We propose a new unsupervised learning technique for extracting information from large text collections. We model documents as if they were generated by a two-stage stochastic pro...
Mark Steyvers, Padhraic Smyth, Michal Rosen-Zvi, T...
KDD
2001
ACM
150views Data Mining» more  KDD 2001»
14 years 8 months ago
Empirical bayes screening for multi-item associations
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
William DuMouchel, Daryl Pregibon
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
14 years 8 months ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu
ICDE
2010
IEEE
260views Database» more  ICDE 2010»
14 years 8 months ago
Locating Mapped Resources in Web 2.0
Abstract-- Mapping mashups are emerging Web 2.0 applications in which data objects such as blogs, photos and videos from different sources are combined and marked in a map using AP...
Anthony K. H. Tung, Beng Chin Ooi, Dongxiang Zhang
MOBIHOC
2006
ACM
14 years 8 months ago
Balancing distance and lifetime in delay constrained ad hoc networks
This paper addresses the problem of optimizing the packet transmission schedule in an ad hoc network with end-toend delay constraints. The emphasis is to determine the proper rela...
Ben Liang, Min Dong