Sciweavers

4526 search results - page 829 / 906
» Algorithmic problems related to the Internet
Sort
View
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
16 years 1 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
99
Voted
KDD
2003
ACM
99views Data Mining» more  KDD 2003»
16 years 1 months ago
Fragments of order
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
Aristides Gionis, Teija Kujala, Heikki Mannila
116
Voted
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
16 years 28 days ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
PODS
2002
ACM
167views Database» more  PODS 2002»
16 years 23 days ago
OLAP Dimension Constraints
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
Carlos A. Hurtado, Alberto O. Mendelzon
99
Voted
ICDT
2010
ACM
219views Database» more  ICDT 2010»
15 years 10 months ago
Aggregate Queries for Discrete and Continuous Probabilistic XML
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
Serge Abiteboul, T.-H Hubert Chan, Evgeny Kharlamo...