Study the Personal Push Service of University Library Based on Big Data Mining

2014 ◽  
Vol 998-999 ◽  
pp. 1261-1265 ◽  
Author(s):  
Cheng Yi ◽  
Ying Xia ◽  
Zhi Yong Zhang

It expounds the big data and the relevant theoretical knowledge of big data mining, In view of the lack of effective analysis of the data resource access in delivery service of university library, this paper designs the personalized recommendation system service model of university library, with clustering analysis and association rules theory as the foundation of technology. And it introduces in detail how to cluster according to the user's attribute characteristics and how to introduce minimum support to opti-mize on the basis of the classical association rules algorithm. Experiments show that the improved algorithm can improves the utilization of library resources.

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Sha Duan ◽  
Ziwei Wang

In the digital information age, data mining technology is becoming more widely used in libraries for its useful impact. In the context of big data, how to efficiently mine big data, extract features, and provide users with high-quality personalized service is one of the important issues that needs to be solved in the current university library big data application. Brain computing is a kind of comprehensive processing behavior of the human brain simulated by the computer, which can comprehensively analyze a variety of information and play a very good guiding role in processing library service behavior. This paper briefly introduces the related concepts and algorithms of data mining technology and deeply studies the classical algorithm of association rules, namely, Apriori algorithm, which analyzes the necessity and feasibility of applying data mining technology to university library management. The design idea and functional goal of the college book intelligent recommendation system are based on the decision tree method and association rule analysis method. Through the application research of data mining technology in the personalized service of the university library, combined with the actual work, this paper proposes data mining of association rules in the university library system. The research further elaborates on the system architecture, data processing, mining implementation algorithms, and application of mining results. The experimental results of the research have certain significance for the university library to explore personalized services, provide book recommendation services, and make corresponding decisions to optimize the library’s collection layout.


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 568-570 ◽  
pp. 798-801
Author(s):  
Ye Qing Xiong ◽  
Shu Dong Zhang

It occurs time and space performance bottlenecks when traditional association rules algorithms are used to big data mining. This paper proposes a parallel algorithm based on matrix under cloud computing to improve Apriori algorithm. The algorithm uses binary matrix to store transaction data, uses matrix "and" operation to replace the connection between itemsets and combines cloud computing technology to implement the parallel mining for frequent itemsets. Under different conditions, the simulation shows it improves the efficiency, solves the performance bottleneck problem and can be widely used in big data mining with strong scalability and stability.


2018 ◽  
Vol 36 (3) ◽  
pp. 443-457 ◽  
Author(s):  
Kaigang Yi ◽  
Tinggui Chen ◽  
Guodong Cong

Purpose Nowadays, database management system has been applied in library management, and a great number of data about readers’ visiting history to resources have been accumulated by libraries. A lot of important information is concealed behind such data. The purpose of this paper is to use a typical data mining (DM) technology named an association rule mining model to find out borrowing rules of readers according to their borrowing records, and to recommend other booklists for them in a personalized way, so as to increase utilization rate of data resources at library. Design/methodology/approach Association rule mining algorithm is applied to find out borrowing rules of readers according to their borrowing records, and to recommend other booklists for them in a personalized way, so as to increase utilization rate of data resources at library. Findings Through an analysis on record of book borrowing by readers, library manager can recommend books that may be interested by a reader based on historical borrowing records or current book-borrowing records of the reader. Research limitations/implications If many different categories of book-borrowing problems are involved, it will result in large length of encoding as well as giant searching space. Therefore, future research work may be considered in the following aspects: introduce clustering method; and apply association rule mining method to procurement of book resources and layout of books. Practical implications The paper provides a helpful inspiration for Big Data mining and software development, which will improve their efficiency and insight on users’ behavior and psychology. Social implications The paper proposes a framework to help users understand others’ behavior, which will aid them better take part in group and community with more contribution and delightedness. Originality/value DM technology has been used to discover information concealed behind Big Data in library; the library personalized recommendation problem has been analyzed and formulated deeply; and a method of improved association rules combined with artificial bee colony algorithm has been presented.


Web Services ◽  
2019 ◽  
pp. 702-711
Author(s):  
Anu Saini

Today every big company, like Google, Flipkart, Yahoo, Amazon etc., is dealing with the Big Data. This big data can be used to predict the recommendation for the user on the basis of their past behavior. Recommendation systems are used to provide the recommendation to the users. The author presents an overview of various types of recommendation systems and how these systems give recommendation by using various approaches of Collaborative Filtering. Various research works that employ collaborative filtering for recommendations systems are reviewed and classified by the authors. Finally, this chapter focuses on the framework of recommendation system of big data along with the detailed survey on the use of the Big Data mining in collaborative filtering.


This chapter aims at exploring the intersection of cloud computing with big data. The big data analysis, mining, and privacy concerns are discussed. First, this chapter deals with the software framework, MapReduce™ that is commonly used for performing Big Data Analysis in the clouds. In addition, some of the most used techniques for performing Big Data Mining are detailed. For instance, Clustering, Co-Clustering, and Association Rules are described in detail. In particular, the k-center problem is described while with reference to the association rules beyond the basic definitions, the Apriori Algorithm is outlined and illustrated by some numerical examples. These techniques are also described with reference to their versions based on MapReduce. Finally, the description of some real applications conclude the chapter.


Author(s):  
Anu Saini

Today every big company, like Google, Flipkart, Yahoo, Amazon etc., is dealing with the Big Data. This big data can be used to predict the recommendation for the user on the basis of their past behavior. Recommendation systems are used to provide the recommendation to the users. The author presents an overview of various types of recommendation systems and how these systems give recommendation by using various approaches of Collaborative Filtering. Various research works that employ collaborative filtering for recommendations systems are reviewed and classified by the authors. Finally, this chapter focuses on the framework of recommendation system of big data along with the detailed survey on the use of the Big Data mining in collaborative filtering.


Sign in / Sign up

Export Citation Format

Share Document