메뉴 건너뛰기




Volumn 46, Issue 3, 2010, Pages 1262-1289

Fast learning of grammar production probabilities in radar electronic support

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE CASE; COMPUTATIONAL COSTS; COMPUTATIONAL REQUIREMENTS; CONVERGENCE TIME; ELECTRONIC SUPPORT; ERROR RATE; ESTIMATED STATE; EXPECTATION MAXIMIZATION; EXPERIMENTAL PROTOCOLS; FAST LEARNING; GRAMMATICAL MODELS; MEMORY COMPLEXITY; NOVEL ALGORITHM; ORDERS OF MAGNITUDE; PARSE TREES; PERFORMANCE MEASURE; PRODUCTION RULES; RADAR DATA; RADAR EMITTERS; RADAR SIGNALS; STOCHASTIC CONTEXT FREE GRAMMAR; STORAGE REQUIREMENTS; TEST DATA; THREAT ASSESSMENT; TIME COMPLEXITY; TRAINING DATA SETS; TRAINING SETS; VITERBI; WORST-CASE EXECUTION TIME;

EID: 77955623243     PISSN: 00189251     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAES.2010.5545188     Document Type: Article
Times cited : (27)

References (31)
  • 1
    • 0020139431 scopus 로고
    • Automatic processing for ESM
    • Pt. F
    • Davies, C. L. and Hollands, P. Automatic processing for ESM. Proceedings of the IEE, Pt. F, 129, 3 (1982), 164-171.
    • (1982) Proceedings of the IEE , vol.129 , Issue.3 , pp. 164-171
    • Davies, C.L.1    Hollands, P.2
  • 8
    • 0002532056 scopus 로고
    • The estimation of stochastic context-free grammars using the inside-outside algorithm
    • Lari, K. and Young, S. The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language, 4 (1990), 35-56.
    • (1990) Computer Speech and Language , vol.4 , pp. 35-56
    • Lari, K.1    Young, S.2
  • 10
    • 0014732304 scopus 로고
    • An efficient context-free parsing algorithm
    • Feb.
    • Earley, J. An efficient context-free parsing algorithm. Communication of the ACM, 13, 2 (Feb. 1970), 84-102.
    • (1970) Communication of the ACM , vol.13 , Issue.2 , pp. 84-102
    • Earley, J.1
  • 11
    • 84930564497 scopus 로고
    • The CYK-approach to serial and parallel parsing
    • June
    • Nijholt, A. The CYK-approach to serial and parallel parsing. Language Research, 27, 2 (June 1991), 229-254.
    • (1991) Language Research , vol.27 , Issue.2 , pp. 229-254
    • Nijholt, A.1
  • 13
    • 84937297274 scopus 로고
    • An efficient probabilistic context-free parsing algorithm that computes prefix probabilities
    • Stolcke, A. An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics, 21, 2 (1995), 165-201.
    • (1995) Computational Linguistics , vol.21 , Issue.2 , pp. 165-201
    • Stolcke, A.1
  • 14
    • 0347660816 scopus 로고    scopus 로고
    • A new one-pass algorithm for estimating stochastic context-free grammars
    • Ra, D-Y. and Stockman, G. C. A new one-pass algorithm for estimating stochastic context-free grammars. Information Processing Letters, 72 (1999), 37-45.
    • (1999) Information Processing Letters , vol.72 , pp. 37-45
    • Ra, D.-Y.1    Stockman, G.C.2
  • 15
    • 4444281941 scopus 로고    scopus 로고
    • Parameter learning of logic programs for symbolic-statistical modeling
    • Sato, T. and Kameya, Y. Parameter learning of logic programs for symbolic-statistical modeling. Journal of Artificial Intelligence Research, 2 (2001), 391-454.
    • (2001) Journal of Artificial Intelligence Research , vol.2 , pp. 391-454
    • Sato, T.1    Kameya, Y.2
  • 18
    • 84943263315 scopus 로고    scopus 로고
    • Estimating grammar parameters using bounded memory
    • In H. F. P. Adriaans and M. van Zaanen (Eds.) (ICGI), New York: Springer
    • Oates, T. and Heeringa, B. Estimating grammar parameters using bounded memory. In H. F. P. Adriaans and M. van Zaanen (Eds.), Proceedings of the Sixth International Colloquium on Grammatical Inference (ICGI), New York: Springer, 2002, 185-198.
    • (2002) Proceedings of the Sixth International Colloquium on Grammatical Inference , pp. 185-198
    • Oates, T.1    Heeringa, B.2
  • 20
    • 13244260785 scopus 로고    scopus 로고
    • Evaluation of several lightweight stochastic context-free grammars for RNA secondary structure prediction
    • Dowell, R. and Eddy, S. Evaluation of several lightweight stochastic context-free grammars for RNA secondary structure prediction. BMC Bioinformatics, 5, 1 (2004), 71.
    • (2004) BMC Bioinformatics , vol.5 , Issue.1 , pp. 71
    • Dowell, R.1    Eddy, S.2
  • 23
    • 77955635638 scopus 로고    scopus 로고
    • A cross-correlation technique for radar emitter recognition using pulse time of arrival information
    • Borossa Valley, Australia
    • Elton, S. D. A cross-correlation technique for radar emitter recognition using pulse time of arrival information. In Proceedings of the 2001 Defence Applications in Signal Processing, Borossa Valley, Australia, 2001, 19-23.
    • (2001) Proceedings of the 2001 Defence Applications in Signal Processing , pp. 19-23
    • Elton, S.D.1
  • 25
    • 0037202530 scopus 로고    scopus 로고
    • Construction and evaluation of language models based on stochastic context-free grammars for speech recognition
    • Hori, C., Katoh, M., Ito, A., and Kohda, M. Construction and evaluation of language models based on stochastic context-free grammars for speech recognition. Systems and Computers in Japan, 33, 12 (2002), 48-59.
    • (2002) Systems and Computers in Japan , vol.33 , Issue.12 , pp. 48-59
    • Hori, C.1    Katoh, M.2    Ito, A.3    Kohda, M.4
  • 26
    • 34547554216 scopus 로고    scopus 로고
    • Combination of estimation algorithms and grammatical inference techniques to learn stochastic context-free grammars
    • ICGI 2000), Lisbon, Portugal, Sept.11-13
    • Nevado, F., Sanchez, J. A., and Benedi, J. M. Combination of estimation algorithms and grammatical inference techniques to learn stochastic context-free grammars. In Proceedings of the 5th International Colloquium (ICGI 2000), Lisbon, Portugal, Sept. 11-13, 2000, 164-171.
    • (2000) Proceedings of the 5th International Colloquium , pp. 164-171
    • Nevado, F.1    Sanchez, J.A.2    Benedi, J.M.3
  • 27
    • 0031237601 scopus 로고    scopus 로고
    • Consistency of stochastic context-free grammars from probabilistic estimation based on growth transformations
    • Sept.
    • Sanchez, J. A. and Benedi, J. M. Consistency of stochastic context-free grammars from probabilistic estimation based on growth transformations. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19 (Sept. 1997), 1052-1055.
    • (1997) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.19 , pp. 1052-1055
    • Sanchez, J.A.1    Benedi, J.M.2
  • 28
    • 0026187099 scopus 로고
    • The application of stochastic context-free grammars using the inside-outside algorithm
    • Lari, K. and Young, S. The application of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language, 5 (1991), 237-257.
    • (1991) Computer Speech and Language , vol.5 , pp. 237-257
    • Lari, K.1    Young, S.2
  • 29
    • 0005930884 scopus 로고    scopus 로고
    • Learning of stochastic context-free by means of estimation algorithm
    • Sanchez, J. A. and Benedi, J. M. Learning of stochastic context-free by means of estimation algorithm. EUROSPEECH'99, (1999), 1799-1802.
    • (1999) Eurospeech 99 , pp. 1799-1802
    • Sanchez, J.A.1    Benedi, J.M.2
  • 31
    • 0345438685 scopus 로고    scopus 로고
    • Roc graphs: Notes and practical considerations for data mining researchers
    • Fawcett, T. Roc graphs: Notes and practical considerations for data mining researchers. HP Labs, Technical Report HPL-2003-2004, 2003.34
    • (2003) HP Labs Technical Report HPL-2003-2004
    • Fawcett, T.1


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