Sciweavers

5158 search results - page 828 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
16 years 7 months ago
Tell me something I don't know: randomization strategies for iterative data mining
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
Heikki Mannila, Kai Puolamäki, Markus Ojala, ...
MOBIHOC
2009
ACM
16 years 7 months ago
Admission control and scheduling for QoS guarantees for variable-bit-rate applications on wireless channels
Providing differentiated Quality of Service (QoS) over unreliable wireless channels is an important challenge for supporting several future applications. We analyze a model that h...
I-Hong Hou, P. R. Kumar
194
Voted
MOBIHOC
2009
ACM
16 years 7 months ago
Aging rules: what does the past tell about the future in mobile ad-hoc networks?
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...
Han Cai, Do Young Eun
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
16 years 7 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
16 years 7 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...