메뉴 건너뛰기




Volumn 2737, Issue , 2003, Pages 257-266

FSSM: Fast construction of the optimized segment support map

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA WAREHOUSES; TREES (MATHEMATICS);

EID: 35248817442     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45228-7_26     Document Type: Article
Times cited : (5)

References (13)
  • 1
    • 0001882616 scopus 로고
    • Fast Algorithm for Mining Association Rules
    • Santiago, Chile, August
    • R. Agrawal and R. Srikant. Fast Algorithm for Mining Association Rules. In Proc. of VLDB, pages 487-499, Santiago, Chile, August 1994.
    • (1994) Proc. of VLDB , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 3
    • 0002034653 scopus 로고    scopus 로고
    • Efficient Mining of Emerging Patterns: Discovering Trends and Differences
    • San Diego, CA, USA, August
    • G. Dong and J. Li. Efficient Mining of Emerging Patterns: Discovering Trends and Differences. In Proc. of ACM SIGKDD, San Diego, CA, USA, August 1999.
    • (1999) Proc. of ACM SIGKDD
    • Dong, G.1    Li, J.2
  • 4
    • 0002401815 scopus 로고
    • Discovery of Multiple-Level Association Rules from Large Databases
    • Zurich, Swizerland
    • J. Han and Y. Fu. Discovery of Multiple-Level Association Rules from Large Databases. In Proc. of VLDB, Zurich, Swizerland, 1995.
    • (1995) Proc. of VLDB
    • Han, J.1    Fu, Y.2
  • 5
    • 47849119266 scopus 로고    scopus 로고
    • Mining Frequent Patterns without Candidate Generation: A Frequent-pattern Tree Approach
    • J. Han, J. Pei Y. Yin, and R. Mao. Mining Frequent Patterns without Candidate Generation: A Frequent-pattern Tree Approach. J. of Data Mining and Knowledge Discovery, 7(3/4), 2003.
    • (2003) J. of Data Mining and Knowledge Discovery , vol.7 , Issue.3-4
    • Han, J.1    Pei, J.2    Yin, Y.3    Mao, R.4
  • 8
    • 0008717186 scopus 로고    scopus 로고
    • The Segment Support Map: Scalable Mining of Frequent Itemsets
    • December
    • L. Lakshmanan, K-S. Leung, and R.T. Ng. The Segment Support Map: Scalable Mining of Frequent Itemsets. SIGKDD Explorations, 2:21-27, December 2000.
    • (2000) SIGKDD Explorations , vol.2 , pp. 21-27
    • Lakshmanan, L.1    Leung, K.-S.2    Ng, R.T.3
  • 9
    • 0000319965 scopus 로고
    • Discovering Frequent Episodes in Sequences
    • Montreal, Canada, August
    • H. Mannila, H. Toivonen, and A. I. Verkamo. Discovering Frequent Episodes in Sequences. In Proc. of ACM SIGKDD, Montreal, Canada, August 1995.
    • (1995) Proc. of ACM SIGKDD
    • Mannila, H.1    Toivonen, H.2    Verkamo, A.I.3
  • 10
    • 0036208481 scopus 로고    scopus 로고
    • OSSM: A Segmentation Approach to Optimize Frequency Counting
    • San Jose, CA, USA, February
    • C. K-S. Leung R. T. Ng and H. Mannila. OSSM: A Segmentation Approach to Optimize Frequency Counting. In Proc. of IEEE Int. Conf. on Data Engineering, pages 583-592, San Jose, CA, USA, February 2002.
    • (2002) Proc. of IEEE Int. Conf. on Data Engineering , pp. 583-592
    • Leung, C.K.-S.1    Ng, R.T.2    Mannila, H.3
  • 11
    • 0032092760 scopus 로고    scopus 로고
    • Exploratory Mining and Pruning Optimizations of Constrained Association Rules
    • Washington, USA, June
    • R. T. Ng, L. V. S. Lakshmanan, and J. Han. Exploratory Mining and Pruning Optimizations of Constrained Association Rules. In Proc. of SIGMOD, Washington, USA, June 1998.
    • (1998) Proc. of SIGMOD
    • Ng, R.T.1    Lakshmanan, L.V.S.2    Han, J.3
  • 13
    • 0033901934 scopus 로고    scopus 로고
    • Mining Recurrent Items in Multimedia with Progressive Resolution Refinement
    • San Diego, March
    • O. R. Zaiane, J. Han, and H. Zhu. Mining Recurrent Items in Multimedia with Progressive Resolution Refinement. In Proc. of ICDE, San Diego, March 2000.
    • (2000) Proc. of ICDE
    • Zaiane, O.R.1    Han, J.2    Zhu, H.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.