• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.197-206
• /
• 2012

A exisiting recommedation system using association rules has the problem, such as delay of processing speed from a cause of frequent scanning a large data, scalability and accuracy as well. In this paper, using a Implicit method which is not used user's profile for rating, we propose the personalized recommendation system which is a new method using the FP-tree mining based on RFM. It is necessary for us to keep the analysis of RFM method and FP-tree mining to be able to reflect attributes of customers and items based on the whole customers' data and purchased data in order to find the items with high purchasability. The proposed makes frequent items and creates association rule by using the FP-tree mining based on RFM without occurrence of candidate set. We can recommend the items with efficiency, are used to generate the recommendable item according to the basic threshold for association rules with support, confidence and lift. To estimate the performance, the proposed system is compared with existing system. As a result, it can be improved and evaluated according to the criteria of logicality through the experiment with dataset, collected in a cosmetic internet shopping mall.

• Communications for Statistical Applications and Methods
• /
• v.8 no.3
• /
• pp.823-829
• /
• 2001

Even though a rapid development of modem medical science, paralysis disease is a highly dangerous and murderous disease. Shin et al. (1978) constructed the diagnosis expert system which identify a type of the paralysis disease from symptoms of a paralysis disease patients by using the canonical discriminant analysis. The decision tree-based analysis, however, has advantages over the method used in Shin et al. (1998), such as it does not need assumptions - linearity and normality, and suggest appropriate diagnosis procedure which is easily explained. In this paper, we applied the decision tree to construct the model which Identify a type of the paralysis disease.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2002.05a
• /
• pp.67-71
• /
• 2002

본 논문에서는 many-to-many IP 멀티캐스팅을 위한 효율적인 BCT(Backbone Core Tree)생성 알고리즘의 시뮬레이션 방법에 대하여 제안한다. BCT는 기법은 CBT(Core Based Tree)에 기반을 두고 있다. CBT는 공유 트리를 이용하여 멀티캐스트 자료를 전달하기 때문에 Source based Tree에 비하여 각 라우터가 유지해야 하는 상태 정보의 양에 적고, 적용하기 간단하지만, Core 라우터 선택의 어려움과 트래픽이 Core로 집중되는 문제점을 가지고 있다. 이에 대한 보완책으로 BCT기법이 제안되었는데, 본 논문에서는 주어진 네트워크 위상 그래프에서 최소신장 트리를 만들고, 센트로이드(Centroid)를 이용하여 효율적인 BCT를 생성하는 알고리즘을 제안하고 시뮬레이션 방법을 제시한다.

• Communications for Statistical Applications and Methods
• /
• v.8 no.1
• /
• pp.271-279
• /
• 2001

Sequential pattern discovery is one of main interests in web usage mining. the technique of sequential pattern discovery attempts to find inter-session patterns such that the presence of a set of items is followed by another item in a time-ordered set of server sessions. In this paper, a tree-based sequential pattern finding method is proposed in order to discover navigation patterns in server sessions. At each learning process, the suggested method learns about the navigation patterns per server session and summarized into the modified Rymon's tree.

• Journal of Korea Multimedia Society
• /
• v.3 no.6
• /
• pp.633-642
• /
• 2000

This paper proposes a dominant source-based tree (DSBT) that constructs a localized multicast routing tree for dynamic multicasting without rerouting. To constrain end-to-end delays a multicast tree needs to be reconstructed when a new node joins the group due to additive tree constraint. In DSBT, a multicast group G is expressed by a (DS, NCM) pair, where DS is a dominant source address and NCM is a normalized cost margin. A node wishing to participate in a group selects a path that complies with NCM toward DS such that the end-to-end cost is constrained without any rerouting. Simulation results show that the proposed method performed better in terms of the overall tree cost compared with the Nave algorithm and in terms of the end-to-end delays between any two members compared with the Greedy algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.5 s.43
• /
• pp.19-27
• /
• 2006

This paper presents a query processing model in a wrapper based on the XML view tree. The query processing in a wrapper requires view composition, query translation into local sources, and generation of XML documents from local query results. We present a query processing model based on the view tree, where the XML views and the XML query is represented by the view tree. Since the view tree keeps the structure of a virtual XML document, it is easy to navigate the path expression. The view tree is also used as a template for schema generation and XML document generation as a query result. Moreover this conceptual uniform abstraction for the XML view and the user query makes it easy to support a multi-level XML view and to implement our composition mechanism.

• Ocean Systems Engineering
• /
• v.9 no.3
• /
• pp.261-285
• /
• 2019

Nowadays in offshore industry there are emerging hazards with vague property such as act of terrorism, act of war, unforeseen natural disasters such as tsunami, etc. Therefore industry professionals such as offshore energy insurers, safety engineers and risk managers in order to determine the failure rates and frequencies for the potential hazards where there is no data available, they need to use an appropriate method to overcome this difficulty. Furthermore in conventional risk based analysis models such as when using a fault tree analysis, hazards with vague properties are normally waived and ignored. In other word in previous situations only a traditional probability based fault tree analysis could be implemented. To overcome this shortcoming fuzzy set theory is applied to fault tree analysis to combine the known and unknown data in which the pre-combined result will be determined under a fuzzy environment. This has been fulfilled by integration of a generic bow-tie based risk analysis model into the risk assessment phase of the Risk Management (RM) cycles as a backbone of the phase. For this reason Fault Tree Analysis (FTA) and Event Tree Analysis (ETA) are used to analyse one of the significant risk factors associated in offshore terminals. This process will eventually help the insurers and risk managers in marine and offshore industries to investigate the potential hazards more in detail if there is vagueness. For this purpose a case study of offshore terminal while coinciding with the nature of the Caspian Sea was decided to be examined.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.4
• /
• pp.29-37
• /
• 2010

The change detection of XML documents is a major research area. However, though XML becomes a file format for Hangul documents, research on change detection of Hangul documents based on the characteristics of Hangul documents is rather scarce. Since format data in Hangul documents are very large, which is different from ordinary XML documents, it is not proper to apply general XML change detection algorithms such as X-treeDiff+ to Hangul documents without any change. In this paper, we propose new contents-based matching algorithm and implement it in X-treeDiff+. The result of our testing shows better performance for most documents in editing process.

• Journal of Forest and Environmental Science
• /
• v.39 no.4
• /
• pp.203-212
• /
• 2023

Directional felling is a felling method practised by the Forestry Department in Peninsular Malaysia as prescribed in Field Work Manual (1997) for Selective Management Systems (SMS) in forest harvesting. Determining the direction of tree felling in Peninsular Malaysia is conducted during the pre-felling inventory 1 to 2 years before the felling operation. This study aimed to predict and analyze the direction of tree felling using the vector-based path distance back link method in Geographic Information Systems (GIS) and compare it with the felling direction observed on the ground. The study area is at Balah Forest Reserve, Kelantan, Peninsular Malaysia. A Path Distance Back Link (spatial analyst) function in ArcGIS Pro 3.0 was used in predicting tree felling direction. Meanwhile, a binary classification was used to compare the felling direction estimated using GIS and the tree felling direction observed on the ground. Results revealed that 61.3% of 31 trees predicted using the vector-based projection method were similar to the felling direction observed on the ground. It is important to note that dynamic changes of natural constraints might occur in the middle of tree felling operation, such as weather problems, wind speed, and unpredicted tree falling direction.

• 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.