Terry Sullivan. Locating question difficulty through explorations in question space. In Proceedings of the first ACM/IEEE-CS joint conference on Digital libraries, pages 251--252. ACM Press, 2001.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Expresso Microarray Experiment Management.. - Heath, Heath.. (2001) (1 citation) (Correct)
....for new (untested) input value, as well as if we are interested in deriving phenomenological models that serve as initial explanations of the observations. Support vector machines [Brown et al. 2000] decision trees [Garofalakis et al. 2000] regression [Vapnik, 1998] discriminant analysis [Sullivan, 2001], and backpropagation neural networks [Gallant, 1993] are examples of supervised techniques. Model based vs. Model Free Methods 4 Lenwood S. Heath In addition, analysis techniques can be characterized as model free (also called nonparametric, memory based, or lazy) or as model based (also ....
Sullivan, T. (2001). Locating question difficulty through explorations in question space. In Proceedings of the First ACM/IEEE-CS Joint Conference on Digital Libraries, pages 251-2.
Query Difficulty, Robustness and Selective Application.. - Amati, Carpineto, Romano (2004) (Correct)
No context found.
Terry Sullivan. Locating question difficulty through explorations in question space. In Proceedings of the first ACM/IEEE-CS joint conference on Digital libraries, pages 251--252. ACM Press, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC