✦ LIBER ✦

Identifiability of factor analysis: some results and open problems

✍ Scribed by Alexander Shapiro

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 390 KB
Volume: 70
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(85)90038-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Identifiability of factor analysis: Some

Identifiability of factor analysis: Some results and open problems

✍ Alexander Shapiro 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 50 KB

Estimation of open dwell time and proble

Estimation of open dwell time and problems of identifiability in channel experiments

✍ Grace L. Yang; Charles E. Swenberg 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 764 KB

Identifiability of full, marginal, and c

Identifiability of full, marginal, and conditional factor analysis models

✍ Masamori Ihara; Yutaka Kano 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 397 KB

The end structure of a graph: recent res

The end structure of a graph: recent results and open problems

✍ Reinhard Diestel 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 1022 KB

This paper aims to give a brief introduction to a set of problems, old and new, concerned with one of the main and long-standing quests in infinite graph theory: how to represent the end structure of a given graph by that of a simpler subgraph, in particular a spanning tree. There has been a fair am

New results and open problems in the the

New results and open problems in the theory of the Vlasov equation

✍ E. Horst 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Some Results on Primeness and Unique Fac

Some Results on Primeness and Unique Factorization of Entire Functions

✍ I. Dondoshansky 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 580 KB