• Journal of Digital Contents Society
• /
• v.18 no.8
• /
• pp.1593-1601
• /
• 2017

In a big data platform, association rule mining applications could bring some benefits. For instance, in a agricultural big data platform, the association rule mining application could recommend specific products for farmers to grow, which could increase income. The key process of the association rule mining is the frequent itemsets mining, which finds sets of products accompanying together frequently. Former researches about this issue, e.g. Apriori, are not satisfying enough because huge possible sets can cause memory to be overloaded. In order to deal with it, SON algorithm has been proposed, which divides the considered set into many smaller ones and handles them sequently. But in a single machine, SON algorithm cause heavy time consuming. In this paper, we present a method to find association rules in our Hadoop based big data platform, by parallelling SON algorithm. The entire process of association rule mining including pre-processing, SON algorithm based frequent itemset mining, and association rule finding is implemented on Hadoop based big data platform. Through the experiment with real dataset, it is conformed that the proposed method outperforms a brute force method.

• The Journal of the Korea Contents Association
• /
• v.12 no.4
• /
• pp.76-85
• /
• 2012

Through opinion mining, we can analyze the degree of positive or negative sentiments that customers feel about important entities or attributes in online customer reviews. But, the limit of the opinion mining techniques is to provide only simple functions in analyzing the reviews. In this paper, we proposed novel techniques that can analyze the online customer reviews multi-dimensionally. The novel technique is to modify the existing OLAP techniques so that they can be applied to text data. The novel technique, that is, multi-dimensional analytic model consists of noun, adjective and document axes which are converted into four relational tables in relational database. The multi-dimensional analysis model would be new framework which can converge the existing opinion mining, information summarization and clustering algorithms. In this paper, we implemented the multi-dimensional analysis model and algorithms. we recognized that the system would enable us to analyze the online customer reviews more complexly.

• The Journal of Asian Finance, Economics and Business
• /
• v.6 no.3
• /
• pp.173-183
• /
• 2019

This study aims to utilize big data contents of news and social media for developing a corporate strategy of multinational enterprises and their global decision-making through the data mining technique, especially text mining. In this paper, the data of 2 news media (BBC and CNN) and 2 social media (Facebook and Twitter) were collected for the three global leading Korean companies (Samsung, Hyundai Motor Company, and LG) from April, 2018 to April, 2019. The findings of this paper have shown that traditional news media and also modern social media have become devastating tools to extract global trends or phenomena for businesses. Moreover, this presents that a company can adopt a two-track strategy through two different types of media by deriving the key issues or trends from news media channels and also grasping consumers' sentiments, preference or issues of interest such as battery or design from social media. In addition, analyzing the texts of those media and understanding the association rules greatly contribute to the comparison between two different types of media channels to see the difference. Lastly, this provides meaningful and valuable data empowered insights to find a future direction comprehensively and develop a global strategy for sustainability of business.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.1
• /
• pp.229-241
• /
• 2015

Nowadays, an open-market which provides sellers and consumers a cyber place for making a transaction over the Internet has emerged as a prevalent sales channel because of convenience and relatively low price it provides. However, there are few studies about CRM strategies based on VIP consumers for an open-market even though understanding VIP consumers' behaviors in open-markets is important to increase its revenue. Therefore, we propose CRM strategies targeted on VIP customers, obtained by analyzing the transaction data of VIP customers from an open-market using data mining techniques. To that end, we first defined the VIP customers in terms of recency, frequency and monetary (RFM) values. Then, we used data mining techniques to develop a model which best classifies and identifies infiluential factors customers into VIPs or non-VIPs. We also validate each of promotion types in the aspect of effectiveness and identify association rules among the types. Then, based on the findings from these experiments, we propose strategies from the perspectives of CRM dimensions for the open-market to thrive.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.1
• /
• pp.97-106
• /
• 2014

The development of big data technology was to more accurately predict diversified contemporary society and to more efficiently operate it, and to enable impossible technique in the past. This technology can be utilized in various fields such as the social science, economics, politics, cultural sector, and science technology at the national level. It is a prerequisite to find valuable information by data mining techniques in order to analyze big data. Data mining techniques associated with big data involve text mining, opinion mining, cluster analysis, association rule mining, and so on. The most widely used data mining technique is to explore association rules. This technique has been used to find the relationship between each set of items based on the association thresholds such as support, confidence, lift, similarity measures, etc.This paper proposed cosine net confidence as association thresholds, and checked the conditions of interestingness measure proposed by Piatetsky-Shapiro, and examined various characteristics. The comparative studies with basic confidence and cosine similarity, and cosine net confidence were shown by numerical example. The results showed that cosine net confidence are better than basic confidence and cosine similarity because of the relevant direction.

• Journal of Intelligence and Information Systems
• /
• v.7 no.1
• /
• pp.97-121
• /
• 2001

Until now, we have believed that one of advantages of cyber market is that it can virtually display and sell goods because it does not necessary maintain expensive physical shops and inventories. But, in a highly competitive environment, business model that does away with goods in stock must be modified. As we know in the case of AMAZON, leading companies already consider merchandise management as a critical success factor in their business model. That is, a solution to compete against one's competitors in a highly competitive environment is merchandise management as in the traditional retail market. Cyber market has not only past sales data but also web log data before sales data that contains information of path that customer search and purchase on cyber market as compared with traditional retail market. So if we can correctly analyze the characteristics of before sales patterns using web log data, we can better prepare for the potential customers and effectively manage inventories and merchandises. We introduce a systematic analysis method to extract useful data for merchandise management - demand forecasting, evaluating & selecting - using web mining that is the application of data mining techniques to the World Wide Web. We use various techniques of web mining such as clustering, mining association rules, mining sequential patterns.

• Journal of Korea Multimedia Society
• /
• v.10 no.8
• /
• pp.945-957
• /
• 2007

Quantitative association rules apply a binary association to the data which have the relatively strong quantitative attributions in a large database system. When a domain range of quantitative data which involve the significant meanings for the association is too broad, a domain requires to be divided into a proper interval which satisfies the minimum support for the generation of large interval items. The reliability of formulated rules is enormously influenced by the generation of large interval items. Therefore, this paper proposes a new method to efficiently generate the large interval items. The proposed method does not lose any meaningful intervals compared to other existing methods, provides the accurate large interval items which are close to the minimum support, and minimizes the loss of characteristics of data. In addition, since our method merges data where the frequency of data is high enough, it provides the fast run time compared with other methods for the broad quantitative domain. To verify the superiority of proposed method, the real national census data are used for the performance analysis and a Clunix HPC system is used for the parallel processing.

• Journal of the Korean Data and Information Science Society
• /
• v.28 no.1
• /
• pp.49-56
• /
• 2017

Among the techniques for analyzing big data, the association rule mining is a technique for searching for relationship between some items using various relevance evaluation criteria. This associative rule scheme is based on the direction of rule creation, and there are positive, negative, and inverse association rules. The purpose of this paper is to investigate the applicability of various types of relatively causal strength measures to the types of association rules from the point of view of interestingness measure. We also clarify the relationship between various types of confidence measures. As a result, if the rate of occurrence of the posterior item is more than 0.5, the first measure ($RCS_{IJ1}$) proposed by Good (1961) is more preferable to the first measure ($RCS_{LR1}$) proposed by Lewis (1986) because the variation of the value is larger than that of $RCS_{LR1}$, and if the ratio is less than 0.5, $RCS_{LR1}$ is more preferable to $RCS_{IJ1}$.

• Journal of Intelligence and Information Systems
• /
• v.14 no.1
• /
• pp.1-17
• /
• 2008

Data mining is defined as the process of discovering meaningful and useful pattern in large volumes of data. In particular, finding associations rules between items in a database of customer transactions has become an important thing. Some data structures and algorithms had been proposed for storing meaningful information compressed from an original database to find frequent itemsets since Apriori algorithm. Though existing method find all association rules, we must have a lot of process to analyze association rules because there are too many rules. In this paper, we propose a new data structure, called a Frequent Pattern Network (FPN), which represents items as vertices and 2-itemsets as edges of the network. In order to utilize FPN, We constitute FPN using item's frequency. And then we use a clustering method to group the vertices on the network into clusters so that the intracluster similarity is maximized and the intercluster similarity is minimized. We generate association rules based on clusters. Our experiments showed accuracy of clustering items on the network using confidence, correlation and edge weight similarity methods. And We generated association rules using clusters and compare traditional and our method. From the results, the confidence similarity had a strong influence than others on the frequent pattern network. And FPN had a flexibility to minimum support value.

• The KIPS Transactions:PartD
• /
• v.15D no.3
• /
• pp.429-440
• /
• 2008

Formal Concept Analysis (FCA) is a widely used methodology for data analysis, which extracts concepts and builds a concept hierarchy from given data. A concept consists of objects and attributes shared by those objects, and a concept hierarchy includes information on super-sub relations among the concepts. In this paper, we propose a method for extracting Implication and Association rules from a concept hierarchy given a query by a user. The method also describes a way for displaying the extracted rules. Based on this method, we implemented an automatic tool, QAG-Wizard. Because the QAG-Wizard not only elicits relation information for the given query, but also displays it in structured form intuitively, we expect that it can be used in the fields of data analysis, data mining and information retrieval for various purposes.