• Journal of Korean Society of Forest Science
• /
• v.94 no.6
• /
• pp.453-461
• /
• 2005

Structural characteristics and successional trends of actual forest vegetation in Youngil soil erosion control district, South Korea, were studied and described by the phytosociological investigations and diameter measurement. And also the incremental growth pattern of the major trees for erosion control analyzed using increment core. Sixty-eight releves were sampled with $100m^2$ plots. Two main vegetation types (Lespedeza bicolor-Miscanthus sinensis-type and Alnus firma-Styrax japonica-type) have been distinguished and typified nine vegetation units. Constancy classes diagram showed that the higher species (${\geq}IV$) have only 2.6% and that most species occurred were rare and had low abundances. The successional trends of the actual forest vegetation would be mostly changed as Quercus serrata forest. Annual diameter growth was 3.0~3.4 mm in case of conifer (Pinus rigida and Pinus thunbergii), and the broad-leaved trees (Alnus firma, Robinia pseudo-acacia, and Alnus hirsuta) showed 4.3~4.9 mm. The incremental growth patterns showed to be decreased rapidly since twenty to twenty-five years regardless of the species of trees.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.3
• /
• pp.155-164
• /
• 2016

For frequency pattern analysis of large databases, the new tree-based frequency pattern analysis algorithm which can compensate for the disadvantages of the Apriori method has been variously studied. In frequency pattern tree, the number of nodes is associated with memory allocation, but also affects memory resource consumption and processing speed of the growth. Therefore, reducing the number of nodes in the tree is very important in the frequency pattern mining. However, the absolute criteria which need to order the transaction items for construction frequency pattern tree has lowered the compression ratio of the tree nodes. But most of the frequency based tree construction methods adapted the absolute criteria. FP-tree is typically frequency pattern tree structure which is an extended prefix-tree structure for storing compressed frequent crucial information about frequent patterns. For construction the tree, all the frequent items in different transactions are sorted according to the absolute criteria, frequency descending order. CanTree also need to absolute criteria, canonical order, to construct the tree. In this paper, we proposed a novel frequency pattern tree construction method that does not use the absolute criteria, IRFP-tree algorithm. IRFP-tree(Intersection Rule based FP-tree). IRFP-tree is constituted with the new paradigm of the intersection rule without the use of the absolute criteria. It increased the compression ratio of the tree nodes, and reduced the tree construction time. Our method has the additional advantage that it provides incremental mining. The reported test result demonstrate the applicability and effectiveness of the proposed approach.