메뉴 건너뛰기




Volumn 7, Issue 1, 1996, Pages 142-146

Sequential neural text compression

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA COMPRESSION; ENCODING (SYMBOLS); LEARNING SYSTEMS; PROBABILITY;

EID: 0029732478     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/72.478398     Document Type: Article
Times cited : (75)

References (13)
  • 3
    • 0043262325 scopus 로고
    • Comparison of two unsupervised neural network models for redundancy reduction
    • M. C. Mozer, P. Smolensky, D. S. Touretzky, J. L. Elman, and A. S. Weigend, Eds.
    • S. Lindstadt, "Comparison of two unsupervised neural network models for redundancy reduction," in M. C. Mozer, P. Smolensky, D. S. Touretzky, J. L. Elman, and A. S. Weigend, Eds., in Proc. 1993 Connectionist Models Summer School, 1993, pp. 308-315.
    • (1993) Proc. 1993 Connectionist Models Summer School , pp. 308-315
    • Lindstadt, S.1
  • 4
    • 0000646059 scopus 로고
    • Learning internal representations by error propagation
    • Cambridge, MA: MIT Press
    • D. E. Rumelhart, G. E. Hinton, and R. J. Williams, "Learning internal representations by error propagation." in Parallel Distributed Processing, vol. 1. Cambridge, MA: MIT Press, 1986, pp. 318-362.
    • (1986) Parallel Distributed Processing , vol.1 , pp. 318-362
    • Rumelhart, D.E.1    Hinton, G.E.2    Williams, R.J.3
  • 5
    • 0001033889 scopus 로고
    • Learning complex, extended sequences using the principle of history compression
    • J. H. Schmidhuber, "Learning complex, extended sequences using the principle of history compression." Neural Computa., vol. 4, no 2, pp. 234-242, 1992.
    • (1992) Neural Computa. , vol.4 , Issue.2 , pp. 234-242
    • Schmidhuber, J.H.1
  • 6
    • 0040422903 scopus 로고
    • Learning factorial codes by predictability minimization
    • _, "Learning factorial codes by predictability minimization," Neural Computa., vol. 4, no. 6, pp. 863-879, 1992.
    • (1992) Neural Computa. , vol.4 , Issue.6 , pp. 863-879
  • 7
    • 0348068168 scopus 로고
    • Learning unambiguous reduced sequence descriptions
    • J. E. Moody, S. J. Hanson, and R. P. Lippman, Eds. San Mateo, CA: Morgan Kaufmann
    • _, "Learning unambiguous reduced sequence descriptions," in Advances in Neural Information Processing Systems 4, J. E. Moody, S. J. Hanson, and R. P. Lippman, Eds. San Mateo, CA: Morgan Kaufmann, 1992, pp. 291-298.
    • (1992) Advances in Neural Information Processing Systems 4 , pp. 291-298
  • 9
    • 0009305378 scopus 로고
    • Discovering predictable classifications
    • J. H. Schmidhuber and D. Prelinger, "Discovering predictable classifications," Neural Computa., vol. 5, no. 4, pp. 625-635, 1993.
    • (1993) Neural Computa. , vol.5 , Issue.4 , pp. 625-635
    • Schmidhuber, J.H.1    Prelinger, D.2
  • 11
    • 0023364261 scopus 로고
    • Arithmetic coding for data compression
    • I. H. Witten, R. M. Neal, and J. G. Cleary, "Arithmetic coding for data compression," Commun. ACM, vol. 30, no. 6, pp. 520-540, 1987.
    • (1987) Commun. ACM , vol.30 , Issue.6 , pp. 520-540
    • Witten, I.H.1    Neal, R.M.2    Cleary, J.G.3
  • 12
    • 0026157964 scopus 로고
    • Fixed data base version of the Lempel-Ziv data compression algorithm
    • A. Wyner and J. Ziv, "Fixed data base version of the Lempel-Ziv data compression algorithm," IEEE Trans. Inform. Theory, vol. 37, pp. 878-880, 1991.
    • (1991) IEEE Trans. Inform. Theory , vol.37 , pp. 878-880
    • Wyner, A.1    Ziv, J.2
  • 13
    • 0017493286 scopus 로고
    • A universal algorithm for sequential data compression
    • J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," IEEE Trans. Inform. Theory, vol. IT-23, no. 5, pp. 37-343, 1977.
    • (1977) IEEE Trans. Inform. Theory , vol.IT-23 , Issue.5 , pp. 37-343
    • Ziv, J.1    Lempel, A.2


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