Application of Non-redundant Association Rules in University Library

In view of the number of the association rules to the libraries’ book circulation data are too large to analyze, this paper introduced the definition and the theorem of redundant rules ,then proposed the redundancy theorem in negative association rules. Combined with correlation, the paper gave us an algorithm and apply it to the library’s information services, the experiment show that it can mine the implied discipline, so that it can better service for library management, research and teaching.

[1]  Wei Yuan-yuan Non-redundant Rules for Redescription Datasets Mining Based on FCA , 2008 .

[2]  Wu Weiping An Efficient Algorithm for Rapidly Mining Non-redundant Rules , 2003 .

[3]  Song Han-tao Approach for Mining Positive & Negative Association Rules Based on 2-level Support , 2005 .

[4]  Ramakrishnan Srikant,et al.  Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[5]  Wei-Min Ouyang,et al.  Mining Negative Sequential Patterns in Transaction Databases , 2007, 2007 International Conference on Machine Learning and Cybernetics.

[6]  C. Gordon Bell Computer Engineering , 1998 .

[7]  Chengqi Zhang,et al.  Efficient Mining of Event-Oriented Negative Sequential Rules , 2008, 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.

[8]  Wang You Minimal Association Rules and Mining Algorithm , 2007 .

[9]  Wenjun Zeng,et al.  Image-adaptive watermarking using visual models , 1998, IEEE J. Sel. Areas Commun..

[10]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

[11]  Gao Feng Algorithm for Generating Non-Redundant Association Rules , 2001 .

[12]  Wei-Hua Hao,et al.  Mining negative sequential patterns , 2007 .