Fifty years have passed since the publication of the first regression tree algorithm. New techniques have added capabilities that far surpass those of the early methods. Modern classification trees can partition the data with linear splits on subsets of variables and fit nearest neighbor, kernel density, and other models in the partitions. Regression trees can fit almost every kind of tradition...

The terminal nodes of a binary tree classifier represent discrete classes to be recognized. In this paper the classes are considered to be fuzzy sets in which a specific sample can belong to more than one class with different degrees of membership. The terminal nodes is this case will contain information about the degrees to which test samples belong to particular classes. This will allow the d...

This thesis investigates whether stock picking based on classification and regression trees can be implemented as a successful algorithmic trading system, if only based on technical analysis. To evaluate the performance of this method a fictional portfolio was constructed from the Stockholm Stock Exchange OMX30, traded on a five-year period. By means of implementation, classification of the ass...

Of the five muscarinic receptor subtypes, the M5 receptor is the only one detectable in midbrain dopaminergic neurons, making it an attractive potential therapeutic target for treating disorders in which dopaminergic signaling is disrupted. However, developing an understanding of the role of M5 in regulating midbrain dopamine neuron function has been hampered by a lack of subtype-selective comp...

The AdaBoost like algorithm for boosting CART regression trees is considered. The boosting predictors sequence is analyzed on various data sets and the behaviour of the algorithm is investigated. An instability index of a given estimation method with respect to some training sample is defined. Based on the bagging algorithm, this instability index is then extended to quantify the additional ins...

In designing a decision tree for classification or regression, one selects at each node a feature to be tested, and partitions the range of that feature into a small number of bins, each bin corresponding to a child of the node. When the feature’s range is discrete with N unordered outcomes, the optimal partition, that is, the partition minimizing an expected loss, is usually found by an exhaus...

Nonsmooth local optimization problems occur in many fields, including engineering, mathematics, and economics. In economics, nonsmooth problems can be found in finance, mathematical economics and production theory. Examples include, nonsmooth utility maximization and exact penalty functions. However there are few convergent optimization algorithms to solve general nonsmooth or discontinuous pro...

A functional high throughput screen identified a novel chemotype for the positive allosteric modulation (PAM) of the muscarinic acetylcholine receptor (mAChR) subtype 5 (M5). Application of rapid analog, iterative parallel synthesis efficiently optimized M5 potency to arrive at the most potent M5 PAMs prepared to date and provided tool compound 8n (ML380) demonstrating modest CNS penetration (h...

We determined the antigenic specificity and protective immunogenicity of two chemically synthesized peptides of type 5 streptococcal M protein. The synthetic peptides, designated S-M5(1-20) and S-M5(20-40), represent the amino-terminal amino acid sequence of the native pepsin-extracted M5 molecule, which is known to contain at least one heart cross-reactive epitope. Initial studies showed that ...