Sciweavers

1060 search results - page 84 / 212
» On the Discovery of Random Trees
Sort
View
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
15 years 10 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, ...
67
Voted
RSA
2006
96views more  RSA 2006»
14 years 10 months ago
Concentration inequalities for functions of independent variables
Following the entropy method this paper presents general concentration inequalities, which can be applied to combinatorial optimization and empirical processes. The inequalities g...
Andreas Maurer
97
Voted
BMCBI
2007
179views more  BMCBI 2007»
14 years 10 months ago
rMotifGen: random motif generator for DNA and protein sequences
Background: Detection of short, subtle conserved motif regions within a set of related DNA or amino acid sequences can lead to discoveries about important regulatory domains such ...
Eric C. Rouchka, C. Timothy Hardin
BMCBI
2011
14 years 4 months ago
Phenotype Recognition with Combined Features and Random Subspace Classifier Ensemble
Background: Automated, image based high-content screening is a fundamental tool for discovery in biological science. Modern robotic fluorescence microscopes are able to capture th...
Bailing Zhang, Tuan D. Pham
AINA
2007
IEEE
15 years 4 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein