http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
홍진원,김재련,Hong, Jin-Won,Kim, Jae-Yearn 한국산업경영시스템학회 1995 한국산업경영시스템학회지 Vol.18 No.36
This paper determines the allocation of computers and data files to minimize the sum of processing and communication costs which occur in processing jobs at each node. The problem of optimally configuring a distributed computer system belongs to the class of NP-Complete problems and the object function of this paper is nonlinear function and is hard to solve. This paper seeks the solution of distributed processing system by Tabu Search. Firstly, it presents the method of generating the starting solution proper to the distributed processing system. Secondly, it develops the method of searching neighborhood solutions. Finally, it determines the Tabu restriction appropriate to the distributed processing system. According to the experimental results, this algorithm solves a sized problems in reasonable time and is effective in the convergence of the solution. The algorithm developed in this paper is also applicable to the general allocation problems of the distributed processing system.
러프셋 이론과 개체 관계 비교를 통한 의사결정나무 구성
한상욱(Sang-Wook Han),김재련(Jae-Yearn Kim) 대한산업공학회 2007 대한산업공학회지 Vol.33 No.2
We present a new decision tree classification algorithm using rough set theory that can induce classification rules, the construction of which is based on core attributes and relationship between objects. Although decision trees have been widely used in machine learning and artificial intelligence, little research has focused on improving classification quality. We propose a new decision tree construction algorithm that can be simplified and provides an improved classification quality. We also compare the new algorithm with the ID3 algorithm in terms of the number of rules.
서완석(Wan-Seok Seo),김재련(Jae-Yearn Kim) 한국산업경영시스템학회 2005 한국산업경영시스템학회지 Vol.28 No.1
Data mining is widely used for turning huge amounts of data into useful information and knowledge in the information industry in recent years. When analyzing data set with continuous values in order to gain knowledge utilizing data mining, we often undergo a process called discretization, which divides the attribute's value into intervals. Such intervals from new values for the attribute allow to reduce the size of the data set. In addition, discretization based on rough set theory has the advantage of being easily applied. In this paper, we suggest a discretization algorithm based on Rough Set theory and SOM(Self-Organizing Map) as a means of extracting valuable information from large data set, which can be employed even in the case where there lacks of professional knowledge for the field.
오승준(Seung-Joon Oh),김재련(Jae-Yearn Kim) 한국지능시스템학회 2004 한국지능시스템학회논문지 Vol.14 No.2
소매점 거래 데이터와 단백질 시퀀스, 웹 로그 등과 같은 상업적이거나 과학적인 데이터의 폭발적인 증가를 볼 수 있다. 이런 데이터들은 순서적인 면을 가지고 있는 시퀀스 데이터들이다. 그러나, 순서적인 면을 고려한 클러스터링 알고리듬은 소수이다. 따라서, 본 연구에서는 시퀀스 데이터들을 클러스터링 하는 방법을 연구한다. 시퀀스들 간의 유사도를 계산하기 위한 새로운 유사도를 제안한다. 또한, 유사도를 효율적으로 계산하기 위한 방법과 클러스터링 방법도 제안한다. 계층적 클러스터링 알고리듬은 높은 계산량을 가지고 있기에, 새로운 클러스터링 방법이 요구된다. 그러므로, 본 연구에서는 샘플링과 k-nn 방법을 이용한 확장성 있는 클러스터링 방법을 제안한다. 실제 데이터 셋과 합성 데이터 셋을 이용하여, 본 연구에서 제안하는 방법이 기존 방법보다 성능이 우수함을 보여준다. There has been enormous growth in the amount of commercial and scientific data, such as retail transactions, protein sequences, and web-logs. Such datasets consist of sequence data that have an inherent sequential nature. However, few clustering algorithms consider sequentiality. In this paper, we study how to cluster sequence datasets. We propose a new similarity measure to compute the similarity between two sequences. We also present an efficient method for determining the similarity measure and develop a clustering algorithm. Due to the high computational complexity of hierarchical clustering algorithms for clustering large datasets, a new clustering method is required. Therefore, we propose a new scalable clustering method using sampling and a k-nearest-neighbor method. Using a real dataset and a synthetic dataset, we show that the quality of clusters generated by our proposed approach is better than that of clusters produced by traditional algorithms.
엔트로피 기반 분할과 중심 인스턴스를 이용한 분류기법의 데이터 감소
손승현(Seung-Hyun Son),김재련(Jae-Yearn Kim) 한국산업경영시스템학회 2006 한국산업경영시스템학회지 Vol.29 No.2
The instance-based learning is a machine learning technique that has proven to be successful over a wide range of classification problems. Despite its high classification accuracy, however, it has a relatively high storage requirement and because it must search through all instances to classify unseen cases, it is slow to perform classification. In this paper, we have presented a new data reduction method for instance-based learning that integrates the strength of instance partitioning and attribute selection. Experimental results show that reducing the amount of data for instance-based learning reduces data storage requirements, lowers computational costs, minimizes noise, and can facilitates a more rapid search.
고객의 행동 변화를 통한 신규고객 세분화와 구매항목 예측
도희정(Hee Jung Do),김재련(Jae Yearn Kim) 대한산업공학회 2007 대한산업공학회지 Vol.33 No.3
Since the 1980s, the marketing paradigm has rapidly changed from product-driven marketing to customer-driven marketing. Recently, due to an increase in the amount of information, customer-differentiation strategies have been emphasized more than product-differentiation strategies. This paper suggests a methodology for new customer segmentation and purchase forecasting using changes in customer behavior. This methodology includes a segmentation method for new customers using existing customer’s characteristics and a purchase-forecasting system using the purchase-behavior patterns of existing customers. The proposed methodology not only provides differential services from a segmentation system but also recommends differential items from the purchase forecasting system for new and existing customers.