278 search results - page 14 / 56 » Fast Feature Selection Using Fractal Dimension |
INFORMS
1998
13 years 8 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
AAAI
2008
13 years 10 months ago
2008
Based on Information Theory, optimal feature selection should be carried out by searching Markov blankets. In this paper, we formally analyze the current Markov blanket discovery ...
VISUALIZATION
2000
IEEE
14 years 24 days ago
2000
IEEE
Visualization algorithms have seen substantial improvements in the past several years. However, very few algorithms have been developed for directly studying data in dimensions hi...
CGF
2008
13 years 8 months ago
2008
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...
FDG
2009
ACM
14 years 2 months ago
2009
ACM
In this paper, I will discuss a set of techniques for supporting limited variable binding in behavior-based systems. This adds additional useful expressivity while preserving the ...