Sciweavers

1310 search results - page 33 / 262
» Learning the k in k-means
Sort
View
SIGCSE
2005
ACM
108views Education» more  SIGCSE 2005»
15 years 7 months ago
Teaching and learning ethics in computer science: walking the walk
The author shares techniques used in a successful "Ethics and Professionalism" class at California State University, San Bernardino. The author describes active learning...
Richard J. Botting
ALT
2002
Springer
15 years 11 months ago
On the Eigenspectrum of the Gram Matrix and Its Relationship to the Operator Eigenspectrum
Abstract. In this paper we analyze the relationships between the eigenvalues of the m × m Gram matrix K for a kernel k(·, ·) corresponding to a sample x1, . . . , xm drawn from ...
John Shawe-Taylor, Christopher K. I. Williams, Nel...
ICASSP
2011
IEEE
14 years 5 months ago
Compressed learning of high-dimensional sparse functions
This paper presents a simple randomised algorithm for recovering high-dimensional sparse functions, i.e. functions f : [0, 1]d → R which depend effectively only on k out of d va...
Karin Schnass, Jan Vybíral
JMLR
2012
13 years 4 months ago
Sparse Additive Machine
We develop a high dimensional nonparametric classification method named sparse additive machine (SAM), which can be viewed as a functional version of support vector machine (SVM)...
Tuo Zhao, Han Liu
JOT
2010
124views more  JOT 2010»
15 years 10 days ago
Improving Learning Object Reuse Through OOD: A Theory of Learning Objects
The concept of a learning object (LO) has spread quickly without a very specific universal definition, and though born originally from the idea of object oriented design, with a ...
Claudine A. Allen, Ezra K. Mugisa