• The Journal of Korean Institute of Next Generation Computing
• /
• v.13 no.2
• /
• pp.102-110
• /
• 2017

Current word sense disambiguation techniques employ various machine learning-based methods. Various approaches have been proposed to address this problem, including the knowledge base approach. This approach defines the sense of an ambiguous word in accordance with knowledge base information with no training corpus. In unsupervised learning techniques that use a knowledge base approach, graph-based and similarity-based methods have been the main research areas. The graph-based method has the advantage of constructing a semantic graph that delineates all paths between different senses that an ambiguous word may have. However, unnecessary semantic paths may be introduced, thereby increasing the risk of errors. To solve this problem and construct a fine-grained graph, in this paper, we propose a model that iteratively constructs the graph while eliminating unnecessary nodes and edges, i.e., senses and semantic paths. The hybrid similarity estimation model was applied to estimate a more accurate sense in the constructed semantic graph. Because the proposed model uses BabelNet, a multilingual lexical knowledge base, the model is not limited to a specific language.

• Annual Conference on Human and Language Technology
• /
• 1994.11a
• /
• pp.201-206
• /
• 1994

문서 인식 시스템의 성능을 저하시키는 가장 큰 원인 중의 하나로 문자 분할 오류를 들 수 있는데 보다 우수한 성능의 문서 인식 시스템 개발을 위해서는 정확한 문자 분할 방법이 절실히 요구된다. 기존의 문자 분할에 관한 연구들은 이진 영상을 대상으로 함으로써 접촉되거나 겹치는 문자의 경계 부분에서 문자 분할에 유용한 정보들을 잃어 문자 분할 오류를 초래할 수 있다. 하지만 명도 영상을 분석해 보면 문자의 접촉 부분에서 주로 나타나는 지형적 특징이 있으며, 문자 경계에서 명도값이 변하는 것을 관찰할 수 있는데 이와같은 명도 영상의 정보를 사용하면 보다 효과적으로 문자를 분할할 수 있을 것으로 판단된다. 본 연구에서는 이러한 점에 착안하여 명도 영상으로부터 지형적 특징을 추출하고 다단계 그래프 탐색 방법을 이용하여 명도값을 추적함으로써 비선형 문자 경계를 찾는 새로운 문자 분할 방법을 제안한다. 제안된 방법은 명도 문자열 영상을 입력으로 받아 명도 영상의 투영값과 명도 영상으로부터 추출된 지형적 특성을 이용하여 문자 분할 영역을 결정하고 문자 분할 영역내에서 다단계 그래프 탐색에 의한 비선형 문자 분할 경로를 찾는다. 그리고 문자 인식기와 결항하여 최종 문자 분할 위치를 확정하는 인식 결과를 이용한 문자 분할을 수행함으로써 문자 분할 위치 및 문자 인식 결과를 확정한다. 다양한 문서에 대한 실험 결과 제안된 방법이 이진 정보만을 사용하는 방법보다 접촉 혹은 겹친 문자 분할에 매우 효과적임을 알 수 있었다.

• East Asian mathematical journal
• /
• v.30 no.4
• /
• pp.451-474
• /
• 2014

The purpose of this study is to analyze error patterns third-year middle school students make on quadratic function graph problems and to examine about the possible correct them by providing supplementary tutoring. To exam the error patterns that occur during problem solving processes, to 82 students, We provided 25 quadratic function graph problems in the preliminary-test. The 5 types of errors was conceptual errors, false intuition errors, incorrect use of conditions in problems, technical errors, and errors from slips or carelessness. Statistical analysis of the preliminary-test and post-test shows that achievement level was higher in the post-test, after supplementary tutoring, and the t-test proves this to be meaningful data. According to the per subject analyses, the achievement level in the interest of symmetry, parallel translation, and general graph, respectively, were all higher in the post-test than the preliminary-test and this is meaningful data as well. However, no meaningful relation could be found between the preliminary-test and the post-test on other subjects such as graph remodeling and relations positions of the parabola. For the correction of errors, try the appropriate feedback and various teaching and learning methods.

• Journal of Information Management
• /
• v.42 no.1
• /
• pp.47-62
• /
• 2011

While an ideal author graph should have its nodes to represent authors, automatically-generated author graphs mostly use author names as their nodes due to the difficulty of resolving author names into individuals. However, employing author names as nodes of author graphs merges namesakes, otherwise separate nodes in the author graph, into the same node, which may distort the characteristics of the author graph. This study proposes an algorithm which resolves author ambiguities based on co-authorship and then yields an author graph consisting of not author name nodes but author nodes. Scientific collaboration relationship this algorithm depends on tends to produce the clustering results which minimize the over-clustering error at the expense of the under-clustering error. In experiments, the algorithm is applied to the real citation records where Korean namesakes occur, and the results are discussed.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.461-465
• /
• 2002

When general software system wants to need continuous Dept of Software Engineering by discovery of specification imperative sentence in some program, programmer analyzes program through practice orbit chase of program about value of input data. This paper that see therefore applies object intention program Slicing to existent program Slicing method, and express practice orbit of program in object intention subordination graph and show process that become Slicing. Proposed algorithm defenses crab extension is possible and can be used advantageously in case program is developed gradually as well as.

• The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
• /
• v.5 no.3
• /
• pp.3-13
• /
• 1994

In the environments with interference and Rayleigh fading the bit error probability equation of FH / MFSK signal has been derived and the error rate has been evaluated. And the results are shown in graphs and discussed. The degree of improvement of error rate performance has been found out in space diversity technique. From the results, we know that maximal ratio combining is very effective for Rayleigh fading and interference.

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

• Journal of the Korean Society of Earth Science Education
• /
• v.17 no.2
• /
• pp.153-167
• /
• 2024

This study explored the errors and context occurred during high school students' data analysis processes. For the study, 222 data inquiry reports produced by 74 students from 'A' High School were collected and explored the detailed error types in the data analysis processes such as data collection and preprocessing, data representation, and data interpretation. The results of study found that in the data interpretation process, students had a somewhat insufficient understanding of seasonal variations and periodic patterns about weather elements. And, various types of errors were identified in the data representation process, such as basic unit in graphs, legend settings, trend lines. The causes of these errors are the feature of authoring tools, misconceptions related to weather elements, and cognitive biases, etc. Based on the study's results, educational implications for big data education, a significant topic in future science education, were derived. And related follow-up studies were suggested.

• The KIPS Transactions:PartC
• /
• v.13C no.1 s.104
• /
• pp.45-54
• /
• 2006

Nowadays, a lot of techniques have been applied for the detection of malicious behavior. However, the current techniques taken into practice are facing with the challenge of much variations of the original malicious behavior, and it is impossible to respond the new forms of behavior appropriately and timely. There are also some limitations can not be solved, such as the error affirmation (positive false) and mistaken obliquity (negative false). With the questions above, we suggest a new method here to improve the current situation. To detect the malicious code, we put forward dealing with the basic source code units through the conceptual graph. Basically, we use conceptual graph to define malicious behavior, and then we are able to compare the similarity relations of the malicious behavior by testing the formalized values which generated by the predefined graphs in the code. In this paper, we show how to make a conceptual graph and propose an efficient method for similarity measure to discern the malicious behavior. As a result of our experiment, we can get more efficient detection rate.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.9
• /
• pp.2323-2333
• /
• 1998

Software engineers generally analyze the program behavior under the test case that revealed the error, not under any teneric est case. In this paper we discuss the dynamic slice consisting of all statements that actually affect the value of a variable occurrence for a given program input. We propose an efficient algorithm to make dynamic program slices. The eficiency of this algorithm is evaluated on some developed program. results are shown by a marking table of execution history. Dynamic Dependence Graph, and Reduced Dynamic Dependence Graph, Consequently, the efficiency of the proosed algorithm is also presented by the compariso with algorithm that was announced previously.