• International Journal of Computer Science & Network Security
• /
• v.23 no.10
• /
• pp.135-146
• /
• 2023

An effective educational program warrants the inclusion of an innovative construction which enhances the higher education efficacy in such a way that accelerates the achievement of desired results and reduces the risk of failures. Educational Decision Support System (EDSS) has currently been a hot topic in educational systems, facilitating the pupil result monitoring and evaluation to be performed during their development. Insufficient information systems encounter trouble and hurdles in making the sufficient advantage from EDSS owing to the deficit of accuracy, incorrect analysis study of the characteristic, and inadequate database. DMTs (Data Mining Techniques) provide helpful tools in finding the models or forms of data and are extremely useful in the decision-making process. Several researchers have participated in the research involving distributed data mining with multi-agent technology. The rapid growth of network technology and IT use has led to the widespread use of distributed databases. This article explains the available data mining technology and the distributed data mining system framework. Distributed Data Mining approach is utilized for this work so that a classifier capable of predicting the success of students in the economic domain can be constructed. This research also discusses the Intelligent Knowledge Base Distributed Data Mining framework to assess the performance of the students through a mid-term exam and final-term exam employing Multi-agent system-based educational mining techniques. Using single and ensemble-based classifiers, this study intends to investigate the factors that influence student performance in higher education and construct a classification model that can predict academic achievement. We also discussed the importance of multi-agent systems and comparative machine learning approaches in EDSS development.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.447-458
• /
• 2003

The basic assumption of conventional data mining methodology is that the data set of a knowledge discovery process should be fixed and available before the process can proceed. Consequently, this assumption is valid only when the static knowledge embedded in a specific data set is the target of data mining. In addition, a conventional data mining method requires considerable computing time to produce the result of mining from a large data set. Due to these reasons, it is almost impossible to apply the mining method to a realtime analysis task in a data stream where a new transaction is continuously generated and the up-to-dated result of data mining including the newly generated transaction is needed as quickly as possible. In this paper, a new mining concept, open data mining in a data stream, is proposed for this purpose. In open data mining, whenever each transaction is newly generated, the updated mining result of whole transactions including the newly generated transactions is obtained instantly. In order to implement this mechanism efficiently, it is necessary to incorporate the delayed-insertion of newly identified information in recent transactions as well as the pruning of insignificant information in the mining result of past transactions. The proposed algorithm is analyzed through a series of experiments in order to identify the various characteristics of the proposed algorithm.

• The Journal of Information Technology and Database
• /
• v.6 no.1
• /
• pp.89-101
• /
• 1999

Increasing number of companies recognize that the understanding of customers and their markets is indispensable for their survival and business success. The companies are rapidly increasing the amount of investments to develop customer databases which is the basis for the database marketing activities. Database marketing is closely related to data mining. Data mining is the non-trivial extraction of implicit, previously unknown and potentially useful knowledge or patterns from large data. Data mining applied to database marketing can make a great contribution to reinforce the company's competitiveness and sustainable competitive advantages. This paper develops the classification model to select the most responsible customers from the customer databases for telemarketing system and evaluates the performance of the developed model using LIFT measure. The model employs the decision tree algorithm, i.e., CHAID which is one of the well-known data mining techniques. This paper also represents the effective database marketing strategy by applying the data mining technique to a credit card company's telemarketing system.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.25 no.5
• /
• pp.46-52
• /
• 2002

Today's database system needs to collect huge amount of questionnaire that results from development of the information technology by the internet, so it has to be administrable. However, there are many difficulties concerned with finding analytic data or useful information in the high capacity-database. Data mining can solve these problems and utilize the database. Questionnaire analysis that uses data mining has drawn relevant patterns that did not look or was tended to overlook before. These patterns can be applied by a new business rule. The purpose of this research is to analyze the questionnaire results and to present the result that can help to make decision easily with data mining. Recognition and analysis about these techniques of data mining show suitable type of questionnaire survey. This research focus on the form of present composition and the model of suitable questionnaire to analyze the type of it. Also, the comparison between the actual questionnaire result and the conventional statistical analysis is examined.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.3
• /
• pp.515-527
• /
• 2005

The data mining is a new approach to extract useful information through effective analysis of huge data in numerous fields. We utilized this data mining technique to analyze medical record of 39,900 people. Whole data were separated by gender first and divided into three groups, including normal, stage 1 hypertension, and stage 2 hypertension. The data from each group were analyzed with data mining technique. Based on the result that we have extracted with this data mining technique, major risk factors for the hypertension are age, BMI score, family history.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.4
• /
• pp.1-17
• /
• 2014

The functions of stocking and releasing in logistics center consist of three major procedure such as receiving, shipping and stock managements. Each process includes various sub-processes which are complicatedly connected with each other. Furthermore, lots of operators execute various tasks in the different sub-processes, simultaneously. It makes difficult to standardize, monitor, and analyze the processes. This paper proposed the quantitative methodology using process mining approach to discover and analyze receiving and shipping processes. For this purpose, the PDA operation log data is analyzed to build a realistic process model. The deduced model has been compared with official process model. In addition, task assignment and social networks analysises are carried out by utilizing process mining tools. Also, it has been proposed how to improve the processes with the analytical simulation model based on the results of process mining.

• Journal of information and communication convergence engineering
• /
• v.10 no.1
• /
• pp.40-44
• /
• 2012

Data mining, which is attracting public attention, is a process of drawing out knowledge from a large mass of data. The key technique in data mining is the ability to maximize the similarity in a group and minimize the similarity between groups. Since grouping in data mining deals with a large mass of data, it lessens the amount of time spent with the source data, and grouping techniques that shrink the quantity of the data form to which the algorithm is subjected are actively used. The current grouping algorithm is highly sensitive to static and reacts to local minima. The number of groups has to be stated depending on the initialization value. In this paper we propose a gene algorithm that automatically decides on the number of grouping algorithms. We will try to find the optimal group of the fittest function, and finally apply it to a data mining problem that deals with a large mass of data.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.549-552
• /
• 2004

Since open-cut mining excavates gradually from the top of the mountain, vegetation planting is needed to reduce negative environmental impact on the surrounding environment. Accordingly, this study aimed at performing the environmental monitoring of the open-cut mining ground using the satellite remote sensing technique. As the research technique, in order to grasp the environmental change around the open-cut mining ground, NDVI (normalized difference vegetation index) was calculated, and every year change of the vegetation activity was analyzed. The results of the study showed lower vegetation activity in the open-cut mining ground compared to the surrounding areas and suggested the need for closed monitoring by remote sensing techniques.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.48
• /
• pp.53-63
• /
• 1998

Mining for association rules between items in a large database of sales transaction has been described as an important data mining problem. The mining of association rules can be mapped into the problem of discovering large itemsets. In this paper we present an efficient algorithm for mining association rules by minimizing the total numbers of candidate 2-itemset, │C$_2$│. More the total numbers of candidate 2-itemset, less the time of executing the algorithm for mining association rules. The total performance of algorithm depends on the time of finding large 2-itemsets. Hence, minimizing the total numbers of candidate 2-itemset is very important. We have performed extensive experiments and compared the performance of our algorithm with the DHP algorithm, the best existing algorithm.

• KIEAE Journal
• /
• v.12 no.2
• /
• pp.77-82
• /
• 2012

Data mining is to discover problems in the large amounts of data. Also, data mining trying to find the cause of the problem and the structure. Building energy consumption patterns, the amount of data is infinite. Also, the patterns have a lot of direct and indirect effects. Discussion is needed about the correlation. This work looking for the cause of energy consumption. As a result, energy management can find out the issue. Building energy analysis utilizing data mining techniques to predict energy consumption. And the results are as follows: 1) Using data mining technique, We classified complicated data to several patterns and gained meaningful informations from them. 2) Using cluster analysis, We classified building energy consumption data of residents and analyzed characters of patterns.