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

Article Preview

Abstract:

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.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 998-999)

Pages:

1261-1265

Citation:

Online since:

July 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Information on http: /zh. wikipedia. org/wiki/%E5%A4%A7%E6%95%B8%E6%93%9A.

Google Scholar

[2] Shengyong Ding, FanYongBing, MinShiWu. Jie Huo Da Shu Ju. Posts & Telecom press, Beijing. 2013. 3. ( In Chinese).

Google Scholar

[3] Lei Tan. New Internet Big data mining. Publishing House of Electronics Industry, Beijing. 2013. 3. ( In Chinese).

Google Scholar

[4] Hongyan Zhang. The Research and Achievement of New Book Recommendation System in College Library. Journal of Academic Libraries, 2013(5): pp.106-113. ( In Chinese).

Google Scholar

[5] Xiao xiang Wang. Association Rules Mining Based on The Related Interest Measure. Lanzhou Jiaotong University. 2013. 6. ( In Chinese).

Google Scholar

[6] Hui LI, Xinyue LIU. A recommendation system combining user clustering and association rules with multiple minimum support. Journal of Beijing chemical university. 39(6)2012. p: 111-116. ( In Chinese).

Google Scholar