• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.647-656
• /
• 2003

In Webspace, mining traversal patterns is to understand user's path traversal patterns. On this mining, it has a unique characteristic which objects (for example, URLs) may be visited due to their positions rather than contents, because users move to other objects according to providing information services. As a consequence, it becomes very complex to extract meaningful information from these data. Recently discovering traversal patterns has been an important problem in data mining because there has been an increasing amount of research activity on various aspects of improving the quality of information services. This paper presents a Dynamic Link Recommendation (DLR) algorithm that recommends link sets on a Web site through mining frequent traversal patterns. It can be employed to any Web site with massive amounts of data. Our experimentation with two real Weblog data clearly validate that our method outperforms traditional method.

• Journal of Intelligence and Information Systems
• /
• v.20 no.1
• /
• pp.133-148
• /
• 2014

Recently, with the advent of various information channels, the number of has continued to grow. The main cause of this phenomenon can be found in the significant increase of unstructured data, as the use of smart devices enables users to create data in the form of text, audio, images, and video. In various types of unstructured data, the user's opinion and a variety of information is clearly expressed in text data such as news, reports, papers, and various articles. Thus, active attempts have been made to create new value by analyzing these texts. The representative techniques used in text analysis are text mining and opinion mining. These share certain important characteristics; for example, they not only use text documents as input data, but also use many natural language processing techniques such as filtering and parsing. Therefore, opinion mining is usually recognized as a sub-concept of text mining, or, in many cases, the two terms are used interchangeably in the literature. Suppose that the purpose of a certain classification analysis is to predict a positive or negative opinion contained in some documents. If we focus on the classification process, the analysis can be regarded as a traditional text mining case. However, if we observe that the target of the analysis is a positive or negative opinion, the analysis can be regarded as a typical example of opinion mining. In other words, two methods (i.e., text mining and opinion mining) are available for opinion classification. Thus, in order to distinguish between the two, a precise definition of each method is needed. In this paper, we found that it is very difficult to distinguish between the two methods clearly with respect to the purpose of analysis and the type of results. We conclude that the most definitive criterion to distinguish text mining from opinion mining is whether an analysis utilizes any kind of sentiment lexicon. We first established two prediction models, one based on opinion mining and the other on text mining. Next, we compared the main processes used by the two prediction models. Finally, we compared their prediction accuracy. We then analyzed 2,000 movie reviews. The results revealed that the prediction model based on opinion mining showed higher average prediction accuracy compared to the text mining model. Moreover, in the lift chart generated by the opinion mining based model, the prediction accuracy for the documents with strong certainty was higher than that for the documents with weak certainty. Most of all, opinion mining has a meaningful advantage in that it can reduce learning time dramatically, because a sentiment lexicon generated once can be reused in a similar application domain. Additionally, the classification results can be clearly explained by using a sentiment lexicon. This study has two limitations. First, the results of the experiments cannot be generalized, mainly because the experiment is limited to a small number of movie reviews. Additionally, various parameters in the parsing and filtering steps of the text mining may have affected the accuracy of the prediction models. However, this research contributes a performance and comparison of text mining analysis and opinion mining analysis for opinion classification. In future research, a more precise evaluation of the two methods should be made through intensive experiments.

• Proceedings of the IEEK Conference
• /
• 2003.07c
• /
• pp.2561-2564
• /
• 2003

Data mining is an effective method of the discovery of useful information such as rules and previously unknown patterns existing in large databases. The discovery of association rules is an important data mining problem. We have developed a new parallel mining called Distributed Frequent Pattern Tree (abbreviated by DFPT) algorithm on a distributed shared nothing parallel system to detect association rules. DFPT algorithm is devised for parallel execution of the FP-growth algorithm. It needs only two full disk data scanning of the database by eliminating the need for generating the candidate items. We have achieved good workload balancing throughout the mining process by distributing the work equally to all processors. We implemented the algorithm on a PC cluster system, and observed that the algorithm outperformed the Improved Count Distribution scheme.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2005.11a
• /
• pp.61-66
• /
• 2005

Spatiotemporal data mining represents the confluence of several fields including spatiotemporal databases, machine loaming, statistics, geographic visualization, and information theory. Exploration of spatial data mining and temporal data mining has received much attention independently in knowledge discovery in databases and data mining research community. In this paper, we introduce an algorithm Max_MOP for discovering moving sequences in mobile environment. Max_MOP mines only maximal frequent moving patterns. We exploit the characteristic of the problem domain, which is the spatiotemporal proximity between activities, to partition the spatiotemporal space. The task of finding moving sequences is to consider all temporally ordered combination of associations, which requires an intensive computation. However, exploiting the spatiotemporal proximity characteristic makes this task more cornputationally feasible. Our proposed technique is applicable to location-based services such as traffic service, tourist service, and location-aware advertising service.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.03a
• /
• pp.125-133
• /
• 1999

The objective of knowledge discovery and data mining lies in the generation of useful insights from a store of data. This paper presents a framework for knowledge mining to provide a systematic approach to the selection and deployment of tools for automated learning. Every methodology has its strengths and limitations. Consequently, a multistrategy approach may be required to take advantage of the strengths of disparate technique while circumventing their individual limitations. For concreteness, the general framework for data mining in marketing is examined in the context of developing agents for optimizing a supply chain network.

• 한국데이터정보과학회:학술대회논문집
• /
• 2006.04a
• /
• pp.241-251
• /
• 2006

Data mining is the method to find useful information for large amounts of data in database It is used to find hidden knowledge by massive data, unexpectedly pattern, relation to new rule. The methods of data mining are decision tree, association rules, clustering, neural network and so on. We analyze industrial waste database using data mining technique. We use k-means algorithm for clustering and C5.0 algorithm for decision tree and Apriori algorithm for association rule. We can use these analysis outputs for environmental preservation and environmental improvement.

• International Journal of Quality Innovation
• /
• v.2 no.2
• /
• pp.93-100
• /
• 2001

This paper illustrates a prototyping framework of the documentation-standards retrieval system via the data mining approach for enhancing software development quality. We first present an approach for designing a retrieval algorithm based on data mining, with the three basic technologies of machine learning, statistics and database management, applied to this system to speed up the searching time and increase the fitness. This approach derives from the observation that data mining can discover unsuspected relationships among elements in large databases. This observation suggests that data mining can be used to elicit new knowledge about the design of a subject system and that it can be applied to large legacy systems for efficiency. Finally, software development quality will be improved at the same time when the project managers retrieving for the documentation standards.

• Journal of Intelligence and Information Systems
• /
• v.4 no.1
• /
• pp.41-58
• /
• 1998

본 연구는 여러 가지 Data Mining 기법들로부터 도출된 지식과 AHP를 이용하여 도출된 전문가의 지식을 사용된 정보의 특성에 따라 조사하고, 이러한 각각의 지식들을 중심으로 부도예측 모형을 설계한 후, 각 모형의 특성 및 부도예측력에 대한 실증적 비교연구에 그 목적을 두고 있다. 사용된 Data Mining 기법들은 통계적 다중판별분석 모형, ID3 모형, 인공신경망 모형이며, 전문가 지식의 추출은 AHP를 사용하여 45명의 전문가로부터 부도와 관련하여 인터뷰 및 설문조사를 실시하였다. 특히 부도예측에 사용된 변수의 특성을 정량적 재무정보와 정성적 비재무정보로 나누어서 각 모형의 특성을 비교연구하였다. 연구결과 부도예측시 정성적정보의 중요성을 확인하였으며, 전문가의 지식을 기반으로한 AHP 모형이 위험예측모형으로 사용될 수 있음을 실증적으로 보여주었다.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.4
• /
• pp.17-24
• /
• 2018

This paper proposes data mining models relevant to the serial publication periods and mobile gamification likelihood of webtoon contents which were either serialized or completed in platform. The size of the cartoon industry including webtoon takes merely 1% of the total entertainment contents industry in Korea. However, the significance of webtoon business is rapidly growing because its intellectual property can be easily used as an effective OSMU (One Source Multi-Use) vehicle for multiple types of contents such as movie, drama, game, and character-related merchandising. We suggested a set of data mining classifiers that are deemed suitable to provide prediction models for serial publication periods and mobile gamification likelihood for the sake of webtoon contents. As a result, the balanced accuracies are respectively recorded as 85.0% and 59.0%, from the two models.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.11
• /
• pp.111-116
• /
• 2017

This paper proposes a data mining approach to predicting stock price direction. Stock market fluctuates due to many factors. Therefore, predicting stock price direction has become an important issue in the field of stock market analysis. However, in literature, there are few studies applying data mining approaches to predicting the stock price direction. To contribute to literature, this paper proposes comparing single classifiers and ensemble classifiers. Single classifiers include logistic regression, decision tree, neural network, and support vector machine. Ensemble classifiers we consider are adaboost, random forest, bagging, stacking, and vote. For the sake of experiments, we garnered dataset from Korea Stock Exchange (KRX) ranging from 2008 to 2015. Data mining experiments using WEKA revealed that random forest, one of ensemble classifiers, shows best results in terms of metrics such as AUC (area under the ROC curve) and accuracy.