• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.10
• /
• pp.4007-4024
• /
• 2020

It is tremendously important to construct decision trees to use as a tool for knowledge representation from a given decision table. However, the usual algorithms may split the decision table based on each value, which is not efficient for numerical attributes. The methodology of this paper is to split the given decision table into binary groups as like the CART algorithm, that uses binary split to work for both categorical and numerical attributes. The difference is that it uses split for each attribute established by the directed acyclic graph in a dynamic programming fashion whereas, the CART uses binary split among all considered attributes in a greedy fashion. The aim of this paper is to study the effect of binary splits in comparison with each value splits when building the decision trees. Such effect can be studied by comparing the number of nodes, local and global misclassification rate among the constructed decision trees based on three proposed algorithms.

• Communications for Statistical Applications and Methods
• /
• v.9 no.2
• /
• pp.411-423
• /
• 2002

In this paper, we propose a split criterion for binary decision trees. The proposed criterion selects the optimal split by measuring the prediction success of the candidate splits at a given node. The criterion is shown to have the property of exclusive preference. Examples are given to demonstrate the properties of the criterion.

• Communications for Statistical Applications and Methods
• /
• v.10 no.2
• /
• pp.471-478
• /
• 2003

In this paper, we reconsider the Kolmogorov-Smirnoff distance as a split criterion for binary decision trees and suggest an algorithm to obtain the Kolmogorov-Smirnoff distance more efficiently when the input variable have more than three categories. The Kolmogorov-Smirnoff distance is shown to have the property of exclusive preference. Empirical results, comparing the Kolmogorov-Smirnoff distance to the Gini index, show that the Kolmogorov-Smirnoff distance grows more accurate trees in terms of misclassification rate.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.19 no.10
• /
• pp.1065-1074
• /
• 2008

T-DMB(Terrestrial Digital Multimedia Broadcasting) system, is based on the Eureka-147 standard, provides various multimedia data services. However T-DMB system needs upgrades for more various services and better services. Therefore, we proposed advanced T-DMB system using unequal error protection system and hierarchical modulation in this paper while maintaing backward compatibility. And we simulated various bit split methods and double binary turbo code of DVB-RCS standard as method of LP data stream for additional service of advanced T-DMB. As the simulation results, double binary turbo code of proposed advanced T-DMB system have each coding gain of over 2 dB compared to conventional T-DMB.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2020.11a
• /
• pp.162-165
• /
• 2020

본 논문에서는 차세대 비디오 압축 표준인 MPEG-5 Essential Video Coding (EVC) 에서 사용된 블록 분할 방식에 대해서 소개한다. EVC 에서 사용된 블록 분할 방식은 기존 비디오 압축 표준인 HEVC/H.265 에서 사용된 쿼드 트리(Quad-tree)가 아닌 이진 분할(Binary split)과 삼진 분할(Ternary split)을 사용한 Binary ternary tree(BTT) 기술을 사용하고 있다. 또한 기존 비디오 압축 기술과 달리 분할된 블록의 코딩 순서를 정해서 사용 할 수 있는 Split unit coding order (SUCO) 기술이 사용되고 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2342-2348
• /
• 1999

DCT-based codebook design using binary tree was proposed to reduce computation time and to solve the initial codebook problem. In this method, DCT coefficient of training vectors that has maximum variance is to be a split key and the mean of coefficients at the location is used as split threshold, then balanced binary tree for final codebook is formed. However edge degradation appears in the reconstructed image, since the blocks of shade region are frequently selected for codevector. In this paper, we propose DCT-based vector quantization codebook design using unbalanced binary tree. Above all, the node that has the largest split key is splited. So the number of edge codevector can be increased. From the simulation results, this method reconstructs the edge region sincerely and shows higher PSNR than previous methods.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1997.11a
• /
• pp.145-149
• /
• 1997

In this paper, a hierarchical spatio-temporal image segmentation method based on binary split algorithm is proposed. Intensity and displacement vector at each pixel are used for image segmentation. The displacement vectors between two image frames which skip over one or several frames can be approximated by accumulating of the velocity vectors calculated from optical flow between two successive frames when the time interval between the two image frames is short enough or the motion is slow. The pixels whose displacement vector and intensity are ambiguous are precisely decided by the modified watershed algorithm using the proposed priority measure. In the experiment, the region of moving object is precisely segmented.

• Communications for Statistical Applications and Methods
• /
• v.10 no.3
• /
• pp.971-980
• /
• 2003

The tree method can be extended to multivariate responses, such as repeated measure and longitudinal data, by modifying the split function so as to accommodate multiple responses. Recently, some decision trees for multiple responses have been constructed by Segal (1992) and Zhang (1998). Segal suggested a tree can analyze continuous longitudinal response using Mahalanobis distance for within node homogeneity measures and Zhang suggested a tree can analyze multiple binary responses using generalized entropy criterion which is proportional to maximum likelihood of joint distribution of multiple binary responses. In this paper, we will modify CART procedure and suggest a new tree-based method that can analyze multiple binary responses using similarity measures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12C
• /
• pp.997-1005
• /
• 2008

In this paper, we proposed advanced T-DMB system which is based on Eureka-147 using UEP coding methods and hiererchical modulation for providing additional services while maintaining BER performance. We simulated the proposed advanced T-DMB system using unequal l6QAM modulation scheme combined with various bit split methods and coding methods such as double binary turbo code of DVB-RCS standard and LDPC code of DVB-S2 standard. In the simulation results, double binary turbo code and LDPC code of proposed advanced T-DMB system have coding gain of 2dB and 3.5dB compared to conventional T-DMB system respectively.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2005.07b
• /
• pp.1347-1350
• /
• 2005

A modified Time-Ratio Gray Scale AMOLED drive technique is described in which the frame period is split into two half-frames, each of which is divided into binary weighted sub-frames and driven in the conventional time-ratio manner. The proposed technique improves aperture ratio by reducing TFT sizes in pixel circuits.