• Journal of the Korea Society of Computer and Information
• /
• v.13 no.1
• /
• pp.45-54
• /
• 2008

As mobile Web technology becomes more increasingly applicable. the mobile contents market. especially the music downloading for mobile phones, has recorded remarkable growth. In spite of this rapid growth, customers experience high levels of frustration in the process of searching for desired music contents. It affects to a re-purchasing rate of customers and also. music mubile content providers experience a decrease in the benefit. Therefore, in aspects of a customer relationship management (CRM), a new way to increase a benefit by providing a convenient shopping environment to mobile customers is necessary. As an solution for this situation, we propose a new music recommender system to enhance the customers' search efficiency by combining collaborative filtering with mobile web mining and ordinal scale based customer preferences. Some experiments are also performed to verify that our proposed system is more effective than the current recommender systems in the mobile Web.

• Korean Business Review
• /
• v.15
• /
• pp.79-97
• /
• 2002

In this study, an analytical CRM for customer segmentation is exercised by integrating and analyzing the customer profile data and the access data to a particular web site. We believe that effective customer segmentation will be possible with a basis of the understanding of customer characteristics as well as behavior on the web. One of the critical tasks in the web data-mining is concerned with both 'how to collect the data from the web in an efficient manner?' and 'how to integrate the data(mostly in a variety of types) effectively for the analysis?' This study proposes a panel approach as an efficient data collection method in the web. For the customer data analysis, OLAF and a tree-structured algorithm are applied in this study. The results of the analysis with both techniques are compared, confirming the previous work which the two techniques are inter-complementary.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.160-161
• /
• 2017

Sentiment analysis and opinion mining is the field of study that analyzes people's opinions, sentiments, evaluations, attitudes, and emotions from written language Opinion mining and sentiment analysis(OMSA) as a research discipline has emerged during last 15 years and provides a methodology to computationally process the unstructured data mainly to extract opinions and identify their sentiments. The relatively new but fast growing research discipline has changed a lot during these years. This paper presents a scientometric analysis of research work done on OMSA during 2007-2016. For the literature analysis, research publications indexed in Web of Science (WoS) database are used as input data. The publication data is analyzed computationally to identify year-wise publication pattern, rate of growth of publications, research areas. More detailed manual analysis of the data is also performed to identify popular approaches (machine learning and lexcon-based) used in these publications, levels (documents, sentences or aspect-level) of sentiment analysis work done and major application areass of OMSA.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.313-315
• /
• 2004

인터넷 사용이 보편화됨에 따라 기존의 방화벽만으로는 탐지가 불가능한 웹 서비스의 취약점을 이용한 공격이 증가하고 있다. 그 중에서도 특히 웹 어플리케이션의 프로그래밍 오류를 이용한 침입이 공격 수단의 대부분을 차지하고 있다. 본 논문에서는 웹 어플리케이션의 동작을 분석한 후 취약점 발생 부분에 대해 웹 로그 마이닝 기법을 사용하여 실시간으로 로그를 분석함으로서 공격 패턴을 비교ㆍ분석한다. 또한 프로세스 분석기를 통한 결정(decision) 과정을 통해 침입으로 판단되면 해당 접속 프로세스(pid)를 제거 한 후 공격 아이피를 차단함으로서 침입을 탐지하는 메커니즘을 제시한다.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.267-271
• /
• 2005

The goal of data mining is to extract new and useful knowledge from large scale datasets. As the amount of available data grows explosively, it became vitally important to develop faster data mining algorithms for various types of data. Recently, an interest in developing data mining algorithms that operate on graphs has been increased. Especially, mining frequent patterns from structured data such as graphs has been concerned by many research groups. A graph is a highly adaptable representation scheme that used in many domains including chemistry, bioinformatics and physics. For example, the chemical structure of a given substance can be modelled by an undirected labelled graph in which each node corresponds to an atom and each edge corresponds to a chemical bond between atoms. Internet can also be modelled as a directed graph in which each node corresponds to an web site and each edge corresponds to a hypertext link between web sites. Notably in bioinformatics area, various kinds of newly discovered data such as gene regulation networks or protein interaction networks could be modelled as graphs. There have been a number of attempts to find useful knowledge from these graph structured data. One of the most powerful analysis tool for graph structured data is frequent subgraph analysis. Recurring patterns in graph data can provide incomparable insights into that graph data. However, to find recurring subgraphs is extremely expensive in computational side. At the core of the problem, there are two computationally challenging problems. 1) Subgraph isomorphism and 2) Enumeration of subgraphs. Problems related to the former are subgraph isomorphism problem (Is graph A contains graph B?) and graph isomorphism problem(Are two graphs A and B the same or not?). Even these simplified versions of the subgraph mining problem are known to be NP-complete or Polymorphism-complete and no polynomial time algorithm has been existed so far. The later is also a difficult problem. We should generate all of 2$^n$ subgraphs if there is no constraint where n is the number of vertices of the input graph. In order to find frequent subgraphs from larger graph database, it is essential to give appropriate constraint to the subgraphs to find. Most of the current approaches are focus on the frequencies of a subgraph: the higher the frequency of a graph is, the more attentions should be given to that graph. Recently, several algorithms which use level by level approaches to find frequent subgraphs have been developed. Some of the recently emerging applications suggest that other constraints such as connectivity also could be useful in mining subgraphs : more strongly connected parts of a graph are more informative. If we restrict the set of subgraphs to mine to more strongly connected parts, its computational complexity could be decreased significantly. In this paper, we present an efficient algorithm to mine frequent subgraphs that are more strongly connected. Experimental study shows that the algorithm is scaling to larger graphs which have more than ten thousand vertices.

• The KIPS Transactions:PartD
• /
• v.17D no.4
• /
• pp.253-258
• /
• 2010

Traditional frequent pattern mining considers equal profit/weight value of every item. Weighted Frequent Pattern (WFP) mining becomes an important research issue in data mining and knowledge discovery by considering different weights for different items. Existing algorithms in this area are based on fixed weight. But in our real world scenarios the price/weight/importance of a pattern may vary frequently due to some unavoidable situations. Tracking these dynamic changes is very necessary in different application area such as retail market basket data analysis and web click stream management. In this paper, we propose a novel concept of dynamic weight and an algorithm DWFPM (dynamic weighted frequent pattern mining). Our algorithm can handle the situation where price/weight of a pattern may vary dynamically. It scans the database exactly once and also eligible for real time data processing. To our knowledge, this is the first research work to mine weighted frequent patterns using dynamic weights. Extensive performance analyses show that our algorithm is very efficient and scalable for WFP mining using dynamic weights.

• Korea Trade Review
• /
• v.46 no.5
• /
• pp.65-81
• /
• 2021

The technological development in the era of the 4th industrial revolution is changing the paradigm of various industries. Various technologies such as big data, cloud, artificial intelligence, virtual reality, and the Internet of Things are used, creating synergy effects with existing industries, creating radical development and value creation. Among them, the logistics sector has been greatly influenced by quantitative data from the past and has been continuously accumulating and managing data, so it is highly likely to be linked with big data analysis and has a high utilization effect. The modern advanced technology has developed together with the data mining technology to discover hidden patterns and new correlations in such big data, and through this, meaningful results are being derived. Therefore, data mining occupies an important part in big data analysis, and this study tried to analyze data mining techniques that can contribute to the logistics field and common logistics using these data mining technologies. Therefore, by using the AHP technique, it was attempted to derive priorities for each type of efficient data mining for logisticalization, and R program and R Studio were used as tools to analyze this. Criteria of AHP method set association analysis, cluster analysis, decision tree method, artificial neural network method, web mining, and opinion mining. For the alternatives, common transport and delivery, common logistics center, common logistics information system, and common logistics partnership were set as factors.

• Smart Media Journal
• /
• v.2 no.2
• /
• pp.20-27
• /
• 2013

The concept of social media is top of the agenda for many business executives and decision makers, as well as consultants try to identify ways where companies can make profitable use of applications such as Netflix, Flixster. The social media is playing an increasingly important role as the information sources for customers making product choices etc. With the flourish of Web 2.0 technology, customer reviews are becoming more and more useful and important information resources for people to save their time and energy on purchasing products that they want. This paper proposes the Bayesian Probabilistic Classification algorithm to mine the social media review, and evaluates it by different splits and cross validation mechanism from the real data set. The explored study experimental results show the robustness and effectiveness of proposed approach for mining the social media review.

• Journal of information and communication convergence engineering
• /
• v.15 no.3
• /
• pp.170-174
• /
• 2017

Nowadays, people share and discuss scientific papers on social media such as the Web 2.0, big data, online forums, blogs, Twitter, Facebook and scholar community, etc. In addition to a variety of metrics such as numbers of citation, download, recommendation, etc., paper review text is also one of the effective resources for the study of scientific impact. The social media tools improve the research process: recording a series online scholarly behaviors. This paper aims to research the huge amount of paper reviews which have generated in the social media platforms to explore the implicit information about research papers. We implemented and shown the result of text mining on review texts using R language. And we found that Zika virus was the research hotspot and association research methods were widely used in 2016. We also mined the news review about one paper and derived the public opinion.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2017.07a
• /
• pp.344-345
• /
• 2017

Opinion mining and sentiment analysis(OMSA) as a research discipline has emerged during last 15 years and provides a methodology to computationally process the unstructured data mainly to extract opinions and identify their sentiments. The relatively new but fast growing research discipline has changed a lot during these years. This paper presents a scientometric analysis of research work done on OMSA during 2007-2016. For the literature analysis, research publications indexed in Web of Science (WoS) database are used as input data. The publication data is analyzed computationally to identify year-wise publication pattern, rate of growth of publications, research areas.