Sciweavers

1060 search results - page 78 / 212
» On the Discovery of Random Trees
Sort
View
SDM
2010
SIAM
202views Data Mining» more  SDM 2010»
14 years 8 months ago
Multiresolution Motif Discovery in Time Series
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
Nuno Castro, Paulo J. Azevedo
KDD
2009
ACM
167views Data Mining» more  KDD 2009»
15 years 5 months ago
Anomalous window discovery through scan statistics for linear intersecting paths (SSLIP)
Anomalous windows are the contiguous groupings of data points. In this paper, we propose an approach for discovering anomalous windows using Scan Statistics for Linear Intersectin...
Lei Shi, Vandana Pursnani Janeja
89
Voted
ISAAC
2004
Springer
87views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Random Access to Advice Strings and Collapsing Results
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
Jin-yi Cai, Osamu Watanabe
SADM
2011
14 years 5 months ago
Random survival forests for high-dimensional data
: Minimal depth is a dimensionless order statistic that measures the predictiveness of a variable in a survival tree. It can be used to select variables in high-dimensional problem...
Hemant Ishwaran, Udaya B. Kogalur, Xi Chen, Andy J...
BMCBI
2004
111views more  BMCBI 2004»
14 years 10 months ago
Multiclass discovery in array data
Background: A routine goal in the analysis of microarray data is to identify genes with expression levels that correlate with known classes of experiments. In a growing number of ...
Yingchun Liu, Markus Ringnér