✦ LIBER ✦

Algorithms for experimental data analysis allowing for additional a priori information

✍ Scribed by A. I. Grebennikov

Publisher: Springer
Year: 1991
Tongue: English
Weight: 311 KB
Volume: 2
Category: Article
ISSN: 1046-283X
DOI: 10.1007/bf01128925

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Conceptual algorithms for analysis of ex

Conceptual algorithms for analysis of experimental data

✍ M. R. Romanovskii 📂 Article 📅 1980 🏛 Springer US 🌐 English ⚖ 381 KB

A test for additional information in can

A test for additional information in canonical correlation analysis

✍ Yasunori Fujikoshi 📂 Article 📅 1982 🏛 Springer Japan 🌐 English ⚖ 373 KB

Efficient algorithm for additive and mul

Efficient algorithm for additive and multiplicative models in data envelopment analysis

✍ Toshiyuki Sueyoshi; Yih-Long Chang 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 659 KB

Experimental Data Checker: Better Inform

Experimental Data Checker: Better Information for Organic Chemists

✍ S. E. Adams; J. M. Goodman; R. J. Kidd; A. D. McNaught; P. Murray-Rust; F. R. No 📂 Article 📅 2005 🏛 John Wiley and Sons ⚖ 8 KB

A performance criterion for information

A performance criterion for information theoretic data analysis

✍ J.L. Kinsey; R.D. Levine 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 357 KB

A practical criterion which determines the number of slgnificznt parameters (the "constraints") \\ hich need be cmplo) ed in an information theoreticdata analysis is derked and applied. ## 1. Xntroduction Implicit in the development of information theory [t-4] up to this point has been the assumpt

BicFinder: a biclustering algorithm for

BicFinder: a biclustering algorithm for microarray data analysis

✍ Wassim Ayadi; Mourad Elloumi; Jin-Kao Hao 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 649 KB