[1] Agrawal, R., Imielinski, T. and Swami, A., “Mining Association Rules between Sets of Items in Large Database,” Proceedings of the ACM SIGMOD Conference on Management of Data, Washington, D.C., USA, pp. 207-216, May, 1993.
[2] Yao, H., Hamilton, H. J. and Butz, C. J., “A foundational approach to mining itemset utilities from databases,” In Proceedings of the 4th SIAM international conference on data mining, pp. 482–486, 2004.
[3] Chan, R., Yang, Q. and Shen, Y. D., “Mining High utility Itemsets,” Proceedings of the Third IEEE International Conference on Data Mining (ICDM’03), pp.19-26, 2003.
[4] Atallah, M., Elmagarmid, A., Ibrahim, M., Bertino, E. and Verykios, V., “Disclosure limitation of sensitive rules,” CERIAS Tech Report, No. 02, 2000.
[5] 林士閔,“資料探勘技術應用於國防機敏資訊防護之研究”,國防大學理工學院資訊科學研究所碩士論文,桃園,2009。[6] Wang, S.L., Parikh, B. and Jafari, A., “Hiding Informative Association Rule Sets,” Expert Systems with Applications, Vol. 33, pp. 316-323, August, 2007.
[7] Wang, S.L., Maskey, R., Jafari, A. and Hong, T.P., “Efficient Sanitization of Informative Association Rules,” Expert Systems with Applications, Vol. 35, pp.442-450, 2008.
[8] 張淵琮、陳善泰,“機敏關聯規則集快速完全隱藏演算法”,第十八屆資訊安全會議(CISC)論文集,花蓮,第547-560頁,2008。
[9] Wu, Y. H., Chiang, C.M. and Chen, A.L.P., “Hiding Sensitive Association Rules with Limited Side Effects,” IEEE Transactions on Knowledge and Data Engineering, Vol. 19, pp. 29-42, January, 2007.
[10] Amiri, A., “Dare to Share: Protecting Sensitive Knowledge with Data Sanitization,” Decision Support Systems, Vol. 43, pp. 181-191, February, 2007.
[11] Moustakides, G.V. and Verykios, V.S., “A Max-Min Approach for Hiding Frequent Itemsets,” Proceedings of the Sixth IEEE International Conference on Data Mining, Washington, D.C., USA, pp. 502-506, 2006.
[12] Weng, C.C., Chen, S.T. and Chang, Y.C., “Novel Algorithms for Hiding Sensitive Frequent Itemsets,” Proceedings of the eighth International Symposium on Advanced Intelligent Systems, Sokcho-City, Korea, pp. 753-757, September, 2007.
[13] Li, H. F., Huang, H. Y., Chen, Y.C., Liu, Y. J. and Lee, S. Y., “Fast and Memory Efficient Mining of High Utility Itemsets in Data Streams,” Proceedings of the Eighth IEEE International Conference on Data Mining, pp. 881-886, 2008.
[14] Ahmed, C. F., Tanbeer, S. K., Jeong, B. S. and Lee, Y. K., “Mining High Utility Patterns in Incremental Databases,” ICUIMC-09, Suwon, S. Korea, pp. 656-663, 2009.
[15] Chu, C. J., Tseng, V. S. and Liang, T., “An efficient algorithm for mining temporal high utility itemsets from data streams,” The Journal of Systems and Software , Vol.81, pp. 1105–1117, 2008.
[16] Liu, Y., Liao, W. and Choudhary, A., “A Two Phase algorithm for fast discovery of High Utility of Itemsets,” In Proceedings of the 9th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD’05), pp. 689-695, 2005.
[17] Lee, C.H., Lin, C.R. and Chen, M.S., “Sliding-window filtering: an efficient algorithm for incremental mining on a time-variant database,” International Conference on Information and Knowledge Management (CIKM01), pp. 263–270, November, 2001.
[18] Shin, S. J. and Lee, W. S., “On-line generation association rules over data streams,” Information and Software Technology , Vol. 50, pp. 569-578, 2008.
[19] Han, J., Pei, J., Yin, Y. and Mao, R., “Mining frequent patterns without candidate generation: A frequent-pattern tree approach,” Data Mining and Knowledge Discovery, Vol.8, pp. 53–87, 2004.
[20] Sun, X. and Yu, P. S., “A Border-Based Approach for Hiding Sensitive Frequent Itemsets,” Proceedings of the Fifth IEEE International Conference on Data Mining (ICDM'05), pp. 426-433, 2005.
[21] 張淵淙,“關聯規則探勘於資訊分享環境中機敏資料隱藏之研究”,國防大學理工學院資訊科學研究所碩士論文,桃園,2008。
[22] Yeh, J. S. and Hsu, P. C., “HHUIF and MSICF: Novel algorithms for privacy preserving utility mining,” Expert Systems with Applications, Vol. 37, pp. 4779-4786, 2010.
[23] Weng, C. C., Chen, S. T. and Lo, H. C., “A Novel Algorithm for Completely Hiding Sensitive Association Rules,” Proceedings of the Eighth IEEE International Conference on Intelligent Systems Design and Applications, pp. 202-208, 2008.
[24] Ma, C. X. and Zhang, J., “DHUI: A New Algorithm For Mining High Utility Itemsets,” Proceedings of the Eighth International Conference on Machine Learning and Cybernetics, pp. 173-177, 2009.
[25] Shankar, S., Purusothaman, T. and Jayanthi, S., “Novel Algorithm for Mining High Utility Itemsets,” Proceedings of the 2008 International Conference on Computing, Communication and Networking (ICCCN 2008), pp. 1-6, 2008.
[26] Lin, C. W., Hong, T. P. and Lu, W. H., “The Pre-FUFP algorithm for incremental mining,” Expert Systems with Applications, Vol. 36, pp. 9498-9505, 2009.
[27] Woo, H. J. and Lee, W. S., “estMax: Tracing Maximal Frequent Itemsets over Online Data Streams,” Proceedings of the Seventh IEEE International Conference on Data Mining, pp. 709-714, 2007.
[28] Liu, Y. C. and Hsu, P. Y., “Toward supporting real-time mining for data residing on enterprise systems,” Expert Systems with Applications, Vol.34, pp. 877–888, 2008.
[29] Tseng, V. S., Wu, C. W., Shie, B. E. and Yu, P. S., “UP-Growth: An Efficient Algorithm for High Utility Itemset Mining,” Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 253-262, 2010.
[30] IBM Almaden Research Center. Synthetic data generation code for associations and sequential patterns. http://www.almaden.ibm.com/cs/projects/iis/hdb/Projects/data_mining/datasets/
syndata.html.