• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.2
• /
• pp.41-50
• /
• 2017

The purpose of this paper is to improve the service tree analysis introduced recently by Geum et al. [15]. Service tree analysis structures the service based on the customer participation perspective and provides a qualitative analysis method categorizing the service elements on the basis of its impact to top service. This paper attempts to apply the concept of reliability importance to the service tree analysis as a perspective of quantitative analysis, which is considered little in Geum et al. [15]. Reliability importance is a measure of the structural impact of the components that make up the system on the system lifetime in reliability engineering field and often used in fault tree analysis. We transform the reliability importance into service importance in accordance with service tree analysis, so that the influence of service elements on the service can be judged and compared. The service importance is defined as the amount of change of the service according to the change of the service element, therefore, it can be utilized as an index for determining a service element for service improvement. In addition, as an index for paired service elements, the relationship between the two service components can be measured by joint service importance. This paper introduces conceptual changes in the process of applying reliability importance to service analysis, and shows how to use the service importance for identifying the priority of service element for the final service and improving customer satisfaction through an example. By using the service importance and joint service importance in service tree analysis, it is possible to make efficient decision making in the process of determining the service elements for analyzing and improving the service.

• Journal of Information Technology Services
• /
• v.20 no.2
• /
• pp.111-126
• /
• 2021

A Kano model was used to classify the quality attributes of the service robot function for actual deployment that can support and replace bank employees. Quality attributes for a total of 6 dimensions and 23 service elements were divided into bank employees and customer groups, and service priorities were derived after comparative analysis. The Decision tree model was used to supplement the excessive simplification of quality attributes by the modest number of Kano models and to classify and predict by segment market. Of the 23 services, 16 were classified into the same attributes in both groups. 6 services classified as combination attributes used a Decision tree to identify differences in perception of quality attributes among groups. In terms of basic financial services and professional financial services, it was confirmed that bank employees feel financial service robots more attractive than ordinary customers. In the design of IT convergence service, we propose a methodology for deriving quality attributes by combining a Kano model for classifying quality attributes of two groups and a Decision tree for forecasting subdivision markets.

• Journal of Internet Computing and Services
• /
• v.16 no.6
• /
• pp.23-30
• /
• 2015

As BigData is issued, many applications that operate based on the results of data analysis have been developed, typically applications are products recommend service of e-commerce application service system, search service on the search engine service and friend list recommend system of social network service. In this paper, we suggests a decision frequent pattern tree that is combined the origin frequent pattern tree that is mining similar pattern to appear in the data set of the existing data mining techniques and decision tree based on the theory of computer science. The decision frequent pattern tree algorithm improves about problem of frequent pattern tree that have to make some a lot's pattern so it is to hard to analyze about data. We also proposes to model for a Mapredue framework that is a programming model to help to operate in distributed environment.

• Journal of Information Processing Systems
• /
• v.13 no.3
• /
• pp.546-558
• /
• 2017

The amount of multimedia traffic over the Internet has been increasing because of the development of networks and mobile devices. Accordingly, studies on multicast, which is used to provide efficient multimedia and video services, have been conducted. In particular, studies on centralized multicast tree construction have attracted attention with the advent of software-defined networking. Among the centralized multicast tree construction algorithms, the group Takahashi and Matsuyama (GTM) algorithm is the most commonly used in multiple multicast tree construction. However, the GTM algorithm considers only the network-cost overhead when constructing multicast trees; it does not consider the temporary service disruption that arises from a link change for users receiving an existing service. Therefore, in this study, we propose a multiple multicast tree construction algorithm that can reduce network cost while avoiding considerable degradation of service quality to users. This is accomplished by considering both network-cost and link-change overhead of users. Experimental results reveal that, compared to the GTM algorithm, the proposed algorithm significantly improves the user-experienced quality of service by substantially reducing the number of linkchanged users while only slightly adding to the network-cost overhead.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.2
• /
• pp.203-210
• /
• 2015

The ecological environment monitoring system configured with Sensor Node, Gateway, Service Platform, and Web Browser. In this paper, we designed gateway resource tree and service function to do handling in the ecological environment monitoring service. Gateway Service Function based on oneM2M Common Service Function, Gateway Resource Tree configured with Application Part handling Sensor Data and Gateway link handling. lastly Device Registration, Sensing, Control, Profile Management.

• Journal of Internet Computing and Services
• /
• v.5 no.5
• /
• pp.129-138
• /
• 2004

In the telecommunications network, multicasting is widely used recently. Multicast tree problem is modeled as the NP-complete Steiner problem in the networks. In this paper, we study algorithms for finding efficient multicast trees with hop and node degree constraints. Multimedia service is an application of multicasting and it is required to transfer a large volume of multimedia data with QoS(Quality of Service). Though heuristics for solving the multicast tree problems with one constraint have been studied. however, there is no optimum algorithm that finds an optimum multicast tree with hop and node degree constraints up to now. In this paper, an approach for finding an efficient multicast tree that satisfies hop and node degree constraints is presented and the experimental results explain how the hop and node degree constraints affect to the total cost of a multicast tree.

• Journal of KIISE:Software and Applications
• /
• v.36 no.2
• /
• pp.144-152
• /
• 2009

To provide intelligent service in mobile environment, it needs to estimate user's intention or requirement, through analyzing context information of end-users such as preference or behavior patterns. In this paper, we infer context information from uncertain log stored in mobile device. And we propose the inference method of end-user's behavior to match context information with service, and the proposed method is based on context-tree. We adopt bayesian probabilistic method to infer uncertain context information effectively, and the context-tree is constructed to utilize non-numerical context which is hard to handled with mathematical method. And we verify utility of proposed method by appling the method to intelligent phone book service.

• Journal of Korean Society for Quality Management
• /
• v.42 no.1
• /
• pp.71-79
• /
• 2014

Purpose: The purpose of this study is to develop the methods for evaluating patients' queue environment using decision tree and queueing theory. Methods: This study uses CHAID decision tree and M/G/1 queueing theory to estimate pain point and patients waiting time for medical service. This study translates hospital physical data process to logical process to adapt queueing theory. Results: This study indicates that three nodes of the system has predictable problem with patients waiting time and can be improved by relocating patients to other nodes. Conclusion: This study finds out three seek points of the hospital through decision tree analysis and substitution nodes through the queueing theory. Revealing the hospital patients' queue environment, this study has several limitations such as lack of various case and factors.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.12
• /
• pp.1405-1414
• /
• 2014

The office management service platform configured with office's sensor devices, G/DSCL(Gateway/Device Service Capability Layer), NSCL(Network Service Capability Layer), and NA(Network Application). In this paper, we designed gateway resource tree and service scenario to fit the office management service and demonstrated appropriate operation of the office management service through intelligent functional modeling.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2886-2896
• /
• 1996

The Type of Service based multicast routing algorithm is necessary to support efficiently herogeneous applications in ATM network. In this paper I propose the Constrained Multicast Tree with Virtual Destination(DMTVD) heuristic algorithm as least cost multicast routing algorithm. The service is categorized into two types, as delay sensitive and non in CMTVD algorithm. For the delay sensitive service type, the cost optimized route is the Minimum Cost Stenier Tree connecting all the destination node group, virtual destination node group and source node with least costs, subject to the delay along the path being less than the maximum allowable end to end delay. The other side for the non-delay sensitive service, the cost optimized route is the MCST connecting all the multicast groups with least costs, subject to the traffic load is balanced in the network. The CMTVD algorithm is based on the Constrained Multicasting Tree algorithm but regards the nodes branching multiple destination nodes as virtural destination node. The experimental results show that the total route costs is enhanced 10%-15% than the CTM algorithm.