• The Korean Journal of Applied Statistics
• /
• v.24 no.5
• /
• pp.931-939
• /
• 2011

In practice, thresholds are determined by the two subjective assessment methods in a generalized pareto distribution of mean extreme function(MEF-graph) or Hill-graph. To remedy the problem of subjectiveness of these methods, we propose an alternative method to determine the threshold based on the robust statistics. We compared the MEF-graph, Hill-graph and our method through VaRs on the Korean stock market data from January 5, 1987 to August 3, 2009. As a result, the VaR based on the proposed method is not much different from the existing methods, and the standard deviation of VaR for our method was the smallest. The results show that our method can be a promising alternative to determine thresholds of the generalized pareto distributions.

• School Mathematics
• /
• v.18 no.1
• /
• pp.127-141
• /
• 2016

This study analyzes modes related to use of graph representation that appears to solve high school students quadratic function problem based on the graph using modes of Chauvat. It was examined the extent of understanding of the quadratic function of students through the flexibility of the representation of the Bannister (2014) from the analysis. As a result, the graph representation mode in which a high school students are mainly used is a nomographic specific mode, when using operational mode, it was found to be an error. The flexibility of Bannister(2014) that were classified to the use of representation from the point of view of the object and the process in the understanding of the function was constrained operation does not occur between the two representations in understanding the function in the process of perspective. Based on these results, the teaching on use graph representation for the students in classroom is required and the study of teaching and learning methods can understand the function from various perspectives is needed.

• The Journal of Society for e-Business Studies
• /
• v.24 no.3
• /
• pp.87-98
• /
• 2019

As artificial intelligence is actively studied, it is being applied to various fields such as image, video and natural language processing. The natural language processing, in particular, is being studied to enable computers to understand the languages spoken and spoken by people and is considered one of the most important areas in artificial intelligence technology. In natural language processing, it is a complex, but important to make computers learn to understand a person's common sense and generate results based on the person's common sense. Knowledge graphs, which are linked using the relationship of words, have the advantage of being able to learn common sense easily from computers. However, the existing knowledge graphs are organized only by focusing on specific languages and fields and have limitations that cannot respond to neologisms. In this paper, we propose an intelligent chatbotsystem that collects and analyzed data in real time to build an automatically scalable knowledge graph and utilizes it as the base data. In particular, the fine-tuned BERT-based for relation extraction is to be applied to auto-growing graph to improve performance. And, we have developed a chatbot that can learn human common sense using auto-growing knowledge graph, it verifies the availability and performance of the knowledge graph.

• Nutrition Research and Practice
• /
• v.16 no.5
• /
• pp.565-576
• /
• 2022

BACKGROUND/OBJECTIVES: Various accelerometer equations are used to predict energy expenditure (EE). On the other hand, the development of these equations and their validation studies have been conducted primarily without including older adults. This study assessed the accuracy of 8 ActiGraph accelerometer equations to predict the energy cost of walking in older adults. SUBJECTS/METHODS: Thirty-one participants with a mean age of 74.3 ± 3.3 yrs were enrolled in this study (20 men and 11 women). The participants completed 8 walking activities, including 5 treadmill and 3 self-paced walking activities. The EE was measured using a portable indirect calorimeter, with each participant simultaneously wearing the ActiGraph accelerometer. Eight ActiGraph equations were assessed for accuracy by comparing the predicted EE with indirect calorimetry results. RESULTS: All equations resulted in an overall underestimation of the EE across the activities (bias -1 to -1.8 kcal·min^-1 and -0.7 to -1.8 metabolic equivalents [METs]), as well as during treadmill-based (bias -1.5 to -2.9 kcal·min^-1 and -0.9 to -2.1 METs) and self-paced (bias -1.2 to -1.7 kcal·min-1 and -0.2 to -1.3 METs) walking. In addition, there were higher rates of activity intensity misclassifications, particularly among vigorous physical activities. CONCLUSIONS: The ActiGraph equations underestimated the EE for walking activities in older adults. In addition, these equations inaccurately classified the activities based on their intensities. The present study suggests a need to develop ActiGraph equations specific to older adults.

• The Journal of Information Systems
• /
• v.27 no.1
• /
• pp.153-169
• /
• 2018

Purpose Since human brains catch images faster than texts or numbers, infographics has been widely used in business in the form of "information dashboard" to enhance the efficiency of decision-making. Groupware, however, has neglected the adoption and use of infographics, in particular, in the idea generation process. Given that an overall performance of groupware-based idea generation is no better than that of the (paper-and-pencil-based) Nominal Group Technique, Jung et al. (2010) adopted the notion of infographics in the form of performance feedback to solve the productivity paradox. With the consistent results, which demonstrate beneficial effects of infographics on performance enhancement, an interesting observation that groups with the bar chart treatment performed better than groups with the dot chart treatment was made. The main purpose of this study was to find if there were a performance consistency between the outcomes from the previous study and the outcomes from the current study. Design/methodology/approach In experiment 1, we employed the same system used in the previous study (i.e., Jung et al., 2010). As individuals' contributions accumulated, the mechanism visually displayed individuals' performances two-dimensionally in the form of a bar chart or a dot chart. Then, we compared the performance outcomes from this study to the outcomes from previous study (i.e., Jung et al., 2010). In experiment 2, we modified the performance graph to test the effect of "playfulness" on performance by converting dots to car images. Then, we compared the performance outcome from experiment 2 to the outcomes from experiment 1. Findings Just like our interesting (and unexpected) finding in Jung et al.'s study (2010), the outcome confirmed a consistent superior performance of a bar chart. This implies that a bar chart is a better choice when stimulating performance with a visual aid in the context of groupware-based idea generation. Although a bar chart was criticized in a way that errors of length-area judgments are 40 ~ 250% greater than those of positional judgments along a common scale, such illusion turned out to be facilitating upward performance comparison better. Regarding Experiment 2, the outcome showed that the revised-dot graph is as good as the bar graph in terms of quantity and quality score of ideas. We attribute the performance enhancement of the resized-dot to the interaction between the motivational characteristic and the situational characteristic of playfulness because individuals in the revised-dot graph treatment performed better than individuals in the dot graph treatment. Given the order of performance (Bar >= Revised Dot > Dot) that the revised-dot treatment performed the same as (or lower than) the bar treatment, an additional research is warranted to reach to a consistent outcome.

• The KIPS Transactions:PartD
• /
• v.8D no.3
• /
• pp.257-264
• /
• 2001

We developed a SIFG (Slice-based Information Graph), which modelled the information flow on program on the basis of the information flow of data tokens on data slices. Then we defied a SCM (Slice-based complexity measure), which measured the program complexity by measuring the complexity of information flow on SIFG. SCM satisfied the necessary properties for complexity measure proposed by Briand et al. SCM could measure not only the control and data flow on program but also the physical size of program unlike the existing measures.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1748-1759
• /
• 2018

Weber Local Descriptor (WLD) is a stable and effective feature extraction algorithm, which is based on Weber's Law. It calculates the differential excitation information and direction information, and then integrates them to get the feature information of the image. However, WLD only considers the center pixel and its contrast with its surrounding pixels when calculating the differential excitation information. As a result, the illumination variation is relatively sensitive, and the selection of the neighbor area is rather small. This may make the whole information is divided into small pieces, thus, it is difficult to be recognized. In order to overcome this problem, this paper proposes Weber Symmetrical Local Graph Structure (WSLGS), which constructs the graph structure based on the $5{\times}5$ neighborhood. Then the information obtained is regarded as the differential excitation information. Finally, we demonstrate the effectiveness of our proposed method on the database of ORL, JAFFE and our own built database, high-definition infrared faces. The experimental results show that WSLGS provides higher recognition rate and shorter image processing time compared with traditional algorithms.

• Journal of the Korea Computer Graphics Society
• /
• v.22 no.4
• /
• pp.11-19
• /
• 2016

In this paper, we propose an automatic segmentation method of renal parenchyma on abdominal CT image using graph-cuts with shape constraint based on multi-probabilistic atlas. The proposed method consists of following three steps. First, to use the various shape information of renal parenchyma, multi-probabilistic atlas is generated by cortex-based similarity registration. Second, initial seeds for graph-cuts are extracted by maximum a posteriori (MAP) estimation and renal parenchyma is segmented by graph-cuts with shape constraint. Third, to reduce alignment error of probabilistic atlas and increase segmentation accuracy, registration and segmentation are iteratively performed. To evaluate the performance of proposed method, qualitative and quantitative evaluation are performed. Experimental results show that the proposed method avoids a leakage into neighbor regions with similar intensity of renal parenchyma and shows improved segmentation accuracy.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.20 no.1
• /
• pp.70-85
• /
• 2021

Deep learning methodology, which has been actively studied in recent years, has improved the performance of artificial intelligence. Accordingly, systems utilizing deep learning have been proposed in various industries. In traffic systems, spatio-temporal graph modeling using GNN was found to be effective in predicting traffic speed. Still, it has a disadvantage that the model is trained inefficiently due to the memory bottleneck. Therefore, in this study, the road network is clustered through the graph clustering algorithm to reduce memory bottlenecks and simultaneously achieve superior performance. In order to verify the proposed method, the similarity of road speed distribution was measured using Jensen-Shannon divergence based on the analysis result of Incheon UTIC data. Then, the road network was clustered by spectrum clustering based on the measured similarity. As a result of the experiments, it was found that when the road network was divided into seven networks, the memory bottleneck was alleviated while recording the best performance compared to the baselines with MAE of 5.52km/h.

• Korean Journal of Remote Sensing
• /
• v.5 no.2
• /
• pp.85-90
• /
• 1989

A new graph-theoretic clustering method based on relaxation labeling is proposed. More accurate classification is achieved by using relaxation labeling which take advantage of contextual information. Moreover, threshold selection is not needed in this method.