• Korean Management Science Review
• /
• v.24 no.2
• /
• pp.177-196
• /
• 2007

For better predictions and classifications in customer recommendation, this study proposes an integrative model that efficiently combines the currently-in-use statistical and artificial intelligence models. In particular, by integrating the models such as Association Rule, Frequency Matrix, and Rule Induction, this study suggests an integrative prediction model. Integrated models consist of four models: ASFM model which combines Association Rule(A) and Frequency Matrix(B), ASRI model which combines Association Rule(A) and Rule Induction(C), FMRI model which combines Frequency Matrix(B) and Rule Induction(C), and ASFMRI model which combines Association Rule(A), Frequency Matrix(B), and Rule Induction(C). The data set for the tests is collected from a convenience store G, which is the number one in its brand in S. Korea. This data set contains sales information on customer transactions from September 1, 2005 to December 7, 2005. About 1,000 transactions are selected for a specific item. Using this data set. it suggests an integrated model predicting whether a customer buys or not buys a specific product for target marketing strategy. The performance of integrated model is compared with that of other models. The results from the experiments show that the performance of integrated model is superior to that of all other models such as Association Rule, Frequency Matrix, and Rule Induction.

• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.1011-1020
• /
• 2008

The problem of finding Cramer rule for solutions of some restricted linear equation Ax = b has been widely discussed. Recently Wang and Qiao consider the following more general problem AXB = D, $R(X){\subset}T$, $N(X){\supset}\tilde{S}$. They present the solution of above general restricted matrix equation by using generalized inverses and give an explicit expression for the elements of the solution matrix for the matrix equation. In this paper we re-consider the restricted matrix equation and give an equivalent matrix equation to it. Through the equivalent matrix equation, we derive condensed Cramer rule for above restricted matrix equation. As an application, condensed determinantal expressions for $A_{T,S}^{(2)}$ A and $AA_{T,S}^{(2)}$ are established. Based on above results, we present a method for computing the solution of a kind of restricted matrix equation.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2007.11a
• /
• pp.489-498
• /
• 2007

For better predictions and classifications in customer recommendation, this study proposes an integrative model that efficiently combines the currently-in-use statistical and artificial intelligence models. In particular, by integrating the models such as Association Rule, Frequency Matrix, and Rule Induction, this study suggests an integrative prediction model. The data set for the tests is collected from a convenience store G, which is the number one in its brand in S. Korea. This data set contains sales information on customer transactions from September 1, 2005 to December 7, 2005. About 1,000 transactions are selected for a specific item. Using this data set, it suggests an integrated model predicting whether a customer buys or not buys a specific product for target marketing strategy. The performance of integrated model is compared with that of other models. The results from the experiments show that the performance of integrated model is superior to that of all other models such as Association Rule, Frequency Matrix, and Rule Induction.

• Journal of Korea Multimedia Society
• /
• v.20 no.7
• /
• pp.1054-1064
• /
• 2017

With the development of cloud computing, internet technology and Internet of Things(IoT), most of applications are being smarter and changing from native application to SaaS (Software as a Service) application. New versatile SaaS applications are being released through various app portals (e.g. appstore, googleplay, T-Store, and so on). However, a user has a difficulty in searching, choosing an suitable application to him. It is also hard for him to know what functions of each SaaS application are useful. He wants to be recommended something inter-operated SaaS service according to his personality and his situation. Therefore, this paper presents a way of making mash-up of SaaS applications in order to provide the most convenient inter-operated SaaS service to user. This paper also presents SaaS Application Mash-up Framework (SAMF), complex context and rule matrix. The proposed SAMF is a main system that totally manage SaaS application mash-up service. Complex context and rule matrix are key components in order to recommend what SaaS applications are needed and how those SaaS applications are inter-operated. The SAMF collects complex contexts (User Description, Status Description, SaaS Service Description) in order to choose which SaaS applications are useful, analyze what functions to use, how to mash-up.

• ETRI Journal
• /
• v.39 no.4
• /
• pp.592-604
• /
• 2017

Intrusion detection is very important for network situation awareness. While a few methods have been proposed to detect network intrusion, they cannot directly and effectively utilize semi-quantitative information consisting of expert knowledge and quantitative data. Hence, this paper proposes a new detection model based on a directed acyclic graph (DAG) and a belief rule base (BRB). In the proposed model, called DAG-BRB, the DAG is employed to construct a multi-layered BRB model that can avoid explosion of combinations of rule number because of a large number of types of intrusion. To obtain the optimal parameters of the DAG-BRB model, an improved constraint covariance matrix adaption evolution strategy (CMA-ES) is developed that can effectively solve the constraint problem in the BRB. A case study was used to test the efficiency of the proposed DAG-BRB. The results showed that compared with other detection models, the DAG-BRB model has a higher detection rate and can be used in real networks.

• Tunnel and Underground Space
• /
• v.10 no.2
• /
• pp.173-179
• /
• 2000

The influence of the plastic flow rules on the elasto-plastic behaviour of a discrete joint element was investigated by performing the numerical direct shear tests under both constant normal displacement and normal displacement conditions. The finite interface elements obeying Plesha’s joint constitutive law was used to allow the relative motion of the rock blocks on the joint surface. Realistic results were obtained in the tests adopting the non-associated flow rule, while the associated flow rule overestimated the joint dilation. To overcome the computational drawbacks coming from the non-symmetric element stiffness matrix in the conventional non-associated plasticity, the symmetric formulation of the tangential stiffness matrix for a non-associated joint element was proposed. The symmetric elasto-plastic matrix it derived by assuming an imaginary equivalent joint with associated flow rule which shows the same plastic response as that of original Joint with non-associated flow rule. The validity of the formulation was confirmed through the numerical direct shear tests under constant normal stress condition.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.67-70
• /
• 2007

본 논문은 클러스터링 문제에서 사전 정보에 대한 활용의 효율을 개선시킬 수 있는 방법을 제안한다. 클러스터링에서 사전 정보의 존재 시 이의 활용은 성능을 개선시킬 수 있는 계기가 될 수 있으므로 그의 활용 폭을 늘리기 위한 방법으로 다양한 사용 방법의 적용인 semi-supervised 클러스터링 앙상블을 제안한다. 사전 정보의 활용 방법의 방안으로써 association-rule의 개념을 접목하였다. 클러스터 수를 다르게 적용하더라도 패턴간의 유사도가 높으면 같은 그룹에 속할 확률은 높아진다. 다양한 초기화에 따른 클러스터의 동작은 사전 정보의 활용을 다양화 시키게 되며, 사전 정보에 충족하는 각각의 클러스터 결과를 제시한다. 결과를 총 취합하여 association-matrix를 형성하면 패턴간의 유사도를 얻을 수 있으며 결국 association-matrix를 통해 클러스터링 할 수 있는 방법을 제시한다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.358-363
• /
• 1998

An algorithm for representing the cubic spline interpolation of differentiable functions by a fuzzy system is presented in this paper. The cubic B-spline functions which form a basis for the interpolation function are used as the fuzzy sets for input fuzzification. The ordinal number of the coefficient cKL in the list of the coefficient cij's as sorted in increasing order, is taken to be the output fuzzy set number in the (k, l) th entry of the fuzzy rule table. Spike functions are used for the output fuzzy sets, with cij's as support boundaries after they are sorted. An algorithm to compute the support boundaries explicitly without solving the matrix equation involved is included, along with a few properties of the fuzzy rule matrix for the designed fuzzy system.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.731-739
• /
• 1998

The probabilistic relaxation(PR) scheme based on the conditional probability and probability space partition has the important property that when its compatibility coefficient matrix (CCM) has uniform components it can classify m-dimensional probabilistic distribution vectors into different classes. When consistency or inconsistency measures have been defined, the properties of PRs are completely determined by the compatibility coefficients among labels of labeled objects and influence weight among labeled objects. In this paper we study the properties of PR in which both compatibility coefficients and influence weights are uniform, and then a learning rule for such PR system is derived. Experiments have been performed to verify the effectiveness of the learning rule.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.40 no.2
• /
• pp.224-233
• /
• 1991

The multilayer expanson of single layer NN (Neural Network) was needed to solve the linear seperability problem as shown by the classic example using the XOR function. The EBP (Error Back Propagation ) learning rule is often used in multilayer Neural Networks, but it is not without its faults: 1)D.Rimmelhart expanded the Delta Rule but there is a problem in obtaining Ca from the linear combination of the Weight matrix N between the hidden layer and the output layer and H, wich is the result of another linear combination between the input pattern and the Weight matrix M between the input layer and the hidden layer. 2) Even if using the difference between Ca and Da to adjust the values of the Weight matrix N between the hidden layer and the output layer may be valid is correct, but using the same value to adjust the Weight matrixd M between the input layer and the hidden layer is wrong. Recognitron III was proposed to solve these faults. According to simulation results, since Recognitron III does not learn the three layer NN itself, but divides it into several single layer NNs and learns these with learning patterns, the learning time is 32.5 to 72.2 time faster than EBP NN one. The number of patterns learned in a EBP NN with n input and output cells and n+1 hidden cells are 2**n, but n in Recognitron III of the same size. [5] In the case of pattern generalization, however, EBP NN is less than Recognitron III.