Sciweavers

2100 search results - page 199 / 420
» Learning to rank on graphs
Sort
View
ERCIMDL
2005
Springer
104views Education» more  ERCIMDL 2005»
16 years 2 days ago
Evaluation of the NSDL and Google for Obtaining Pedagogical Resources
We describe an experiment that measures the pedagogical usefulness of the results returned by the National Science Digital Library (NSDL) and Google. Eleven public school teachers ...
Frank McCown, Johan Bollen, Michael L. Nelson
UAI
2008
15 years 8 months ago
Cumulative distribution networks and the derivative-sum-product algorithm
We introduce a new type of graphical model called a `cumulative distribution network' (CDN), which expresses a joint cumulative distribution as a product of local functions. ...
Jim C. Huang, Brendan J. Frey
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
15 years 4 months ago
Classification with Sums of Separable Functions
Abstract. We present a novel approach for classification using a discretised function representation which is independent of the data locations. We construct the classifier as a su...
Jochen Garcke
DMIN
2009
142views Data Mining» more  DMIN 2009»
15 years 4 months ago
A Combinatorial Fusion Method for Feature Construction
- This paper demonstrates how methods borrowed from information fusion can improve the performance of a classifier by constructing (i.e., fusing) new features that are combinations...
Ye Tian, Gary M. Weiss, D. Frank Hsu, Qiang Ma
ALT
2008
Springer
16 years 3 months ago
Exploiting Cluster-Structure to Predict the Labeling of a Graph
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
Mark Herbster