Results 1  10
of
31,057
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
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
Classic Problems
, 2007
"... No background required Motivation (importance) is guaranteed Today: Three classic problems Three problems from YL 2 / 231 ..."
Abstract
 Add to MetaCart
No background required Motivation (importance) is guaranteed Today: Three classic problems Three problems from YL 2 / 231
The Nonstochastic Multiarmed Bandit Problem
 SIAM JOURNAL OF COMPUTING
, 2002
"... In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This classical problem has received much attention because of the simple model it provides of the tradeoff between exploration (trying out ..."
Abstract

Cited by 491 (34 self)
 Add to MetaCart
In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This classical problem has received much attention because of the simple model it provides of the tradeoff between exploration (trying
K.B.: MultiInterval Discretization of ContinuousValued Attributes for Classication Learning. In:
 IJCAI.
, 1993
"... Abstract Since most realworld applications of classification learning involve continuousvalued attributes, properly addressing the discretization process is an important problem. This paper addresses the use of the entropy minimization heuristic for discretizing the range of a continuousvalued a ..."
Abstract

Cited by 832 (7 self)
 Add to MetaCart
Abstract Since most realworld applications of classification learning involve continuousvalued attributes, properly addressing the discretization process is an important problem. This paper addresses the use of the entropy minimization heuristic for discretizing the range of a continuous
Economic Action and Social Structure: The Problem of Embeddedness
 American Journal of Sociology
, 1985
"... How behavior and institutions are affected by social relations is one of the classic questions of social theory. This paper concerns the extent to which economic action is embedded in structures of social relations, in modern industrial society. Although the usual neoclassical accounts provide an &q ..."
Abstract

Cited by 3311 (3 self)
 Add to MetaCart
How behavior and institutions are affected by social relations is one of the classic questions of social theory. This paper concerns the extent to which economic action is embedded in structures of social relations, in modern industrial society. Although the usual neoclassical accounts provide
Classic Problems............................................................. 69
, 2003
"... Problems from topology proceedings / edited by Elliott Pearl. vi, 216 p. Includes bibliographical references. ISBN 0973086718 1. Topology—Problems, exercises, etc. I. Pearl, Elliott. II. Title. ..."
Abstract
 Add to MetaCart
Problems from topology proceedings / edited by Elliott Pearl. vi, 216 p. Includes bibliographical references. ISBN 0973086718 1. Topology—Problems, exercises, etc. I. Pearl, Elliott. II. Title.
Domain Adaptation for Classication Problem ⋆
"... Domain Adaptation (DA) is a learning problem where we wish to leverage labeled data from source domain to learn a hypothesis performing well on a different but related target domain for which no labeled data is available. In this paper, an idea of unified method named UNDA (United Domain Adaptation) ..."
Abstract
 Add to MetaCart
Domain Adaptation (DA) is a learning problem where we wish to leverage labeled data from source domain to learn a hypothesis performing well on a different but related target domain for which no labeled data is available. In this paper, an idea of unified method named UNDA (United Domain Adaptation
An Efficient Solution to the FivePoint Relative Pose Problem
, 2004
"... An efficient algorithmic solution to the classical fivepoint relative pose problem is presented. The problem is to find the possible solutions for relative camera pose between two calibrated views given five corresponding points. The algorithm consists of computing the coefficients of a tenth degre ..."
Abstract

Cited by 484 (13 self)
 Add to MetaCart
An efficient algorithmic solution to the classical fivepoint relative pose problem is presented. The problem is to find the possible solutions for relative camera pose between two calibrated views given five corresponding points. The algorithm consists of computing the coefficients of a tenth
Tabu Search  Part I
, 1989
"... This paper presents the fundamental principles underlying tabu search as a strategy for combinatorial optimization problems. Tabu search has achieved impressive practical successes in applications ranging from scheduling and computer channel balancing to cluster analysis and space planning, and more ..."
Abstract

Cited by 680 (11 self)
 Add to MetaCart
, and more recently has demonstrated its value in treating classical problems such as the traveling salesman and graph coloring problems. Nevertheless, the approach is still in its infancy, and a good deal remains to be discovered about its most effective forms of implementation and about the range
ON A CLASSICAL PROBLEM OF PROBABILITY THEORY
, 1961
"... We consider the following classical “urnproblem”. Suppose that there are 71 urns given, and that balls are placed at random in these urns one after the other. Let us suppose that the urns are labelled with the numbers 1,2,..., n and let tj be equal to k if the jth ball is placed into the kth urn. ..."
Abstract

Cited by 45 (2 self)
 Add to MetaCart
We consider the following classical “urnproblem”. Suppose that there are 71 urns given, and that balls are placed at random in these urns one after the other. Let us suppose that the urns are labelled with the numbers 1,2,..., n and let tj be equal to k if the jth ball is placed into the kth urn
Results 1  10
of
31,057