Sciweavers

42 search results - page 6 / 9
» A unified approach to ranking in probabilistic databases
Sort
View
SSD
2007
Springer
124views Database» more  SSD 2007»
14 years 21 days ago
Querying Objects Modeled by Arbitrary Probability Distributions
In many modern applications such as biometric identification systems, sensor networks, medical imaging, geology, and multimedia databases, the data objects are not described exact...
Christian Böhm, Peter Kunath, Alexey Pryakhin...
SIGMOD
2008
ACM
206views Database» more  SIGMOD 2008»
14 years 6 months ago
Ad-hoc aggregations of ranked lists in the presence of hierarchies
A variety of web sites and web based services produce textual lists at varying time granularities ranked according to several criteria. For example, Google Trends produces lists o...
Nilesh Bansal, Sudipto Guha, Nick Koudas
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
14 years 7 months ago
Web usage mining based on probabilistic latent semantic analysis
The primary goal of Web usage mining is the discovery of patterns in the navigational behavior of Web users. Standard approaches, such as clustering of user sessions and discoveri...
Xin Jin, Yanzan Zhou, Bamshad Mobasher
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 6 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
ICDE
2008
IEEE
131views Database» more  ICDE 2008»
14 years 8 months ago
On Skylining with Flexible Dominance Relation
Given a set of d dimensional objects, a skyline query finds the objects ("skyline") that are not dominated by others. However, skylines do not always provide useful query...
Tian Xia, Donghui Zhang, Yufei Tao