• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.10
• /
• pp.397-402
• /
• 2019

Accurately predicting cancer prognosis to provide appropriate treatment strategies for patients is one of the critical challenges in bioinformatics. Many researches have suggested machine learning models to predict patients' outcomes based on their gene expression data. Gene expression data is high-dimensional numerical data containing about 17,000 genes, so traditional researches used feature selection or dimensionality reduction approaches to elevate the performance of prognostic prediction models. These approaches, however, have an issue of making it difficult for the predictive models to grasp any biological interaction between the selected genes because feature selection and model training stages are performed independently. In this paper, we propose a novel two-dimensional image formatting approach for gene expression data to achieve feature selection and prognostic prediction effectively. Node2Vec is exploited to integrate biological interaction network and gene expression data and a convolutional neural network learns the integrated two-dimensional gene expression image data and predicts cancer prognosis. We evaluated our proposed model through double cross-validation and confirmed superior prognostic prediction accuracy to traditional machine learning models based on raw gene expression data. As our proposed approach is able to improve prediction models without loss of information caused by feature selection steps, we expect this will contribute to development of personalized medicine.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.4
• /
• pp.284-288
• /
• 2009

With explosively growing PPI databases, the computational approach for a prediction and configuration of PPI network has been a big stream in the bioinformatics area. Recent researches gradually consider physicochemical properties of proteins and support high resolution results with integration of experimental results. With regard to current research trend, it is very close future to complete a PPI network configuration of each organism. However, direct applying the PPI network to real field is complicated problem because PPI network is only a set of co-expressive proteins or gene products, and its network link means simple physical binding rather than in-depth knowledge of biological process. In this paper, we suggest a protein functional flow model which is a directed network based on a protein functions' relation of signaling transduction pathway. The vertex of the suggested model is a molecular function annotated by gene ontology, and the relations among the vertex are considered as edges. Thus, it is easy to trace a specific function's transition, and it can be a constraint to extract a meaningful sub-path from whole PPI network. To evaluate the model, 11 functional flow models of Homo sapiens were built from KEGG, and Cronbach's alpha values were measured (alpha=0.67). Among 1023 functional flows, 765 functional flows showed 0.6 or higher alpha values.

• Journal of KIISE:Software and Applications
• /
• v.28 no.8
• /
• pp.560-569
• /
• 2001

지식 기반 정보검색 시스템에서의 질의 확장은 단어간의 의미 관계를 고려한 지식베이스를 필요로 한다. 기존의 단순 마이닝 기법은 사용자의 선호도를 고려하지 않은 채 연관 단어를 추출하므로 재현율은 향상되나 정확도는 저하된다. 본 논문에서는 단어간의 의미 관게를 고려한 연관 단어 중에서 사용자가 선호하는 연관 단어만을 포함하는 정확도가 향상된 최적화된 연관 단어 지식베이스 구축을 위한 방법을 제안한다. 이를 위해 컴퓨터 분야의 웹문서를 8개의 클래스로 분류하고, 각 클래스별 웹문서에서 명사를 추출한다. 추출된 명사를 대상으로 Apriori 알고리즘을 이용하여 연관 단어를 추출하고, 유전자 알고리즘을 이용하여 사용자가 선호하지 않은 연관 단어를 지식베이스의 구축 대상에서 제외시킨다. 본 논문에서 제안된 Apriori 알고리즘과 유전자 알고리즘의 성능을 평가하기 위하여 Apriori 알고리즘은 상호 정보량과 Rocchio 알고리즘과 비교하며, 유전자 알고리즘은 TF.IDF를 이용한 단어 정제 방법과 비교한다.

• Journal of Digital Convergence
• /
• v.13 no.1
• /
• pp.263-268
• /
• 2015

Put your information in the object-based sensors and mobile networks has been developed that correlate with ubiquitous information technology as the development of IT technology. However, a security solution is to have the data stored in the server, what minimal conditions. In this paper, we propose a data management method is applied to a hash chain of the properties of the multiple techniques to the data used by the big user and the data services to ensure safe handling large amounts of data being provided in the big data services. Improves the safety of the data tied to the hash chain for the classification to classify the attributes of the data attribute information according to the type of data used for the big data services, functions and characteristics of the proposed method. Also, the distributed processing of big data by utilizing the access control information of the hash chain to connect the data attribute information to a geographically dispersed data easily accessible techniques are proposed.

• Journal of KIISE
• /
• v.42 no.10
• /
• pp.1195-1206
• /
• 2015

For the management of a knowledge system, systems that automatically infer and manage scalable knowledge are required. Most of these systems use ontologies in order to exchange knowledge between machines and infer new knowledge. Therefore, approaches are needed that infer new knowledge for scalable ontology. In this paper, we propose an approach to perform rule based reasoning for scalable SHIF ontologies in a spark framework which works similarly to MapReduce in distributed memories on a cluster. For performing efficient reasoning in distributed memories, we focus on three areas. First, we define a data structure for splitting scalable ontology triples into small sets according to each reasoning rule and loading these triple sets in distributed memories. Second, a rule execution order and iteration conditions based on dependencies and correlations among the SHIF rules are defined. Finally, we explain the operations that are adapted to execute the rules, and these operations are based on reasoning algorithms. In order to evaluate the suggested methods in this paper, we perform an experiment with WebPie, which is a representative ontology reasoner based on a cluster using the LUBM set, which is formal data used to evaluate ontology inference and search speed. Consequently, the proposed approach shows that the throughput is improved by 28,400% (157k/sec) from WebPie(553/sec) with LUBM.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.759-764
• /
• 2005

In this paper we describe a face recognition using EBGM(Elastic Bunch Graph Matching) method. Usally, the PCA and LDA based face recognition method with the low-dimensional subspace representation use holistic image of faces, but this study uses local features such as a set of convolution coefficients for Gabor kernels of different orientations and frequencies at fiducial points including the eyes, nose and mouth. At pre-recognition step, all images are represented with same size face graphs and they are used to recognize a face comparing with each similarity for all images. The proposed algorithm has less computation time due to simplified face graph than conventional EBGM method and the fuzzy matching method for calculating the similarity of face graphs renders more face recognition results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.2C
• /
• pp.200-207
• /
• 2008

In this paper, a new detector is proposed for code acquisition, which employs the signs and ranks of the received signal samples, instead of their actual values, and so does not require knowledge of the non-Gaussian noise dispersion. The mean acquisition performance of the proposed detector is compared with that of the detector of $^{[1]}$. The simulation results show that the proposed scheme is not only robust to deviations from the true value of the non-Gaussian noise dispersion, but also has comparable performance to that of the scheme of $^{[1]}$ using exact knowledge of the non-Gaussian noise dispersion.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.22 no.1
• /
• pp.115-125
• /
• 2023

This paper relates to the development of CCTV camera posture calibration algorithm that can simultaneously collect traffic information such as traffic volume and speed in the state of view of the CCTV camera set for traffic monitoring. The developed autonomous posture calibration algorithm uses vehicle recognition and tracking techniques to identify the road, and automatically determines the angle of view for the operator's traffic surveillance and traffic information collection. To verify the performance of the proposed algorithm, a CCTV installed on site was used, and the results of the angle of view automatically calculated by the autonomous posture calibration algorithm for the angle of view set for traffic surveillance and traffic information collection were compared.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.5
• /
• pp.446-454
• /
• 2002

This paper presents the Doppler Scanning technique which enables us to detect the relative positions of moving distributed sources using Doppler frequency shift estimate when the moving source consists of distributed sources with different signature frequencies. Doppler frequency shifts of characteristic frequencies of machinery noise sources such as ship's generator and propeller, with tine along CPA (Closest Point of Approach of moving source) are unique, and can be functioned with respect to each source position. Therefore, this technique can be applied to estimate the relative geometrical positions between machinery noise sources. The Extended Kalman Filter (EKF) which has a high frequency resolution with high time resolution, is adopted for improving accuracy of Doppler frequency shift estimate geometric resolution of machinery positions since machinery noise sources show in general low frequency band characteristics with limited spacial distance. The performance of the technique is examined by the numerical simulations and is verified by the experiment using loudspeaker sources on the roof of the car.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.3
• /
• pp.463-472
• /
• 2012

This paper propose a security method that performs mutual authentication between the SIP UA and the server, check for integrity of the signaling channel and protection of SDP information for VoIP using a One-Time Password. To solve the vulnerability of existing HTTP Digest authentication scheme in SIP, Various SIP Authentication schemes have been proposed. But, these schemes can't meet security requirements of SIP or require expensive cryptographic operations. Proposed method uses OTP that only uses hash function and is updated each authentication. So Proposed method do not require expensive cryptographic operations but performs user authentication efficiently and safely than existing methods. In addition, Proposed method verifies the integrity of the SIP messages and performs SDP encryption/decryption through OTP that used for user authentication. So Proposed method can reduce communication overhead when applying S/MIME or TLS.