Abstract
Medicine Paring Analysis is one of the most important tasks in the research of Traditional Chinese Medicine Prescriptions. The most essential and difficult step is to mine associations between different medicine items. This paper proposes an effective approach in solving this problem. The main contributions include: (1) proposing a novel data structure called indexed frequent pattern tree (IFPT) to maintain the mined frequent patterns (2) presenting an efficient algorithm called Nearest Neighbor First (NNF) to mine association rules from IFPT (3) designing and implementing two optimization strategies that avoid the examinations of a lot of subsets of Y that can’t be the left part of any association rule of the form X \(\Rightarrow\) Y – X and thus achieving a wonderful performance and (4) conducting extensive experiments which show that NNF runs far faster than Apriori algorithm and has better scalability. And finally we demonstrate the effectiveness of this method in Medicine Paring Analysis.
This work was supported by Grant from National Science Foundation of China (60473071), Specialized Research Fund for Doctoral Program by the Ministry of Education (SRFDP 20020610007), and the grant from the State Administration of Traditional Chinese Medicine (SATCM 2003JP40). LI Chuan, PENG Jing, HU Jianjun are Ph. D Candidates at DB&KE Lab, Sichuan University. Jiang Yongguang is a Professor at Chengdu University of Traditional Chinese Medicine. And TANG Changjie is the associate author.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
General Guidelines for Methodologies on Research and Evaluation of Traditional Medicine, http://www.who.int/medicines/library/trm/who-edm-trm-2000-1/who-edm-trm-2000-1.pdf
Guste Editors’ Notes on the special issue, http://www.sinica.edu.tw/~jds/preface.pdf
Fan, M., Li, C.: Mining Frequent Patterns in an FP-tree Without Conditional FP-tree Generation. Journal of Computer Research and Development 40 (2004)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. 2000 ACM-SIGMOD Intl. Conf. on Management of Data, May 2000, pp. 1–12 (2000)
Li, C., Fan, M.: A New Algorithm on Multi-dimensional Association Rules Mining. Journal of Computer Science 29(A Complement), 1–4 (2002)
Li, C., Fan, M.: Generating Association Rules Based on Threaded Frequent Pattern Tree. Journal of Computer Engineering and Application 4 (2004)
Fan, M., Li, C.: A Fast Algorithm for Mining Frequent Closed ItemSets. Submitted to ICDM 2004 (2004)
Li, C., Fan, M.: Research on Single-dimensional Association Mining. Full Paper Data Base of Wanfang Network
Agrawal, R., Srikant, R.: Fast algorithms for Mining association rules. In: Proc. 1994 Int’l Conf. on Very Large Data Bases, September 1994, pp. 487–499 (1994)
Pei, J., Han, J., Mao, R.: CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets. In: Proc. 2000 ACM-SIGMOD Int. 2000 ACM SIGMOD Intl. Conference on Management of Data, pp. 8–10 (2000)
http://teacher.scu.edu.cn/~chjtang/buf/download/test/lichuan.zip
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chuan, L., Changjie, T., Jing, P., Jianjun, H., Yongguang, J., Xiaojia, Y. (2005). NNF: An Effective Approach in Medicine Paring Analysis of Traditional Chinese Medicine Prescriptions. In: Zhou, L., Ooi, B.C., Meng, X. (eds) Database Systems for Advanced Applications. DASFAA 2005. Lecture Notes in Computer Science, vol 3453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11408079_52
Download citation
DOI: https://doi.org/10.1007/11408079_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25334-1
Online ISBN: 978-3-540-32005-0
eBook Packages: Computer ScienceComputer Science (R0)