• Title/Summary/Keyword: 자동범주화

Search Result 59, Processing Time 0.022 seconds

Hierarchical Automatic Classification of News Articles based on Association Rules (연관규칙을 이용한 뉴스기사의 계층적 자동분류기법)

  • Joo, Kil-Hong;Shin, Eun-Young;Lee, Joo-Il;Lee, Won-Suk
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.6
    • /
    • pp.730-741
    • /
    • 2011
  • With the development of the internet and computer technology, the amount of information through the internet is increasing rapidly and it is managed in document form. For this reason, the research into the method to manage for a large amount of document in an effective way is necessary. The conventional document categorization method used only the keywords of related documents for document classification. However, this paper proposed keyword extraction method of based on association rule. This method extracts a set of related keywords which are involved in document's category and classifies representative keyword by using the classification rule proposed in this paper. In addition, this paper proposed the preprocessing method for efficient keywords creation and predicted the new document's category. We can design the classifier and measure the performance throughout the experiment to increase the profile's classification performance. When predicting the category, substituting all the classification rules one by one is the major reason to decrease the process performance in a profile. Finally, this paper suggested automatically categorizing plan which can be applied to hierarchical category architecture, extended from simple category architecture.

Comparative Study on Cognitive Scheme of Movement Verbs (이동동사의 인지 도식에 관한 비교 연구)

  • 오현금;남기춘
    • Proceedings of the Korean Society for Cognitive Science Conference
    • /
    • 2002.05a
    • /
    • pp.59-64
    • /
    • 2002
  • 인지심리학 및 인지언어학 분야에서 시도한 어휘 표상, 특히 움직임과 관련된 동사의 인지도식에 관한 연구들을 비교해보고자 한다. 인간의 언어학적인 지식을 도식적으로 표상 하고자 하는 노력은 언어의 통사적인 외형에만 치중하는 연구에서는 언어의 의미구조를 파악하기 힘들다고 판단하고 의미적인 범주화를 중요시하게 되었다. 본 연구에서는 시각적 이미지 도식을 중점적으로 살펴보기로 한다. 이미지 도식은 공간적 위치 관계, 이동, 형상 등에 관한 지각과 결부되어 있다. 이미지로 나타낸 표상은 근본적으로 세상의 인식과 세상에 대한 행동방법을 사용하게 하는 유추적이고 은유적인 원칙에 기초하고 있다. 이러한 점에 있어서, 언술을 발화한 화자는 어느 정도 주관적인 행동의 능력과 그가 인식한 개념화에서부터 문자화시킨 표상을 구성한다. 인지 원칙에 입각한 의미 표상에 중점을 둔 도식으로는, Langacker, Lakoff, Talmy의 도식이 있다. 프랑스에서 톰 R. Thom과 같은 수학자들은 질적인 현상에 관심을 가져 형역학(morphodynamique)이론을 확립하였는데, 이 이론은 요즘의 인지 연구에 수학적 기초를 제공하였다. R. Thom, J. Petitot-Cocorda의 도식 및 구조 의미론의 창시자라고 불리는 B.Pottier의 도식이 여기에 속한다 J.-P. Descles가 제시한 인지연산문법(Grammaire Applicative et Cognitive)은 다른 인지문법과는 달리 정보 자동처리과정에서 사용할 수 있는 연산자와 피연산자의 관계에 기초한 수학적 연산작용을 발전시켰다. 동사의 의미는 의미-인지 도식으로 설명되는데, 이것은 서로 다른 연산자와 피연산자로 구성된 형식화된 표현이다. 인간의 인지 기능은 언어로 표현되며, 언어는 인간의 의사소통, 사고 행위 및 인지학습의 핵심적 기능을 담당한다. 인간의 언어정보처리 메카니즘은 매우 복잡한 과정이기 때문에 언어정보처리와 관련된 언어심리학, 인지언어학, 형식언어학, 신경해부학 및 인공지능학 등의 관련된 분야의 학제적 연구가 필요하다.

  • PDF

A Study on Improved Model of Digital Basemap Database (수치지도 자료기반구축 개선모형에 관한 연구)

  • 유복모;신동빈
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.17 no.3
    • /
    • pp.213-223
    • /
    • 1999
  • This study provides a improved model of digital basemap production that can efficiently identify and correct the various errors generated in digital map production process. In order to fulfill the requirements that the new model calls for, this study provides a typology of errors by analyzing the errors in digital basemap data. Computer programs for automatic error searching and for checking the correctness of the digital codes in the data have also been developed. Exsiting visual error-checking process has also been analyzed and more systematic process is suggested. As a result, it is found that the improved model of digital basemap production suggested in this study contributes to improving the quality of the digital map database by providing a systematic method for efficient error-searching and correction of digital map data.

  • PDF

Utilizing Unlabeled Documents in Automatic Classification with Inter-document Similarities (문헌간 유사도를 이용한 자동분류에서 미분류 문헌의 활용에 관한 연구)

  • Kim, Pan-Jun;Lee, Jae-Yun
    • Journal of the Korean Society for information Management
    • /
    • v.24 no.1 s.63
    • /
    • pp.251-271
    • /
    • 2007
  • This paper studies the problem of classifying documents with labeled and unlabeled learning data, especially with regards to using document similarity features. The problem of using unlabeled data is practically important because in many information systems obtaining training labels is expensive, while large quantities of unlabeled documents are readily available. There are two steps In general semi-supervised learning algorithm. First, it trains a classifier using the available labeled documents, and classifies the unlabeled documents. Then, it trains a new classifier using all the training documents which were labeled either manually or automatically. We suggested two types of semi-supervised learning algorithm with regards to using document similarity features. The one is one step semi-supervised learning which is using unlabeled documents only to generate document similarity features. And the other is two step semi-supervised learning which is using unlabeled documents as learning examples as well as similarity features. Experimental results, obtained using support vector machines and naive Bayes classifier, show that we can get improved performance with small labeled and large unlabeled documents then the performance of supervised learning which uses labeled-only data. When considering the efficiency of a classifier system, the one step semi-supervised learning algorithm which is suggested in this study could be a good solution for improving classification performance with unlabeled documents.

Automatic Interface Synthesis based on IP Categorization and Characteristics Matching (IP 범주화와 특성 대응을 통한 인터페이스 회로 자동 합성)

  • Yun, Chang-Ryul;Jhang, Kyoung-Son
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.43 no.10 s.352
    • /
    • pp.34-44
    • /
    • 2006
  • A system-on-a-chip (SoC) design uses pre-verified IP hardware blocks in order to reduce design time. We need interface circuits to connect IPs with different protocols. In SoC design we should design interface circuits frequently and these tasks are somewhat time-consuming and error-prone. So it is necessary to generate the interface circuits automatically. Several studies have been made on generating interface circuits only from the communication protocols of IPs. With existing approaches, it is not easy to generate interface circuits connecting two IPs only from communication protocols: connection between IP with address and W without address, connection between IP with only one port to transfer address/data and IP with different ports for address and data connection between IP that transfer address and data together and IP that transfer only one address with a number of data in a burst. No consideration of various characteristics of IPs and no changed algorithm are responsible for it. In order to solve this problem, the proposed approach categorizes communication protocols of IPs, and takes characteristics matching of IPs into account during the interface synthesis. In experiments, we show that we could correctly generate and verify interface circuits for IPs with different characteristics.

A Study of Research on Methods of Automated Biomedical Document Classification using Topic Modeling and Deep Learning (토픽모델링과 딥 러닝을 활용한 생의학 문헌 자동 분류 기법 연구)

  • Yuk, JeeHee;Song, Min
    • Journal of the Korean Society for information Management
    • /
    • v.35 no.2
    • /
    • pp.63-88
    • /
    • 2018
  • This research evaluated differences of classification performance for feature selection methods using LDA topic model and Doc2Vec which is based on word embedding using deep learning, feature corpus sizes and classification algorithms. In addition to find the feature corpus with high performance of classification, an experiment was conducted using feature corpus was composed differently according to the location of the document and by adjusting the size of the feature corpus. Conclusionally, in the experiments using deep learning evaluate training frequency and specifically considered information for context inference. This study constructed biomedical document dataset, Disease-35083 which consisted biomedical scholarly documents provided by PMC and categorized by the disease category. Throughout the study this research verifies which type and size of feature corpus produces the highest performance and, also suggests some feature corpus which carry an extensibility to specific feature by displaying efficiency during the training time. Additionally, this research compares the differences between deep learning and existing method and suggests an appropriate method by classification environment.

Interpretation of Noun Sequence using Semantic Information Extracted from Machine Readable Dictionary and Corpus (기계가독형사전과 코퍼스에서 추출한 의미정보를 이용한 명사열의 의미해석)

  • 이경순;김도완;김길창;최기선
    • Korean Journal of Cognitive Science
    • /
    • v.12 no.1_2
    • /
    • pp.11-24
    • /
    • 2001
  • The interpretation of noun sequence is to find semantic relation between the nouns in noun sequence. To interpret noun sequence, semantic knowledge about words and relation between words is required. In this thesis, we propose a method to interpret a semantic relation between nouns in noun sequence. We extract semantic information from an machine readable dictionary (MRD) and corpus using regular expressions. Based on the extracted information, semantic relation of noun sequence is interpreted. And. we use verb subcategorization information together with the semantic information from an MRD and corpus. Previous researches use semantic knowledge extracted only from an MRD but our method uses an MRD. corpus. and subcategorizaton information to interpret noun sequences. Experimental result shows that our method improves the accuracy rate by +40.30% and the coverage rate by + 12.73% better than previous researches.

  • PDF

A Study on the Performance Improvement of Rocchio Classifier with Term Weighting Methods (용어 가중치부여 기법을 이용한 로치오 분류기의 성능 향상에 관한 연구)

  • Kim, Pan-Jun
    • Journal of the Korean Society for information Management
    • /
    • v.25 no.1
    • /
    • pp.211-233
    • /
    • 2008
  • This study examines various weighting methods for improving the performance of automatic classification based on Rocchio algorithm on two collections(LISA, Reuters-21578). First, three factors for weighting are identified as document factor, document factor, category factor for each weighting schemes, the performance of each was investigated. Second, the performance of combined weighting methods between the single schemes were examined. As a result, for the single schemes based on each factor, category-factor-based schemes showed the best performance, document set-factor-based schemes the second, and document-factor-based schemes the worst. For the combined weighting schemes, the schemes(idf*cat) which combine document set factor with category factor show better performance than the combined schemes(tf*cat or ltf*cat) which combine document factor with category factor as well as the common schemes (tfidf or ltfidf) that combining document factor with document set factor. However, according to the results of comparing the single weighting schemes with combined weighting schemes in the view of the collections, while category-factor-based schemes(cat only) perform best on LISA, the combined schemes(idf*cat) which combine document set factor with category factor showed best performance on the Reuters-21578. Therefore for the practical application of the weighting methods, it needs careful consideration of the categories in a collection for automatic classification.

Optimal supervised LSA method using selective feature dimension reduction (선택적 자질 차원 축소를 이용한 최적의 지도적 LSA 방법)

  • Kim, Jung-Ho;Kim, Myung-Kyu;Cha, Myung-Hoon;In, Joo-Ho;Chae, Soo-Hoan
    • Science of Emotion and Sensibility
    • /
    • v.13 no.1
    • /
    • pp.47-60
    • /
    • 2010
  • Most of the researches about classification usually have used kNN(k-Nearest Neighbor), SVM(Support Vector Machine), which are known as learn-based model, and Bayesian classifier, NNA(Neural Network Algorithm), which are known as statistics-based methods. However, there are some limitations of space and time when classifying so many web pages in recent internet. Moreover, most studies of classification are using uni-gram feature representation which is not good to represent real meaning of words. In case of Korean web page classification, there are some problems because of korean words property that the words have multiple meanings(polysemy). For these reasons, LSA(Latent Semantic Analysis) is proposed to classify well in these environment(large data set and words' polysemy). LSA uses SVD(Singular Value Decomposition) which decomposes the original term-document matrix to three different matrices and reduces their dimension. From this SVD's work, it is possible to create new low-level semantic space for representing vectors, which can make classification efficient and analyze latent meaning of words or document(or web pages). Although LSA is good at classification, it has some drawbacks in classification. As SVD reduces dimensions of matrix and creates new semantic space, it doesn't consider which dimensions discriminate vectors well but it does consider which dimensions represent vectors well. It is a reason why LSA doesn't improve performance of classification as expectation. In this paper, we propose new LSA which selects optimal dimensions to discriminate and represent vectors well as minimizing drawbacks and improving performance. This method that we propose shows better and more stable performance than other LSAs' in low-dimension space. In addition, we derive more improvement in classification as creating and selecting features by reducing stopwords and weighting specific values to them statistically.

  • PDF