• Journal of the Korea Society of Computer and Information
• /
• v.17 no.10
• /
• pp.107-116
• /
• 2012

The applying of semantic technologies that aim to let computers understand and automatically process the meaning of the interlinked data on the Web is spreading. In Semantic Web, understanding and accessing the associations between data that is, the meaning between data as well as accessing to the data itself is important. W3C recommended RDF (Resource Description Framework) as a standard format to represent both Semantic Web data and their associations and also proposed several RDF query languages in order to support query processing for RDF data. However further researches on the query language definition considering the semantic associations and query processing techniques are still required. In this paper, using the suffix array-based indexing scheme previously introduced for RDF query processing, we propose a query processing approach to handle ${\rho}$-path query which is the representative type of semantic associations. To evaluate the query processing performance of the proposed approach, we implemented two different types of query processing approaches and measured the average query processing times. The experiments show that the proposed approach achieved 1.8 to 2.5 and 3.8 to 11 times better performance respectively than others two.

• The Journal of Society for e-Business Studies
• /
• v.8 no.4
• /
• pp.69-88
• /
• 2003

In high dimensional data, most of clustering algorithms tend to degrade the performance rapidly because of nature of sparsity and amount of noise. Recently, partial dimensional clustering algorithms have been studied, which have good performance in clustering. These algorithms select the dimensional data closely related to clustering but discard the dimensional data which are not directly related to clustering in entire dimensional data. However, the traditional algorithms have some problems. At first, the algorithms employ grid based techniques but the large amount of grids make worse the performance of algorithm in terms of computational time and memory space. Secondly, the algorithms explore dimensions related to clustering using k-medoid but it is very difficult to determine the best quality of k-medoids in large amount of high dimensional data. In this paper, we propose an efficient partial dimensional clustering algorithm which is called CLIP. CLIP explores dense regions for cluster on a certain dimension. Then, the algorithm probes dense regions on a next dimension. dependent on the dense regions of the explored dimension using incremental projection. CLIP repeats these probing work in all dimensions. Clustering by Incremental projection can prune the search space largely and reduce the computational time considerably. We evaluate the performance(efficiency, effectiveness and accuracy, etc.) of the proposed algorithm compared with other algorithms using common synthetic data.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.6
• /
• pp.2839-2843
• /
• 2013

In this study, the relation between the corneal refractive power and the tear break-up time(TBUT) was analyzed. The results can be effectively used in eye clinics and served as the reference on wearing the contact lenses. We had measured the radius of the corneal of university students who are in the range of 21 to 27 year-old and who don't have eye disease. The corneal refractive power was calculated by using the radius of the corneal. And TBUT is the time when the mire image is distorted first time. The relation between the corneal refractive power and TBUT in right eye was a linear as 'y=37.921-0.610x', in which the larger the refractive power of the cornea is, the shorter TBUT is(negative relationship; r=-0.462, p=0.010). The relation in left eye was also a negatively linear as 'y=41.894-0.695x'(r=-0.509, p=0.004). Consequently, in both eyes the corneal refractive power and TBUT have a negative correlation when myopia is a high. It is possible to predict TBUT, which is necessary in deciding on wear of contact lenses, by measuring the corneal radius of subjects.

• Journal of the Korean association of regional geographers
• /
• v.17 no.4
• /
• pp.432-442
• /
• 2011

Climatic variables such as temperature and precipitation tend to vary both in space and in time simultaneously. Thus, it is necessary to include space-time autocorrelation into conventional spatial interpolation methods for reliable time-series mapping. This paper introduces and applies space-time variogram modeling and space-time kriging to generate time-series temperature maps using hourly Automatic Weather System(AWS) temperature observation data for a one-month period. First, temperature observation data are decomposed into deterministic trend and stochastic residual components. For trend component modeling, elevation data which have reasonable correlation with temperature are used as secondary information to generate trend component with topographic effects. Then, space-time variograms of residual components are estimated and modelled by using a product-sum space-time variogram model to account for not only autocorrelation both in space and in time, but also their interactions. From a case study, space-time kriging outperforms both conventional space only ordinary kriging and regression-kriging, which indicates the importance of using space-time autocorrelation information as well as elevation data. It is expected that space-time kriging would be a useful tool when a space-poor but time-rich dataset is analyzed.

• Journal of the korean academy of Pediatric Dentistry
• /
• v.45 no.3
• /
• pp.363-369
• /
• 2018

A salivary testing instrument has an advantage that the method is simple and can be performed in a short time. However, it is necessary to verify the factors that affect the reliability of the result, because the device is easy to use and even saliva collection is simple. The aim of this study was to compare the difference of the test results according to the measurement time in order to analyze the time factor of the external variable among the factors that may affect the measurement results of the salivary testing instrument. The relationship between the measured values of the salivary testing instrument to identify the internal variables was analyzed. Saliva was collected from 20 randomly selected patients regardless of age, sex, or diseases. The mean age was 46.6 years, 10 males and 10 females. The saliva collected was directly measured with the salivary testing instrument as group I. The saliva samples were placed in air in a paper cup for 10 minutes, and then measured as group III. Then group I was remeasured after 30 minutes and assigned as group II. Group III was remeasured after 30 minutes and called as group IV. As a result, all of the cariogenic bacteria, acidity, buffer capacity, blood, leukocyte, protein and ammonia, except buffer capacity, showed statistically significant changes in group II and IV. This means that the reliability of the test results is poor if the measurement time is not observed. Cariogenic bacteria were correlated with leukocyte and protein, buffer capacity was related to acidity, protein, and protein was related to buffer capacity and leukocyte. In conclusion, the result according to the measurement time as the external variable was different, which means that time must be strictly monitored when testing saliva. It is also necessary to take into account the relevance of the correlations between the internal variables and the clinical data.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.262-265
• /
• 2011

많은 학습 시스템에서 학습자의 수준에 맞는 맞춤학습을 위해서 학습자의 정확한 능력을 측정하는 평가 방법이 필요하다. 기존의 지필고사는 이를 위해서 학습자의 능력과 관련된 많은 수의 문항을 똑같은 시간과 순서대로 풀게 되므로 평가의 효율성 면에서 문제를 가지고 있다. 따라서 이러한 지필고사방식의 문제점을 해결하기 위해 문항정보이론과 컴퓨터의 처리성능을 결합시킨 컴퓨터화된 적응적 검사(CAT)에 대한 연구가 활발히 진행되고 있다. CAT는 지필고사의 문제점을 상당부분 해결했으나 문항간 연관성에 대해서는 독립을 가정하여 그렇지 않은 경우에는 비효율성을 가져올 수 있다. 본 논문에서는 문항반응이론 방식의 CAT가 가진 문제점을 해결하면서 성능이 개선된 베이지안 네트워크를 도입한 CAT를 제안한다. 이는 베이지안 네트워크에 평가문항을 세부분야별로 대입하여 한 문항에 대한 응답으로 그와 연관된 분야의 학습자 능력을 추론한다. 또한 실험을 통해 기존의 기법을 사용했을 때에 비해 학습자의 실제 능력치에 수렴하는 속도가 증가함을 보인다.

• The Journal of the Korea Contents Association
• /
• v.7 no.6
• /
• pp.1-8
• /
• 2007

In electronic commerce, it is important for users to recommend the proper item among large item sets with saving time and effort. Therefore, if the recommendation system can be recommended the suitable item, we will gain a good satisfaction to the user. In this paper, we proposed the associative relation clustering split method in the collaborative filtering in order to perform the accuracy and the scalability. We produce the lift between associative items using the ratings data. and then split the node group that consists of the item to improve an efficiency of the associative relation cluster. This method differs the association about the items of groups. If the association of groups is filled, the reminding items combine. To estimate the performance, the suggested method is compared with the K-means and EM in the MovieLens data set.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.160-162
• /
• 2004

기존의 웹 문서 분류 시스템서는 많은 시간과 노력을 요구하며, 연관 단어가 아닌 단일 단어만으로 웹 문서들을 분류하여 단어의 중의성을 반영하지 못해 많은 오분류가 있었다. 이러한 문제점을 해결하기 위해 본 논문에서는 협력적 필터링을 위한 연관 단어 빈도를 사용한 웹 문서 분류 방법을 제안한다. 제안된 방법에서는 웹 문서 내에서 단어들을 추출하고 빈도 가중치를 계산한다. 추출된 단어를 Apriori 알고리즘에 의해 연관 규칙을 생성하고 신뢰도에 단어 빈도 가중치를 반영한다. 수정된 신뢰도를 ARHP 알고리즘에 적용하여 연관 단어들 사이의 유사정도를 계산하고 유사 클래스를 구성한다 생성된 유사 클래스들을 기반으로 웹 문서를 $\alpha$-cut을 이용하여 분류한다 성능평가를 위해 기존의 문서 분류 방법들과 비교 평가를 하였다.

• Korean Journal of Remote Sensing
• /
• v.23 no.4
• /
• pp.257-272
• /
• 2007

This paper analyzed relationships between various features from SAR data with multiple acquisition dates and mode (frequency, polarization and incidence angles), and land-cover classes. Two typical types of features were extracted by considering acquisition conditions of currently available SAR data. First, coherence, temporal variability and principal component transform-based features were extracted from multi-temporal and single mode SAR data. C-band ERS-1/2, ENVISAT ASAR and Radarsat-1, and L-band JERS-1 SAR data were used for those features and different characteristics of different SAR sensor data were discussed in terms of land-cover discrimination capability. Overall, tandem coherence showed the best discrimination capability among various features. Long-term coherence from C-band SAR data provided a useful information on the discrimination of urban areas from other classes. Paddy fields showed the highest temporal variability values in all SAR sensor data. Features from principal component transform contained particular information relevant to specific land-cover class. As features for multiple mode SAR data acquired at similar dates, polarization ratio and multi-channel variability were also considered. VH/VV polarization ratio was a useful feature for the discrimination of forest and dry fields in which the distributions of coherence and temporal variability were significantly overlapped. It would be expected that the case study results could be useful information on improvement of classification accuracy in land-cover classification with SAR data, provided that the main findings of this paper would be confirmed by extensive case studies based on multi-temporal SAR data with various modes and ground-based SAR experiments.

• Journal of Intelligence and Information Systems
• /
• v.17 no.3
• /
• pp.169-185
• /
• 2011

Data redundancy is problematic in that it not only induces heavy storage management cost but also could bring critical degradation of information systems. Unfortunately, to our knowledge, only few enterprises willingly afford time and efforts for the faithful conceptual design to prevent the degree of inappropriate data as much as they could, while most of enterprises pay rare attention to the notion of that sort of data quality. Wondering if there would be any other way to design the enterprise.wide data design without prior knowledge about business works is our major motivation for this study. In this paper, we present our data modeling methodology in which associations among objects in each sentences of a business job descriptions are treated as the focal point in database design. A proposed agent for automated design tool simply takes a business job description written in natural language as an input, and then designs an entity relationship diagram with some smart rules. We introduce the scope of the proposed agent and its detailed logics with several examples. And then, we verify the appropriateness of the resulted associations among objects. Lastly, we perform case studies to evaluate the devised agent's applicability to a business field.