• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.1
• /
• pp.90-99
• /
• 2003

Object clustering, which makes classification for a set of objects into a number of groups such that objects included in a group have similar characteristic and objects in different groups have dissimilar characteristic each other, has been exploited in diverse area such as information retrieval, data mining, group technology, etc. In this study, an object-clustering problem with similarity coefficients between objects is considered. At first, an evaluation function for the optimization problem is defined. Then, a genetic algorithm and local optimization technique based on heuristic method are proposed and used in order to obtain near optimal solutions. Solutions from the genetic algorithm are improved by local optimization techniques based on object relocation and cluster merging. Throughout extensive experiments, the validity and effectiveness of the proposed algorithms are tested.

• The KIPS Transactions:PartD
• /
• v.16D no.1
• /
• pp.113-122
• /
• 2009

Since the traditional pattern mining methods only probe unspecified moving patterns that seem to satisfy users' requests among diverse patterns within the limited scopes of time and space, they are not applicable to problems involving the mining of optimal moving patterns, which contain complex time and space constraints, such as 1) searching the optimal path between two specific points, and 2) scheduling a path within the specified time. Therefore, in this paper, we illustrate some problems on mining the optimal moving patterns with complex time and space constraints from a vast set of historical data of numerous moving objects, and suggest a new moving pattern mining method that can be used to search patterns of an optimal moving path as a location-based service. The proposed method, which determines the optimal path(most frequently used path) using pattern frequency retrieved from historical data of moving objects between two specific points, can efficiently carry out pattern mining tasks using by space generalization at the minimum level on the moving object's location attribute in consideration of topological relationship between the object's location and spatial scope. Testing the efficiency of this algorithm was done by comparing the operation processing time with Dijkstra algorithm and $A^*$ algorithm which are generally used for searching the optimal path. As a result, although there were some differences according to heuristic weight on $A^*$ algorithm, it showed that the proposed method is more efficient than the other methods mentioned.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.79-93
• /
• 2009

For developing the location based service which is individualized and specialized according to the characteristic of the users, the spatio-temporal pattern mining for extracting the meaningful and useful patterns among the various patterns of the mobile object on the spatio-temporal area is needed. Thus, in this paper, as the practical application toward the development of the location based service in which it is able to apply to the real life through the pattern mining from the huge historical data of mobile object, we are proposed STOMP(using Frequency of sequence and Weight) that is the new mining method for extracting the patterns with spatial and temporal constraint based on the problems of mining the optimal moving pattern which are defined in STOMP(F)[25]. Proposed method is the pattern mining method compositively using weighted value(weights) (a distance, the time, a cost, and etc) for our previous research(STOMP(F)[25]) that it uses only the pattern frequent occurrence. As to, it is the method determining the moving pattern in which the pattern frequent occurrence is above special threshold and the weight is most a little bit required among moving patterns of the object as the optimal path. And also, it can search the optimal path more accurate and faster than existing methods($A^*$, Dijkstra algorithm) or with only using pattern frequent occurrence due to less accesses to nodes by using the heuristic moving history.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.11-18
• /
• 2006

The logical analysis of data(LAD) is a Boolean-logic based data mining tool. A critical step in analyzing data by LAD is the pattern generation stage where useful knowledge and hidden structural information in data is discovered in the form of patterns. A conventional method for pattern generation in LAD is based on term enumeration that renders the generation of higher degree patterns practically impossible. In this paper, we present a novel optimization-based pattern generation methodology and propose two mathematical programming models, a mixed 0-1 integer and linear programming (MILP) formulation and a well-studied set covering problem (SCP) formulation for the generation of optimal and heuristic patterns, respectively. With benchmark datasets, we demonstrate the effectiveness of our models by automatically generating with ease patterns of high complexity that cannot be generated with the conventional approach.

• Information Systems Review
• /
• v.21 no.1
• /
• pp.135-152
• /
• 2019

Recently there are many development and support policies for start-up companies because of successful venture companies related to ICT services. However, as these policies have focused on the support for the initial stage of start-up, many start-up companies have difficulties to continuously grow up. The main reason for these difficulties is that they recognize start-up tasks as independent activities. However, many experts or related articles say that start-up tasks are composed of related processes from the initial stage to the stable stage of start-up firms. In this study, we models the start-up processes based on the survey collected by the start-up companies, and analyze the start-up process of ICT service companies with process mining techniques. Through process mining analysis, we can draw a sequential flow of tasks for start-ups and the characteristics of them. The analysis of start-up businessman, idea derivation, creating business model, business diversification processes are resulted as important processes, but marketing activity and managing investment funds are not. This result means that marketing activity and managing investment funds are activities that need ongoing attention. Moreover, we can find temporal and complementary tasks which could not be captured by independent individual-level activity analysis. Our process analysis results are expected to be used in simulation-based web-intelligent system to support start-up business, and more cumulated start-up business cases will be helpful to give more detailed individual-level personalization service. And our proposed process model and analyzing results can be used to solve many difficulties for start-up companies.

• Journal of Intelligence and Information Systems
• /
• v.9 no.1
• /
• pp.157-177
• /
• 2003

This paper presents a comprehensive and successful application of data mining methodologies to improve and predict wafer yield in a semiconductor wafer fabrication system. As the wafer fabrication process is getting more complex and the volume of technological data gathered continues to be vast, it is difficult to analyze the cause of yield deterioration effectively by means of statistical or heuristic approaches. To begin with this paper applies a clustering method to automatically identify AUF (Area Uniform Failure) phenomenon from data instead of naked eye that bad chips occurs in a specific area of wafer. Next, sequential pattern analysis and classification methods are applied to and out machines and parameters that are cause of low yield, respectively. Furthermore, radial bases function method is used to predict yield of wafers that are in process. Finally, this paper demonstrates an information system, Y2R-PLUS (Yield Rapid Ramp-up, Prediction, analysis & Up Support), that is developed in order to analyze and predict wafer yield in a korea semiconductor manufacturer.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.409-413
• /
• 2005

The logical analysis of data(LAD) is an effective Boolean-logic based data mining tool. A critical step in analyzing data by LAD is the pattern generation stage where useful knowledge and hidden structural information in data is discovered in the form of patterns. A conventional method for pattern generation in LAD is based on term enumeration that renders the generation of higher degree patterns practically impossible. In this paper, we present a new optimization-based pattern generation methodology and propose two mathematical programming medels, a mixed 0-1 integer and linear programming(MILP) formulation and a well-studied set covering problem(SCP) formulation for the generation of optimal and heuristic patterns, respectively. With benchmark datasets, we demonstrate the effectiveness of our models by automatically generating with much ease patterns of high complexity that cannot be generated with the conventional approach.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.412-414
• /
• 2005

최근들어 기업의 업무가 더욱 전문화되고 복잡해짐에 따라 워크플로우 시스템도 복잡해지고 다양해 지고 있다. 이러한 문제로 인하여 실제 필요로 하는 프로세스의 관리 및 도출이 요구된다. 본 논문에서는 영향력있는 프로세스를 도출하고 지원하기 위한 워크플로우 마이닝에 관하여 분석한 후 분석을 바탕으로 상관관계분석과 주성분분석을 통하여 워크플로우를 보다 효율적으로 관리할 수 있는 마이닝 규칙을 제시한다.

• Journal of Computing Science and Engineering
• /
• v.1 no.2
• /
• pp.162-176
• /
• 2007

Machine Learning (ML) has become very popular within Data Mining (KDD) and Artificial Intelligence (AI) research and their applications. In the ML and KDD contexts, two main approaches can be used for inducing a Bayesian Network (BN) from data, namely, Conditional Independence (CI) and the Heuristic Search (HS). When a BN is induced for classification purposes (Bayesian Classifier - BC), it is possible to impose some specific constraints aiming at increasing the computational efficiency. In this paper a new CI based approach to induce BCs from data is proposed and two algorithms are presented. Such approach is based on the Markov Blanket concept in order to impose some constraints and optimize the traditional PC learning algorithm. Experiments performed with the ALARM, as well as other six UCI and three artificial domains revealed that the proposed approach tends to execute fewer comparison tests than the traditional PC. The experiments also show that the proposed algorithms produce competitive classification rates when compared with both, PC and Naive Bayes.

• Asia pacific journal of information systems
• /
• v.15 no.3
• /
• pp.209-221
• /
• 2005

One of the most fundamental problems in business is to evaluate the value of each product. The difficulty is that the profit of one product not only comes from its own sales, but also its influence on the sales of other products, i.e., the "cross-selling effect". This study integrates a measure for cross selling and an algorithm for profit estimation. Sales transaction data and post sales survey data from on-line and off-line shopping mall is used to show the effectiveness of the method against other heuristic for profit estimation based on product-specific profitability. We show that with the use of the new method we are able to identify the cross-selling potential of each product and use the information for better product selection.