These Association rule mining is to find association rules that satisfy the predefined minimum support and confidence from a given database. The Apriori and FP-tree algorithms are the most common and existing frequent itemsets mining algorithm, but these algorithms lack incremental learning ability. Incremental learning ability is desirable to solve the temporal dynamic property of knowledge an...

Evidence for variable selection bias in classification tree algorithms based on the Gini Index is reviewed from the literature and embedded into a broader explanatory scheme: Variable selection bias in classification tree algorithms based on the Gini Index can be caused not only by the statistical effect of multiple comparisons, but also by an increasing estimation bias and variance of the spli...

Efficient forest management increases the demand for detailed, timely information. High spatial resolution remotely sensed imagery provides viable sources and opportunities for automated forest interpretation at an individual tree level. Recent research, which aims at providing tree-based forest inventory measurements, has considered automatic individual tree crown detection and delineation. A ...

Rowan University 5.

POWER, the PhylOgenetic WEb Repeater, is a web-based service designed to perform user-friendly pipeline phylogenetic analysis. POWER uses an open-source LAMP structure and infers genetic distances and phylogenetic relationships using well-established algorithms (ClustalW and PHYLIP). POWER incorporates a novel tree builder based on the GD library to generate a high-quality tree topology accordi...

there is always a considerable difference between the corporate performance and the tax levy that is identified by the taxation authorities which has become a common practice. this fact has led to no fairness among taxpayers, a fact that influences the horizontal and vertical sides of equity. horizontal equity is created when people feel the benefits of the tax gain that is proportional to the ...

In this paper, a general tree algorithm processing a random flow of arrivals is analyzed. Capetanakis-Tsybakov-Mikhailov’s protocol in the context of communication networks with random access is an example of such an algorithm. In computer science, this corresponds to a trie structure with a dynamic input. Mathematically, it is related to a stopped branching process with exogeneous arrivals (im...

We propose a generic decision tree framework that supports reusable components design. The proposed generic decision tree framework consists of several sub-problems which were recognized by analyzing well-known decision tree induction algorithms, namely ID3, C4.5, CART, CHAID, QUEST, GUIDE, CRUISE, and CTREE. We identified reusable components in these algorithms as well as in several of their p...

the success or failure of an organization has a direct relationship with how its human resources are employed and retained. it is the case that organizations keep large amounts of information and data on entrance evaluations and processes. this information, however, is often left unutilized. data mining is considered a solution for analyzing these data. this paper is investigating educated and ...