ACM Home Page
Please provide us with feedback. Feedback
Mining frequent patterns by pattern-growth: methodology and implications
Full text PdfPdf (781 KB)
Source ACM SIGKDD Explorations Newsletter archive
Volume 2 ,  Issue 2  (December 2000) table of contents
Special issue on “Scalable data mining algorithms”
Pages: 14 - 20  
Year of Publication: 2000
ISSN:1931-0145
Authors
Jiawei Han  School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada V5A 1S6
Jian Pei  School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada V5A 1S6
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 149,   Citation Count: 24
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/380995.381002
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
 
4
5
 
6
7
8
9
 
10
 
11
 
12
 
13
14
15
 
16
17
 
18
[18] B. Liu, W. Hsu, and Y. Ma. Integrating classification and association rule mining. In KDD'98, pp. 80-86, New York, NY, Aug. 1998.
 
19
[19] H. Mannila, H. Toivonen, and A. I. Verkamo. Efficient algorithms for discovering association rules. In KDD'94, pp. 181-192, Seattle, WA, July 1994.
 
20
21
 
22
23
 
24
 
25
[25] J. Pei, J. Han, and R. Mao. CLOSET: An efficient algorithm for mining frequent closed itemsets. In DMKD'00, pp. 11-20, Dallas, TX, May 2000.
 
26
 
27
 
28
 
29
[29] H. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. In KDD'97, pp. 67-73, Newport Beach, CA, Aug. 1997.

CITED BY  24