메뉴 건너뛰기




Volumn 1, Issue 2, 2007, Pages

Twain: Two-end association miner with precise frequent exhibition periods

Author keywords

Association; Temporal

Indexed keywords

ASSOCIATION RULES; DATABASE SYSTEMS; MATHEMATICAL MODELS; TIME VARYING SYSTEMS;

EID: 34548222585     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/1267066.1267069     Document Type: Article
Times cited : (21)

References (46)
  • 9
    • 77953886684 scopus 로고    scopus 로고
    • Mining general temporal association rules for items with different exhibition periods
    • IEEE Computer Society Press, Los Alamitos, CA
    • CHANG, C.-Y., CHEN, M.-S., AND LEE, C.-H. 2002. Mining general temporal association rules for items with different exhibition periods. In Proceedings of the 2nd IEEE International Conference on Data Mining. IEEE Computer Society Press, Los Alamitos, CA.
    • (2002) Proceedings of the 2nd IEEE International Conference on Data Mining
    • CHANG, C.-Y.1    CHEN, M.-S.2    LEE, C.-H.3
  • 11
    • 0033877857 scopus 로고    scopus 로고
    • Discovering temporal association rules: Algorithms, language and system
    • IEEE Computer Society Press, Los Alamitos, CA
    • CHEN, X. AND PETR, I. 2000. Discovering temporal association rules: algorithms, language and system. In Proceedings of the 16th IEEE International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, CA.
    • (2000) Proceedings of the 16th IEEE International Conference on Data Engineering
    • CHEN, X.1    PETR, I.2
  • 21
    • 33749645082 scopus 로고    scopus 로고
    • MIC framework: An information-theoretic approach to quantitative association rule mining
    • IEEE Computer Society Press, Los Alamitos, CA
    • KE, Y., CHENG, J., AND NG, W. 2006. MIC framework: An information-theoretic approach to quantitative association rule mining. In Proceedings of the 22nd IEEE International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, CA.
    • (2006) Proceedings of the 22nd IEEE International Conference on Data Engineering
    • KE, Y.1    CHENG, J.2    NG, W.3
  • 25
    • 0042850501 scopus 로고    scopus 로고
    • LEE, C.-H., CHEN, M.-S., AND LIN, C.-R. 2003. Progressive partition miner: An efficient algorithm for mining general temporal association rules. IEEE Trans. Knowl. Data Eng. 15, 4 (Aug.), 1004-1017.
    • LEE, C.-H., CHEN, M.-S., AND LIN, C.-R. 2003. Progressive partition miner: An efficient algorithm for mining general temporal association rules. IEEE Trans. Knowl. Data Eng. 15, 4 (Aug.), 1004-1017.
  • 30
    • 0003959442 scopus 로고
    • Fast sequential and parallel algorithms for association rule mining: A comparison
    • Tech. Rep. CS-TR-3515, Dept. of Computer Science, Univ. of Maryland, College Park, MD
    • MUELLER, A. 1995. Fast sequential and parallel algorithms for association rule mining: A comparison. Tech. Rep. CS-TR-3515, Dept. of Computer Science, Univ. of Maryland, College Park, MD.
    • (1995)
    • MUELLER, A.1
  • 33
    • 0031220368 scopus 로고    scopus 로고
    • PARK, J.-S., CHEN, M.-S., AND YU, P. S. 1997. Using a hash-based method with transaction trimming for mining association rules. IEEE Trans. Knowl. Data Eng. 9, 5 (Oct.), 813-825.
    • PARK, J.-S., CHEN, M.-S., AND YU, P. S. 1997. Using a hash-based method with transaction trimming for mining association rules. IEEE Trans. Knowl. Data Eng. 9, 5 (Oct.), 813-825.


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