Mining N-most interesting itemsets using support-ordered tries

IEEE International Conference on Computer Systems and Applications, 2006

Volumn 2006, Issue , 2006, Pages 592-599

  Arshad, Muhammad Umer ^b   Ayyaz, Muhammad Naeem ^a,b  

^a IEEE   (Pakistan)

^b UNIVERSITY OF ENGINEERING AND TECHNOLOGY   (Pakistan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONSTRAINT THEORY; PROBLEM SOLVING; THRESHOLD ELEMENTS;

EXECUTION TIME; FREQUENT ITEMSETS (FI); SUPPORT-ORDERED TRIE ITEMSET (SOTRIELT);

DATA MINING;

EID: 33750835594     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/aiccsa.2006.205150     Document Type: Conference Paper

References (25)

1. A. W. -C. Fu, R. W. -W. Kwong, and J. Tang "Mining Ar-most Interesting Itemsets," Proc. Int'l Symp. Methodologies for Intelligent Systems (EMS), 2000.
2. Y. -K. Woon, W -K. Ng, and E -P. Lim, "A Support-Ordered Trie for Fast Frequent Itemset Discovery," IEEE TKDE, vol. 16, no. 7, pp. 875-879, July 2004.
3. R. Agrawal and J. Shafer, "Parallal Mining of Association Rules," IEEE TKDE, vol. 8, no. 6, pp. 962-969, December 1994.
4. H. Mannila, H. Toivonen, and A. I. Verkamo, "Efficient algorithms for discovering association rules," Proc. Intl. Conf. on Knowledge Discovery and Data Mining (KDD'94), pp. 181-192, Seattle, WA, July 1994.
5. Amir, R. Feldman, and R. Kashi, "A New and Versatile Method for Association Generation," Information Systems, vol. 22, no. 6, pp. 333-347, 1999.
6. R. Agrawal, T. Imielinski, and A. Swami, "Minining Association Rules Between Sets of Items in Large Databases," ACM SIGMOD Conf., pp. 207-216, May 1993.
7. R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules," Proc. 20th Very Large Database Conf. (VLDB), pp. 487-499, September 1994.
8. K. Gouda and M. J. Zaki, "Efficiently Mining Maximal Frequent Itemsets," In Proc. ICDM'01, San Jose, CA, November 2001.
9. M. J. Zaki, "Scalable Algorithms for Association Mining," IEEE TKDE, vol. 12, no. 3, pp. 372-390, June 2000.
10. J. Pei, J. Han and R. Mao, "CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets," In Proc. DMKD'00, 2000.
11. M. J. Zaki and C. J. Hasino. "CHARM: An Efficient Algorithm for Closed Itemset Mining," In Proc SIAM'02, Arlington, April 2002.
12. Y. L. Cheung and A. Fu, "Mining Frequent Itemsets without Support Threshold: With and without Item Constraints," IEEE TKDE, vol. 16, no. 9, pp. 774-778, September 2002.
13. J. Han, J. Pei, and Y. Yin, "Mining Frequent Patterns without Candidate Generation," Proc. ACM SIGMOD Conf., pp. 1-12, 2000.
14. J. Han, J. Wang, Y. Lu, and P. Tzvetkov, "Mining Top-K Frequent Closed Patterns without Minimum Support," In Proc. Int'l Conf. on Data Mining (ICDM' 02), pp. 211-218, 2002.
15. P. Tzvetkov, X. Yan, and J. Han, "TSP: Mining Top-k Closed Sequential Patterns," Journal of Knowledge and Information Systems, 2005. In Proc. Int'l Conf. on Data Mining (ICDM' 03), pp. 347-354, 2003.
16. 2P-growth: An Efficient Algorithm for Mining Frequent Patterns without any Thresholds," In Proc. of IEEE ICDM'04 Workshop on Alternative Techniques for Data Mining and Knowledge Discoverey, Brighton, UK, November 2004.
17. Z. He, "Mining Top-k Approximate Frequent Patterns," http://arxiv.org/abs/cs.DB/0503037
18. J. S. Park, M.S. Chen, and P.S. Yu, "Using a hash-based method with transaction trimming for mining association rules," IEEE TKDE, vol. 9, no. 5, pp. 813-824, September 1997.
19. F. Coenen, P. Leng, and S. Ahmed, "Data Structures for Association Rule Mining: T-Trees and P-Trees," IEEE TKDE, vol. 16, no. 6, pp. 774-778, June 2004.
20. R. Rymon, "Search through Systematic Set Enumeration," Proc. Third Int'l Conf. Principles of Knowledge Representation and Reasoning, pp. 539-550, 1992.
21. R. de la Briandais, "File searching using variable-length keys," In Western Joint Computer Conference, pages 295-298, March 1959.
22. E. Fredkin, "Trie Memory," Communication of the ACM, 3(9): 490-499, 1960.
23. D. E. Knuth. "The Art of Computer Programming," vol. 3, Addison-Wesley, 1968.
24. A. Das, W. -k Ng, and Y. -k Woon, "Rapid Association Rule Mining," In Proc. CIKM, Atlanta, Georgia, November 2001.
25. IBM Almaden Research Center, Synthetic Data Generation code for Associaton and Sequential Patterns, http://www.almaden.ibm.com/software.quest