메뉴 건너뛰기




Volumn 1, Issue , 2006, Pages 1208-1211

Tree based behavior monitoring for adaptive fraud detection

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BEHAVIORAL RESEARCH; COMPUTER CRIME; ONLINE SYSTEMS; PROBLEM SOLVING; TREES (MATHEMATICS);

EID: 34047208045     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPR.2006.1136     Document Type: Conference Paper
Times cited : (10)

References (14)
  • 8
    • 0039253846 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • J. Han, J. Pei and Y. Yin (2001). Mining frequent patterns without candidate generation. SIGMOD'00, pp.1-12.
    • (2001) SIGMOD'00 , pp. 1-12
    • Han, J.1    Pei, J.2    Yin, Y.3
  • 10
    • 34047197386 scopus 로고    scopus 로고
    • J. R. Quinlan (1993). C4.5: Program for machine learning. Morgan Kaufmann, San Mateo, CA, USA.
    • J. R. Quinlan (1993). C4.5: Program for machine learning. Morgan Kaufmann, San Mateo, CA, USA.
  • 11
    • 27944493331 scopus 로고    scopus 로고
    • Naïve Bayesian Learning
    • Technical Report CS97-557, Department of Computer Science and Engineering, University of California, San Diego, USA
    • C. Elkan (1997). Naïve Bayesian Learning. Technical Report CS97-557, Department of Computer Science and Engineering, University of California, San Diego, USA.
    • (1997)
    • Elkan, C.1
  • 13
    • 0024889169 scopus 로고
    • Simple fast algorithms for the editing distance between trees and related problems
    • K. Zhang and D. Shasha (1989). Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing, 18:1245-1262.
    • (1989) SIAM Journal of Computing , vol.18 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2


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