Sciweavers

156 search results - page 3 / 32
» Random Access to Abstract Data Types
Sort
View
ICDM
2010
IEEE
108views Data Mining» more  ICDM 2010»
13 years 5 months ago
Assessing Data Mining Results on Matrices with Randomization
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
Markus Ojala
MCS
2007
Springer
14 years 1 months ago
Random Feature Subset Selection for Ensemble Based Classification of Data with Missing Features
Abstract. We report on our recent progress in developing an ensemble of classifiers based algorithm for addressing the missing feature problem. Inspired in part by the random subsp...
Joseph DePasquale, Robi Polikar
JLP
2007
89views more  JLP 2007»
13 years 7 months ago
Universality and semicomputability for nondeterministic programming languages over abstract algebras
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
Wei Jiang, Yuan Wang, Jeffery I. Zucker
TDP
2010
124views more  TDP 2010»
13 years 5 months ago
Random Forests for Generating Partially Synthetic, Categorical Data
Abstract. Several national statistical agencies are now releasing partially synthetic, public use microdata. These comprise the units in the original database with sensitive or ide...
Gregory Caiola, Jerome P. Reiter
IJCNN
2007
IEEE
14 years 1 months ago
Random Feature Subset Selection for Analysis of Data with Missing Features
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
Joseph DePasquale, Robi Polikar