Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 10 of 10 for “"random subspaces"”.
-
Evolutionary feature creation for ensembles
… of the ensembles to be generated. We choose random subspaces method (Ho, 1998b) to generate ensembles and we have proposed two strategies to create EoC. In the first one, we combine the votes from each evolved classifier feature by feature. The performance obtained is slightly better than an …
-
On testing for a difference in two high-dimensional mean vectors.
… mean vectors that combines aspects of the random subspaces and cluster subspaces tests to improve test power.
-
Q-fully quadratic modeling and its application in a random subspace derivative-free method
… Recent research has shown that incorporating random subspaces into model-based DFO methods has the potential to improve their performance on high-dimensional problems. However, most of the current theoretical and practical results are based on linear approximation models due to the complexity …
-
Random sections of star bodies
… concerns analytic and geometric aspects of random sections of star bodies and their implications for problems in stochastic geometry. We treat isoperimetric inequalities and distribution of volumes of such sections. In particular, we resolve a longstanding conjecture on affine isoperimetric …
-
Fine-Grained, Unsupervised, Context-based Change Detection and Adaptation for Evolving Categorical Data
… vote of a set of models representing different random subspaces of the data [5]. These ideas are applied to a set of concept drift detector objects and merged with concepts from a recent, state-of-the-art, context-based change detection algorithm, the so-called Change Detection in Categorical …
-
Multi-classifier systems for off-line signature verification
… is very limited in practice. Moreover, only random forgeries are employed to train the system, which must in turn to discriminate between genuine samples and random, simple and skilled forgeries during operations. These last two forgery types are not available during the training phase. The …
-
Blind Demodulation via Convex and Non-Convex Programming
… the vectors have known signs and belong to known subspaces, we introduce the convex program BranchHull, which is posed in the natural parameter space that does not require an approximate solution or initialization in order to be stated or solved. Under the structural assumptions that $x$ and $w$ …
-
Heterogeneous face recognition
… generalizes the algorithm,called Prototype Random Subspaces (P-RS), to any HFR scenario. The viability of this algorithm is demonstrated on four separate HFR databases (near infrared, thermal infrared, forensic sketch, and viewed sketch). The third contribution of this dissertation is a …
-
Multiple instance learning under real-world conditions
… instances by projecting the instances into random subspaces. Clustering is performed on the data in these subspaces and positive instances are probabilistically identified based on the bag label of instances in clusters. Experiments show that the method achieves state-of-theart performance …
-
Enhancing Gene Expression Signatures in Cancer Prediction Models: Understanding and Managing Classification Complexity
… in classification complexity is also observed. A random subspace based multivariable feature selection approach using cost sensitive analysis is proposed to model the underlying heterogeneous cancer biology and address complexity due to multiple molecular pathways and unbalanced distribution of …