Pruning the dendritic tree

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effect of pruning on dendritic tree topology.

The variability in topological shapes of observed neuronal branching patterns can accurately be described by a simple model for random sequential growth. This finding is remarkable in view of the fact that the actual neuritic growth process can vary, and includes phases of regression and removal of branches which were not considered in the model. The aim of the present study is to investigate t...

متن کامل

Probability-Based Game Tree Pruning

In game-tree search, a point value is customarily used to measure position evaluation. If the uncertainty about the value is to be reflected in the evaluation, which is described with probabilistic distribution or probabilities, the search process must back up distributions from leaf nodes to the root. It is shown that even though the merit value of a node is described by probabilities, α-β bou...

متن کامل

The Biases of Decision Tree Pruning Strategies

Post pruning of decision trees has been a successful approach in many real-world experiments, but over all possible concepts it does not bring any inherent improvement to an algorithm's performance. This work explores how a PAC-proven decision tree learning algorithm fares in comparison with two variants of the normal top-down induction of decision trees. The algorithm does not prune its hypoth...

متن کامل

Decision Tree Pruning: Biased or

We evaluate the performance of weakestlink pruning of decision trees using crossvalidation. This technique maps tree pruning into a problem of tree selection: Find the best (i.e. the right-sized) tree, from a set of trees ranging in size from the unpruned tree to a null tree. For samples with at least 200 cases, extensive empirical evidence supports the following conclusions relative to tree se...

متن کامل

MDL-Based Decision Tree Pruning

This paper explores the application of the Min imum Description Length principle for pruning decision trees We present a new algorithm that intuitively captures the primary goal of reduc ing the misclassi cation error An experimental comparison is presented with three other prun ing algorithms The results show that the MDL pruning algorithm achieves good accuracy small trees and fast execution ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature Reviews Neuroscience

سال: 2011

ISSN: 1471-003X,1471-0048

DOI: 10.1038/nrn3099