Sciweavers

2252 search results - page 131 / 451
» Improving Random Forests
Sort
View
BMCBI
2008
95views more  BMCBI 2008»
13 years 8 months ago
Unsupervised reduction of random noise in complex data by a row-specific, sorted principal component-guided method
Background: Large biological data sets, such as expression profiles, benefit from reduction of random noise. Principal component (PC) analysis has been used for this purpose, but ...
Joseph W. Foley, Fumiaki Katagiri
SIGMOD
2005
ACM
128views Database» more  SIGMOD 2005»
14 years 8 months ago
Deriving Private Information from Randomized Data
Randomization has emerged as a useful technique for data disguising in privacy-preserving data mining. Its privacy properties have been studied in a number of papers. Kargupta et ...
Zhengli Huang, Wenliang Du, Biao Chen
ICSE
2007
IEEE-ACM
14 years 8 months ago
Feedback-Directed Random Test Generation
We present a technique that improves random test generation by incorporating feedback obtained from executing test inputs as they are created. Our technique builds inputs incremen...
Carlos Pacheco, Shuvendu K. Lahiri, Michael D. Ern...
EWSN
2010
Springer
14 years 5 months ago
Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks
The simplicity and low-overhead of random walks have made them a popular querying mechanism for Wireless Sensor Networks. However, most of the related work is of theoretical nature...
Marco Zuniga, Chen Avin, Manfred Hauswirth
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 8 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel