메뉴 건너뛰기




Volumn 2396, Issue , 2002, Pages 15-30

Machine learning for sequential data: A review

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; DECODING; HIDDEN MARKOV MODELS; MACHINE LEARNING; SYNTACTICS;

EID: 84951778046     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-70659-3_2     Document Type: Conference Paper
Times cited : (478)

References (24)
  • 1
    • 70350708516 scopus 로고    scopus 로고
    • Achieving high-accuracy text-to-speech with machine learning
    • In R. I. Damper, editor, Chapman and Hall, New York, NY
    • G. Bakiri and T. G. Dietterich. Achieving high-accuracy text-to-speech with machine learning. In R. I. Damper, editor, Data Mining Techniques in Speech Synthesis. Chapman and Hall, New York, NY, 2002.
    • (2002) Data Mining Techniques in Speech Synthesis
    • Bakiri, G.1    Dietterich, T.G.2
  • 2
    • 0030242097 scopus 로고    scopus 로고
    • Input-output HMM’s for sequence processing
    • September
    • Y. Bengio and P. Frasconi. Input-output HMM’s for sequence processing. IEEE Transactions on Neural Networks, 7(5):1231-1249, September 1996.
    • (1996) IEEE Transactions on Neural Networks , vol.7 , Issue.5 , pp. 1231-1249
    • Bengio, Y.1    Frasconi, P.2
  • 4
    • 84933530882 scopus 로고
    • Approximating discrete probability distributions with dependence trees
    • C. Chow and C. Liu. Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14:462-467, 1968.
    • (1968) IEEE Transactions on Information Theory , vol.14 , pp. 462-467
    • Chow, C.1    Liu, C.2
  • 6
    • 0002629270 scopus 로고
    • Maximum-likelihood from incomplete data via the EM algorithm
    • A. P. Dempster, N. M. Laird, and D. B Rubin. Maximum-likelihood from incomplete data via the EM algorithm. J. Royal Stat. Soc., B39:1-38, 1977.
    • (1977) J. Royal Stat. Soc , vol.B39 , pp. 1-38
    • Dempster, A.P.1    Laird, N.M.2    Rubin, D.B.3
  • 7
    • 26444565569 scopus 로고
    • Finding structure in time
    • J. L. Elman. Finding structure in time. Cognitive Science, 14:179-211, 1990.
    • (1990) Cognitive Science , vol.14 , pp. 179-211
    • Elman, J.L.1
  • 10
    • 84942484786 scopus 로고
    • Ridge regression: Biased estimation of nonorthogonal components
    • A. E. Hoerl and R. W. Kennard. Ridge regression: biased estimation of nonorthogonal components. Technometrics, 12:55-67, 1970.
    • (1970) Technometrics , vol.12 , pp. 55-67
    • Hoerl, A.E.1    Kennard, R.W.2
  • 11
    • 0004121079 scopus 로고
    • Serial order: A parallel distributed processing approach
    • Sci., UC San Diego
    • M. I. Jordan. Serial order: A parallel distributed processing approach. ICS Rep. 8604, Inst. for Cog. Sci., UC San Diego, 1986.
    • (1986) ICS Rep. 8604, Inst. For Cog
    • Jordan, M.I.1
  • 12
    • 0031381525 scopus 로고    scopus 로고
    • Wrappers for feature subset selection
    • Ron Kohavi and George H. John. Wrappers for feature subset selection. Artificial Intelligence, 97(1-2):273-324, 1997.
    • (1997) Artificial Intelligence , vol.97 , Issue.1-2 , pp. 273-324
    • Kohavi, R.1    John, G.H.2
  • 14
    • 0030735972 scopus 로고    scopus 로고
    • Overcoming the myopic of inductive learning algorithms with RELIEFF
    • Igor Kononenko, Edvard ˇSimec, and Marko Robnik-Šikonja. Overcoming the myopic of inductive learning algorithms with RELIEFF. Applied Intelligence, 7(1): 39-55, 1997.
    • (1997) Applied Intelligence , vol.7 , Issue.1 , pp. 39-55
    • Kononenko, I.1    ˇsimec, E.2    Robnik-Šikonja, M.3
  • 15
    • 0142192295 scopus 로고    scopus 로고
    • Conditional random fields: Probabilistic models for segmenting and labeling sequence data
    • San Francisco, CA, Morgan Kaufmann
    • John Lafferty, Andrew McCallum, and Fernando Pereira. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Int. Conf. Machine Learning, San Francisco, CA,2001. Morgan Kaufmann.
    • (2001) In Int. Conf. Machine Learning
    • Lafferty, J.1    McCallum, R.2    Pereira, F.3
  • 16
    • 0032203257 scopus 로고    scopus 로고
    • Gradient-based learning applied to document recognition
    • Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner. Gradient-based learning applied to document recognition. Proceedings of the IEEE, 86(11):2278-2324, 1998.
    • (1998) Proceedings of the IEEE , vol.86 , Issue.11 , pp. 2278-2324
    • Lecun, Y.1    Bottou, L.2    Bengio, Y.3    Haffner, P.4
  • 17
    • 0001923944 scopus 로고
    • Hoeffding races: Accelerating model selection search for classification and function approximation
    • Morgan Kaufmann
    • Oded Maron and Andrew W. Moore. Hoeffding races: Accelerating model selection search for classification and function approximation. In Adv. Neural Inf. Proc. Sys. 6, 59-66. Morgan Kaufmann, 1994.
    • (1994) In Adv. Neural Inf. Proc. Sys , vol.6 , pp. 59-66
    • Maron, O.1    Moore, A.W.2
  • 18
    • 0000747663 scopus 로고    scopus 로고
    • . Maximum entropy Markov models for information extraction and segmentation
    • Morgan Kaufmann
    • Andrew McCallum, Dayne Freitag, and Fernando Pereira. Maximum entropy Markov models for information extraction and segmentation. In Int. Conf. on Machine Learning, 591-598. Morgan Kaufmann, 2000.
    • (2000) In Int. Conf. On Machine Learning , pp. 591-598
    • McCallum, A.1    Freitag, D.2    Pereira, F.3
  • 20
    • 0023803244 scopus 로고
    • Predicting the secondary structure of globular proteins using neural network models
    • N. Qian and T. J. Sejnowski. Predicting the secondary structure of globular proteins using neural network models. J. Molecular Biology, 202:865-884, 1988.
    • (1988) J. Molecular Biology , vol.202 , pp. 865-884
    • Qian, N.1    Sejnowski, T.J.2
  • 21
    • 0005685575 scopus 로고
    • C4.5: Programs for machine learning
    • J. R. Quinlan. C4.5: Programs for machine learning. Morgan Kaufmann, 1993.
    • (1993) Morgan Kaufmann
    • Quinlan, J.R.1
  • 23
    • 0000383868 scopus 로고
    • Parallel networks that learn to pronounce english text
    • February
    • T. J. Sejnowski and C. R. Rosenberg. Parallel networks that learn to pronounce english text. Journal of Complex Systems, 1(1):145-168, February 1987.
    • (1987) Journal of Complex Systems , vol.1 , Issue.1 , pp. 145-168
    • Sejnowski, T.J.1    Rosenberg, C.R.2
  • 24
    • 0000539096 scopus 로고
    • Generalization by weightelimination with application to forecasting
    • Morgan Kaufmann
    • A. S. Weigend, D. E. Rumelhart, and B. A. Huberman. Generalization by weightelimination with application to forecasting. Adv. Neural Inf. Proc. Sys. 3, 875-882, Morgan Kaufmann, 1991.
    • (1991) Adv. Neural Inf. Proc. Sys , vol.3 , pp. 875-882
    • Weigend, A.S.1    Rumelhart, D.E.2    Huberman, B.A.3


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