• Title/Summary/Keyword: Sequence Classification

Search Result 400, Processing Time 0.034 seconds

A NOTE ON PROJECTIVE AND INJECTIBVE AUTOMATA

  • Park, Chin-Hong
    • Journal of applied mathematics & informatics
    • /
    • v.3 no.1
    • /
    • pp.79-88
    • /
    • 1996
  • In this paper we define a new short exact sequence of automata and we investigate module-like properties on projective and injective automata

Research on Malware Classification with Network Activity for Classification and Attack Prediction of Attack Groups (공격그룹 분류 및 예측을 위한 네트워크 행위기반 악성코드 분류에 관한 연구)

  • Lim, Hyo-young;Kim, Wan-ju;Noh, Hong-jun;Lim, Jae-sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.1
    • /
    • pp.193-204
    • /
    • 2017
  • The security of Internet systems critically depends on the capability to keep anti-virus (AV) software up-to-date and maintain high detection accuracy against new malware. However, malware variants evolve so quickly they cannot be detected by conventional signature-based detection. In this paper, we proposed a malware classification method based on sequence patterns generated from the network flow of malware samples. We evaluated our method with 766 malware samples and obtained a classification accuracy of approximately 40.4%. In this study, malicious codes were classified only by network behavior of malicious codes, excluding codes and other characteristics. Therefore, this study is expected to be further developed in the future. Also, we can predict the attack groups and additional attacks can be prevented.

A study on extraction of optimized API sequence length and combination for efficient malware classification (효율적인 악성코드 분류를 위한 최적의 API 시퀀스 길이 및 조합 도출에 관한 연구)

  • Choi, Ji-Yeon;Kim, HeeSeok;Kim, Kyu-Il;Park, Hark-Soo;Song, Jung-Suk
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.24 no.5
    • /
    • pp.897-909
    • /
    • 2014
  • With the development of the Internet, the number of cyber threats is continuously increasing and their techniques are also evolving for the purpose of attacking our crucial systems. Since attackers are able to easily make exploit codes, i.e., malware, using dedicated generation tools, the number of malware is rapidly increasing. However, it is not easy to analyze all of malware due to an extremely large number of malware. Because of this, many researchers have proposed the malware classification methods that aim to identify unforeseen malware from the well-known malware. The existing malware classification methods used malicious information obtained from the static and the dynamic malware analysis as the criterion of calculating the similarity between malwares. Also, most of them used API functions and their sequences that are divided into a certain length. Thus, the accuracy of the malware classification heavily depends on the length of divided API sequences. In this paper, we propose an extraction method of optimized API sequence length and combination that can be used for improving the performance of the malware classification.

Hangul Handwriting Recognition using Recurrent Neural Networks (순환신경망을 이용한 한글 필기체 인식)

  • Kim, Byoung-Hee;Zhang, Byoung-Tak
    • KIISE Transactions on Computing Practices
    • /
    • v.23 no.5
    • /
    • pp.316-321
    • /
    • 2017
  • We analyze the online Hangul handwriting recognition problem (HHR) and present solutions based on recurrent neural networks. The solutions are organized according to the three kinds of sequence labeling problem - sequence classifications, segment classification, and temporal classification, with additional consideration of the structural constitution of Hangul characters. We present a stacked gated recurrent unit (GRU) based model as the natural HHR solution in the sequence classification level. The proposed model shows 86.2% accuracy for recognizing 2350 Hangul characters and 98.2% accuracy for recognizing the six types of Hangul characters. We show that the type recognizing model successfully follows the type change as strokes are sequentially written. These results show the potential for RNN models to learn high-level structural information from sequential data.

A Study on the Classification Scheme of Cultural Resource in ACIA (아시아문화정보원의 문화자원 분류체계 연구)

  • Lee, Myoung-Gyu
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.49 no.1
    • /
    • pp.319-340
    • /
    • 2015
  • The purpose of this study is to provide a plan of classification scheme to efficiently manage the collected cultural resource in Asian Culture Information Agency (ACIA) of Asian Culture Complex. The characteristic and category of the cultural resources are identified after studying objectives and acquisition policies of ACIA. This paper in here compares classification schemes such as HRAF scheme, UNESCO cultural framework, Folklore Archive scheme, and classification scheme of Academy of Korean Studies. On the basis of it, this study proposes the principle and criterion of the new classification scheme in ACIA. The new classification scheme is classified as the cultural, social, and natural area in sequence. The number of main classes is set up 16 items.

Application Traffic Classification using PSS Signature

  • Ham, Jae-Hyun;An, Hyun-Min;Kim, Myung-Sup
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.7
    • /
    • pp.2261-2280
    • /
    • 2014
  • Recently, network traffic has become more complex and diverse due to the emergence of new applications and services. Therefore, the importance of application-level traffic classification is increasing rapidly, and it has become a very popular research area. Although a lot of methods for traffic classification have been introduced in literature, they have some limitations to achieve an acceptable level of performance in real-time application-level traffic classification. In this paper, we propose a novel application-level traffic classification method using payload size sequence (PSS) signature. The proposed method generates unique PSS signatures for each application using packet order, direction and payload size of the first N packets in a flow, and uses them to classify application traffic. The evaluation shows that this method can classify application traffic easily and quickly with high accuracy rates, over 99.97%. Furthermore, the method can also classify application traffic that uses the same application protocol or is encrypted.

The Analysis of prescription used for back pain in the Donguibogam(東醫寶鑑) (동의보감의 배통처방에 대한 분석)

  • Han, Young Soo;Oh, Min Suck
    • Journal of Haehwa Medicine
    • /
    • v.13 no.1
    • /
    • pp.269-277
    • /
    • 2004
  • 1. The frequency of source of prescriptions is Dongweonshibse(東垣十書), Hagansanghansamyukse(河間傷寒三六書), Senmyoungronbang(宣明論方), Gogumuigam(古今醫鑑), Dangyesimbob(丹溪心法), Uihakgangmok(醫學綱目), Taepyonghyeininhwajekukbang(太平惠民和劑局方) in sequence. 2. The classification of prescriptions by efficacy is Haepyoy(解表藥), Igiyak(理氣藥), Boikyak(補益藥), Sahayak(瀉下藥), Chongyo1yak(淸熱藥等), etc., in sequence. 3. The frequency of used medicine is Gangwhal(羌活), Insam(人蔘), Hwangbaek(黃柏), Gamsu(甘遂), Jadakek(紫大戟), Daehwang(大黃), Seungma(升麻), Shiho(紫胡), Bangpung(防風), Jinpi(陳皮), Oyak(烏藥), Chongung(川芎), Changchul(蒼朮), Gobon(藁本), etc., in sequence. 4. The Song(性) of used medicine is mainly Onsong(溫性) and Hansong(寒性), the mi(味) is Sinmi(辛味), Gomi(苦味), Gammi(甘味), Hammi(鹹味) in sequence, the Gwigyong(歸經) is Bigyong (脾經), Wigyong(胃經), Gangyong(肝經), Paegyong(肺經), etc., in seguence.

  • PDF

miRNA Pattern Discovery from Sequence Alignment

  • Sun, Xiaohan;Zhang, Junying
    • Journal of Information Processing Systems
    • /
    • v.13 no.6
    • /
    • pp.1527-1543
    • /
    • 2017
  • MiRNA is a biological short sequence, which plays a crucial role in almost all important biological process. MiRNA patterns are common sequence segments of multiple mature miRNA sequences, and they are of significance in identifying miRNAs due to the functional implication in miRNA patterns. In the proposed approach, the primary miRNA patterns are produced from sequence alignment, and they are then cut into short segment miRNA patterns. From the segment miRNA patterns, the candidate miRNA patterns are selected based on estimated probability, and from which, the potential miRNA patterns are further selected according to the classification performance between authentic and artificial miRNA sequences. Three parameters are suggested that bi-nucleotides are employed to compute the estimated probability of segment miRNA patterns, and top 1% segment miRNA patterns of length four in the order of estimated probabilities are selected as potential miRNA patterns.

Decision-Tree-Based Markov Model for Phrase Break Prediction

  • Kim, Sang-Hun;Oh, Seung-Shin
    • ETRI Journal
    • /
    • v.29 no.4
    • /
    • pp.527-529
    • /
    • 2007
  • In this paper, a decision-tree-based Markov model for phrase break prediction is proposed. The model takes advantage of the non-homogeneous-features-based classification ability of decision tree and temporal break sequence modeling based on the Markov process. For this experiment, a text corpus tagged with parts-of-speech and three break strength levels is prepared and evaluated. The complex feature set, textual conditions, and prior knowledge are utilized; and chunking rules are applied to the search results. The proposed model shows an error reduction rate of about 11.6% compared to the conventional classification model.

  • PDF

STRONG CLASSIFICATION OF EXTENSIONS OF CLASSIFIABLE C*-ALGEBRAS

  • Eilers, Soren;Restorff, Gunnar;Ruiz, Efren
    • Bulletin of the Korean Mathematical Society
    • /
    • v.59 no.3
    • /
    • pp.567-608
    • /
    • 2022
  • We show that certain extensions of classifiable C*-algebras are strongly classified by the associated six-term exact sequence in K-theory together with the positive cone of K0-groups of the ideal and quotient. We use our results to completely classify all unital graph C*-algebras with exactly one non-trivial ideal.