• 한국정보과학회논문지:소프트웨어및응용
• /
• 제29권11호
• /
• pp.775-784
• /
• 2002

DNA chip 기술에 의해 얻어지는 마이크로어레이(microarray) 데이타는 세포나 조직 내의 수천 개 유전자의 발현도(expression level)를 한번에 측정한 것으로, 유전자 발현 양상에 기반한 암의 진단, 유전자의 기능 예측 등에 이용되고 있다. 다양한 데이타 분석 기법들 중 베이지안망(Bayesian network)은 데이타의 각 속성들간의 관계를 그래프 형태로 표현할 수 있는 특징을 가지고 있다. 이는 마이크로어레이 데이타의 분석을 통해 여러 유전자와 조직의 특성(암의 종류 등) 사이의 관계를 밝히는데 유용하다 하지만 대부분의 마이크로어레이 데이타는 sparse data로 베이지안망을 비롯한 각종 분석 기법의 적용을 어렵게 하고 있다. 본 논문에서는 베이지안망에 기반한 마이크로어레이 데이타 분석을 위해 효율적 구조 학습 알고리즘과 데이타 차원 축소를 이용한다. 제시되는 분석법은 실제 마이크로어레이 데이타인 NC160 data set에 적용되었으며, 그 유용성은 데이타로부터 학습된 베이지안망이 실제 생물학적으로 알려진 사실들을 어느 정도 정확하게 표현하는지에 의해 평가되었다.

• Communications for Statistical Applications and Methods
• /
• 제10권2호
• /
• pp.445-456
• /
• 2003

Spatial data are usually obtained at selected locations even though they are potentially available at all locations in a continuous region. Moreover the monitoring locations are clustered in some regions, sparse in other regions. One important goal of spatial data analysis is to predict unknown response values at any location throughout a region of interest. Thus, an appropriate space model should be set up and their estimates and predictions must be accompanied by measures of uncertainty. In this study we see that a space model proposed allows a best interpolation to annual rainfall data in South Korea.

• International Journal of Advanced Culture Technology
• /
• 제1권2호
• /
• pp.1-6
• /
• 2013

In this paper, we evaluate performance of existing similarity measurement metric and propose a novel method using user's preferences information entropy to reduce MAE in memory-based collaborative recommender systems. The proposed method applies a similarity of individual inclination to traditional similarity measurement methods. We experiment on various similarity metrics under different conditions, which include an amount of data and significance weighting from n/10 to n/60, to verify the proposed method. As a result, we confirm the proposed method is robust and efficient from the viewpoint of a sparse data set, applying existing various similarity measurement methods and Significance Weighting.

• Communications for Statistical Applications and Methods
• /
• 제2권1호
• /
• pp.48-54
• /
• 1995

A direct method for fitting analysis-of-variance models to unbalanced data is presented. This method exploits sparsity and rank deficiency of the matrix and is based on Gram-Schmidt orthogonalization of a set of sparse columns of the model matrix. The computational algorithm of the sum of squares for testing estmable hyphotheses is given.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권12호
• /
• pp.5103-5115
• /
• 2015

In radar imaging, a target is usually consisted of a few strong scatterers which are sparsely distributed. In this paper, an improved sparse signal recovery algorithm based on smoothed l₀ (SL0) norm method is proposed to achieve high resolution ISAR imaging with limited pulse numbers. Firstly, one new smoothed function is proposed to approximate the l₀ norm to measure the sparsity. Then a single loop step is used instead of two loop layers in SL0 method which increases the searching density of variable parameter to ensure the recovery accuracy without increasing computation amount, the cost function is undated in every loop for the next loop until the termination is satisfied. Finally, the new set of solution is projected into the feasible set. Simulation results show that the proposed algorithm is superior to the several popular methods both in terms of the reconstruction performance and computation time. Real data ISAR imaging obtained by the proposed algorithm is competitive to several other methods.

• 응용통계연구
• /
• 제35권3호
• /
• pp.445-455
• /
• 2022

본 논문에서는 고차원 희소 회귀분석을 위한 기존의 베이지안 방법들을 소개하고, 다양한 모의실험 세팅에서 성능을 비교한다. 특히, 확장 가능하고 정확한 베이지안 추론을 가능하게 하는 변분 베이즈 방법(variational Bayes method) (Ray와 Szabó, 2021) 에 중점을 둔다. 시뮬레이션 자료를 기반으로 한 희소 고차원 선형회귀분석을 실시하고 변분 베이즈 방법의 성능을 다른 베이지안 및 빈도론 방법들과 비교한다. 로지스틱 회귀분석에서 변분 베이즈 방법의 실제 성능을 확인하기 위해 백혈병 유전자 발현 자료를 사용하여 실자료 분석을 수행한다.

• 제어로봇시스템학회논문지
• /
• 제16권8호
• /
• pp.744-750
• /
• 2010

To segment instances of vehicle classes in a sparse stereo-matching data set, this paper presents an algorithm for clustering based on DP (Dynamic Programming). The algorithm is agglomerative: it begins with each element in the set as a separate cluster and merges them into successively larger clusters according to similarity of two clusters. Here, similarity is formulated as a cost function of DP. The proposed algorithm is proven to be effective by experiments performed on various images acquired by a moving vehicle.

• Journal of Information Processing Systems
• /
• 제16권1호
• /
• pp.6-29
• /
• 2020

Biometrics identification using multiple modalities has attracted the attention of many researchers as it produces more robust and trustworthy results than single modality biometrics. In this paper, we present a novel multimodal recognition system that trains a deep learning network to automatically learn features after extracting multiple biometric modalities from a single data source, i.e., facial video clips. Utilizing different modalities, i.e., left ear, left profile face, frontal face, right profile face, and right ear, present in the facial video clips, we train supervised denoising auto-encoders to automatically extract robust and non-redundant features. The automatically learned features are then used to train modality specific sparse classifiers to perform the multimodal recognition. Moreover, the proposed technique has proven robust when some of the above modalities were missing during the testing. The proposed system has three main components that are responsible for detection, which consists of modality specific detectors to automatically detect images of different modalities present in facial video clips; feature selection, which uses supervised denoising sparse auto-encoders network to capture discriminative representations that are robust to the illumination and pose variations; and classification, which consists of a set of modality specific sparse representation classifiers for unimodal recognition, followed by score level fusion of the recognition results of the available modalities. Experiments conducted on the constrained facial video dataset (WVU) and the unconstrained facial video dataset (HONDA/UCSD), resulted in a 99.17% and 97.14% Rank-1 recognition rates, respectively. The multimodal recognition accuracy demonstrates the superiority and robustness of the proposed approach irrespective of the illumination, non-planar movement, and pose variations present in the video clips even in the situation of missing modalities.

• 한국통신학회논문지
• /
• 제41권1호
• /
• pp.1-11
• /
• 2016

본 논문에서는 Orthogonal Frequency Division Multiplexing(OFDM) 시스템에서 압축센싱을 이용하는 채널추정기법을 연구한다. 압축센싱은 측정벡터의 크기가 성능에 영향을 주는데, OFDM에서는 channel delay spread가 큰 경우에 압축센싱 기법을 사용하는데 제약이 된다. 본 논문에서는 채널추정 오차를 줄이기 위해서 OFDM data block에 pilot information을 추가해 측정벡터의 길이를 증가시켜 성능을 향상시킨다. 제안하는 방식이 성긴 신호의 위치를 찾을 확률을 높이고 압축센싱의 신호 복원 성능을 높인다. 모의실험을 통해 제안하는 방식이 기존 방식보다 신호 복원 능력이 더 우수함을 확인한다.

• Journal of Communications and Networks
• /
• 제18권3호
• /
• pp.493-501
• /
• 2016

In-network storage is an effective technique for avoiding network congestion and reducing power consumption in continuous data collection in wireless sensor networks. In recent years, network coding based storage design has been proposed as a means to achieving ubiquitous access that permits any query to be satisfied by a few random (nearby) storage nodes. To maintain data consistency in continuous data collection applications, the readings of a sensor over time must be sent to the same set of storage nodes. In this paper, we present an efficient approach to updating data at storage nodes to maintain data consistency at the storage nodes without decoding out the old data and re-encoding with new data. We studied a transmission strategy that identifies a set of storage nodes for each source sensor that minimizes the transmission cost and achieves ubiquitous access by transmitting sparsely using the sparse matrix theory. We demonstrate that the problem of minimizing the cost of transmission with coding is NP-hard. We present an approximation algorithm based on regarding every storage node with memory size B as B tiny nodes that can store only one packet. We analyzed the approximation ratio of the proposed approximation solution, and compared the performance of the proposed coding approach with other coding schemes presented in the literature. The simulation results confirm that significant performance improvement can be achieved with the proposed transmission strategy.