Sciweavers

325 search results - page 53 / 65
» Computing all skyline probabilities for uncertain data
Sort
View
KDD
2002
ACM
293views Data Mining» more  KDD 2002»
14 years 8 months ago
Automatic Categorization of Web Pages and User Clustering with Mixtures of Hidden Markov Models
We propose mixtures of hidden Markov models for modelling clickstreams of web surfers. Hence, the page categorization is learned from the data without the need for a (possibly cumb...
Alexander Ypma, Tom Heskes
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
14 years 7 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 4 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
PODC
2004
ACM
14 years 28 days ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
COMPGEOM
2010
ACM
14 years 17 days ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan