메뉴 건너뛰기




Volumn 3403, Issue , 2005, Pages 1-20

Towards generic pattern mining

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; GRAPH THEORY; PATTERN RECOGNITION; TREES (MATHEMATICS);

EID: 26844570289     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32262-7_1     Document Type: Conference Paper
Times cited : (12)

References (32)
  • 6
    • 0035007850 scopus 로고    scopus 로고
    • MAFIA: A maximal frequent itemset algorithm for transactional databases
    • April
    • D. Burdick, M. Calimlim, and J. Gehrke. MAFIA: a maximal frequent itemset algorithm for transactional databases. In Intl. Conf. on Data Engineering, April 2001.
    • (2001) Intl. Conf. on Data Engineering
    • Burdick, D.1    Calimlim, M.2    Gehrke, J.3
  • 10
    • 27544478009 scopus 로고    scopus 로고
    • Advances in frequent itemset mining implementations: Report on FIMI'03
    • June
    • B. Goethals and M.J. Zaki. Advances in frequent itemset mining implementations: report on FIMI'03. SIGKDD Explorations, 6(1), June 2003.
    • (2003) SIGKDD Explorations , vol.6 , Issue.1
    • Goethals, B.1    Zaki, M.J.2
  • 21
    • 19544369474 scopus 로고    scopus 로고
    • Dryade: A new approach for discovering closed frequent trees in heterogeneous tree databases
    • A. Termier, M-C. Rousset, and M. Sebag. Dryade: a new approach for discovering closed frequent trees in heterogeneous tree databases. In IEEE Int'l Conf. on Data Mining, 2004.
    • (2004) IEEE Int'l Conf. on Data Mining
    • Termier, A.1    Rousset, M.-C.2    Sebag, M.3
  • 29
    • 0034826102 scopus 로고    scopus 로고
    • SPADE: An efficient algorithm for mining frequent sequences
    • Jan/Feb
    • M. J. Zaki. SPADE: An efficient algorithm for mining frequent sequences. Machine Learning Journal, 42(1/2):31-60, Jan/Feb 2001.
    • (2001) Machine Learning Journal , vol.42 , Issue.1-2 , pp. 31-60
    • Zaki, M.J.1


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