5275 search results - page 839 / 1055 » Computing by observing |
169
click to vote
DATAMINE
1998
15 years 6 months ago
1998
The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and non-...
194
click to vote
JMLR
2002
15 years 6 months ago
2002
We present some greedy learning algorithms for building sparse nonlinear regression and classification models from observational data using Mercer kernels. Our objective is to dev...
212
click to vote
DATAMINE
1999
15 years 6 months ago
1999
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
174
click to vote
SIGCSE
2002
ACM
15 years 6 months ago
2002
ACM
In this paper, we examine implications of definitions of information technology to women's participation in the industry and in academe. This paper is exploratory only, based...
165
click to vote
TASLP
2002
15 years 6 months ago
2002
The first stage in many pattern recognition tasks is to generate a good set of features from the observed data. Usually, only a single feature space is used. However, in some compl...