Sciweavers

691 search results - page 20 / 139
» Constructing Ensembles from Data Envelopment Analysis
Sort
View
ICDAR
2003
IEEE
14 years 24 days ago
Automatic Classification of Hand Drawn Geometric Shapes using Constructional Sequence Analysis
A method for automatically assessing the constructional sequence from a neuropsychological drawing task using Hidden Markov Models is presented. We also present a method of extrac...
Richard M. Guest, Samuel Chindaro, Michael C. Fair...
CCS
2008
ACM
13 years 9 months ago
Principled reasoning and practical applications of alert fusion in intrusion detection systems
It is generally believed that by combining several diverse intrusion detectors (i.e., forming an IDS ensemble), we may achieve better performance. However, there has been very lit...
Guofei Gu, Alvaro A. Cárdenas, Wenke Lee
WCRE
2009
IEEE
14 years 2 months ago
Domain Feature Model Recovery from Multiple Applications Using Data Access Semantics and Formal Concept Analysis
Feature models are widely employed in domainspecific software development to specify the domain requirements with commonality and variability. A feature model is usually construct...
Yiming Yang, Xin Peng, Wenyun Zhao
KDD
2000
ACM
110views Data Mining» more  KDD 2000»
13 years 11 months ago
An empirical analysis of techniques for constructing and searching k-dimensional trees
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
Douglas A. Talbert, Douglas H. Fisher
AAAI
2004
13 years 9 months ago
Online Parallel Boosting
This paper presents a new boosting (arcing) algorithm called POCA, Parallel Online Continuous Arcing. Unlike traditional boosting algorithms (such as Arc-x4 and Adaboost), that co...
Jesse A. Reichler, Harlan D. Harris, Michael A. Sa...