메뉴 건너뛰기




Volumn 176, Issue 8, 2006, Pages 1003-1031

Looking into the seeds of time: Discovering temporal patterns in large transaction sets

Author keywords

Knowledge discovery; Temporal data mining; Temporal pattern

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATA PROCESSING; PATTERN RECOGNITION; SET THEORY;

EID: 31944451673     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2005.01.019     Document Type: Article
Times cited : (22)

References (20)
  • 11
    • 84890521199 scopus 로고    scopus 로고
    • A new algorithm for discovering the maximum frequent itemset
    • Advances in Database Technology-EDBT'98 March 23-27, 1998, Valencia, Spain
    • D. Lin, Z.M. Kedem, A new algorithm for discovering the maximum frequent itemset, in: Advances in Database Technology-EDBT'98, 6th International Conference on Extending Database Technology, March 23-27, 1998, Valencia, Spain, 1998, pp. 105-119.
    • (1998) 6th International Conference on Extending Database Technology , pp. 105-119
    • Lin, D.1    Kedem, Z.M.2


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