• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.5
• /
• pp.618-623
• /
• 2011

This paper proposes a novel method to discriminate meaningful tables from decorative one using a composite kernel for handling structural information of tables. In this paper, structural information of a table is extracted with two types of parse trees: context tree and table tree. A context tree contains structural information around a table, while a table tree presents structural information within a table. A composite kernel is proposed to efficiently handle these two types of trees based on a parse tree kernel. The support vector machines with the proposed kernel dised kuish meaningful tables from the decorative ones with rich structural information.

• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.276-279
• /
• 2011

문서 내에 존재하는 개체 간의 관계를 자동으로 추출할 때 다양한 형태의 문서 분석 결과를 활용할 수 있다. 본 논문에서는 기존에 개발되어 비교적 높은 성능을 보여준 트리 커널의 구절 구조 유사성 정보와 두 개체 사이의 유의미한 연관관계를 표현하는 술어-논항 구조 패턴의 유사성 정보를 활용하는 혼합 커널을 제안한다. 구문적 구조를 이용하는 기존의 트리 커널 기법에 술어와 논항 간의 의미적 구조를 활용하는 술어-논항 구조 패턴 유사도 커널을 결합하여 상호보완적인 혼합 커널을 구성하였고, 실험을 통하여 개발된 커널의 성능을 측정하였다. 실험 결과 구절 구조 정보를 이용하는 트리 커널만을 단독으로 사용했을 때보다 술어-논항 구조의 패턴 정보를 결합한 혼합 커널을 사용했을 때에 더 좋은 성능을 보이는 것을 확인할 수 있었다. 이는 관계 인스턴스에 대한 구절 구조 정보뿐만 아니라 개체 간의 유의미한 연관관계를 표현해주는 술어-논항 구조 패턴 또한 관계 추출 작업에 매우 유용한 정보임을 입증하고 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.78-80
• /
• 1999

마이크로 커널 구조는 필수 불가결한 커널 기능만을 가지게 되며, 운영체제의 기능성은 서버로 동작하게 된다. 따라서 모노리틱 운영체제에 비해서 커널 기능의 확장 및 개발이 용이하다는 장점을 가지게 된다. 본 연구에서는 기존에 제시된 마이크로 커널의 접근방식에서 추가적으로 멀티미디어를 지원할 수 있는 멀티미디어 마이크로 커널(M3K)을 구현하고 있다. 특히 M3K는 멀티미디어의 실시간 특성 및 기능을 제공할 수 있는 구조로서 컴포넌트에 기반한 커널 프레임워크를 사용하고 있다. 본 논문은 M3K 마이크로 커널을 구현함에 있어서 커널 구조 자체를 컴포넌트화시켜 필요한 기능만을 선택적으로 결합해서 사용할 수 있는 방법을 제시하고 있으며, 현재 동작중인 쓰레드 컴포넌트의 아키텍처 위주로 설명한다.

• The Journal of the Acoustical Society of Korea
• /
• v.36 no.4
• /
• pp.261-266
• /
• 2017

In this paper, we propose a vocal and nonvocal separation method which uses a combination of kernel model and LSTM (Long-Short Term Memory) networks. Conventional vocal and nonvocal separation methods estimate the vocal component even in sections where only non-vocal components exist. This causes a problem of the source estimation error. Therefore we combine the existing kernel based separation method with the vocal/nonvocal classification based on LSTM networks in order to overcome the limitation of the existing separation methods. We propose a parallel combined separation algorithm and series combined separation algorithm as combination structures. The experimental results verify that the proposed method achieves better separation performance than the conventional approaches.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06c
• /
• pp.240-244
• /
• 2010

본 논문에서는 단백질 간 상호작용 자동 식별을 위해서 구문 트리 커널을 확장한 시맨틱 구문 트리 커널을 제안한다. 기존의 구문 트리 커널은 구문 트리의 단말 노드를 구성하는 개별 어휘에 대해서 단순하게 외형적 비교를 수행하기 때문에 실제 의미적으로는 유사한 두 구문 트리의 커널 수치가 상대적으로 낮아져서 단백질 간 상호작용 식별의 성능이 떨어지는 문제점이 발생한다. 이를 극복하기 위해서 두 구문 트리의 구문적 유사도(syntactic similarity)와 어휘 의미적 유사도(lexical semantic similarity)를 동시에 효과적으로 계산하여 이를 결합하는 새로운 커널을 고안하였다. 그리고 제안된 시맨틱 구문 트리 커널을 활용하여 단백질 간 상호작용 식별 성능을 향상시킬 수 있음을 실험을 통하여 보여주었다.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.4
• /
• pp.11-18
• /
• 2010

Fuzzy c-means (FCM) is a simple but efficient clustering algorithm using the concept of a fuzzy set that has been proved to be useful in many areas. There are, however, several well known problems with FCM, such as sensitivity to initialization, sensitivity to outliers, and limitation to convex clusters. In this paper, global fuzzy c-means (G-FCM) and kernel fuzzy c-means (K-FCM) are combined to form a non-linear variant of G-FCM, called kernel global fuzzy c-means (KG-FCM). G-FCM is a variant of FCM that uses an incremental seed selection method and is effective in alleviating sensitivity to initialization. There are several approaches to reduce the influence of noise and accommodate non-convex clusters, and K-FCM is one of them. K-FCM is used in this paper because it can easily be extended with different kernels. By combining G-FCM and K-FCM, KG-FCM can resolve the shortcomings mentioned above. The usefulness of the proposed method is demonstrated by experiments using artificial and real world data sets.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.32 no.1
• /
• pp.55-63
• /
• 2019

In engineering problems, many random variables have correlation, and the correlation of input random variables has a great influence on reliability analysis results of the mechanical systems. However, correlated variables are often treated as independent variables or modeled by specific parametric joint distributions due to difficulty in modeling joint distributions. Especially, when there are insufficient correlated data, it becomes more difficult to correctly model the joint distribution. In this study, multivariate kernel density estimation with bounded data is proposed to estimate various types of joint distributions with highly nonlinearity. Since it combines given data with bounded data, which are generated from confidence intervals of uniform distribution parameters for given data, it is less sensitive to data quality and number of data. Thus, it yields conservative statistical modeling and reliability analysis results, and its performance is verified through statistical simulation and engineering examples.

• The Journal of the Acoustical Society of Korea
• /
• v.31 no.3
• /
• pp.188-196
• /
• 2012

In this paper, we propose a new approach to speaker identification technique which uses an ensemble of multiple classifiers (speaker identifiers). KPCA (kernel principal component analysis) enhances features for each classifier. To reduce the processing time and memory requirements, we select limited number of samples randomly which are used as estimation set for each KPCA basis. The experimental result shows that the proposed approach gives a higher identification accuracy than GKPCA (greedy kernel principal component analysis).

• The Journal of the Acoustical Society of Korea
• /
• v.29 no.3
• /
• pp.216-221
• /
• 2010

In this paper, we propose speaker verification method using Support Vector Machine (SVM) kernel with Gaussian Mixture Model (GMM)-supervector based on the Mahalanobis distance. The proposed GMM-supervector SVM kernel method is combined GMM with SVM. The GMM-supervectors are generated by GMM parameters of speaker and other speaker utterances. A speaker verification threshold of GMM-supervectors is decided by SVM kernel based on Mahalanobis distance to improve speaker verification accuracy. The experimental results for text-independent speaker verification using 20 speakers demonstrates the performance of the proposed method compared to GMM, SVM, GMM-supervector SVM kernel based on Kullback-Leibler (KL) divergence, and GMM-supervector SVM kernel based on Bhattacharyya distance.