Finding neural codes using random projections

Neurocomputing

Volumn 58-60, Issue , 2004, Pages 19-25

  Mumey, Brendan ^a   Sarkar, Aditi ^b   Gedeon, Tomáš ^b   Dimitrov, Alex ^b   Miller, John ^b  

^a Idaho National Laboratory   (United States)

^b MONTANA STATE UNIVERSITY   (United States)

Author keywords

Information quantization; Neural coding; Random projections

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; OPTIMIZATION;

NEURAL CODES; QUANTIZATION;

NEUROLOGY;

ALGORITHM; ARTICLE; CODING; COMPUTER ANALYSIS; FEASIBILITY STUDY; INFORMATION PROCESSING; NERVE PROJECTION; NERVE STIMULATION; NEUROTRANSMISSION; PRIORITY JOURNAL; PROBABILITY; RANDOMIZATION; STIMULUS RESPONSE;

EID: 2542479070     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.neucom.2004.01.017     Document Type: Article

References (6)

1. Cover T. Thomas J. Elements of Information Theory 1991 Wiley-Interscience New York
2. Dimitrov A.G. Miller J.P. Neural coding and decoding: communication channels and quantization Network: Comput. Neural Systems 12 4 2001 441-472
3. B. Mumey, T. Gedeon, Optimal mutual information quantization is NP-complete, Neural Information Coding (NIC) workshop poster, Snowbird, UT, 2003.
4. R. Shamir, R. Sharan, Click: a clustering algorithm with applications to gene expression analysis, in: Proceedings of Intelligent Systems for Molecular Biology (ISMB), 2000, pp. 307-316.
5. R. Shamir, D. Tsur, Improved algorithms for the random cluster graph model, in: Proceedings of Scandanavian Workshop on Algorithms Theory (SWAT), 2002, pp. 230-239.
6. N. Tishby, F. Pereira, W. Bialek, The information bottleneck method, in: Proceedings of the 37th Annual Allerton Conference on Communication, Control and Computing, University of Illinois, 1999.