Learn More
The structure of a software system deteriorates as a result of continuous maintenance activity. For the purpose of software reengineering or reverse engineering, software engineers often get the original source code as the most updated source of information due to lack of current documentation and limited or nonexistent availability of the original(More)
The Random Forest algorithm generates quite diverse decision trees as the base classifiers by applying the Random Subspace algorithm on the bootstrap samples for high dimensional datasets. However, for low dimensional datasets the diversity among the trees falls sharply for the Random Forest algorithm. To increase the ensemble accuracy by inducing more(More)
Here we calculate the expected number of isolated vertices, edges, self loops and triangles in a random realization of stochastic Kronecker graph. We then establish some bounds on the values of the parameters of the stochastic Kronecker graph which are sufficient to generate large random graph with no isolated vertices, edges, self loops and triangles.(More)
The agar tree (Aquilaria agallocha Roxb.) is an evergreen tropical tree species containing precious dark resinous heartwood (agarwood). The population of agar tree is rapidly declining in natural forests in Bangladesh, and the species is now being planted in government-owned degraded forest sites as well as privately-owned homestead forests. A survey was(More)
The stochastic Kronecker Graph model can generate large random graph that closely resembles many real world networks. For example, the output graph has a heavy-tailed degree distribution, has a (low) diameter that effectively remains constant over time and obeys the so-called densification power law [1]. Aside from this list of very important graph(More)