• Journal of Electrical Engineering and information Science
• /
• 제1권2호
• /
• pp.146-146
• /
• 1996

Although knowledge discovery is increasingly important in databases, the discovered knowledge sets may not be effectively used for application domains. It is partly because knowledge discovery does not take user's interests into account, and too many knowledge sets are discovered to handle efficiently. We believe that user's interests are conveyed by a query and if a nested query is concerned it may include a user's thought process. This paper describes a novel concept for discovering knowledge sets based on query processing. Knowledge discovery process is performed by: extracting features from databases, spanning features to generate range features, and constituting a knowledge set. The contributions of this paper include the following: (1) not only simple queries but also nested queries are considered to discover knowledge sets regarding user's interests and user's thought process, (2) not only positive examples (answer to a query) but also negative examples are considered to discover knowledge sets regarding database abstraction and database exceptions, and (3) finally, the discovered knowledge sets are quantified.

• Journal of Electrical Engineering and information Science
• /
• 제1권2호
• /
• pp.145-156
• /
• 1996

Although knowledge discovery is increasingly important in databases, the discovered knowledge sets may not be effectively used for application domains. It is partly because knowledge discovery does not take user's interests into account, and too many knowledge sets are discovered to handle efficiently. We believe that user's interests are conveyed by a query and if a nested query is concerned it may include a user's thought process. This paper describes a novel concept for discovering knowledge sets based on query processing. Knowledge discovery process is performed by: extracting features from databases, spanning features to generate range features, and constituting a knowledge set. The contributions of this paper include the following: (1) not only simple queries but also nested queries are considered to discover knowledge sets regarding user's interests and user's thought process, (2) not only positive examples (answer to a query) but also negative examples are considered to discover knowledge sets regarding database abstraction and database exceptions, and (3) finally, the discovered knowledge sets are quantified.

• 산업경영시스템학회지
• /
• 제23권57호
• /
• pp.11-20
• /
• 2000

In dynamic management environment, CEO must make an efficient decision with information & knowledge management systems based on IT(Information Technology). As a key component to cope with this current, we suggest the business performance analysis system based on KDD(Knowledge Discovery in Databases). We consider the theoretical model that is composited both Value-Added in respect of stakeholder and Economic Value-Added in respect of shareholder. Additionally we use DBMS and data mining method using Genetic Algorithms as physical model. To demonstrate the performance of the business performance analysis system, we analyse a domestic motors industry. The empirical case is based on the financial data of KISFAS(Korea Investors Services Financial Analysis System) database. The samples included in the study consist of H motors/S motors industry over the 16-year from 1981 to 1996.

• 한국정보과학회논문지:데이타베이스
• /
• 제31권3호
• /
• pp.205-218
• /
• 2004

시공간 데이타관리를 위한 데이타베이스 기술이 발전함에 따라 방대한 시공간 데이타 집합으로부터 의미 있는 시공간 지식 탐사를 필요로 하는 시공간 응용 서비스가 증대되고 있다. 이 논문에서는 시공간 지식 탐사 기법 개발을 지원하기 위하여 시공간 3계층 지식탐사 프레임워크를 제안하였다. 프레임 워크에서는 시공간 지식 탐사 문제 정의를 위한 기반 모델을 제시하여 시공간 지식에 대한 정의 및 관계를 표현할 수 있도록 하였다. 또한 시공간 지식 탐사 시스템의 구성요소 및 구현 모델을 제시하였다. 이 논문에서 제안한 시공간 지식 탐사를 위한 프레임워크는 앞으로 새로운 유형의 시공간 지식 탐사 기법 개발에 적용될 수 있는 특징을 포함하고 있다. 제안한 프레임워크는 시공간 이동 패턴과 같은 새로운 유형의 지식 탐사 기법 개발 지원에 있어 시공간 데이타 집합, 정보 및 지식에 대한 관계 규정과 각 요소에 대한 표현 모델을 제공함으로써 지식 탐사 문제를 형식화하고 단순화할 수 있다.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• pp.290-293
• /
• 2000

Knowledge discovery refers to the overall process of discovering useful knowledge from data. The linear programming model is a special form of useful knowledge that is embedded in a database. Since formulating models from scratch requires knowledge-intensive efforts, knowledge-based formulation support systems have been proposed in the DSS area. However, they rely on the strict assumption that sufficient domain knowledge should already be captured as a specific knowledge representation form. Hence, the purpose of this paper is to propose a methodology that finds useful knowledge on building linear programming models from a database. The methodology consists of two parts. The first part is to find s first-cut model based on a data dictionary. To do so, we applied the GPS algorithm. The second part is to discover a second-cut model by applying neural network technique. An illustrative example is described to show the feasibility of the proposed methodology.

• 한국디지털정책학회:학술대회논문집
• /
• 한국디지털정책학회 2004년도 춘계학술대회
• /
• pp.575-592
• /
• 2004

In modern dynamic management environment, there is growing recognition that? information & knowledge management systems are essential for CEO's efficient/effective decision making. As a key component to cope with this current, we suggest the management performance analysis syystem based on Knowledge Discovery in Database (KDD). The system measures management performance that is considered with both VA(Value- Added), which represents stakeholder's point of view and EVA(Economic Value-Added), which represents shareholder's point of view. The relation ship between management performance and some 80 financial ratios is analyzed, and then important financial ratios are drawn out. In analyzing the relationship, we applied KDD process which includes such as multidimensional cube, OLAP(On-Line Analytic Process), data mining and AHP(Analytic Hierarchy Process). To demonstrate the performance of the system, we conducted a case study using financial data over the 16-years from 1981 to 1996 of Korean automobile industry which is taken from database of KISF AS(Korea Investors Services Financial Analysis System).

• 한국디지털정책학회:학술대회논문집
• /
• 한국디지털정책학회 2003년도 창립학술대회
• /
• pp.191-210
• /
• 2003

In modern dynamic management environment, there is growing recognition that information & knowledge management systems are essential for CEO's Efficient/effective decision making, As a key component to cope with this current, we suggest the management performance analysis system based on Knowledge Discovery in Database (KDD). The system measures management performance that is considered with both VA(Value-Added), which represents stakeholder's point of view and EVA(Economic Value-Added), which represents shareholder's point of view, The relationship between management performance and some 80 financial ratios is analyzed, and then important financial ratios are drawn out. In analyzing the relationship, we applied KDD process which includes such as multidimensional cube, OLAP(On -Line Analytic Process), data mining and AHP(Analytic Hierarchy Process). To demonstrate the performance of the system, we conducted a case study using financial data over the 16-years from 1981 to 1996 of Korean automobile industry which is taken from database of KISFAS(Korea Investors Services Financial Analysis System).

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

Knowledge discovery in databases(KDD) is the process for extracting valid, novel, potentially useful and understandable knowledge form real data. There are many academic and industrial activities with new technologies and application areas. Particularly, data mining is the core step in the KDD process, consisting of many algorithms to perform clustering, pattern recognition and rule induction functions. The main goal of these algorithms is prediction and description. Prediction means the assessment of unknown variables. Description is concerned with providing understandable results in a compatible format to human users. We introduce an efficient data mining algorithm considering predictive and descriptive capability. Reasonable pattern is derived from real world data by a revised neural network model and a proposed fuzzy rule extraction technique is applied to obtain understandable knowledge. The proposed neural network model is a hierarchical self-organizing system. The rule base is compatible to decision makers perception because the generated fuzzy rule set reflects the human information process. Results from real world application are analyzed to evaluate the system\`s performance.

• ETRI Journal
• /
• 제32권5호
• /
• pp.676-686
• /
• 2010

Mining sequential patterns is an important research issue in data mining and knowledge discovery with broad applications. However, the existing sequential pattern mining approaches consider only binary frequency values of items in sequences and equal importance/significance values of distinct items. Therefore, they are not applicable to actually represent many real-world scenarios. In this paper, we propose a novel framework for mining high-utility sequential patterns for more real-life applicable information extraction from sequence databases with non-binary frequency values of items in sequences and different importance/significance values for distinct items. Moreover, for mining high-utility sequential patterns, we propose two new algorithms: UtilityLevel is a high-utility sequential pattern mining with a level-wise candidate generation approach, and UtilitySpan is a high-utility sequential pattern mining with a pattern growth approach. Extensive performance analyses show that our algorithms are very efficient and scalable for mining high-utility sequential patterns.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2004년도 봄 학술발표논문집 Vol.31 No.1 (B)
• /
• pp.115-117
• /
• 2004

Recently, mining far association rules in distributed database environments is a central problem in knowledge discovery area. While the data are located in different share-nothing machines, and each data site grows by time. Mining global frequent itemsets is hard and not efficient in large number of distributed sewen. In many distributed databases. time component(which is usually attached to transactions in database), contains meaningful time-related rules. In this paper, we design a new DTA(distributed temporal association) algorithm that combines temporal concepts inside distributed association rules. The algorithm confirms the time interval for applying association rules in distributed databases. The experiment results show that DTA can generate interesting correlation frequent itemsets related with time periods.