Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...

In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.

in the shafaroud forest, logging operation is generally performed by using selective cutting methods. chainsaw and cable skidder are two main forest machines for harvesting of this forest. however, forest harvesting operations result in serious residual stand damage during felling, winching and skidding operations in this forest. residual stand damage resulting from selective cutting was assess...

difference aspects of multinomial statistical modelings and its classifications has been studied so far. in these type of problems y is the qualitative random variable with t possible states which are considered as classifications. the goal is prediction of y based on a random vector x ? ir^m. many methods for analyzing these problems were considered. one of the modern and general method of cla...

‎The first variable Zagreb index of graph $G$ is defined as‎ ‎begin{eqnarray*}‎ ‎M_{1,lambda}(G)=sum_{vin V(G)}d(v)^{2lambda}‎, ‎end{eqnarray*}‎ ‎where $lambda$ is a real number and $d(v)$ is the degree of‎ ‎vertex $v$‎. ‎In this paper‎, ‎some upper and lower bounds for the distribution function and expected value of this index in random increasing trees (rec...