Mining customer dynamics in designing customer segmentation using data mining techniques

The purpose of this paper is to propose a combined data mining approach for analyzing and profiling customers in video on demand (VoD) services. The proposed approach integrates clustering and association rule mining. For customer segmentation, the LRFMP model is employed alongside the k-means and Apriori algorithms to generate association rules between the identified customer groups and content genres. The applicability of the proposed approach is demonstrated on real-world data obtained from an Internet protocol television (IPTV) operator. In this way, four main customer groups are identified: “high consuming-valuable subscribers”,” less consuming subscribers”,” less consuming-loyal subscribers” and “disloyal subscribers”. In detail, for each group of customers, a different marketing strategy or action is proposed, mainly campaigns, special-day promotions, discounted materials, offering favorite content, etc. Further, genres preferred by these customer segments are extracted using the Apriori algorithm. The results obtained from this case study also show that the proposed approach provides an efficient tool to form different customer segments with specific content rental characteristics, and to generate useful association rules for these distinct groups. The proposed combined approach in this research would be beneficial for IPTV service providers to implement effective CRM and customer-based marketing strategies.

The Technology has an increasing impact on all areas of life, including the education sector, and requires developing countries to emulate developed countries and integrate technology into their education systems. Recently schools in Libya are facing an issue trying to figure out why students perform poorly in certain subjects and how can they know how they will perform next in the future in coming semesters in perspective subject. There are several methods proposed to predict the student’s performance, using data mining techniques. In this paper, there are plans to create Data Mining Techniques in Education (i.e., DME) prediction model clustering, classification and association rule mining in many universities and schools in order to provide students and teachers with the most advanced platform. Although relatively late, the Libyan government finally responded to this challenge by investing heavily in rebuilding the education system and launching a national plan to presented method in terms of predicting students’ performance based on their grades in Math and English. The results are divided in to three main sections clustering analysis using k-mean algorithm, classification analysis was done using two rounds first using Gain Ratio Evaluations to find out the top attributes that used by J84 algorithm in second round of classification, and rule association analysis using A priori algorithm. Rule association analysis is applied for the clusters generate by clustering analysis to generate the rules associated with each cluster. For each section, a list of inputs is presented with the scale used for the values followed by the results of the algorithm and explanation for the finding.

The growth of the e-commerce business sector presents competitors and creates company competition. Customers are the company's main asset that must be maintained. Understanding the different characteristics, behaviors and habits of each customer segment is important for companies to identify potential customers, establish important strategies, manage customer relationships and increase company profitability. The needs and desires of each customer are different, so that determining a strategy requires a method of segmenting customers according to their respective similarities. Using the clustering method with the K-Means algorithm helps determine customer segmentation based on transaction history data. Determination of the optimal k cluster randomized K-Means doesn't always give good result, so the Elbow, Silhouette and Davies-Bouldin Index methods are used. The determination of the test variables is based on the LRFM model (Length, Recency, Frequency, and Monetary), so that the customer segmentation obtained is more accurate in recognizing customer behavior and loyalty. The results of test 3606 dataset through the preprocessing stage using these methods results in three groups of customers that is New Customers, Lost Customers and Core Customers adjust the Customer Loyalty Matrix LRFM

Coronary Heart Disease (CHD) is a ordinary cardiovascular disease which does gravely harm to humans' health. It belongs to the category of chest stuffiness and pains on usual Indian Medicine. Many more researcher work on the association improvement is a very important research field in data mining. The mining association rule recurrently has been adopting numerous replica support, confidence, interestingness. But this model can't accurate determine the correlative degree between the precursor and the major of the rule by allocation. So we proposed a new mining algorithm of association rules. Proposed a new system based SVM,fuzzy Discriminant support. Our propose Coronary Heart Disease prediction system quantitatively estimate the correlation of rules and reduce many rules that have low support or have no correlation or have negative correlation. In our work we conduct experiments on large real time rural and urban data set and to predict the diseases like Medication in Coronary Heart Disease.

The number of mobile shop is growing very fast in various regions in Indonesia including in Yogyakarta due to the increasing demand of mobile phone. This fact leads high competition among the mobile phone shops. In these conditions the mobile phone shop should have a good promotion strategy in order to survive in competition, especially for a small mobile phone shop. To create attractive promotion strategy, the companies/shops should know their customer segmentation and the buying pattern of their target market. These kind of analysis can be done using Data mining technique. This study aims to segment customer using Agglomerative Hierarchical Clustering and know customer buying pattern using Association Rule Mining. This result conducted in a mobile shop in Sleman Yogyakarta. The clustering result shows that the biggest customer segment of the shop was male university student who come on weekend and from association rule mining, it can be concluded that tempered glass and smart phone “x” as well as action camera and waterproof monopod and power bank have strong relationship. This results that used to create promotion strategies which are presented in the end of the study.

The online version contains supplementary material available at 10.1007/s40200-021-00884-2.

Data privacy becomes one of the most important aspects of Data Mining models designing. So far, most of studies on Data Mining algorithms where focused on efficiency and usability. One of a factor of achieved improvements is using a data warehouse as a source of analyzed data. In our work, we focus on the association rule mining within the parallel spatial data warehouse with data privacy preserving. According to the data model of the data warehouse, we use VPSI algorithm which operates on vertically partitioned data. The data protection mechanism uses a secure intersection of sets. The algorithm is based on the parallel version of Apriori algorithm, but instead of mining data on a transaction level, it operates on aggregated data. In our paper we analyze both aspects, efficiency and data privacy level of the algorithm.

Privacy is very important in Data Mining. Association rule mining, is a important technique, has already been applied in a wide range of areas. Large databases cannot be secured by encryption or other techniques because of complexities. These security issues can be divided into two categories: data hiding and knowledge hiding. This paper deals with the problem of association rule mining which preserves the confidentiality of each database i.e. Knowledge hiding. Knowledge hiding is concerned with the sanitization of confidential knowledge from the data. There are many methods to solve this problem. The one, presented in the paper is called support-based and confidence-based blocking schemes. Apriori algorithm is used for mining rule from database. Knowledge hiding is achieved using ISL and DSR. The improvement over sensitive rule hiding is proposed to offer more accuracy and security with smaller negative impact. In ever changing business environment like enterprises e-businesses, the old fashioned disclosure and database inference protection techniques are not capable to ensure complete data privacy. Privacy is important for the on line disclosure of private information Organizations should be able to evaluate the risk of disclosing information and should adopt new more efficient approaches for information disclosure control, in order to maintain their competitive edge in the market. Not only the data but also the hidden knowledge in the data should be made secure. The sensitive information can be extracted in the form of association rules with association rule mining tools. But this can jeopardize the privacy of the customers. Some other rule could be very critical for the company itself such as buying patterns of very rich customers. For example, an Internet based company may give up selling hardware and may concentrate on selling books and videos. Therefore a rule relating the customer buying patterns of hardware may no longer be sensitive for that company. It is desirable to apply a trivial algorithm that hides data by deleting it randomly. Data Mining is the process of discovering new patterns from large data sets involving methods from statistics and artificial intelligence but also database management. Privacy has become an important issue in Data Mining. Many methods have been brought out to solve this problem. This paper focuses on the problem of association rule mining, which hides the knowledge from each database. This paper reviews the major method of knowledge hiding. Association rule mining, as a very important technique, has already been applied in a wide range of areas. Knowledge hiding is concerned with the sanitization of confidential knowledge from the data. As a result of association rule mining, many useful association rules will be discovered, but at the same time, many privacy rules will also be exposed which do not want others to know. To solve this, limit the mining process, in order to keep these sensitive rules being hidden. There are so many methods to solve this problem. The one that is covered in the paper is just one kind of them, called support-based and confidence-based blocking schemes. Algorithm used For Knowledge Hiding is ISL algorithm or DSR algorithm (2). The main disadvantage of a block in algorithm is the fact that the dataset, apart from the blocked values, is not distorted. Thus, an adversary can disclose the hidden rules by identifying those generating item sets that contain question marks and lead to rules with a maximum confidence that lies above the minimum confidence threshold. If the number of these rules is small then the probability of identifying the sensitive ones among them becomes high. To avoid this problem, a method for selectively removing individual values from a database is introduced to prevent the discovery of a set of rules, while preserving the data for other applications. The problem of building privacy preserving algorithms is considered for one category of data mining techniques, the association rule mining. New metrics is introduced in order to demonstrate how security issues can be taken into consideration in the general framework of association rule mining (1).

Learning objects (LOs) are digital or non-digital entities used for learning, education or training commonly stored in repositories searchable by their associated metadata. Unfortunately, based on the current standards, such metadata is often missing or incorrectly entered making search difficult or impossible. In this paper, we investigate automating metadata generation for SCORM-complaint LOs based on user interactions with the LO and static information about LOs and users. Our framework, called the Intelligent Learning Object Guide (iLOG), involves real-time tracking of each user sessions (an LO Wrapper), offline data mining to identify key attributes or patterns on how the LOs have been used as well as characteristics of the users (MetaGen), and the selection of these findings as metadata. Mechanisms used in the data mining include data imputation via clustering, association rule mining, and feature selection ensemble. This paper describes the methodology of automatic annotation, presents the results on the evaluation and validation of the algorithms, and discusses the resulting metadata. We have deployed our iLOG implementation for five LOs in introductory computer science topics and collected data for over 1400 sessions. We demonstrate that iLOG successfully tracks user interactions that can be used to automate the generation of meaningful empirical usage metadata for different stakeholder groups including learners and instructors, LO developers, and researchers.

Frequent pattern mining and consequently association rule mining is a useful technique for discovering relationships between items in databases. However, as the size of the data to be analyzed increases or the values of the pruning thresholds decrease, larger number of frequent pattern and more association rules will be generated with little information about the association rules in relation to each other. This research paper discusses a method to segment rules into different sets with no internal conflicts. The goal is to establish an effective method to reduce the difficulty for businesses to review the association rules of different customer segments, and track the behaviors of market segments based on their buying behaviors. The method established in this paper has the advantage of not needing customer information, thus removing the need for businesses to obtain customer information. This removes the threat of intrusions into customer privacy. The method also generates the rule sets based on conflicting rules, and dividing rules based on customer behaviors is more accurate than customer characteristics. The proposed method has been validated by running some tests.

The rapid development of information and communication technology has driven the need for information services that are more relevant and adaptive to user behaviour. This research aims to integrate data analytics in the study of user behaviour to support the development of effective information services. The dataset used is Kaggle's Online Retail Dataset, which includes sales transaction data of online retail companies in the UK from December 2010 to December 2011. The analysis was conducted through customer segmentation using K-Means Clustering algorithm and predictive analysis with Association Rule Mining. The segmentation results successfully grouped customers into four main clusters, namely loyal customers, potential customers, passive customers, and low-spending customers. Model evaluation showed optimal performance with an accuracy rate of 85%, precision of 82%, recall of 78%, and F1-Score of 80%, and Silhouette Score of 0.62, indicating effective customer segmentation. The findings prove that the application of data analytics can provide deep insights into customer behaviour and support the development of more personalised and adaptive information services. This research is expected to be a reference in designing data-driven information service development strategies in various sectors.

This study focuses on predicting which firms will increase capital by issuing new stocks in the near future. Many stakeholders, including banks, credit rating agencies and investors, performs a variety of analyses for firms' growth, profitability, stability, activity, productivity, etc., and regularly report the firms' financial analysis indices. In the paper, we develop predictive models for rights issues using these financial analysis indices and data mining techniques. This study approaches to building the predictive models from the perspective of two different analyses. The first is the analysis period. We divide the analysis period into before and after the IMF financial crisis, and examine whether there is the difference between the two periods. The second is the prediction time. In order to predict when firms increase capital by issuing new stocks, the prediction time is categorized as one year, two years and three years later. Therefore Total six prediction models are developed and analyzed. In this paper, we employ the decision tree technique to build the prediction models for rights issues. The decision tree is the most widely used prediction method which builds decision trees to label or categorize cases into a set of known classes. In contrast to neural networks, logistic regression and SVM, decision tree techniques are well suited for high-dimensional applications and have strong explanation capabilities. There are well-known decision tree induction algorithms such as CHAID, CART, QUEST, C5.0, etc. Among them, we use C5.0 algorithm which is the most recently developed algorithm and yields performance better than other algorithms. We obtained data for the rights issue and financial analysis from TS2000 of Korea Listed Companies Association. A record of financial analysis data is consisted of 89 variables which include 9 growth indices, 30 profitability indices, 23 stability indices, 6 activity indices and 8 productivity indices. For the model building and test, we used 10,925 financial analysis data of total 658 listed firms. PASW Modeler 13 was used to build C5.0 decision trees for the six prediction models. Total 84 variables among financial analysis data are selected as the input variables of each model, and the rights issue status (issued or not issued) is defined as the output variable. To develop prediction models using C5.0 node (Node Options: Output type = Rule set, Use boosting = false, Cross-validate = false, Mode = Simple, Favor = Generality), we used 60% of data for model building and 40% of data for model test. The results of experimental analysis show that the prediction accuracies of data after the IMF financial crisis (59.04% to 60.43%) are about 10 percent higher than ones before IMF financial crisis (68.78% to 71.41%). These results indicate that since the IMF financial crisis, the reliability of financial analysis indices has increased and the firm intention of rights issue has been more obvious. The experiment results also show that the stability-related indices have a major impact on conducting rights issue in the case of short-term prediction. On the other hand, the long-term prediction of conducting rights issue is affected by financial analysis indices on profitability, stability, activity and productivity. All the prediction models include the industry code as one of significant variables. This means that companies in different types of industries show their different types of patterns for rights issue. We conclude that it is desirable for stakeholders to take into account stability-related indices and more various financial analysis indices for short-term prediction and long-term prediction, respectively. The current study has several limitations. First, we need to compare the differences in accuracy by using different data mining techniques such as neural networks, logistic regression and SVM. Second, we are required to develop and to evaluate new prediction models including variables which research in the theory of capital structure has mentioned about the relevance to rights issue.

This research demonstrates the application of association rule mining to spatio‐temporal data. Association rule mining seeks to discover associations among transactions encoded in a database. An association rule takes the form A→B where A (the antecedent) and B (the consequent) are sets of predicates. A spatio‐temporal association rule occurs when there is a spatio‐temporal relationship in the antecedent or consequent of the rule. As a case study, association rule mining is used to explore the spatial and temporal relationships among a set of variables that characterize socioeconomic and land cover change in the Denver, Colorado, USA region from 1970–1990. Geographic Information Systems (GIS)‐based data pre‐processing is used to integrate diverse data sets, extract spatio‐temporal relationships, classify numeric data into ordinal categories, and encode spatio‐temporal relationship data in tabular format for use by conventional (non‐spatio‐temporal) association rule mining software. Multiple level association rule mining is supported by the development of a hierarchical classification scheme (concept hierarchy) for each variable. Further research in spatio‐temporal association rule mining should address issues of data integration, data classification, the representation and calculation of spatial relationships, and strategies for finding ‘interesting’ rules.

Intrusion Detection System has some defects, such as signatures being generated manually, updating attack signatures difficultly and doing nothing in front of ultra data set. This paper presents a hybrid approaches for modeling IDS. Association rule mining and Rough set theory are combined as a hierarchical hybrid intelligent system model. The hybrid intrusion detection model combines association rule mining and rough set theory to improve detection accuracy and reduce false alarm, unreal alarm and computational complexity. Empirical results illustrate that the hybrid intrusion detection model can detect intrusion more accurately.

Dunia Vape Trading Business is a trading business engaged in the sale of electronic cigarette spare parts. Every consumer who is going to buy a product, the consumer looks at the product shelves one by one to find the product they are looking for. The problem that occurs is that sometimes it is tiring for consumers to search on different shelves or it can also cause consumers not to buy the products they actually need. This is because the products sold are not arranged based on the purchasing patterns that consumers often make. Therefore, a method is needed that can make it easier for consumers to find the desired product and so that UD Dunia Vape can find out consumer purchasing patterns so that it can arrange and provide products according to the usual patterns. Therefore, researchers utilize computer technology to help consumers find the desired product and so that UD Dunia Vape can find out consumer purchasing patterns so that it can arrange and provide products according to the usual patterns. In computer science, one of the methods that can be applied is by using data mining. One of the methods used in determining patterns is the Association Rule Mining Method. Association rule mining is a data mining technique that aims to find association rule patterns between a combination of items. Implementation of the Association Rule Mining Method on sales of goods at the UD Dunia Vape Store is used to provide information on the results of building material sales patterns each month which can be used as parameters in managing UD Dunia Vape's inventory of materials, in addition to providing information on the most popular and most sold building materials at UD Dunia Vape. The results obtained Based on the results and discussion, it can be concluded that the analysis of consumer purchasing patterns using the Association Rule method on Dunia Vape sales transaction data can be applied based on the results of manual method application where the association rule results are the same as data mining application testing, namely if you buy I = LOST VAPE URSA CAP POD KIT JOY PURPLE then Buy N = PODS FRIENDLY ICE PEDIA BLUEBERRY 15MG 30ML (24) with a confidence value of 100% and if you buy N = PODS FRIENDLY ICE PEDIA BLUEBERRY 15MG 30ML (24) then Buy I = LOST VAPE URSA CAP POD KIT JOY PURPLE with a confidence value of 100%.