메뉴 건너뛰기




Volumn 1224, Issue , 1997, Pages 191-198

Parallel and distributed search for structure in multivariate time series

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; MACHINE LEARNING; TIME SERIES;

EID: 84947915635     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62858-4_84     Document Type: Conference Paper
Times cited : (2)

References (14)
  • 2
    • 26944447593 scopus 로고
    • Efficiently constructing relational features from background knowledge for inductive machine learning
    • John M. Aronis and Foster J. Provost. Efficiently constructing relational features from background knowledge for inductive machine learning. In Working Notes of the Knowledge Discovery in Databases Workshop, pages 347-358, 1994.
    • (1994) Working Notes of the Knowledge Discovery in Databases Workshop , pp. 347-358
    • Aronis, J.M.1    Provost, F.J.2
  • 7
    • 77951503082 scopus 로고
    • Inverse entailment and progol
    • S. Muggleton. Inverse entailment and progol. New Generation Computing, 13:245-286, 1995.
    • (1995) New Generation Computing , vol.13 , pp. 245-286
    • Muggleton, S.1
  • 10
    • 0028202408 scopus 로고
    • Representation design and bruteforce induction in a boeing manufacturing domain
    • Patricia Riddle, Richard Segal, and Oren Etzioni. Representation design and bruteforce induction in a boeing manufacturing domain. Applied Artificial Intelligence, 8:125-147, 1994.
    • (1994) Applied Artificial Intelligence , vol.8 , pp. 125-147
    • Riddle, P.1    Segal, R.2    Etzioni, O.3
  • 12
    • 85152626023 scopus 로고
    • Efficiently inducing determinations: A complete and systematic search algorithm that uses optimal pruning
    • Jeffrey C. SchIimmer. Efficiently inducing determinations: A complete and systematic search algorithm that uses optimal pruning. In Proceedings of the Tenth International Conference on Machine Learning, pages 284-290, 1993.
    • (1993) Proceedings of the Tenth International Conference on Machine Learning , pp. 284-290
    • Schiimmer, J.C.1
  • 14
    • 84947922747 scopus 로고    scopus 로고
    • Webb. OPUS: An efficient admissible algorithm for unordered search
    • Geoffrey I. Webb. OPUS: An efficient admissible algorithm for unordered search. Journal of Artificial Intelligence Research, 3:45-83, 1996.
    • (1996) Journal of Artificial Intelligence Research , vol.3 , pp. 45-83
    • Geoffrey, I.1


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