• Title/Summary/Keyword: Large Tree

Search Result 935, Processing Time 0.032 seconds

A Differential Index Assignment Scheme for Tree-Structured Vector Quantization (나무구조 벡터양자화 기반의 차분 인덱스 할당기법)

  • 한종기;정인철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.2C
    • /
    • pp.100-109
    • /
    • 2003
  • A differential index assignment scheme is proposed for the image encoding system in which a variable-length tree-structured vector quantizer is adopted. Each source vector is quantized into a terminal node of VLTSVQ and each terminal node is represented as a unique binary vector. The proposed index assignment scheme utilizes the correlation between interblocks of the image to increase the compression ratio with the image quality maintained. Simulation results show that the proposed scheme achieves a much higher compression ratio than the conventional one does and that the amount of the bit rate reduction of the proposed scheme becomes large as the correlation of the image becomes large. The proposed encoding scheme can be effectively used to encode R images whose pixel values we, in general, highly correlated with those of the neighbor pixels.

Exploring Industrial Function Combining Factors for Each Type in the 6th Industry Based on Decision Tree Analysis (의사결정나무분석법을 활용한 6차산업 유형별 산업적 기능결합 요인탐색)

  • Kim, Jungtae
    • Journal of Agricultural Extension & Community Development
    • /
    • v.23 no.3
    • /
    • pp.243-255
    • /
    • 2016
  • This study aims to identify the characteristics of businesses influencing the choice of their type in the 6th industry and analyze how they work. This study analyzed data of 752 businesses certified as belonging to the 6th industry in 2015 through the classification and regression tree (CART) algorithm in decision tree analysis. The results of analysis showed that the type of agricultural product processing, region, the type of service, and the production percentage in a province affected a choice of the type. The most important variable that impacted how businesses in the 6th industry chose their type was the type of agricultural product processing, and if a business produced simple agricultural products, it was likely to specialize into $1st^*2nd$ or $1st^*3rd$. Access to large consumption areas was a critical factor in the growth of 2nd and 3rd industrial functions. These findings would contribute to establishing a model to develop the 6th industry and empirically demonstrate the importance of access to large consumption areas for agricultural businesses and rural tourism.

Flood Mitigation Planing for a Basin Using a Decision Tree Model (의사결정나무모형을 이용한 유역내 구조적 홍수방어 대안 도출)

  • Byeon, Sungho;Kang, Hyunjin;Han, Jeongwoo;Kim, Tae-Woong
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.28 no.1B
    • /
    • pp.33-40
    • /
    • 2008
  • Intensive rainfalls in wet season (June~September) result in serious flood damage which is about 95% of natural hazard in Korea. Recently, in order to cope with repeated flood hazard, comprehensive flood control plans have been carried out in large basins in Korea. The plans suggest structural alternative plans for flood mitigation as well as non-structural plans. In this study, a practical method using a decision tree was developed to systematically allocate structural facilities for flood control, which maximizes the flood control capacity in a basin. This study also presents a practical guidance to organize structural defensive alternatives for a comprehensive flood control plan in a large basin.

Personalized Recommendation System using FP-tree Mining based on RFM (RFM기반 FP-tree 마이닝을 이용한 개인화 추천시스템)

  • Cho, Young-Sung;Ho, Ryu-Keun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.2
    • /
    • pp.197-206
    • /
    • 2012
  • A exisiting recommedation system using association rules has the problem, such as delay of processing speed from a cause of frequent scanning a large data, scalability and accuracy as well. In this paper, using a Implicit method which is not used user's profile for rating, we propose the personalized recommendation system which is a new method using the FP-tree mining based on RFM. It is necessary for us to keep the analysis of RFM method and FP-tree mining to be able to reflect attributes of customers and items based on the whole customers' data and purchased data in order to find the items with high purchasability. The proposed makes frequent items and creates association rule by using the FP-tree mining based on RFM without occurrence of candidate set. We can recommend the items with efficiency, are used to generate the recommendable item according to the basic threshold for association rules with support, confidence and lift. To estimate the performance, the proposed system is compared with existing system. As a result, it can be improved and evaluated according to the criteria of logicality through the experiment with dataset, collected in a cosmetic internet shopping mall.

Improvement Plan for Planting Large Trees in Artificial Ground of the Apartment Complex (공동주택 인공지반 대형교목 식재 개선방안)

  • Kang, Myung-Soo;Kim, Nam-Jung
    • Land and Housing Review
    • /
    • v.6 no.4
    • /
    • pp.221-229
    • /
    • 2015
  • Large trees in the apartment complex are playing an important role to decide the quality of external environment. They are planted with the object of utilizing themselves as a landmark of the complex and enhancing space symbolism. Since planting large trees would require high maintenance costs and generate defect, it would cause decline in quality of external environment. This study researches on large trees in artificial ground of the apartment complex. This study analyzes actual condition of planting and tries to provide improvement direction of planting. In order to conduct this research, three target areas (over R30) and 265 trees are selected. Based on the drawings and specifications this study researches on the plan of landscape design, changes of field design, actual condition of completion, present condition of planting, minimum soil depth of growth and development and types of extra action for soil depth. The result shows that 85% of drawings and specifications for large trees in the apartment complex are deep-rooted tree species. On average large trees with R 35 are planted in artificial ground and there is lack of on average 65cm minimum soil depth of growth and development. Reviewing changes of field design is conducted in such limited size as mainly R30 and R40 and there is no extra plan for lack of soil depth. The plan for securing additional soil depth is done by 85% of mounding. However, since there is only 10% of satisfaction, the inappropriateness in securing additional soil is pointed out. This research also points out that the size of large trees, root characteristics and location-allocation for planting are pivotal factors for securing minimum soil depth of growth and development. This research also provides improvement direction in case of planning planting.

Simplification of LIDAR Data for Building Extraction Based on Quad-tree Structure

  • Du, Ruoyu;Lee, Hyo Jong
    • Annual Conference of KIPS
    • /
    • 2011.11a
    • /
    • pp.355-356
    • /
    • 2011
  • LiDAR data is very large, which contains an amount of redundant information. The information not only takes up a lot of storage space but also brings much inconvenience to the LIDAR data transmission and application. Therefore, a simplified method was proposed for LiDAR data based on quad-tree structure in this paper. The boundary contour lines of the buildings are displayed as building extraction. Experimental results show that the method is efficient for point's simplification according to the rule of mapping.

Semantic Similarity Search using the Signature Tree (시그니처 트리를 사용한 의미적 유사성 검색 기법)

  • Kim, Ki-Sung;Im, Dong-Hyuk;Kim, Cheol-Han;Kim, Hyoung-Joo
    • Journal of KIISE:Databases
    • /
    • v.34 no.6
    • /
    • pp.546-553
    • /
    • 2007
  • As ontologies are used widely, interest for semantic similarity search is also increasing. In this paper, we suggest a query evaluation scheme for k-nearest neighbor query, which retrieves k most similar objects to the query object. We use the best match method to calculate the semantic similarity between objects and use the signature tree to index annotation information of objects in database. The signature tree is usually used for the set similarity search. When we use the signature tree in similarity search, we are required to predict the upper-bound of similarity for a node; the highest similarity value which can be found when we traverse into the node. So we suggest a prediction function for the best match similarity function and prove the correctness of the prediction. And we modify the original signature tree structure for same signatures not to be stored redundantly. This improved structure of signature tree not only reduces the size of signature tree but also increases the efficiency of query evaluation. We use the Gene Ontology(GO) for our experiments, which provides large ontologies and large amount of annotation data. Using GO, we show that proposed method improves query efficiency and present several experimental results varying the page size and using several node-splitting methods.

Breeding of a New Late-season Pear Cultivar 'Mansoo' with Large Sized High Quality and Long Storability (저장력 강한 고품질 대과 만생종 배 '색수(晩秀)' 육성)

  • Kim, Whee-Cheon;Hwang, Hae-Sung;Shin, Il-Sheob;Shin, Yong-Uk;Lee, Don-Kyun;Kang, Sang-Jo;Moon, Jong-Youl;Kim, Jung-Ho
    • Horticultural Science & Technology
    • /
    • v.19 no.1
    • /
    • pp.66-70
    • /
    • 2001
  • 'Mansoo' is a late-season pear cultivar with extra large and high quality fruit of long storability, which was released by National Horticultural Research Institute in 1995. The cultivar originated from the cross between 'Danbae' and 'Okusankichi' at Suwon in 1978, had been under regional adaptability test at nine areas in the name of 'Wonkyo Na-15' for 4 years since 1992. It was vigorous in tree growth and upright in tree shape. Its flower bud is easily maintained, resulting in higher productivity than 'Danbae' and 'Okusankichi'. It bloomed a day later than 'Niitaka', and showed cross-compatibility with 'Niitaka', 'Chojuro' and some other varieties. Harvesting time of 'Mansoo' is late October in Suwon. The fruit shape is oblate and skin color is light yellowish brown. The fruit weighed 600-700 g and has 12-13% soluble solids content. The flesh is soft, juicy, and has negligible grit. It is resistant to black leaf rot (Alternaria kikuchiana Tanaka).

  • PDF

A Study of Evaluating Streetscape Green Environments to Improve Urban Street Green Spaces - A Case Study of Jeonju City - (도시가로녹지의 개선을 위한 녹화환경평가 연구 -전주시를 대상으로-)

  • Jeong, Moon-Sun;Lim, Hyun-Jeong
    • Journal of the Korean Society of Environmental Restoration Technology
    • /
    • v.22 no.3
    • /
    • pp.55-71
    • /
    • 2019
  • The purpose of this study is to propose an evaluation method to assess green environments of streetscapes to improve urban street green spaces in Jeonju City. Through a rapid assessment of urban street green spaces, we suggest an objective basis for expanding street green space as well as for adopting sustainable maintenance and improvement measures. We choose 12 sections of streetscapes (roads and sidewalks) to investigate existing street conditions which have more than four lanes and function as major road axes. Six large roads and six medium roads of Jeonju City center area are investigated as pilot assessment study sites. Site inventory checklists consist of environmental characteristics of streetscape, street tree status, and planting condition evaluation. Environmental characteristics of streetscapes are composed of physical and neighborhood factors. For instance, items for physical factors are types and width of road/sidewalks, paving materials, tree protection materials, and green strip. And surrounding landuse is a neighborhood factor. Assessment items for street tree status are street plant names (tree/shrubs/ground cover), size, and planting intervals. Planting condition evaluation items are tree shape, damage, canopy density, and planting types with existence of adjacent green space. Evaluation results are classified into three levels such as A(maintain or repair), B(greening enhancement), and C(structural improvement). In case of grade A, streetscapes have enough sidewalk width for maintaining green strip and a multi-layered planting(in large road only) with fairly good growing conditions of street trees. For grade B and C, streetscapes have a moderate level of sidewalk width with a single street tree planting. In addition, street tree growing conditions are appeared poor so that green enhancement or maintenance measures are needed. For median, only grade B and C are found as its planting growing foundations are very limited in space. As a result, acquiring enough sidewalk space is essential to enhance ecological quality of urban street green. Especially, it is necessary to have green strip with reasonable widths for plant growing conditions in sidewalks. In addition, we need to consider native species with multi-layer plant compositions while designing street green.

An Efficient Tree Structure Method for Mining Association Rules (트리 구조를 이용한 연관규칙의 효율적 탐색)

  • Kim, Chang-Oh;Ahn, Kwang-Il;Kim, Seong-Jip;Kim, Jae-Yearn
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.27 no.1
    • /
    • pp.30-36
    • /
    • 2001
  • We present a new algorithm for mining association rules in the large database. Association rules are the relationships of items in the same transaction. These rules provide useful information for marketing. Since Apriori algorithm was introduced in 1994, many researchers have worked to improve Apriori algorithm. However, the drawback of Apriori-based algorithm is that it scans the transaction database repeatedly. The algorithm which we propose scans the database twice. The first scanning of the database collects frequent length l-itemsets. And then, the algorithm scans the database one more time to construct the data structure Common-Item Tree which stores the information about frequent itemsets. To find all frequent itemsets, the algorithm scans Common-Item Tree instead of the database. As scanning Common-Item Tree takes less time than scanning the database, the algorithm proposed is more efficient than Apriori-based algorithm.

  • PDF