• Title/Summary/Keyword: 증명의 의미 지도

Search Result 139, Processing Time 0.028 seconds

Inconsistent Pattern Model for Improving the Performance of Supervised Learning in Data Mining (데이터 마이닝의 지도학습 기법 성능향상을 위한 불일치 패턴 모델)

  • Heo, Jun;Kim, Jong-U
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2007.11a
    • /
    • pp.288-305
    • /
    • 2007
  • 본 논문은 데이터 마이닝의 기법 중 가장 잘 알려진 지도학습 기법의 성능 향상을 위한 새로운 Hybrid 및 Combined 기법인 불일치 패턴 모델(오차 패턴 모델)에 대한 연구 논문이다. 불일치 패턴 모델이란 2개 이상의 기법 중 향후 더 레코드별로 더 잘 맞출 수 있는 기법을 메타 분류하는 불일치 패턴 모델을 개발하여, 최종적으로는 기존의 기법보다 더 좋은 분류 정확도 및 예측 향상율을 기대하기 위한 기법을 의미한다. 본 논문에서는 의사 결정나무 추론 기법인 C5.0과 C&RT 그리고 신경망 분석, 그리고 로지스틱 회귀분석과 같은 대표적인 데이터 마이닝의 지도학습 기법을 이용하여 불일치 패턴 모델을 생성하여 보고, 이들이 기존 단일 기법과 기존의 Combined 모델인 Bagging, Boosting 그리고 Stacking 기법보다 성능이 우수함을 23개의 실제 데이터 및 공신력 있는 공개 데이터를 이용하여 증명하여 보였다. 또한 데이터의 특성에 따라서 불일치 패턴 모델의 성능의 변화 및 더 우수해 지는지를 알아보기 위한 연구포 같이 수행을 하여 본 모델의 활용성을 높이고자 하였다.

  • PDF

A Measure for Improvement in Quality of Association Rules in the Item Response Dataset (문항 응답 데이터에서 문항간 연관규칙의 질적 향상을 위한 도구 개발)

  • Kwak, Eun-Young;Kim, Hyeoncheol
    • The Journal of Korean Association of Computer Education
    • /
    • v.10 no.3
    • /
    • pp.1-8
    • /
    • 2007
  • In this paper, we introduce a new measure called surprisal that estimates the informativeness of transactional instances and attributes in the item response dataset and improve the quality of association rules. In order to this, we set artificial dataset and eliminate noisy and uninformative data using the surprisal first, and then generate association rules between items. And we compare the association rules from the dataset after surprisal-based pruning with support-based pruning and original dataset unpruned. Experimental result that the surprisal-based pruning improves quality of association rules in question item response datasets significantly.

  • PDF

Improving The Performance of Triple Generation Based on Distant Supervision By Using Semantic Similarity (의미 유사도를 활용한 Distant Supervision 기반의 트리플 생성 성능 향상)

  • Yoon, Hee-Geun;Choi, Su Jeong;Park, Seong-Bae
    • Journal of KIISE
    • /
    • v.43 no.6
    • /
    • pp.653-661
    • /
    • 2016
  • The existing pattern-based triple generation systems based on distant supervision could be flawed by assumption of distant supervision. For resolving flaw from an excessive assumption, statistics information has been commonly used for measuring confidence of patterns in previous studies. In this study, we proposed a more accurate confidence measure based on semantic similarity between patterns and properties. Unsupervised learning method, word embedding and WordNet-based similarity measures were adopted for learning meaning of words and measuring semantic similarity. For resolving language discordance between patterns and properties, we adopted CCA for aligning bilingual word embedding models and a translation-based approach for a WordNet-based measure. The results of our experiments indicated that the accuracy of triples that are filtered by the semantic similarity-based confidence measure was 16% higher than that of the statistics-based approach. These results suggested that semantic similarity-based confidence measure is more effective than statistics-based approach for generating high quality triples.

A Fair Certified Electronic Mail Protocol that Enhances Guarantee of Reception (수신 보장성이 향상된 공평한 배달 증명 전자 메일 프로토콜)

  • 박용수;조유근
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.9 no.1
    • /
    • pp.86-94
    • /
    • 2003
  • Certified e-mail system guarantees that recipient will get mail content if and only if mall originator receives a receipt. Unlike previous schemes, Optimistic protocols recently published generate a receipt when it meets the condition that the mail content can be accessed by recliner at any time. So originator cannot assure the delivery of e-mail although he can get a receipt. In this paper, we show some flaws in optimistic protocols and propose improved schemes using delivery deadline. Modified protocols guarantee proof-of-receipt and eliminate the problem mentioned above. Furthermore, proposed modification technique can be applicable to most optimistic protocols and is efficient in the sense that modified schemes do not increase the number of messages.

Observer-Based Digital fuzzy Controller Design Using Digital Redesign (디지털 재설계를 이용한 관측기 기반 디지털 퍼지 제어기 설계)

  • Lee, Ho-Jae;Joo, Young-Hoon;Park, Jin-Bae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.5
    • /
    • pp.520-525
    • /
    • 2003
  • This paper concerns a design methodology of observer-based output-feedback digital controller for Takagi-Sugeno(TS) fuzzy systems using intelligent digital redesign (IDR). The term of IDR involves converting an analog fuzzy-mode-based controller into an equivalent digital one in the sense of state-matching. The considered IDR problem is viewed as convex minimization problems of the norm distances between linear operators to be matched. The stability condition is easily embedded and the separations principle is explicitly shown.

A Geometric Proof on Shortest Paths of Bounded Curvature (제한된 곡률을 갖는 최단경로에 대한 기하학적 증명)

  • Ahn, Hee-Kap;Bae, Sang-Won;Cheong, Otfried
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.4
    • /
    • pp.132-137
    • /
    • 2007
  • A point-wise car-like robot moving in the plane changes its direction with a constraint on turning curvature. In this paper, we consider the problem of computing a shortest path of bounded curvature between a prescribed initial configuration (position and orientation) and a polygonal goal, and propose a new geometric proof showing that the shortest path is either of type CC or CS (or their substring), where C specifies a non-degenerate circular arc and S specifies a non-degenerate straight line segment. Based on the geometric property of the shortest path, the shortest path from a configuration to a polygonal goal can be computed in linear time.

Web Information Retrieval Exploiting Markup Pattern (마크업 패턴을 이용한 웹 검색)

  • Kim, Min-Soo;Kim, Min-Koo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.13 no.6
    • /
    • pp.407-411
    • /
    • 2007
  • Over the years, great attention has been paid to the question of exploiting inherent semantic of HTML in the area of web document retrieval. Although HTML is mainly presentation oriented, HTML tags implicitly contain useful semantics that can be catch meaning of text. Focusing on this idea. in this paper we define 'markup pattern' and try to improve performance of web document retrieval using markup patterns. Markup pattern is a mirror of intends of web document publisher and an internal semantic of text on web document. To discover the markup pattern and exploit it, we suggest a new scheme for extracting concepts and weighting documents. For evaluation task, we select two domains-BBC and CNN web sites, and use their search engines to gather domain documents. We re-weight and re-score documents using proposed scheme, and show the performance improvement in the two domains.

A Study on the Development Processes for Digital Contents in the Animation Industry (국내 애니메이션 기업의 애니메이션 콘텐츠 개발과정에 관한 연구)

  • Lee, Han-Chul;Jung, Jai-Jin
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.2
    • /
    • pp.246-259
    • /
    • 2007
  • The animation industry, which accelerates the overall development of the Digital contents industry, is a high value-added industry that produces synergy effects in cooperation with key industries such as IT. Effectively serving as a vital energy source for the Korean economy through its positive effects, such as employment creation. In particular, there is the real prospect that the Korean animation industry will gain ground in overseas markets and thus occupy them ahead of others, by advancing overseas in uni son with the hypersonic network industry. In this regard, this study aims to suggest some concrete ways in which to Korean animation companies can enhance their competitiveness. This is accomplished by positively verifying that some major representative methods of competitiveness enhancement, whose effectiveness has been proved in existing manufacturing and production systems. a re also excellently effective for the animation enterprise. In effect, the study has positively applied and carried out such research on Korean animation enterprises.

  • PDF

Education for Mathematics Teachers and Educational Using of Socrates' Method (수학 교사 교육과 산파법의 교육적 적용)

  • Kim, Nam-Hee
    • School Mathematics
    • /
    • v.11 no.1
    • /
    • pp.39-53
    • /
    • 2009
  • This study was conducted in 2008 with 80 in-service mathematics teachers. We took a course that was consisted of a lecture and a practice on Socrates' method. In our study, mathematics teachers conducted making a teaching plan by using Socrates' method. But we became know that we need to offer concrete ideas or examples for mathematics teachers in order to apply Socrates' method effectively. Therefore we tried to search for educational methods in using Socrates' method to teach school mathematics. After investigating of preceding researches, we selected some examples. On the basis of these examples, we suggested concrete methods in using Socrates' method. That is as follows. Socrates' method need to be used in the context mathematical problem solving. Socrates' method can be applied in the process of overcoming cognitive obstacles. A question in using Socrates' method have to guide mathematical thinking (or attitude). When we use Socrates' method in the teaching of a proof, student need to have an opportunity to guess the conclusion of a proposition. The process of reflection revision-improvement can be connected to using Socrates' method.

  • PDF

Semantic Similarity Search using the Signature Tree (시그니처 트리를 사용한 의미적 유사성 검색 기법)

  • Kim, Ki-Sung;Im, Dong-Hyuk;Kim, Cheol-Han;Kim, Hyoung-Joo
    • Journal of KIISE:Databases
    • /
    • v.34 no.6
    • /
    • pp.546-553
    • /
    • 2007
  • As ontologies are used widely, interest for semantic similarity search is also increasing. In this paper, we suggest a query evaluation scheme for k-nearest neighbor query, which retrieves k most similar objects to the query object. We use the best match method to calculate the semantic similarity between objects and use the signature tree to index annotation information of objects in database. The signature tree is usually used for the set similarity search. When we use the signature tree in similarity search, we are required to predict the upper-bound of similarity for a node; the highest similarity value which can be found when we traverse into the node. So we suggest a prediction function for the best match similarity function and prove the correctness of the prediction. And we modify the original signature tree structure for same signatures not to be stored redundantly. This improved structure of signature tree not only reduces the size of signature tree but also increases the efficiency of query evaluation. We use the Gene Ontology(GO) for our experiments, which provides large ontologies and large amount of annotation data. Using GO, we show that proposed method improves query efficiency and present several experimental results varying the page size and using several node-splitting methods.