Results 1  10
of
806,237
Probabilistic Outputs for Support Vector Machines and Comparisons to Regularized Likelihood Methods
 ADVANCES IN LARGE MARGIN CLASSIFIERS
, 1999
"... The output of a classifier should be a calibrated posterior probability to enable postprocessing. Standard SVMs do not provide such probabilities. One method to create probabilities is to directly train a kernel classifier with a logit link function and a regularized maximum likelihood score. Howev ..."
Abstract

Cited by 1027 (0 self)
 Add to MetaCart
. However, training with a maximum likelihood score will produce nonsparse kernel machines. Instead, we train an SVM, then train the parameters of an additional sigmoid function to map the SVM outputs into probabilities. This chapter compares classification error rate and likelihood scores for an SVM plus
The InputOutput Map Of A Monotone Discrete Time
, 1991
"... the study of fixed points of the input output map of first come first served queues in a very general setup is due to Bambos and Walrand, [4]. ..."
Abstract
 Add to MetaCart
the study of fixed points of the input output map of first come first served queues in a very general setup is due to Bambos and Walrand, [4].
The Realization of InputOutput Maps Using Bialgebras
, 1991
"... We use the theory of bialgebras to provide the algebraic background for state space realization theorems for inputoutput maps of control systems. This allows us to consider from a common viewpoint classical results about formal state space realizations of nonlinear systems and more recent resul ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
We use the theory of bialgebras to provide the algebraic background for state space realization theorems for inputoutput maps of control systems. This allows us to consider from a common viewpoint classical results about formal state space realizations of nonlinear systems and more recent
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
, 2002
"... Matching elements of two data schemas or two data instances plays a key role in data warehousing, ebusiness, or even biochemical applications. In this paper we present a matching algorithm based on a fixpoint computation that is usable across different scenarios. The algorithm takes two graphs (sch ..."
Abstract

Cited by 579 (12 self)
 Add to MetaCart
(schemas, catalogs, or other data structures) as input, and produces as output a mapping between corresponding nodes of the graphs. Depending on the matching goal, a subset of the mapping is chosen using filters. After our algorithm runs, we expect a human to check and if necessary adjust the results. As a
Visual Information Seeking: Tight Coupling of Dynamic Query Filters with Starfield Displays
, 1994
"... This paper offers new principles for visual information seeking (VIS). A key concept is to support browsing, which is distinguished from familiar query composition and information retrieval because of its emphasis on rapid filtering to reduce result sets, progressive refinement of search parameters, ..."
Abstract

Cited by 627 (51 self)
 Add to MetaCart
, continuous reformulation of goals, and visual scanning to identify results. VIS principles developed include: dynamic query filters (query parameters are rapidly adjusted with sliders, buttons, maps, etc.), starfield displays (twodimensional scatterplots to structure result sets and zooming to reduce
Bandera: Extracting Finitestate Models from Java Source Code
 IN PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING
, 2000
"... Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a fini ..."
Abstract

Cited by 648 (33 self)
 Add to MetaCart
program source code. Bandera takes as input Java source code and generates a program model in the input language of one of several existing verification tools; Bandera also maps verifier outputs back to the original source code. We discuss the major components of Bandera and give an overview of how it can
Calibrating noise to sensitivity in private data analysis
 In Proceedings of the 3rd Theory of Cryptography Conference
, 2006
"... Abstract. We continue a line of research initiated in [10, 11] on privacypreserving statistical databases. Consider a trusted server that holds a database of sensitive information. Given a query function f mapping databases to reals, the socalled true answer is the result of applying f to the datab ..."
Abstract

Cited by 631 (57 self)
 Add to MetaCart
Abstract. We continue a line of research initiated in [10, 11] on privacypreserving statistical databases. Consider a trusted server that holds a database of sensitive information. Given a query function f mapping databases to reals, the socalled true answer is the result of applying f
InputOutputMap Through UpdateSplineSmoothing*
, 1991
"... This paper presents a robust method of learning passively a onedimensional inputoutputmap when receiving only indirect information about the correct inputoutputmlap (e.g. only the sign of the deviation between the actual estimated output value and the correct output value is obtained). This in ..."
Abstract
 Add to MetaCart
This paper presents a robust method of learning passively a onedimensional inputoutputmap when receiving only indirect information about the correct inputoutputmlap (e.g. only the sign of the deviation between the actual estimated output value and the correct output value is obtained
Uniqueness of the Weights for Minimal Feedforward Nets with a Given InputOutput Map
, 1992
"... We show that, for feedforward nets with a single hidden layer, a single output node, and a "transfer function" Tanh s, the net is uniquely determined by its inputoutput map, up to an obvious finite group of symmetries (permutations of the hidden nodes, and changing the sign of all the weig ..."
Abstract

Cited by 63 (2 self)
 Add to MetaCart
We show that, for feedforward nets with a single hidden layer, a single output node, and a "transfer function" Tanh s, the net is uniquely determined by its inputoutput map, up to an obvious finite group of symmetries (permutations of the hidden nodes, and changing the sign of all
Smooth Stabilization Implies Coprime Factorization
, 1989
"... This paper shows that coprime right factorizations exist for the input to state mapping of a continuous time nonlinear system provided that the smooth feedback stabilization problem be solvable for this system. In particular, it follows that feedback linearizable systems admit such factorizations. I ..."
Abstract

Cited by 467 (62 self)
 Add to MetaCart
This paper shows that coprime right factorizations exist for the input to state mapping of a continuous time nonlinear system provided that the smooth feedback stabilization problem be solvable for this system. In particular, it follows that feedback linearizable systems admit such factorizations
Results 1  10
of
806,237