Results 1  10
of
161,495
The Nature of Statistical Learning Theory
, 1999
"... Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based on the deve ..."
Abstract

Cited by 13236 (32 self)
 Add to MetaCart
on the developed theory were proposed. This made statistical learning theory not only a tool for the theoretical analysis but also a tool for creating practical algorithms for estimating multidimensional functions. This article presents a very general overview of statistical learning theory including both
Online Scheduling with General Cost Functions
"... We consider a general online scheduling problem on a single machine with the objective of minimizing j wjg(Fj), where wj is the weight/importance of job Jj, Fj is the flow time of the job in the schedule, and g is an arbitrary nondecreasing cost function. Numerous natural scheduling objectives are ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
We consider a general online scheduling problem on a single machine with the objective of minimizing j wjg(Fj), where wj is the weight/importance of job Jj, Fj is the flow time of the job in the schedule, and g is an arbitrary nondecreasing cost function. Numerous natural scheduling objectives
General Cost Functions for Support Vector Regression
 IN PROCEEDINGS OF THE 8TH INTERNATIONAL CONFERENCE ON ARTIFICIAL NEURAL NETWORKS
, 1998
"... The concept of Support Vector Regression is extended to a more general class of convex cost functions. Moreover it is shown how the resulting convex constrained optimization problems can be efficiently solved by a PrimalDual Interior Point path following method. Both computational feasibility and i ..."
Abstract

Cited by 42 (6 self)
 Add to MetaCart
The concept of Support Vector Regression is extended to a more general class of convex cost functions. Moreover it is shown how the resulting convex constrained optimization problems can be efficiently solved by a PrimalDual Interior Point path following method. Both computational feasibility
The Facility Location Problem with General Cost Functions
 Networks
, 2002
"... In this paper we introduce a generalized version of the facility location problem in which the facility cost is a function of the number of clients assigned to the facility. We focus on the case of concave facility cost functions. We observe that this problem can be reduced to the uncapacitated faci ..."
Abstract

Cited by 31 (4 self)
 Add to MetaCart
In this paper we introduce a generalized version of the facility location problem in which the facility cost is a function of the number of clients assigned to the facility. We focus on the case of concave facility cost functions. We observe that this problem can be reduced to the uncapacitated
COLOR IMAGE FILTERING USING GENERALIZED COST FUNCTIONS
"... The concept of cost function (CF) in the context of image filtering is put under investigation in this work. Optimal behaviour of the resulting filters in respect with noise attenuation and edge preservation is sought through the minimization of these functions. This behaviour can be controlled by p ..."
Abstract
 Add to MetaCart
The concept of cost function (CF) in the context of image filtering is put under investigation in this work. Optimal behaviour of the resulting filters in respect with noise attenuation and edge preservation is sought through the minimization of these functions. This behaviour can be controlled
On the regularity of the free boundary in the optimal partial transport problem for general cost functions
"... Abstract. This paper concerns the regularity and geometry of the free boundary in the optimal partial transport problem for general cost functions. More specifically, we prove that a C1 cost implies a locally Lipschitz free boundary. As an application, we address a problem discussed by Caffarelli an ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. This paper concerns the regularity and geometry of the free boundary in the optimal partial transport problem for general cost functions. More specifically, we prove that a C1 cost implies a locally Lipschitz free boundary. As an application, we address a problem discussed by Caffarelli
Costly search and mutual fund flows
 Journal of Finance
, 1998
"... This paper studies the flows of funds into and out of equity mutual funds. Consumers base their fund purchase decisions on prior performance information, but do so asymmetrically, investing disproportionately more in funds that performed very well the prior period. Search costs seem to be an importa ..."
Abstract

Cited by 523 (5 self)
 Add to MetaCart
managers ’ behavior, 1 how board structure affects oversight activities, 2 and how scale and scope economies affect mutual fund costs and fees. 3 More generally, the fund industry is a laboratory in which to study the actions of individual investors who buy fund shares. In this paper, we study the flows
Optimal contracts and competitive markets with costly state verification
 Journal of Economic Theory
, 1979
"... The insight of Arrow [4] and Debreu [7] that uncertainty is easily incorporated into general equilibrium models is doubleedged. It is true that one need only index commodities by the state of nature, and classical results on the existence and optimality of competitive equilibria can be made to ..."
Abstract

Cited by 879 (8 self)
 Add to MetaCart
The insight of Arrow [4] and Debreu [7] that uncertainty is easily incorporated into general equilibrium models is doubleedged. It is true that one need only index commodities by the state of nature, and classical results on the existence and optimality of competitive equilibria can be made to
MetaCost: A General Method for Making Classifiers CostSensitive
 In Proceedings of the Fifth International Conference on Knowledge Discovery and Data Mining
, 1999
"... Research in machine learning, statistics and related fields has produced a wide variety of algorithms for classification. However, most of these algorithms assume that all errors have the same cost, which is seldom the case in KDD prob lems. Individually making each classification learner costsensi ..."
Abstract

Cited by 415 (4 self)
 Add to MetaCart
functioning or change to it. Unlike stratification, MetaCost is applicable to any number of classes and to arbitrary cost matrices. Empirical trials on a large suite of benchmark databases show that MetaCost almost always produces large cost reductions compared to the costblind classifier used (C4.5RULES
Multipoint quantitativetrait linkage analysis in general pedigrees
 Am. J. Hum. Genet
, 1998
"... Multipoint linkage analysis of quantitativetrait loci (QTLs) has previously been restricted to sibships and small pedigrees. In this article, we show how variancecomponent linkage methods can be used in pedigrees of arbitrary size and complexity, and we develop a general framework for multipoint i ..."
Abstract

Cited by 567 (60 self)
 Add to MetaCart
chromosome for each relative pair. We have derived correlations in IBD sharing as a function of chromosomal distance for relative pairs in general pedigrees and provide a simple framework whereby these correlations can be easily obtained for any relative pair related by a single line of descent
Results 1  10
of
161,495