• Title/Summary/Keyword: 규칙 생성과 평가

Search Result 196, Processing Time 0.03 seconds

A hierarchical property-based multi-level approach method for improves user access control in a cloud environment (클라우드 환경에서 사용자 접근제어를 향상시킨 계층적 속성 기반의 다단계 접근 방법)

  • Jeong, Yoon-Su;Kim, Yong-Tae;Park, Gil-Choel
    • Journal of the Korea Convergence Society
    • /
    • v.8 no.11
    • /
    • pp.7-13
    • /
    • 2017
  • In recent years, cloud computing technology has been socially emerged that provides services remotely as various devices are used. However, there are increasing attempts by some users to provide cloud computing services with malicious intent. In this paper, we propose a property - based multi - level hierarchical approach to facilitate authentication access for users accessing servers in cloud environment. The proposed method improves the security efficiency as well as the server efficiency by hierarchically distributing a set of attribute values by replacing the order of the user 's attribute values in the form of bits according to a certain rule. In the performance evaluation, the proposed method shows that the accuracy of authentication according to the number of attributes is higher than that of the existing method by an average of 15.8% or more, and the authentication delay time of the server is decreased by 10.7% on average. As the number of attributes increases, the average overhead change is 8.5% lower than that of the conventional method.

Detection of Car Hacking Using One Class Classifier (단일 클래스 분류기를 사용한 차량 해킹 탐지)

  • Seo, Jae-Hyun
    • Journal of the Korea Convergence Society
    • /
    • v.9 no.6
    • /
    • pp.33-38
    • /
    • 2018
  • In this study, we try to detect new attacks for vehicle by learning only one class. We use Car-Hacking dataset, an intrusion detection dataset, which is used to evaluate classification performance. The dataset are created by logging CAN (Controller Area Network) traffic through OBD-II port from a real vehicle. The dataset have four attack types. One class classification is one of unsupervised learning methods that classifies attack class by learning only normal class. When using unsupervised learning, it difficult to achieve high efficiency because it does not use negative instances for learning. However, unsupervised learning has the advantage for classifying unlabeled data, which are new attacks. In this study, we use one class classifier to detect new attacks that are difficult to detect using signature-based rules on network intrusion detection system. The proposed method suggests a combination of parameters that detect all new attacks and show efficient classification performance for normal dataset.

Intellignce Modeling of Nonlinear Process System Using Fuzzy Neyral Networks-based Structure (퍼지-뉴럴네트워크 구조에 의한 비선형 공정시스템의 지능형 모델링)

  • 오성권;노석범;남궁문
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.5 no.4
    • /
    • pp.41-55
    • /
    • 1995
  • In this paper, an optimal idenfication method using fuzzy-neural networks is proposed for modeling of nonlinear complex systems. The proposed fuzzy-neural modeling implements system structure and parameter identification using the intelligent schemes together wlth optimization theory, linguistic fuzzy implication rules, and neural networks(NNs) from input and output data of processes. Inference type for this fuzzy-neural modeling is presented as simplified inference. To obtain optimal model, the learning rates and momentum coefficients of fuzzy-neural networks(FNNs) are tuned automatically using improved modified complex method and modified learning algorithm. For the purpose of its application to nonlinear processes, data for route choice of traffic problems and those for activateti sluge process of sewage treatment system are used for the purpose of evaluating the performance of the proposed fuzzy-neural network modeling. The results show that the proposed method can produce the intelligence model with higher accuracy than other works achieved previously.

  • PDF

A Knowledge-based System for Analyzing Sophisticated Geometric Structure of Document Images (문서 영상의 정교한 기하적 구조분석을 위한 지식베이스 시스템)

  • Lee, Kyong-Ho;Choy, Yoon-Chul;Cho, Sung-Bae
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.11
    • /
    • pp.795-813
    • /
    • 2001
  • Sophisticated geometric structure analysis must be preceded to create electronic document from logical components extracted from document image. this paper presents a knowledge-based method for sophisticated geometric structure analysis of technical journal pages. The proposed knowledge base encodes geometric characteristics that are not only common in technical journals but also publication-specific in the form rules. The method takes the hybrid of top-down and bottom-up techniques and consists of two phases: region segmentation and identification. Generally, the result of segmentation process does not have a one-to-one matching with composite layout components. Therefore, the proposed method identifies non-text objects such as image, drawing and table, as well as text objects such as text line and equation by splitting or grouping segmented regions into composite layout components. Experimental results with 372 images scanned from the IEEE Transactions on Pattern Analysis and Machine Intelligence show that the proposed method has performed geometrical structure analysis successfully on more than 99% of the test images, resulting in sophisticated performance compared with previous works.

  • PDF

An Algorithm for reducing the search time of Frequent Items (빈발 항목의 탐색 시간을 단축하기 위한 알고리즘)

  • Yun, So-Young;Youn, Sung-Dae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.1
    • /
    • pp.147-156
    • /
    • 2011
  • With the increasing utility of the recent information system, the methods to pick up necessary products rapidly by using a lot of data has been studied. Association rule search methods to find hidden patterns has been drawing much attention, and the Apriori algorithm is a major method. However, the Apriori algorithm increases search time due to its repeated scans. This paper proposes an algorithm to reduce searching time of frequent items. The proposed algorithm creates matrix using transaction database and search for frequent items using the mean number of items of transactions at matrix and a defined minimum support. The mean number of items of transactions is used to reduce the number of transactions, and the minimum support to cut down on items. The performance of the proposed algorithm is assessed by the comparison of search time and precision with existing algorithms. The findings from this study indicated that the proposed algorithm has been searched more quickly and efficiently when extracting final frequent items, compared to existing Apriori and Matrix algorithm.

A Weighted Fuzzy Min-Max Neural Network for Pattern Classification (패턴 분류 문제에서 가중치를 고려한 퍼지 최대-최소 신경망)

  • Kim Ho-Joon;Park Hyun-Jung
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.8
    • /
    • pp.692-702
    • /
    • 2006
  • In this study, a weighted fuzzy min-max (WFMM) neural network model for pattern classification is proposed. The model has a modified structure of FMM neural network in which the weight concept is added to represent the frequency factor of feature values in a learning data set. First we present in this paper a new activation function of the network which is defined as a hyperbox membership function. Then we introduce a new learning algorithm for the model that consists of three kinds of processes: hyperbox creation/expansion, hyperbox overlap test, and hyperbox contraction. A weight adaptation rule considering the frequency factors is defined for the learning process. Finally we describe a feature analysis technique using the proposed model. Four kinds of relevance factors among feature values, feature types, hyperboxes and patterns classes are proposed to analyze relative importance of each feature in a given problem. Two types of practical applications, Fisher's Iris data and Cleveland medical data, have been used for the experiments. Through the experimental results, the effectiveness of the proposed method is discussed.

An Agent System for Efficient VOD Services on Web (효율적 웹 기반 VOD 서비스를 위한 에이전트 시스템)

  • Lee Kyung-Hee;Han Jeong-Hye;Kim Dong-Ho
    • Journal of Digital Contents Society
    • /
    • v.2 no.1
    • /
    • pp.73-79
    • /
    • 2001
  • Most of the existing algorithms try to disseminate the multimedia contents of internet service provider(ISP), without taking into account the needs and characteristics of specific websites including e-learning systems with web-based .educational contents. Sometimes the client must select the best one among the replicated repositories. However, this is a less reliable approach because clients' selections are made without prior information on server load capacity. In this paper we propose an agent system inspired by the need of improving QoS of delivering web-based educational multimedia contents without incurring long access delays. This agent system consists of three components, Analyzer, Knowledge Base, and Automaton embedded the capacity algorithm. It analyzes and investigates traffic information collected from individual replicated server by learners' requests, and selects a server which is available and is expected to provide the fastest latency time and the lowest loaded capacity, and achieves high performance by dynamic replicating web resources among multiple repositories.

  • PDF

A Weighted FMM Neural Network and Feature Analysis Technique for Pattern Classification (가중치를 갖는 FMM신경망과 패턴분류를 위한 특징분석 기법)

  • Kim Ho-Joon;Yang Hyun-Seung
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.1
    • /
    • pp.1-9
    • /
    • 2005
  • In this paper we propose a modified fuzzy min-max neural network model for pattern classification and discuss the usefulness of the model. We define a new hypercube membership function which has a weight factor to each of the feature within a hyperbox. The weight factor makes it possible to consider the degree of relevance of each feature to a class during the classification process. Based on the proposed model, a knowledge extraction method is presented. In this method, a list of relevant features for a given class is extracted from the trained network using the hyperbox membership functions and connection weights. Ft)r this purpose we define a Relevance Factor that represents a degree of relevance of a feature to the given class and a similarity measure between fuzzy membership functions of the hyperboxes. Experimental results for the proposed methods and discussions are presented for the evaluation of the effectiveness and feasibility of the proposed methods.

A Three-Layered Ontology View Security Model for Access Control of RDF Ontology (RDF 온톨로지 접근 제어를 위한 3 계층 온톨로지 뷰 보안 모델)

  • Jeong, Dong-Won;Jing, Yixin;Baik, Dook-Kwon
    • Journal of KIISE:Databases
    • /
    • v.35 no.1
    • /
    • pp.29-43
    • /
    • 2008
  • Although RDF ontologies might be expressed in XML tree model, existing methods for protection of XML documents are not suitable for securing RDF ontologies. The graph style and inference feature of RDF demands a new security model development. Driven by this goal, this paper proposes a new query-oriented model for the RDF ontology access control. The proposed model rewrites a user query using a three-layered ontology view. The proposal resolves the problem that the existing approaches should generate inference models depending on inference rules. Accessible ontology concepts and instances which a user can visit are defined as ontology views, and the inference view defined for controling an inference query enables a controlled inference capability for the user. This paper defines the three-layered view and describes algorithms for query rewriting according to the views. An implemented prototype with its system architecture is shown. Finally, the experiment and comparative evaluation result of the proposal and the previous approach is described.

Extension Method of Association Rules Using Social Network Analysis (사회연결망 분석을 활용한 연관규칙 확장기법)

  • Lee, Dongwon
    • Journal of Intelligence and Information Systems
    • /
    • v.23 no.4
    • /
    • pp.111-126
    • /
    • 2017
  • Recommender systems based on association rule mining significantly contribute to seller's sales by reducing consumers' time to search for products that they want. Recommendations based on the frequency of transactions such as orders can effectively screen out the products that are statistically marketable among multiple products. A product with a high possibility of sales, however, can be omitted from the recommendation if it records insufficient number of transactions at the beginning of the sale. Products missing from the associated recommendations may lose the chance of exposure to consumers, which leads to a decline in the number of transactions. In turn, diminished transactions may create a vicious circle of lost opportunity to be recommended. Thus, initial sales are likely to remain stagnant for a certain period of time. Products that are susceptible to fashion or seasonality, such as clothing, may be greatly affected. This study was aimed at expanding association rules to include into the list of recommendations those products whose initial trading frequency of transactions is low despite the possibility of high sales. The particular purpose is to predict the strength of the direct connection of two unconnected items through the properties of the paths located between them. An association between two items revealed in transactions can be interpreted as the interaction between them, which can be expressed as a link in a social network whose nodes are items. The first step calculates the centralities of the nodes in the middle of the paths that indirectly connect the two nodes without direct connection. The next step identifies the number of the paths and the shortest among them. These extracts are used as independent variables in the regression analysis to predict future connection strength between the nodes. The strength of the connection between the two nodes of the model, which is defined by the number of nodes between the two nodes, is measured after a certain period of time. The regression analysis results confirm that the number of paths between the two products, the distance of the shortest path, and the number of neighboring items connected to the products are significantly related to their potential strength. This study used actual order transaction data collected for three months from February to April in 2016 from an online commerce company. To reduce the complexity of analytics as the scale of the network grows, the analysis was performed only on miscellaneous goods. Two consecutively purchased items were chosen from each customer's transactions to obtain a pair of antecedent and consequent, which secures a link needed for constituting a social network. The direction of the link was determined in the order in which the goods were purchased. Except for the last ten days of the data collection period, the social network of associated items was built for the extraction of independent variables. The model predicts the number of links to be connected in the next ten days from the explanatory variables. Of the 5,711 previously unconnected links, 611 were newly connected for the last ten days. Through experiments, the proposed model demonstrated excellent predictions. Of the 571 links that the proposed model predicts, 269 were confirmed to have been connected. This is 4.4 times more than the average of 61, which can be found without any prediction model. This study is expected to be useful regarding industries whose new products launch quickly with short life cycles, since their exposure time is critical. Also, it can be used to detect diseases that are rarely found in the early stages of medical treatment because of the low incidence of outbreaks. Since the complexity of the social networking analysis is sensitive to the number of nodes and links that make up the network, this study was conducted in a particular category of miscellaneous goods. Future research should consider that this condition may limit the opportunity to detect unexpected associations between products belonging to different categories of classification.