메뉴 건너뛰기




Volumn , Issue , 2004, Pages 156-165

A scalable algorithm for mining maximal frequent sequences using sampling

Author keywords

[No Author keywords available]

Indexed keywords

MAXIMAL FREQUENT SEQUENCES (MFS); MAXIMAL SEQUENTIAL PATTERNS USING SAMPLING (MSPS); PRUNING; SEQUENCE MINING;

EID: 16244391435     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2004.16     Document Type: Conference Paper
Times cited : (7)

References (11)
  • 5
    • 16244396527 scopus 로고    scopus 로고
    • Efficient mining of maximal frequent itemsets from databases on a cluster of workstations
    • to appear
    • S. M. Chung and C. Luo, "Efficient Mining of Maximal Frequent Itemsets from Databases on a Cluster of Workstations," to appear in IEEE Transactions on Parallel and Distributed Systems.
    • IEEE Transactions on Parallel and Distributed Systems
    • Chung, S.M.1    Luo, C.2
  • 9
    • 0002663969 scopus 로고    scopus 로고
    • Sampling large databases for association rules
    • H. Toivonen, "Sampling Large Databases for Association Rules," Proc. of the 22nd VLDB Conf., 1996, pp. 134-145.
    • (1996) Proc. of the 22nd VLDB Conf. , pp. 134-145
    • Toivonen, H.1
  • 11
    • 0034826102 scopus 로고    scopus 로고
    • SPADE: An efficient algorithm for mining frequent sequences
    • M. J. Zaki, "SPADE: An Efficient Algorithm for Mining Frequent Sequences," Machine Learning, 42(1), 2001, pp. 31-60.
    • (2001) Machine Learning , vol.42 , Issue.1 , pp. 31-60
    • Zaki, M.J.1


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