Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,889
Learning to predict by the methods of temporal differences
- MACHINE LEARNING
, 1988
"... This article introduces a class of incremental learning procedures specialized for prediction – that is, for using past experience with an incompletely known system to predict its future behavior. Whereas conventional prediction-learning methods assign credit by means of the difference between predi ..."
Abstract
-
Cited by 1521 (56 self)
- Add to MetaCart
predicted and actual outcomes, the new methods assign credit by means of the difference between temporally successive predictions. Although such temporal-difference methods have been used in Samuel's checker player, Holland's bucket brigade, and the author's Adaptive Heuristic Critic
Gapped BLAST and PSI-BLAST: a new generation of protein database search programs.
- Nucleic Acids Res.
, 1997
"... ABSTRACT The BLAST programs are widely used tools for searching protein and DNA databases for sequence similarities. For protein comparisons, a variety of definitional, algorithmic and statistical refinements described here permits the execution time of the BLAST programs to be decreased substantia ..."
Abstract
-
Cited by 8572 (88 self)
- Add to MetaCart
substantially while enhancing their sensitivity to weak similarities. A new criterion for triggering the extension of word hits, combined with a new heuristic for generating gapped alignments, yields a gapped BLAST program that runs at approximately three times the speed of the original. In addition, a method
Mega: molecular evolutionary genetic analysis software for microcomputers
- CABIOS
, 1994
"... A computer program package called MEGA has been developed for estimating evolutionary distances, reconstructing phylogenetic trees and computing basic statistical quantities from molecular data. It is written in C+ + and is intended to be used on IBM and IBM-compatible personal computers. In this pr ..."
Abstract
-
Cited by 505 (10 self)
- Add to MetaCart
, new algorithms of branch-and-bound and heuristic searches are implemented. In addition, MEGA computes statistical quantities such as nucleotide and amino acid frequencies, transition/transversion biases, codon frequencies (codon usage tables), and the number of variable sites in specified segments
The geometry of graphs and some of its algorithmic applications
- COMBINATORICA
, 1995
"... In this paper we explore some implications of viewing graphs as geometric objects. This approach offers a new perspective on a number of graph-theoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations that res ..."
Abstract
-
Cited by 524 (19 self)
- Add to MetaCart
, small balanced separators can be found efficiently. Faithful low-dimensional representations of statistical data allow for meaningful and efficient clustering, which is one of the most basic tasks in pattern-recognition. For the (mostly heuristic) methods used
Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces
, 1995
"... A new heuristic approach for minimizing possibly nonlinear and non differentiable continuous space functions is presented. By means of an extensive testbed, which includes the De Jong functions, it will be demonstrated that the new method converges faster and with more certainty than Adaptive Simula ..."
Abstract
-
Cited by 427 (5 self)
- Add to MetaCart
A new heuristic approach for minimizing possibly nonlinear and non differentiable continuous space functions is presented. By means of an extensive testbed, which includes the De Jong functions, it will be demonstrated that the new method converges faster and with more certainty than Adaptive
O-Plan: the Open Planning Architecture
, 1990
"... O-Plan is an AI planner based on previous experience with the Nonlin planner and its derivatives. Nonlin and other similar planning systems had limited control architectures and were only partially successful at limiting their search spaces. O-Plan is a design and implementation of a more flexible s ..."
Abstract
-
Cited by 379 (41 self)
- Add to MetaCart
system aimed at supporting planning research and development, opening up new planning methods and supporting strong search control heuristics. O-Plan takes an engineering approach to the construction of an efficient domain independent planning system which includes a mixture of AI and numerical
Tabu Search -- Part II
, 1990
"... This is the second half of a two part series devoted to the tabu search metastrategy for optimization problems. Part I introduced the fundamental ideas of tabu search as an approach for guiding other heuristics to overcome the limitations of local optimality, both in a deterministic and a probabilis ..."
Abstract
-
Cited by 387 (5 self)
- Add to MetaCart
This is the second half of a two part series devoted to the tabu search metastrategy for optimization problems. Part I introduced the fundamental ideas of tabu search as an approach for guiding other heuristics to overcome the limitations of local optimality, both in a deterministic and a
Methods and Metrics for Cold-Start Recommendations
- PROCEEDINGS OF THE 25TH ANNUAL INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL
, 2002
"... We have developed a method for recommending items that combines content and collaborative data under a single probabilistic framework. We benchmark our algorithm against a nave Bayes classifier on the cold-start problem, where we wish to recommend items that no one in the community has yet rated. We ..."
Abstract
-
Cited by 330 (7 self)
- Add to MetaCart
. We systematically explore three testing methodologies using a publicly available data set, and explain how these methods apply to specific real-world applications. We advocate heuristic recommenders when benchmarking to give competent baseline performance. We introduce a new performance metric
New spectral methods for ratio cut partition and clustering
- IEEE TRANS. ON COMPUTER-AIDED DESIGN
, 1992
"... Partitioning of circuit netlists is important in many phases of VLSI design, ranging from layout to testing and hardware simulation. The ratio cut objective function [29] has received much attention since it naturally captures both min-cut and equipartition, the two traditional goals of partitionin ..."
Abstract
-
Cited by 296 (17 self)
- Add to MetaCart
for computing heuristic ratio cuts based on the eigenvector of this second ei-genvalue. Effective clustering methods are an immediate by-product of the second eigenvector computation, and are very successful on the “difficult” input classes proposed in the CAD literature. Finally, we discuss the very natural
Coding, Analysis, Interpretation, and Recognition of Facial Expressions
, 1997
"... We describe a computer vision system for observing facial motion by using an optimal estimation optical flow method coupled with geometric, physical and motion-based dynamic models describing the facial structure. Our method produces a reliable parametric representation of the face's independen ..."
Abstract
-
Cited by 331 (6 self)
- Add to MetaCart
use of this heuristic coding scheme, we have used our computer vision system to probabilistically characterize facial motion and muscle activation in an experimental population, thus deriving a new, more accurate representation of human facial expressions that we call FACS+. Finally, we show how
Results 1 - 10
of
3,889
