Sciweavers

1225 search results - page 87 / 245
» Maximal Consistent Subsets
Sort
View
IJFCS
2002
122views more  IJFCS 2002»
13 years 7 months ago
The Delaunay Hierarchy
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
Olivier Devillers
INFFUS
2002
108views more  INFFUS 2002»
13 years 7 months ago
Relationships between combination methods and measures of diversity in combining classifiers
This study looks at the relationships between different methods of classifier combination and different measures of diversity. We considered ten combination methods and ten measur...
Catherine A. Shipp, Ludmila Kuncheva
INFSOF
1998
73views more  INFSOF 1998»
13 years 7 months ago
Restructuring programs by tucking statements into functions
Changing the internal structure of a program without changing its behavior is called restructuring. This paper presents a transformation called tuck for restructuring programs by ...
Arun Lakhotia, Jean-Christophe Deprez
PAMI
1998
127views more  PAMI 1998»
13 years 7 months ago
The Random Subspace Method for Constructing Decision Forests
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
Tin Kam Ho
MCS
2010
Springer
13 years 6 months ago
A Support Kernel Machine for Supervised Selective Combining of Diverse Pattern-Recognition Modalities
Abstract. The Support Kernel Machine (SKM) and the Relevance Kernel Machine (RKM) are two principles for selectively combining objectrepresentation modalities of different kinds b...
Alexander Tatarchuk, Eugene Urlov, Vadim Mottl, Da...