• Title/Summary/Keyword: 순차 패턴

Search Result 309, Processing Time 0.031 seconds

Analysis of Traffic Card Big Data by Hadoop and Sequential Mining Technique (하둡과 순차패턴 마이닝 기술을 통한 교통카드 빅데이터 분석)

  • Kim, Woosaeng;Kim, Yong Hoon;Park, Hee-Sung;Park, Jin-Kyu
    • Journal of Information Technology Applications and Management
    • /
    • v.24 no.4
    • /
    • pp.187-196
    • /
    • 2017
  • It is urgent to prepare countermeasures for traffic congestion problems of Korea's metropolitan area where central functions such as economic, social, cultural, and education are excessively concentrated. Most users of public transportation in metropolitan areas including Seoul use the traffic cards. If various information is extracted from traffic big data produced by the traffic cards, they can provide basic data for transport policies, land usages, or facility plans. Therefore, in this study, we extract valuable information such as the subway passengers' frequent travel patterns from the big traffic data provided by the Seoul Metropolitan Government Big Data Campus. For this, we use a Hadoop (High-Availability Distributed Object-Oriented Platform) to preprocess the big data and store it into a Mongo database in order to analyze it by a sequential pattern data mining technique. Since we analysis the actual big data, that is, the traffic cards' data provided by the Seoul Metropolitan Government Big Data Campus, the analyzed results can be used as an important referenced data when the Seoul government makes a plan about the metropolitan traffic policies.

Ellipsometric Expressions for a Near-normal-incidence Ellipsometer with the Polarizer-compensator-sample-compensator-analyzer Configuration (편광자-보정기-시료-보정기-검광자 배치를 가지는 준 수직입사 타원계의 타원식)

  • Kim, Sang Youl
    • Korean Journal of Optics and Photonics
    • /
    • v.32 no.4
    • /
    • pp.172-179
    • /
    • 2021
  • A near-normal-incidence ellipsometer (NNIE) is suggested as an optical critical dimension (OCD) measurement system that is highly sensitive to the bottom defect of a sample with high-aspect-ratio structured patterns. Incident light passes through a polarizer and a phase retarder in sequence, and the reflected light from the sample also passes through them, but in reverse order. The operating principle of this NNIE, where a single polarizer and a single phase retarder are shared by the incident and reflected light, is studied, and a method to determine the ellipsometric constants from the measured intensities at proper combinations of the azimuthal angles of polarizer and retarder is presented.

Identification of Unknown Cryptographic Communication Protocol and Packet Analysis Using Machine Learning (머신러닝을 활용한 알려지지 않은 암호통신 프로토콜 식별 및 패킷 분류)

  • Koo, Dongyoung
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.32 no.2
    • /
    • pp.193-200
    • /
    • 2022
  • Unknown cryptographic communication protocols may have advantage of guaranteeing personal and data privacy, but when used for malicious purposes, it is almost impossible to identify and respond to using existing network security equipment. In particular, there is a limit to manually analyzing a huge amount of traffic in real time. Therefore, in this paper, we attempt to identify packets of unknown cryptographic communication protocols and separate fields comprising a packet by using machine learning techniques. Using sequential patterns analysis, hierarchical clustering, and Pearson's correlation coefficient, we found that the structure of packets can be automatically analyzed even for an unknown cryptographic communication protocol.

K-Means Clustering in the PCA Subspace using an Unified Measure (통합 측도를 사용한 주성분해석 부공간에서의 k-평균 군집화 방법)

  • Yoo, Jae-Hung
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.17 no.4
    • /
    • pp.703-708
    • /
    • 2022
  • K-means clustering is a representative clustering technique. However, there is a limitation in not being able to integrate the performance evaluation scale and the method of determining the minimum number of clusters. In this paper, a method for numerically determining the minimum number of clusters is introduced. The explained variance is presented as an integrated measure. We propose that the k-means clustering method should be performed in the subspace of the PCA in order to simultaneously satisfy the minimum number of clusters and the threshold of the explained variance. It aims to present an explanation in principle why principal component analysis and k-means clustering are sequentially performed in pattern recognition and machine learning.

New Temporal Features for Cardiac Disorder Classification by Heart Sound (심음 기반의 심장질환 분류를 위한 새로운 시간영역 특징)

  • Kwak, Chul;Kwon, Oh-Wook
    • The Journal of the Acoustical Society of Korea
    • /
    • v.29 no.2
    • /
    • pp.133-140
    • /
    • 2010
  • We improve the performance of cardiac disorder classification by adding new temporal features extracted from continuous heart sound signals. We add three kinds of novel temporal features to a conventional feature based on mel-frequency cepstral coefficients (MFCC): Heart sound envelope, murmur probabilities, and murmur amplitude variation. In cardiac disorder classification and detection experiments, we evaluate the contribution of the proposed features to classification accuracy and select proper temporal features using the sequential feature selection method. The selected features are shown to improve classification accuracy significantly and consistently for neural network-based pattern classifiers such as multi-layer perceptron (MLP), support vector machine (SVM), and extreme learning machine (ELM).

A Case Study on the Technology and Innovation Management Process in Smartphone Industry (스마트폰 산업에서의 기술혁신관리 프로세스 사례 연구)

  • Park, Sehyoung;Kim, Byung-Keun
    • Journal of Korea Technology Innovation Society
    • /
    • v.21 no.1
    • /
    • pp.92-129
    • /
    • 2018
  • In general, a technology and innovation strategy has been established first. Then, the technology and innovation activities are conducted accordingly. The literature on the technology management process points out that the technology and innovation activities exist in some sequences, nonlinear or linear pattern. However, it is also argued that a certain technology and innovation activity can be occurred or disappeared at certain timing. In this paper, it has been analyzed and clarified how the technology and innovation activities are performed and working together with the technology and innovation strategies in certain context especially when the handset market moves from feature phone to smartphone during a last decade. Empirical results show that the starting point of the technology and innovation activity changes according to the technology and innovation strategies. And, technology innovation activities exhibit multi-layer architecture types. It is confirmed that technology and innovation activities follow a specific pattern. However, if there are some changes in the technology and innovation strategy due to the external environment change, some technology and innovation activities can be skipped because the priority of the technology and innovation activities would be changed. If the firm which has the strategy type of 'innovators' fails to adapt to the fast changing external environment and has the inadequate technology and innovation activities, it is required to change the technology and innovation strategy. It will have a huge impact on the firm's survival.

Magnetic & Crystallographic Properties of Patterned Media Fabricated by Nanoimprint Lithography and Co-Pt Electroplating (나노임프린트 패터닝과 자성박막도금을 이용하여 제작한 패턴드미디어용 자기패턴의 자기적 및 결정구조특성에 관한 연구)

  • Lee, B.K.;Lee, D.H.;Lee, M.B.;Kim, H.S.;Cho, E.H.;Sohn, J.S.;Lee, C.H.;Jeong, G.H.;Suh, S.J.
    • Journal of the Korean Magnetics Society
    • /
    • v.18 no.2
    • /
    • pp.49-53
    • /
    • 2008
  • Magnetic and crystallographic properties of patterned media fabricated by nanoimprint lithography and Co-Pt electroplating were studied. Thin films of Ru(20 nm)/Ta(5 nm)/$SiO_2$(100 nm) were deposited on Si(100) wafer and then 25 nm hole pattern was fabricated by nanoimprint lithography on substrate. The electroplated Co-Pt nano-dots have the diameter of 35 nm and the height of 27 nm. Magnetic dot patterns of Co-Pt alloy were created using electroplated Co-Pt alloy and then their properties were measured by MFM, SQUID, SEM, TEM and AFM. We observed single domain with perendicular anisotropy for each dot and achieved optimum coercivity of 2900 Oe. These results mean that patterned media fabricated by nanoimprint lithography and electroplating have good properties in view of extending superparamagnetic limit while satisfying the writability requirements with the present write heads.

Effective Normalization Method for Fraud Detection Using a Decision Tree (의사결정나무를 이용한 이상금융거래 탐지 정규화 방법에 관한 연구)

  • Park, Jae Hoon;Kim, Huy Kang;Kim, Eunjin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.1
    • /
    • pp.133-146
    • /
    • 2015
  • Ever sophisticated e-finance fraud techniques have led to an increasing number of reported phishing incidents. Financial authorities, in response, have recommended that we enhance existing Fraud Detection Systems (FDS) of banks and other financial institutions. FDSs are systems designed to prevent e-finance accidents through real-time access and validity checks on client transactions. The effectiveness of an FDS depends largely on how fast it can analyze and detect abnormalities in large amounts of customer transaction data. In this study we detect fraudulent transaction patterns and establish detection rules through e-finance accident data analyses. Abnormalities are flagged by comparing individual client transaction patterns with client profiles, using the ruleset. We propose an effective flagging method that uses decision trees to normalize detection rules. In demonstration, we extracted customer usage patterns, customer profile informations and detection rules from the e-finance accident data of an actual domestic(Korean) bank. We then compared the results of our decision tree-normalized detection rules with the results of a sequential detection and confirmed the efficiency of our methods.

Delay Fault Test Pattern Generator Using Indirect Implication Algorithms in Scan Environment (스캔 환경에서 간접 유추 알고리즘을 이용한 경로 지연 고장 검사 입력 생성기)

  • Kim, Won-Gi;Kim, Myeong-Gyun;Gang, Seong-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.6
    • /
    • pp.1656-1666
    • /
    • 1999
  • The more complex and large digital circuits become, the more important delay test becomes which guarantees that circuits operate in time. In this paper, the proposed algorithm is developed, which enable the fast indirect implication for efficient test pattern generation in sequential circuits of standard scan environment. Static learning algorithm enables application of a new implication value using contrapositive proposition. The static learning procedure found structurally, analyzes the gate structure in the preprocessing phase and store the information of learning occurrence so that it can be used in the test pattern generation procedure if it satisfies the implication condition. If there exists a signal line which include all paths from some particular primary inputs, it is a partitioning point. If paths passing that point have the same partial path from primary input to the signal or from the signal to primary output, they will need the same primary input values which separated by the partitioning point. In this paper test pattern generation can be more effective by using this partitioning technique. Finally, an efficient delay fault test pattern generator using indirect implication is developed and the effectiveness of these algorithms is demonstrated by experiments.

  • PDF

Vector Approximation Bitmap Indexing Method for High Dimensional Multimedia Database (고차원 멀티미디어 데이터 검색을 위한 벡터 근사 비트맵 색인 방법)

  • Park Joo-Hyoun;Son Dea-On;Nang Jong-Ho;Joo Bok-Gyu
    • The KIPS Transactions:PartD
    • /
    • v.13D no.4 s.107
    • /
    • pp.455-462
    • /
    • 2006
  • Recently, the filtering approach using vector approximation such as VA-file[1] or LPC-file[2] have been proposed to support similarity search in high dimensional data space. This approach filters out many irrelevant vectors by calculating the approximate distance from a query vector using the compact approximations of vectors in database. Accordingly, the total elapsed time for similarity search is reduced because the disk I/O time is eliminated by reading the compact approximations instead of original vectors. However, the search time of the VA-file or LPC-file is not much lessened compared to the brute-force search because it requires a lot of computations for calculating the approximate distance. This paper proposes a new bitmap index structure in order to minimize the calculating time. To improve the calculating speed, a specific value of an object is saved in a bit pattern that shows a spatial position of the feature vector on a data space, and the calculation for a distance between objects is performed by the XOR bit calculation that is much faster than the real vector calculation. According to the experiment, the method that this paper suggests has shortened the total searching time to the extent of about one fourth of the sequential searching time, and to the utmost two times of the existing methods by shortening the great deal of calculating time, although this method has a longer data reading time compared to the existing vector approximation based approach. Consequently, it can be confirmed that we can improve even more the searching performance by shortening the calculating time for filtering of the existing vector approximation methods when the database speed is fast enough.