Sciweavers

3245 search results - page 304 / 649
» Mining Transformed Data Sets
Sort
View
EDBT
2006
ACM
129views Database» more  EDBT 2006»
16 years 6 months ago
Efficient Quantile Retrieval on Multi-dimensional Data
Given a set of N multi-dimensional points, we study the computation of -quantiles according to a ranking function F, which is provided by the user at runtime. Specifically, F compu...
Man Lung Yiu, Nikos Mamoulis, Yufei Tao
SADM
2011
15 years 1 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
2008
95views more  BMCBI 2008»
15 years 6 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
ILP
2003
Springer
15 years 12 months ago
Query Optimization in Inductive Logic Programming by Reordering Literals
Query optimization is used frequently in relational database management systems. Most existing techniques are based on reordering the relational operators, where the most selective...
Jan Struyf, Hendrik Blockeel
CGF
2008
148views more  CGF 2008»
15 years 6 months ago
Automatic Registration for Articulated Shapes
We present an unsupervised algorithm for aligning a pair of shapes in the presence of significant articulated motion and missing data, while assuming no knowledge of a template, u...
Will Chang, Matthias Zwicker