Sciweavers

1310 search results - page 37 / 262
» Learning the k in k-means
Sort
View
ICSEA
2008
IEEE
15 years 4 months ago
Interdisciplinary Project-Based Learning in Ergonomics for Software Engineers: A Case Study
This paper discusses an interdisciplinary educational initiative led by an instructional team with backgrounds in engineering and psychology in the context of an ergonomics course...
Alexandra Branzan Albu, K. Malakuti, H. Tuokko, W....
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
15 years 10 months ago
The offset tree for learning with partial labels
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
Alina Beygelzimer, John Langford
CORR
2010
Springer
141views Education» more  CORR 2010»
14 years 8 months ago
Learning Functions of Few Arbitrary Linear Parameters in High Dimensions
Let us assume that f is a continuous function defined on the unit ball of Rd , of the form f(x) = g(Ax), where A is a k×d matrix and g is a function of k variables for k ≪ d. ...
Massimo Fornasier, Karin Schnass, Jan Vybír...
CORR
2010
Springer
96views Education» more  CORR 2010»
14 years 9 months ago
Learning High-Dimensional Markov Forest Distributions: Analysis of Error Rates
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
Vincent Y. F. Tan, Animashree Anandkumar, Alan S. ...
IPL
2010
92views more  IPL 2010»
14 years 8 months ago
Learning parities in the mistake-bound model
We study the problem of learning parity functions that depend on at most k variables (kparities) attribute-efficiently in the mistake-bound model. We design a simple, deterministi...
Harry Buhrman, David García-Soriano, Arie M...