• Title/Summary/Keyword: tree kernel

Search Result 40, Processing Time 0.037 seconds

Relation Extraction based on Composite Kernel combining Pattern Similarity of Predicate-Argument Structure (술어-논항 구조의 패턴 유사도를 결합한 혼합 커널 기반관계 추출)

  • Jeong, Chang-Hoo;Choi, Sung-Pil;Choi, Yun-Soo;Song, Sa-Kwang;Chun, Hong-Woo
    • Journal of Internet Computing and Services
    • /
    • v.12 no.5
    • /
    • pp.73-85
    • /
    • 2011
  • Lots of valuable textual information is used to extract relations between named entities from literature. Composite kernel approach is proposed in this paper. The composite kernel approach calculates similarities based on the following information:(1) Phrase structure in convolution parse tree kernel that has shown encouraging results. (2) Predicate-argument structure patterns. In other words, the approach deals with syntactic structure as well as semantic structure using a reciprocal method. The proposed approach was evaluated using various types of test collections and it showed the better performance compared with those of previous approach using only information from syntactic structures. In addition, it showed the better performance than those of the state of the art approach.

Pollen-Tree Selection among the Varieties of Corylus avellana in a Complete Diallel Cross (완전(完全) 대조(對照) 교배(交配)에 의(依)한 개암나무의 수분수(授粉樹) 선발(選拔))

  • Jung, Suk Koo;Noh, Eui Rae;Park, Chi Sun;Ahn, Chang Young;Jo, Jung Gi
    • Journal of Korean Society of Forest Science
    • /
    • v.75 no.1
    • /
    • pp.55-66
    • /
    • 1986
  • A complete diallel cross using ten varieties of Corylus avellana was made to select the best general combiners and the best specific combiners for each characteristic of each variety. The variety "Barcelona" showed the best general combining ability in kernel yield per hectare and the combinations, between Kara and Badem, between Badem and Barcelona, between Sivri and Barcelona, between Sirri and Barcelona, between Palaz and Barcelona, between Tombul and Kara, between Barcelona and Sivri, between Fiukuken2 and Hukuken3, and between Hukuken3 and Hukuken2, showed the best specific combining abilities in kernel yield. The other characteristics such as fruiting rate, pericarp thickness, weight/nut, kernel weight/nut, kernel ratio, and kernel yield per tree or hectare were also compared between the combinations.

  • PDF

Study on the ensemble methods with kernel ridge regression

  • Kim, Sun-Hwa;Cho, Dae-Hyeon;Seok, Kyung-Ha
    • Journal of the Korean Data and Information Science Society
    • /
    • v.23 no.2
    • /
    • pp.375-383
    • /
    • 2012
  • The purpose of the ensemble methods is to increase the accuracy of prediction through combining many classifiers. According to recent studies, it is proved that random forests and forward stagewise regression have good accuracies in classification problems. However they have great prediction error in separation boundary points because they used decision tree as a base learner. In this study, we use the kernel ridge regression instead of the decision trees in random forests and boosting. The usefulness of our proposed ensemble methods was shown by the simulation results of the prostate cancer and the Boston housing data.

Assessment of compressive strength of high-performance concrete using soft computing approaches

  • Chukwuemeka Daniel;Jitendra Khatti;Kamaldeep Singh Grover
    • Computers and Concrete
    • /
    • v.33 no.1
    • /
    • pp.55-75
    • /
    • 2024
  • The present study introduces an optimum performance soft computing model for predicting the compressive strength of high-performance concrete (HPC) by comparing models based on conventional (kernel-based, covariance function-based, and tree-based), advanced machine (least square support vector machine-LSSVM and minimax probability machine regressor-MPMR), and deep (artificial neural network-ANN) learning approaches using a common database for the first time. A compressive strength database, having results of 1030 concrete samples, has been compiled from the literature and preprocessed. For the purpose of training, testing, and validation of soft computing models, 803, 101, and 101 data points have been selected arbitrarily from preprocessed data points, i.e., 1005. Thirteen performance metrics, including three new metrics, i.e., a20-index, index of agreement, and index of scatter, have been implemented for each model. The performance comparison reveals that the SVM (kernel-based), ET (tree-based), MPMR (advanced), and ANN (deep) models have achieved higher performance in predicting the compressive strength of HPC. From the overall analysis of performance, accuracy, Taylor plot, accuracy metric, regression error characteristics curve, Anderson-Darling, Wilcoxon, Uncertainty, and reliability, it has been observed that model CS4 based on the ensemble tree has been recognized as an optimum performance model with higher performance, i.e., a correlation coefficient of 0.9352, root mean square error of 5.76 MPa, and mean absolute error of 4.1069 MPa. The present study also reveals that multicollinearity affects the prediction accuracy of Gaussian process regression, decision tree, multilinear regression, and adaptive boosting regressor models, novel research in compressive strength prediction of HPC. The cosine sensitivity analysis reveals that the prediction of compressive strength of HPC is highly affected by cement content, fine aggregate, coarse aggregate, and water content.

Analyzing Dependencies of Korean Subordinate Clauses (복합 커널을 사용한 한국어 종속절의 의존관계 분석)

  • Kim, Sang-Soo;Park, Seong-Bae;Lee, Sang-Jo;Park, Se Young
    • Annual Conference on Human and Language Technology
    • /
    • 2007.10a
    • /
    • pp.91-98
    • /
    • 2007
  • 한국어에서 절들의 의존관계를 밝히는 작업은 구문 분석 작업에서 가장 어려운 작업들 중에 하나로 인식되고 있다. 절의 의존관계를 파악하는 일은 표면적으로 나타나는 정보만을 가지고 처리할 수 없고, 의미 정보 같은 추가적인 정보가 필요할 것으로 판단하고 처리해왔다. 본 논문에서는 추가적인 정보를 사용하지 않고, 문장에서 얻을 수 있는 표면적인 정보만을 사용하여 절들 간의 의존관계를 파악하는 방법을 제안한다. 문장에서 얻을 수 있는 표면적인 정보는 문장의 구문 정보(tree structure information)와 어휘 및 거리 정보를 가지고 있는 정적인 정보(static information)로 나누어 볼 수 있다. 본 논문에서는 절들 간의 의존 관계 파악을 위하여 구문 정보 및 어휘정보 등을 하나 이상의 커널의 결합해서 사용하는 복합 커널(composite kernel)을 제안하고, 이 커널에 맞는 다양한 인스턴스 공간의 설정을 제안한다. 실험 데이터는 구문 트리로 표현된 STEP 2000코퍼스를 사용하였다. 실험은 최적화된 인스턴스 공간을 절들 간의 의존관계 파악 및 문장 수준에서 성능을 검정하였다. 관계 인스턴스 공간은 절들 간의 연결을 기준으로 Path-enclosed Tree와 Flattened Path-enclosed Tree로, 하부절(관형절)의 표현 유무로 Complete Tree, Contex-sensitive Tree, Simple Tree로 나누어 각각의 조합으로 실험하여 결정하였다. 그리고 결정된 인스턴스 공간에서 복합커널을 사용한 방법이 좋은 성능을 발휘함을 보였다.

  • PDF

Development of Boolean Operations for CAD System Kernel Supporting Non-manifold Models (비다양체 모델을 수용하는 CAD 시스템 커널을 위한 불리안 조직의 개발)

  • 김성환;이건우;김영진
    • Korean Journal of Computational Design and Engineering
    • /
    • v.1 no.1
    • /
    • pp.20-32
    • /
    • 1996
  • The boundary evaluation technique for Boolean operation on non-manifold models which is regarded as the most popular and powerful method to create and modify 3-D CAD models has been developed. This technique adopted the concept of Merge and Selection in which the CSG tree for Boolean operation can be edited quickly and easily. In this method, the merged set which contains complete information about primitive models involved is created by merging primitives one by one, then the alive entities are selected following the given CSG tree. This technique can support the hybrid representation of B-rep(Boundary Representation) and CSG(Constructive Solid Geometry) tree in a unified non-manifold model data structure, and expected to be used as a basic method for many modeling problems such as data representation of form features, and the interference between them, and data representation of conceptual models in design process, etc.

  • PDF

Comparision of Biochar Properties From Biomass produced by Slow Pyrolysis (저속열분해를 통한 바이오매스 부산물의 바이오촤 특성 비교 분석)

  • Park, Jinje;Lee, Yongwoon;Ryu, Changkook;Gang, Ki Seop;Yang, Won;Jung, Jin-Ho;Hyun, Seunghun
    • 한국연소학회:학술대회논문집
    • /
    • 2013.06a
    • /
    • pp.69-72
    • /
    • 2013
  • This study investigates the characteristics of biochar by slow pyrolysis at $500^{\circ}C$ for various biomass residues. Six biomass materials were tested: Tree bark, Tree stem, bagasse, cocopeat, paddy straw and palm kernel shell. In the biochar yield, the effect of ash in the raw biomass was significant for paddy straw. Excluding the ash content, the timber bark, bagasse and paddy straw had a similar biochar yield of 26-29 wt.%. Tree stem and bagasse had well developed pores in a wide size range and large surface area over $200m^2/g$. Cocopeat and PKS has significantly higher biochar yield due to the increased content of lignin, but the development of intra-particle pores and microscopic surface area was very poor. The elemental composition, pH and other properties of the biochar samples were also compared.

  • PDF

A Method for Tree Image Segmentation Combined Adaptive Mean Shifting with Image Abstraction

  • Yang, Ting-ting;Zhou, Su-yin;Xu, Ai-jun;Yin, Jian-xin
    • Journal of Information Processing Systems
    • /
    • v.16 no.6
    • /
    • pp.1424-1436
    • /
    • 2020
  • Although huge progress has been made in current image segmentation work, there are still no efficient segmentation strategies for tree image which is taken from natural environment and contains complex background. To improve those problems, we propose a method for tree image segmentation combining adaptive mean shifting with image abstraction. Our approach perform better than others because it focuses mainly on the background of image and characteristics of the tree itself. First, we abstract the original tree image using bilateral filtering and image pyramid from multiple perspectives, which can reduce the influence of the background and tree canopy gaps on clustering. Spatial location and gray scale features are obtained by step detection and the insertion rule method, respectively. Bandwidths calculated by spatial location and gray scale features are then used to determine the size of the Gaussian kernel function and in the mean shift clustering. Furthermore, the flood fill method is employed to fill the results of clustering and highlight the region of interest. To prove the effectiveness of tree image abstractions on image clustering, we compared different abstraction levels and achieved the optimal clustering results. For our algorithm, the average segmentation accuracy (SA), over-segmentation rate (OR), and under-segmentation rate (UR) of the crown are 91.21%, 3.54%, and 9.85%, respectively. The average values of the trunk are 92.78%, 8.16%, and 7.93%, respectively. Comparing the results of our method experimentally with other popular tree image segmentation methods, our segmentation method get rid of human interaction and shows higher SA. Meanwhile, this work shows a promising application prospect on visual reconstruction and factors measurement of tree.

Altering LCA of dependency parse trees for improving relation extraction from adjective clauses (형용사구에서의 관계추출 개선을 위한 의존구문트리의 최소공동조상 (LCA) 변경)

  • Lee, Dae-Seok;Myaeng, Sung-Hyon
    • Annual Conference on Human and Language Technology
    • /
    • 2018.10a
    • /
    • pp.552-556
    • /
    • 2018
  • 본 논문에서는 텍스트에서 개체(entity) 간 관계(relation) 추출 문제에서 의존구문트리를 이용하여 자질을 추출할 때 형용사구 내에 관계가 나타나는 경우의 성능을 향상시키는 방법을 제안한다. 일률적으로 의존구문트리의 최소공동조상(LCA: Least Common Ancestor)을 이용하는 일반적인 방법보다 형용사구가 나타날 때는 형용사구의 술어를 대신 이용하는 것이 더 좋은 자질이 된다는 것을 제안하고 로지스틱 회귀분석, SVM(linear), SVM(exponential kernel)을 이용한 실험들을 통해 그 효과를 확인하였다. 이는 트리커널을 이용한 것과 같이 의존구문트리의 최소공동조상이 주요한 역할을 하는 관계추출 모델들의 성능을 높일 수 있음을 보여 준다. 수행한 실험 과정을 통해 관계추출 데이터 셋에서 형용사구 내 관계를 포함하는 문장이 전체에서 차지하는 비율이 낮을 경우 생길 수 있는 문제를 추가적으로 얻을 수 있었다.

  • PDF