Search results

The purpose of this paper is to make the mobile e-commerce shopping more convenient and avoid information overload by a mobile e-commerce recommendation system using an improved Apriori algorithm.

Combined with the characteristics of the mobile e-commerce, an improved Apriori algorithm was proposed and applied to the recommendation system. This paper makes products that are recommended to consumers valuable by improving the data mining efficiency. Finally, a Taobao online dress shop is used as an example to prove the effectiveness of an improved Apriori algorithm in the mobile e-commerce recommendation system.

The results of the experimental study clearly show that the mobile e-commerce recommendation system based on an improved Apriori algorithm increases the efficiency of data mining to achieve the unity of real time and recommendation accuracy.

The improved Apriori algorithm is applied in the mobile e-commerce recommendation system solving the limitation of the visual interface in a mobile terminal and the mass data that are continuously generated. The proposed recommendation system provides greater prediction accuracy than conventional systems in data mining.

Association rule mining generates the patterns and correlations from the database, which requires large scanning time, and the cost of computation associated with the generation of the rules is quite high. On the other hand, the candidate rules generated using the traditional association rules mining face a huge challenge in terms of time and space, and the process is lengthy. In order to tackle the issues of the existing methods and to render the privacy rules, the paper proposes the grid-based privacy association rule mining.

The primary intention of the research is to design and develop a distributed elephant herding optimization (EHO) for grid-based privacy association rule mining from the database. The proposed method of rule generation is processed as two steps: in the first step, the rules are generated using apriori algorithm, which is the effective association rule mining algorithm. In general, the extraction of the association rules from the input database is based on confidence and support that is replaced with new terms, such as probability-based confidence and holo-entropy. Thus, in the proposed model, the extraction of the association rules is based on probability-based confidence and holo-entropy. In the second step, the generated rules are given to the grid-based privacy rule mining, which produces privacy-dependent rules based on a novel optimization algorithm and grid-based fitness. The novel optimization algorithm is developed by integrating the distributed concept in EHO algorithm.

The experimentation of the method using the databases taken from the Frequent Itemset Mining Dataset Repository to prove the effectiveness of the distributed grid-based privacy association rule mining includes the retail, chess, T10I4D100K and T40I10D100K databases. The proposed method outperformed the existing methods through offering a higher degree of privacy and utility, and moreover, it is noted that the distributed nature of the association rule mining facilitates the parallel processing and generates the privacy rules without much computational burden. The rate of hiding capacity, the rate of information preservation and rate of the false rules generated for the proposed method are found to be 0.4468, 0.4488 and 0.0654, respectively, which is better compared with the existing rule mining methods.

Data mining is performed in a distributed manner through the grids that subdivide the input data, and the rules are framed using the apriori-based association mining, which is the modification of the standard apriori with the holo-entropy and probability-based confidence replacing the support and confidence in the standard apriori algorithm. The mined rules do not assure the privacy, and hence, the grid-based privacy rules are employed that utilize the adaptive elephant herding optimization (AEHO) for generating the privacy rules. The AEHO inherits the adaptive nature in the standard EHO, which renders the global optimal solution.

The purpose of this paper is to explore various limitations of conventional mining systems in extracting useful buying patterns from retail transactional databases flooded with Big Data. The key objective is to assist retail business owners to better understand the purchase needs of their customers and hence to attract customers to physical retail stores away from competitor e-commerce websites.

This paper employs a systematic and category-based review of relevant literature to explore the challenges possessed by Big Data for retail industry followed by discussion and implementation of association between MapReduce based Apriori association mining and Hadoop-based intelligent cloud architecture.

The findings reveal that conventional mining algorithms have not evolved to support Big Data analysis as required by modern retail businesses. They require a lot of resources such as memory and computational engines. This study aims to develop MR-Apriori algorithm in the form of IRM tool to address all these issues in an efficient manner.

The paper suggests that a lot of research is yet to be done in market basket analysis, if full potential of cloud-based Big Data framework is required to be utilized.

This research arms the retail business owners with innovative IRM tool to easily extract comprehensive knowledge of useful buying patterns of customers to increase profits. This study experimentally verifies the effectiveness of proposed algorithm.

Customer lifetime value (CLV) scoring is highly effective when applied to marketing databases. Some researchers have extended the traditional association rule problem by associating a weight with each item in a transaction. However, studies of association rule mining have considered the relative benefits or significance of “items” rather than “transactions” belonging to different customers. Because not all customers are financially attractive to firms, it is crucial that their profitability be determined and that transactions be weighted according to CLV. This study aims to discover association rules from the CLV perspective.

This study extended the traditional association rule problem by allowing the association of CLV weight with a transaction to reflect the interest and intensity of customer values. Furthermore, the authors proposed a new algorithm, frequent itemsets of CLV weight (FICLV), to discover frequent itemsets from CLV-weighted transactions.

Experimental results from the survey data indicate that the proposed FICLV algorithm can discover valuable frequent itemsets. Moreover, the frequent itemsets identified using the FICLV algorithm outperform those discovered through conventional approaches for predicting customer purchasing itemsets in the coming period.

This study is the first to introduce the optimum approach for discovering frequent itemsets from transactions through considering CLV.

The purpose of this paper is to establish customers’ markets and rules of dynamic customer relationship management (CRM) systems for online retailers.

This research proposes a procedure to discover customers’ markets and rules, which adopts the recency, frequency, monetary value (RFM) variables, transaction records, and socioeconomic data of the online shoppers to be the research variables. The research methods aim at the supervised apriori algorithm, C5.0 decision tree algorithm, and RFM model.

This research discovered eight RFM markets and six rules of online retailers.

The proposed framework and research results can help retailer managers to retain and expand high value markets via their dynamic CRM and POS systems.

This research uses data mining technologies to extract high value markets and rules for marketing plans. The research variables are easy to obtain via retailers’ systems. The found customer values, RFM markets, shopping association rules, and marketing decision rules can be discovered via the framework of this research.

Sampling taxpayers for audits has always been a major concern for policymakers of tax administration. The purpose of this study is to propose a systematic method to select a small number of taxpayers with a high probability of tax fraud.

An efficient sampling method for taxpayers for an audit is investigated in the context of a property acquisition tax. An autoencoder, a popular unsupervised learning algorithm, is applied to 2,228 tax returns, and reconstruction errors are calculated to determine the probability of tax deficiencies for each return. The reasonableness of the estimated reconstruction errors is verified using the Apriori algorithm, a well-known marketing tool for identifying patterns in purchased item sets.

The sorted reconstruction scores are reasonably consistent with actual fraudulent/non-fraudulent cases, indicating that the reconstruction errors can be utilized to select suspected taxpayers for an audit in a cost-effective manner.

The proposed deep learning-based approach is expected to be applied in a real-world tax administration, promoting voluntary compliance of taxpayers, and reinforcing the self-assessing acquisition tax system.

The purpose of this paper is to propose a data mining approach for mining valuable markets for online customer relationship management (CRM) marketing strategy. The industry of coffee shops in Taiwan is employed as an empirical case study in this research.

Via a proposed data mining approach, the study used fuzzy clustering algorithm and Apriori algorithm to analyze customers for obtaining more marketing and purchasing knowledge of online CRM systems.

The research found three hard markets and one fuzzy market. Furthermore, the study discovered two association rules and two fuzzy association rules.

However, industry of coffee shops has been always a fast-growing and competitive business around the world. Thus, marketing strategy is important for this industry. The results and the proposed data mining approach of this research can be used in the industry of coffee shop or other retailers for their online CRM marketing systems.

The purpose of this paper is to determine the best approach to customer segmentation and to extrapolate associated rules for this based on recency, frequency and monetary (RFM) considerations as well as demographic factors. In this study, the impacts of RFM and demographic attributes have been challenged in order to enrich factors that lend comprehension to customer segmentation. Different types of scenario were designed, performed and evaluated meticulously under uniform test conditions. The data for this study were extracted from the database of a global pizza restaurant chain in Turkey. This paper summarizes the findings of the study and also provides evidence of its empirical implications to improve the performance of customer segmentation as well as achieving extracted rule perfection via effective model factors and variations. Accordingly, marketing and service processes will work more effectively and efficiently for customers and society. The implication of this study is that it explains a clear concept for interaction between producers and consumers.

Customer relationship management, which aims to manage record and evaluate customer interactions, is generally regarded as a vital tool for companies that wish to be successful in the rapidly changing global market. The prediction of customer behaviors is a strategically important and difficult issue because of the high variance and wide range of customer orders and preferences. So to have an effective tool for extracting rules based on customer purchasing behavior, considering tangible and intangible criteria is highly important. To overcome the challenges imposed by the multifaceted nature of this problem, the authors utilized artificial intelligence methods, including k-means clustering, Apriori association rule mining (ARM) and neural networks. The main idea was that customer clusters are better enhanced when segmentation processes are based on RFM analysis accompanied by demographic data. Weighted RFM (WRFM) and unweighted RFM values/scores were applied with and without demographic factors and utilized to compose different types and numbers of clusters. The Apriori algorithm was used to extract rules of association. The performance analyses of scenarios have been conducted based on these extracted rules. The number of rules, elapsed time and prediction accuracy were used to evaluate the different scenarios. The results of evaluations were compared with the outputs of another available technique.

The results showed that having an appropriate segmentation approach is vital if there are to be strong association rules. Also, it has been determined from the results that the weights of RFM attributes affect rule association performance positively. Moreover, to capture more accurate customer segments, a combination of RFM and demographic attributes is recommended for clustering. The results’ analyses indicate the undeniable importance of demographic data merged with WRFM. Above all, this challenge introduced the best possible sequence of factors for an analysis of clustering and ARM based on RFM and demographic data.

The work compared k-means and Kohonen clustering methods in its segmentation phase to prove the superiority of adopted segmentation techniques. In addition, this study indicated that customer segments containing WRFM scores and demographic data in the same clusters brought about stronger and more accurate association rules for the understanding of customer behavior. These so-called achievements were compared with the results of classical approaches in order to support the credibility of the proposed methodology. Based on previous works, classical methods for customer segmentation have overlooked any combination of demographic data with WRFM during clustering before proceeding to their rule extraction stages.

Frequent itemset mining (FIM) is a basic topic in data mining. Most FIM methods build itemset database containing all possible itemsets, and use predefined thresholds to determine whether an itemset is frequent. However, the algorithm has some deficiencies. It is more fit for discrete data rather than ordinal/continuous data, which may result in computational redundancy, and some of the results are difficult to be interpreted. The purpose of this paper is to shed light on this gap by proposing a new data mining method.

Regression pattern (RP) model will be introduced, in which the regression model and FIM method will be combined to solve the existing problems. Using a survey data of computer technology and software professional qualification examination, the multiple linear regression model is selected to mine associations between items.

Some interesting associations mined by the proposed algorithm and the results show that the proposed method can be applied in ordinal/continuous data mining area. The experiment of RP model shows that, compared to FIM, the computational redundancy decreased and the results contain more information.

The proposed algorithm is designed for ordinal/continuous data and is expected to provide inspiration for data stream mining and unstructured data mining.

Compared to FIM, which mines associations between discrete items, RP model could mine associations between ordinal/continuous data sets. Importantly, RP model performs well in saving computational resource and mining meaningful associations.

The proposed algorithms provide a novelty view to define and mine association.

The purpose of this study is to discover valuable customers for enterprises. The international market of Taiwan airlines can be enhanced; thus, this study aims at Taiwan’s airline market as a research area.

This research uses data mining technologies with a proposed model to analyse airline customer values for big data online marketing systems, such as customer relationship management (CRM) system. The research applied supervised apriori algorithm, socio-economic variables and a proposed model to discover the rules/markets.

The results show that eight markets were discovered and three association rules were established for business systems of airlines.

The valuable travellers/markets can be discovered by this research. By collecting shoppers’ transactional data, global online CRM and point of sales (POS) systems can be big data marketing systems. The research framework can be easily applied in online CRM/POS or big data marketing systems for international airlines; however, it is for other global businesses as well.