• International Journal of Computer Science & Network Security
• /
• 제21권4호
• /
• pp.209-213
• /
• 2021

Data mining is the application of specific algorithms for extracting patterns from data and KDD is the automated or convenient extraction of patterns representing knowledge implicitly stored or captured in large databases, data warehouses, the Web, other massive information repositories or data streams. Data mining can be used for decision making in educational system. But educational institution does not use any knowledge discovery process approach on these data; this knowledge can be used to increase the quality of education. The problem was happening in the educational management system, but to make education system more flexible and discover knowledge from it huge data, we will use data mining techniques to solve problem.

• 한국정보과학회논문지:데이타베이스
• /
• 제28권1호
• /
• pp.42-47
• /
• 2001

실체뷰는 대량의 데이터웨어하우스에서 질의처리를 효과적으로 수행하기위한 대안으로서, 그 핵심은 각 데이터 원천에서의 데이터변화에 대응한 복합적인 뷰의 효과적인 관리 문제이다. 본 연구에서는 우선 실체뷰 관리에 관한 기존의 연구들을 일별함에 있어서 즉, 갱신의 주체문제, 갱신객체, 및 갱신시간 문제의 세가지 관점에서 본 연구의 위치를 결정한 다음, 대수적 접근법으로 복합뷰 갱신문제가 복잡해지는 원인을 규명하였다. 그 해법으로서 참조무결성을 활용한 복합 조인뷰의 갱신 알고리즘을 제안하면서, 여러 가지 참조무결성 제약조건과 트랜잭션과 관련된 자체갱신적 새로운 해법을 제시했다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2003년도 가을 학술발표논문집 Vol.30 No.2 (2)
• /
• pp.235-237
• /
• 2003

데이터베이스에 저장된 수많은 자료들을 사용자의 질의에 맞추어 웹상에서 표현해주는 것이 바로 리포팅 툴의 역할이다. 그에 관한 연구들로 인해서 EASY BASE, ReportShop 과 같은 여러 리포팅 툴들이 상용화되고 있다. 하지만 사용자가 보다 쉽고 직관적으로 XML문서를 작성하고 관리할 수 있는 툴들은 미흡한게 사실이다. 이 논문에서는 리포팅 툴의 기본이 되는 쿼리 결과를 웹상에서 표현해주는 xml 을 설계하였다.

• 산업경영시스템학회지
• /
• 제23권54호
• /
• pp.27-36
• /
• 2000

The problem of discovering association rules is an emerging research area, whose goal is to extract significant patterns or interesting rules from large databases and several algorithms for mining association rules have been applied to item-oriented sales transaction databases. Data warehouses and OLAP engines are expected to be widely available. OLAP and data mining are complementary; both are important parts of exploiting data. Our study shows that data cube is an efficient structure for mining association rules. OLAP databases are expected to be a major platform for data mining in the future. In this paper, we present an efficient and effective algorithm for mining association rules using data cube. The algorithm can be applicable to enhance the power of competitiveness of business organizations by providing rapid decision support and efficient database marketing through customer segmentation.

• International Journal of Reliability and Applications
• /
• 제3권4호
• /
• pp.155-164
• /
• 2002

This paper focuses on how modem data mining can be integrated with real-time relational databases and commercial data warehouses to improve reliability in real-time. An important Issue for many manufacturers is the development of relational databases that link key product attributes with real-time process parameters. Helpful data for key product attributes in manufacturing may be derived from destructive reliability testing. Destructive samples are taken at periodic time intervals during manufacturing, which might create a long time-gap between key product attributes and real-time process data. A case study is briefly summarized for the medium density fiberboard (MDF) industry. MDF is a wood composite that is used extensively by the home building and furniture manufacturing industries around the world. The cost of unacceptable MDF was as large as 5% to 10% of total manufacturing costs. Prevention can result In millions of US dollars saved by using better Information systems.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2001년도 The Pacific Aisan Confrence On Intelligent Systems 2001
• /
• pp.464-469
• /
• 2001

CRM(Customer Relationship Management : CRM) is an advanced marketing supporting system which analyze customers\` transaction data and classify or target customer groups to effectively increase market share and profit. Many engines were developed to implements the function and those for classification and clustering are considered core ones. In this study, an improved clustering method based on SOM(Self-Organizing Maps : SOM) is proposed. The proposed clustering method finds the optimal number of clusters so that the effectiveness of clustering is increased. It considers all the data types existing in CRM data warehouses. In particular, and adaptive algorithm where the concepts of degeneration and fusion are applied to find optimal number of clusters. The feasibility and efficiency of the proposed method are demonstrated through simulation with simplified data of customers.

• 유통과학연구
• /
• 제14권10호
• /
• pp.153-164
• /
• 2016

Purpose - In general, large companies have larger organizations, funds, and systems to provide more effective and efficient services in the market. However, development needs to support the livelihood of ordinary citizens who work for small businesses as well. This research suggests that a new distribution channel, called a "foothold style Kosa mart," that cooperates jointly with a distribution center and a large discount mart can provide direct solutions to small and mid-size distributors. This new distribution channel can achieve a limited type of "Nadle shop (small supermarket) foster project" related to building a joint distribution center and improvement in wholesale supply. Research design, data, and methodology - Data about the Korea distribution situation, the Nadle stores, and the logistics centers were collected from literature, Statistics Korea, journals, and reports. Specifically, we investigated information about Kosa Mart and Nadle stores. We focused on the redesign of the distribution center for the Nadle store. Results - The Kosa Mart distribution center now includes 18 warehouses, and has been handling 2000-3000 items. Most of the warehouses have been simply designed and items loaded and stored without refrigeration; thus, it is possible to store only products of certain manufactured goods. The current logistics center has no wholesale function because it failed to resolve the joint purchasing and product supply issues of competitively priced products. Conclusions - This study aimed to identify ways to strengthen the competitiveness of small- and medium-sized retailers. A Kosa Mart redesign aims to unifying the logistics center, stores, and customers. First, the joint wholesale logistics system, equipped with an integrated ordering system, needs to process customer orders and store orders at the same time. Second, excellent small business product development has to connect with production. Third, the store composition needs to support a shipping hub. Fourth, the Mart differentiates itself from convenience store goods by supplying regional and specialized products to customers. Fifth, a service buying agent and direct transactions between producers and consumers need to be established, and exhibits and displays of goods need to be improved.

• 한국항만경제학회지
• /
• 제26권2호
• /
• pp.19-35
• /
• 2010

글로벌 물류기업은 효율성 분석을 통하여 경쟁력을 비교 할 수 있다. 글로벌 물류기업은 물류시설과 물류서비스를 체계적으로 활용하여 경영의 효율성을 높여야한다. 본 연구에서는 글로벌물류기업 상위 40개를 연구대상으로 효율성을 분석하였다. 글로벌물류기업에 대한 효율성 분석을 위한 산출요소로 연간 매출액을 사용하였다. 투입요소는 고용원수, 정보시스템 운용수, 창고운용수를 사용하였다. 효율적인 글로벌물류기업으로 CCR과 BCC 모형에서는 Panalpina, C.H. Robinson Worldwide, Maersk Logistics/Damco, Hub Group, Lander Global Logistics이다. 초효율성 분석은 Panalpina, (2.352), Hub Group (1.654), Maersk Logistics/Damco(1.526), Transplace(1.401), C.H. Robinson Worldwide (1.358), UPS Supply Chain Solutions(0.947), J.B.HUNT(0.839), PHONEX INTERNATIONAL(0.783), Kuehne + Nagel(0.782), DB Schenker Logistics(0.769)순으로 보여주고 있다. 마지막으로 글로벌물류기업의 고용원수, 정보시스템 운영수, 창고보유수의 벤치마킹에 대한 프로젝트를 제시하고 있다.

• Asia pacific journal of information systems
• /
• 제14권3호
• /
• pp.169-187
• /
• 2004

Self-maintainability of data warehouse(DW) views is an ability to maintain the DW views without requiring an access to (i) any underlying databases or (ii) any information beyond the DW views and the delta of the databases. With our proposed method, DW views can be updated by using only the old views and the differential files such as different files, referential integrity differential files, linked differential files, and backward-linked differential files that keep the truly relevant tuples in the delta. This method avoids accessing the underlying databases in that the method achieves self-maintainability even in preparing auxiliary information. We showed that out method can be applicable to the DW views that contain joins over relations in a star schema, a snowflake schema, or a galaxy schema.

• 한국정보과학회논문지:데이타베이스
• /
• 제33권2호
• /
• pp.175-187
• /
• 2006

데이타 큐브는 차원 애트리뷰트의 모든 가능한 조합에 대해 데이타를 집단화하는 연산자이다. 차원 애트리뷰트의 수가 n일 때, 데이타 큐브는 $2^n$개의 group-by를 계산한다. 데이타 큐브에 포함된 각각의 group-by를 큐보이드(cuboid)라 부른다. 데이타 큐브는 흔히 미리 계산되어 형태 뷰(materialized view)의 형태로 데이타 웨어하우스에 저장된다. 이러한 데이타 큐브는 소스 릴레이션이 변경되면 이를 반영하기 위해 갱신되어야 한다. 데이타 큐브의 점진적 관리는 데이타 큐브의 변경될 내용만을 계산하여 이를 데이타 큐브에 반영하는 방법을 의미한다. $2^n$개의 큐보이드로 이루어진 큐브의 변경될 내용을 계산하기 위하여, 기존의 방법들은 데이타 큐브와 동일한 개수의 큐보이드를 가지는 변경 큐브를 계산한다. 따라서, 차원 애트리뷰트의 수가 증가할수록 변경 큐브를 계산하는 비용이 매우 커지게 된다. 변경 큐브에 포함된 각 큐보이드들을 변경 큐보이드(delta cuboid)라 부른다. 본 논문에서는 $2^n$개의 변경 큐보이드 대신 $_nC_{{\lceil}n/2{\rceil}}$개의 변경 큐보이드만을 사용하여 데이타 큐브를 갱신하는 방법을 제안한다. 이에 따라 제안하는 방법은 변경 큐브를 계산하는 비용을 크게 줄일 수 있다. 성능 평가 결과는 제안하는 방법이 기존의 방법에 비해 더 좋은 성능을 가지고 있음을 보여준다.