An Data Ming Method Based on AHP and Apriori

2012 ◽  
Vol 198-199 ◽  
pp. 431-434
Author(s):  
Hua Lin Ma

As the current personalized recommendation methods of Internet bookstore are limited too much in function, this paper proposes a kind of Internet bookstore data mining method based on “Strategic”, which can provide personalized recommendations that they really want. It helps us to get the weight attribute of type of book by using AHP, the weight attributes spoken on behalf of its owner, and we add it in association rules. The experimental results indicate that the Internet bookstore recommendation method is feasible.

2010 ◽  
Vol 121-122 ◽  
pp. 447-452
Author(s):  
Qing Zhang Chen ◽  
Yu Jie Pei ◽  
Yan Jin ◽  
Li Yan Zhang

As the current personalized recommendation systems of Internet bookstore are limited too much in function, this paper build a kind of Internet bookstore recommendation system based on “Strategic Data Mining”, which can provide personalized recommendations that they really want. It helps us to get the weight attribute of type of book by using AHP, the weight attributes spoken on behalf of its owner, and we add it in association rules. Then the method clusters the customer and type of book, and gives some strategies of personalized recommendation. Internet bookstore recommendation system is implemented with ASP.NET in this article. The experimental results indicate that the Internet bookstore recommendation system is feasible.


2014 ◽  
Vol 651-653 ◽  
pp. 2185-2188
Author(s):  
Jin Ping Zou ◽  
Xiao Dong Xie

the accurate data mining problem is studied in this paper. With the increasing of data attributes, degree of complexity of the data storage is also increased, resulting in that in data mining process, the complexity of computation is too high, reducing the convergence of the data mining method, thereby reducing the efficiency of data mining. To this end, this paper presents a data mining method based on association rules algorithm. The data is made simplified processing, to obtain the association rules between data which provides the basis for data mining. According to the association rules between the data, the data in line with the minimum support degree is calculated, to achieve accurate data mining. Experimental results show that the proposed algorithm for data mining, can improve mining efficiency, and achieve the desired results.


2014 ◽  
Vol 13 (2) ◽  
pp. 333-339 ◽  
Author(s):  
Yao Chunlong ◽  
Sun Cuicui . ◽  
Fan Fenglong . ◽  
Shen Lan .

2021 ◽  
Author(s):  
Carlos Molina ◽  
Belen Prados-Suarez ◽  
Beatriz Martinez-Sanchez

Federated learning has a great potential to create solutions working over different sources without data transfer. However current federated methods are not explainable nor auditable. In this paper we propose a Federated data mining method to discover association rules. More accurately, we define what we consider as interesting itemsets and propose an algorithm to obtain them. This approach facilitates the interoperability and reusability, and it is based on the accessibility to data. These properties are quite aligned with the FAIR principles.


Author(s):  
Xiaoni Wang ◽  

According to the characteristics of the constrained resource in distributed real-time data mining in the Internet of Things (IOT) environment, a distributed data mining method is researched in such environment. Based on the limits of computing ability, storage ability, battery energy resources, network bandwidth, and the Internet single point failure, the distributed network data mining method is researched, and the adaptive technology and peer-to-peer node method are adopted. The DRA-Kmeans algorithm of data mining based on theK-means algorithm is proposed, and the amount of data communication among the sites to reduce the number of iterations and clustering is reduced. Clustering efficiency is improved, and better clustering results and execution efficiency are achieved.


2014 ◽  
Vol 687-691 ◽  
pp. 1466-1469
Author(s):  
Zhen Chao Wang

In the process of massive student data mining using traditional method, special words and related characteristics were used as mining objects. The concealment and feature of deliberately camouflaged of information made it is difficult for mining model to form an effective cluster centers, which reduced the accuracy of information mining. Hence an optimized data mining method was proposed. According to the degree of generalization and fuzziness of the feature words of student, the threshold of mining information was set, which avoided the effects of redundant information, thus the efficiency of mining was improved. The experimental results showed that using the improved algorithm to perform information mining in massive student database could effectively improve mining efficiency.


2011 ◽  
Vol 291-294 ◽  
pp. 2369-2373
Author(s):  
Ming Hua Jiang

This paper introduces the mobile phone services and association rules, and a data mining method Apriori Algorithm is introduced and uses it to mine the frequency of mobile phone services,and referrals to salespersons to develop the mobile phone services which woud lead to maximum profit,and help mobile telecommunicaiton company to make decision on seveices planning.


2010 ◽  
Vol 143-144 ◽  
pp. 477-481 ◽  
Author(s):  
Yin Qiu Wang ◽  
Xun Xu

Data mining is the process of analyzing data from different perspectives and summarizing it into useful information. The financial management of enterprise management is an important component of the work is the core of enterprise management, improve business management and enhance the economic efficiency of enterprises is very important role. This paper proposes an improved data mining method to enhance the capability of exploring valuable information from financial statements. Experimental results indicate that this proposed method significantly improves the performance.


Sign in / Sign up

Export Citation Format

Share Document