• Title/Summary/Keyword: Case-based Reasoning System

Search Result 268, Processing Time 0.031 seconds

Optimizing Product Design in Cyberspace through Knowledge Mining Agents

  • Kim, Steven H.;Park, Hwa-Gyoo;Chae, Bong-Sug;Shin, Sung-Woo;Lee, Tae-Jong
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1998.10a
    • /
    • pp.56-59
    • /
    • 1998
  • The rapid diffusion of the Internet and the World Wide Web is facilitating greater interaction - and potential opportunities for customization - between vendors and customers. For instance, virtual reality and multimedia technologies allow consumers to envision their designed products. The increasing pace of the business environment highlights the need to deploy intelligent systems in all stages of product design and production planning. This paper deals with a system to generate an appropriate product design by adapting customer preferences and constraints using the case based reasoning methodology. Moreover, intelligent agents are integrated with virtual reality technology to provide a friendly user interface.

  • PDF

Decision support system on selection of classification method for remote sensing imagery (위성 영상 분류 기법 선정을 위한 의사 결정 지원 시스템)

  • 황보주원;유기윤;김용일
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2004.03a
    • /
    • pp.341-346
    • /
    • 2004
  • 본 연구에서는 사례기반추론(case-based reasoning)을 기본으로 하여 실무자의 분류 기법 또는 분류 구조 결정을 돕는 의사 결정 지원 시스템의 모델을 제시한다. 주요한 네 가지 고려 항목은 자료종류(dataset), 위치(location), 기후(climate), 그리고 분류항목(class)이며 사용자는 이들 네 항목에 대해 적합한 값을 선택하게 된다. 본 시스템은 색인화(indexing) 규칙에 따라 관계형 데이터베이스에 저장된 사례들을 추출하여 제시하며 사용자는 그 중 가장 높은 일치도를 보인 사례들을 참고할 수 있다. 본 연구에서는 위계구조를 통해 다양한 분류 조건을 스크린 상에서 선택할 수 있게 함으로써 사용자가 이에 내재된 논리를 분류 구조의 설계에 반영할 수 있게 한다. 또한 Statistics 기능을 통해 여러 사례의 항목당 분포를 사용자가 검토할 수 있게 함으로써 가장 적합한 사례를 의사결정 지원 시스템과의 피드백을 통해 찾아낼 수 있게 해준다. 이밖에 분류 조건을 변화 시켜가면서 상황의 변화를 참고할 수 있도록 Navigation 기능을 고안하였다.

  • PDF

Maintenance & Diagnosis System of AS/RS (자동창고의 예방보전 및 진단시스템 개발)

  • 이현용;송준엽;김동훈
    • Proceedings of the Safety Management and Science Conference
    • /
    • 1999.11a
    • /
    • pp.123-131
    • /
    • 1999
  • 최근에는 수요자 요구의 다양화, 전문인력의 부족, 고임금화, 열악한 작업장에서의 작업기피 현상 등의 영향으로 인해 생산 및 물류의 자동화가 활발히 추진되고 있다. 생산 및 물류시스템의 자동화가 진전됨에 따라 전체 시스템의 물류합리화에 중요한 역할을 담당하는 자동창고 시스템에 대한 설비관리 체계 구축이 필요하게 되었고, 그 일환으로 본 연구에서는 자동창고에 대한 예방보전 및 원인진단을 지원하는 자동창고의 예방보전 및 진단시스템을 개발하였다. 특히 자동창고의 이상을 진단하는데 과거의 트러블내용을 사례로 등록시키고, 전문가가 문제해결에 사용한 경험데이타, 즉 조사항목, 조사결과 및 대처내용을 진단용 사례기반 추론베이스로 구축하여 활용하는 사례기반추론(Case Based Reasoning)방법으로 접근시켰다. 또한 자동창고시스템의 예방보전, 사후보전, 이력관리 기능을 수행할 수 있는 운영소프트웨어를 개발하였다.

  • PDF

An Integrated Approach Using Change-Point Detection and Artificial neural Networks for Interest Rates Forecasting

  • Oh, Kyong-Joo;Ingoo Han
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2000.04a
    • /
    • pp.235-241
    • /
    • 2000
  • This article suggests integrated neural network models for the interest rate forecasting using change point detection. The basic concept of proposed model is to obtain intervals divided by change point, to identify them as change-point groups, and to involve them in interest rate forecasting. the proposed models consist of three stages. The first stage is to detect successive change points in interest rate dataset. The second stage is to forecast change-point group with data mining classifiers. The final stage is to forecast the desired output with BPN. Based on this structure, we propose three integrated neural network models in terms of data mining classifier: (1) multivariate discriminant analysis (MDA)-supported neural network model, (2) case based reasoning (CBR)-supported neural network model and (3) backpropagation neural networks (BPN)-supported neural network model. Subsequently, we compare these models with a neural networks (BPN)-supported neural network model. Subsequently, we compare these models with a neural network model alone and, in addition, determine which of three classifiers (MDA, CBR and BPN) can perform better. This article is then to examine the predictability of integrated neural network models for interest rate forecasting using change-point detection.

  • PDF

Knowledge Discovery Process In Internet For Effective Knowledge Creation : Application To Stock Market (효과적인 지식창출을 위한 인터넷 상의 지식채굴과정 : 주식시장에의 응용)

  • 김경재;홍태호;한인구
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 1999.03a
    • /
    • pp.105-113
    • /
    • 1999
  • 최근 데이터와 데이터베이스의 폭발적 증가에 따라 무한한 데이터 속에서 정보나 지식을 찾고자하는 지식채굴과정(Knowledge discovery process)에 대한 관심이 높아지고 있다. 특히 기업 내외부 데이터베이스 뿐만 아니라 데이터웨어하우스(data warehouse)를 기반으로 하는 OLAP 환경에서의 데이터와 인터넷을 통한 웹(web)에서의 정보 등 정보원의 다양화와 첨단화에 따라 다양한 환경 하에서의 지식 채굴과정이 요구되고 있다. 본 연구에서는 인터넷 상의 지식을 효과적으로 채굴하기 위한 지식채굴과정을 제안한다. 제안된 지식채굴과정은 명시지(explicit knowledge)외에 암묵지(tacit knowledge)를 지식채굴과정에 반영하기 위해 선행지식베이스(prior knowledge base)와 선행지식관리시스템(prior knowledge management system)을 이용한다. 선행지식관리시스템은 퍼지인식도(fuzzy cognitive map)를 이용하여 선행지식베이스를 구축하여 이를 통해 웹에서 찾고자 하는 유용한 정보를 정의하고 추출된 정보를 지식변환시스템(knowledge transformation system)을 통해 통합적인 추론과정에 사용할 수 있는 형태로 변환한다. 제안된 연구모형의 유용성을 검증하기 위하여 재무자료에 선행지식을 제외한 자료와 선행지식을 포함한 자료를 사례기반추론 (case-based reasoning)을 이용하여 실험한 결과, 제안된 지식채굴과정이 유용한 것으로 나타났다.

  • PDF

u-Mentoring System에서 속성 온톨로지와 CBR을 사용한 M3 알고리즘

  • Son, Mi-Ae;Gang, Cho-Rong
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2007.11a
    • /
    • pp.479-486
    • /
    • 2007
  • 멘토링은 조직이나 사회 구성원들의 발전을 돕기 위한 프로그램으로서, 조언자, 상담자 및 후원자 역할을 하는 '멘토(mentor)'와 도움을 얻고자 하는 '멘티(mentee)'가 긴밀한 관계를 맺고 유지함으로써 상호 발전을 위해 수행된다. 현재 이루어지고 있는 대부분의 멘토링은 면대면 (face-to-face) 시스템이거나 웹 기반의 e-mentoring 시스템으로, 전자는 시간적 그리고 지역적 한계를 극복해야만 하고 후자는 멘토나 멘티가 멘토링 사이트에 접속하여 게시판을 확인하지 않으면 제대로 된 멘토링을 수행할 수 없다는 한계를 가지고 있다. 또한 멘토와 멘티의 매칭은 무작위로 이루어지거나 코디네이터라고 불리는 사람이 수행하기 때문에, 비용이 많이 소용될 뿐 아니라 개인적인 편견이나 오류가 개입될 여지가 상존한다. 이에 본 연구에서는 시간과 장소의 제약에 구애 받지 않는 u-Mentoring 시스템을 개발하고자 하며, 그 첫 단계로써 멘토와 멘티간의 매칭을 지원하는 새로운 알고리즘(M3 Algorithm, Mentor-Mentee Matching Algorithm)을 제안하고자 한다. 본 연구에서 제안하는 알고리즘은 매칭의 정확도와 멘토-멘티의 매칭 만족도를 높이기 위해 멘토-멘티 온톨로지(M-Ontology)와 사례기반추론 기법을 사용하였다. 즉, 멘토-멘티의 효과적인 매칭을 위해, 멘토-멘티간 매칭 사례가 없는 초기 단계에는 멘토와 멘티의 속성 비교를 통한 추천 방식을 사용하고, 멘토링이 종료되어 충분한 멘토-멘티간 매칭사례가 수집되면 그 결과를 재사용해 추후 매칭에 활용한다. 본 논문에서는 제안한 매칭 알고리즘이 내장된 u-Mentoring system의 포로토타입을 보여주고자 한다.

  • PDF

A Comparative Study of Estimation by Analogy using Data Mining Techniques

  • Nagpal, Geeta;Uddin, Moin;Kaur, Arvinder
    • Journal of Information Processing Systems
    • /
    • v.8 no.4
    • /
    • pp.621-652
    • /
    • 2012
  • Software Estimations provide an inclusive set of directives for software project developers, project managers, and the management in order to produce more realistic estimates based on deficient, uncertain, and noisy data. A range of estimation models are being explored in the industry, as well as in academia, for research purposes but choosing the best model is quite intricate. Estimation by Analogy (EbA) is a form of case based reasoning, which uses fuzzy logic, grey system theory or machine-learning techniques, etc. for optimization. This research compares the estimation accuracy of some conventional data mining models with a hybrid model. Different data mining models are under consideration, including linear regression models like the ordinary least square and ridge regression, and nonlinear models like neural networks, support vector machines, and multivariate adaptive regression splines, etc. A precise and comprehensible predictive model based on the integration of GRA and regression has been introduced and compared. Empirical results have shown that regression when used with GRA gives outstanding results; indicating that the methodology has great potential and can be used as a candidate approach for software effort estimation.

Development of Music Recommendation System based on Customer Sentiment Analysis (소비자 감성 분석 기반의 음악 추천 알고리즘 개발)

  • Lee, Seung Jun;Seo, Bong-Goon;Park, Do-Hyung
    • Journal of Intelligence and Information Systems
    • /
    • v.24 no.4
    • /
    • pp.197-217
    • /
    • 2018
  • Music is one of the most creative act that can express human sentiment with sound. Also, since music invoke people's sentiment to get empathized with it easily, it can either encourage or discourage people's sentiment with music what they are listening. Thus, sentiment is the primary factor when it comes to searching or recommending music to people. Regard to the music recommendation system, there are still lack of recommendation systems that are based on customer sentiment. An algorithm's that were used in previous music recommendation systems are mostly user based, for example, user's play history and playlists etc. Based on play history or playlists between multiple users, distance between music were calculated refer to basic information such as genre, singer, beat etc. It can filter out similar music to the users as a recommendation system. However those methodology have limitations like filter bubble. For example, if user listen to rock music only, it would be hard to get hip-hop or R&B music which have similar sentiment as a recommendation. In this study, we have focused on sentiment of music itself, and finally developed methodology of defining new index for music recommendation system. Concretely, we are proposing "SWEMS" index and using this index, we also extracted "Sentiment Pattern" for each music which was used for this research. Using this "SWEMS" index and "Sentiment Pattern", we expect that it can be used for a variety of purposes not only the music recommendation system but also as an algorithm which used for buildup predicting model etc. In this study, we had to develop the music recommendation system based on emotional adjectives which people generally feel when they listening to music. For that reason, it was necessary to collect a large amount of emotional adjectives as we can. Emotional adjectives were collected via previous study which is related to them. Also more emotional adjectives has collected via social metrics and qualitative interview. Finally, we could collect 134 individual adjectives. Through several steps, the collected adjectives were selected as the final 60 adjectives. Based on the final adjectives, music survey has taken as each item to evaluated the sentiment of a song. Surveys were taken by expert panels who like to listen to music. During the survey, all survey questions were based on emotional adjectives, no other information were collected. The music which evaluated from the previous step is divided into popular and unpopular songs, and the most relevant variables were derived from the popularity of music. The derived variables were reclassified through factor analysis and assigned a weight to the adjectives which belongs to the factor. We define the extracted factors as "SWEMS" index, which describes sentiment score of music in numeric value. In this study, we attempted to apply Case Based Reasoning method to implement an algorithm. Compare to other methodology, we used Case Based Reasoning because it shows similar problem solving method as what human do. Using "SWEMS" index of each music, an algorithm will be implemented based on the Euclidean distance to recommend a song similar to the emotion value which given by the factor for each music. Also, using "SWEMS" index, we can also draw "Sentiment Pattern" for each song. In this study, we found that the song which gives a similar emotion shows similar "Sentiment Pattern" each other. Through "Sentiment Pattern", we could also suggest a new group of music, which is different from the previous format of genre. This research would help people to quantify qualitative data. Also the algorithms can be used to quantify the content itself, which would help users to search the similar content more quickly.

Response Modeling for the Marketing Promotion with Weighted Case Based Reasoning Under Imbalanced Data Distribution (불균형 데이터 환경에서 변수가중치를 적용한 사례기반추론 기반의 고객반응 예측)

  • Kim, Eunmi;Hong, Taeho
    • Journal of Intelligence and Information Systems
    • /
    • v.21 no.1
    • /
    • pp.29-45
    • /
    • 2015
  • Response modeling is a well-known research issue for those who have tried to get more superior performance in the capability of predicting the customers' response for the marketing promotion. The response model for customers would reduce the marketing cost by identifying prospective customers from very large customer database and predicting the purchasing intention of the selected customers while the promotion which is derived from an undifferentiated marketing strategy results in unnecessary cost. In addition, the big data environment has accelerated developing the response model with data mining techniques such as CBR, neural networks and support vector machines. And CBR is one of the most major tools in business because it is known as simple and robust to apply to the response model. However, CBR is an attractive data mining technique for data mining applications in business even though it hasn't shown high performance compared to other machine learning techniques. Thus many studies have tried to improve CBR and utilized in business data mining with the enhanced algorithms or the support of other techniques such as genetic algorithm, decision tree and AHP (Analytic Process Hierarchy). Ahn and Kim(2008) utilized logit, neural networks, CBR to predict that which customers would purchase the items promoted by marketing department and tried to optimized the number of k for k-nearest neighbor with genetic algorithm for the purpose of improving the performance of the integrated model. Hong and Park(2009) noted that the integrated approach with CBR for logit, neural networks, and Support Vector Machine (SVM) showed more improved prediction ability for response of customers to marketing promotion than each data mining models such as logit, neural networks, and SVM. This paper presented an approach to predict customers' response of marketing promotion with Case Based Reasoning. The proposed model was developed by applying different weights to each feature. We deployed logit model with a database including the promotion and the purchasing data of bath soap. After that, the coefficients were used to give different weights of CBR. We analyzed the performance of proposed weighted CBR based model compared to neural networks and pure CBR based model empirically and found that the proposed weighted CBR based model showed more superior performance than pure CBR model. Imbalanced data is a common problem to build data mining model to classify a class with real data such as bankruptcy prediction, intrusion detection, fraud detection, churn management, and response modeling. Imbalanced data means that the number of instance in one class is remarkably small or large compared to the number of instance in other classes. The classification model such as response modeling has a lot of trouble to recognize the pattern from data through learning because the model tends to ignore a small number of classes while classifying a large number of classes correctly. To resolve the problem caused from imbalanced data distribution, sampling method is one of the most representative approach. The sampling method could be categorized to under sampling and over sampling. However, CBR is not sensitive to data distribution because it doesn't learn from data unlike machine learning algorithm. In this study, we investigated the robustness of our proposed model while changing the ratio of response customers and nonresponse customers to the promotion program because the response customers for the suggested promotion is always a small part of nonresponse customers in the real world. We simulated the proposed model 100 times to validate the robustness with different ratio of response customers to response customers under the imbalanced data distribution. Finally, we found that our proposed CBR based model showed superior performance than compared models under the imbalanced data sets. Our study is expected to improve the performance of response model for the promotion program with CBR under imbalanced data distribution in the real world.

Distributed Table Join for Scalable RDFS Reasoning on Cloud Computing Environment (클라우드 컴퓨팅 환경에서의 대용량 RDFS 추론을 위한 분산 테이블 조인 기법)

  • Lee, Wan-Gon;Kim, Je-Min;Park, Young-Tack
    • Journal of KIISE
    • /
    • v.41 no.9
    • /
    • pp.674-685
    • /
    • 2014
  • The Knowledge service system needs to infer a new knowledge from indicated knowledge to provide its effective service. Most of the Knowledge service system is expressed in terms of ontology. The volume of knowledge information in a real world is getting massive, so effective technique for massive data of ontology is drawing attention. This paper is to provide the method to infer massive data-ontology to the extent of RDFS, based on cloud computing environment, and evaluate its capability. RDFS inference suggested in this paper is focused on both the method applying MapReduce based on RDFS meta table, and the method of single use of cloud computing memory without using MapReduce under distributed file computing environment. Therefore, this paper explains basically the inference system structure of each technique, the meta table set-up according to RDFS inference rule, and the algorithm of inference strategy. In order to evaluate suggested method in this paper, we perform experiment with LUBM set which is formal data to evaluate ontology inference and search speed. In case LUBM6000, the RDFS inference technique based on meta table had required 13.75 minutes(inferring 1,042 triples per second) to conduct total inference, whereas the method applying the cloud computing memory had needed 7.24 minutes(inferring 1,979 triples per second) showing its speed twice faster.