ACM Home Page
Please provide us with feedback. Feedback
The segment support map: scalable mining of frequent itemsets
Full text PdfPdf (713 KB)
Source ACM SIGKDD Explorations Newsletter archive
Volume 2 ,  Issue 2  (December 2000) table of contents
Special issue on “Scalable data mining algorithms”
Pages: 21 - 27  
Year of Publication: 2000
ISSN:1931-0145
Authors
Laks V. S. Lakshmanan  Concordia University, and IIT -Bombay
Carson Kai-Sang Leung  The University of British Columbia
Raymond T. Ng  The University of British Columbia
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 20,   Citation Count: 1
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.381005
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
 
19
 
20
21
 
22
23


Collaborative Colleagues:
Laks V. S. Lakshmanan: colleagues
Carson Kai-Sang Leung: colleagues
Raymond T. Ng: colleagues