✦ LIBER ✦

On the Complexity of Additive Clustering Models

✍ Scribed by Michael D. Lee

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 178 KB
Volume: 45
Category: Article
ISSN: 0022-2496
DOI: 10.1006/jmps.1999.1299

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Regarding the complexity of additive clu

Regarding the complexity of additive clustering models: Comment on Lee (2001)

✍ Daniel J Navarro 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 97 KB

The additive clustering approach to modeling pairwise similarity of entities is a powerful tool for deriving featural stimulus representations. In a recent paper, Lee (2001) proposes a statistically principled measure for choosing between clustering models that accounts for model complexity as well

On the parallel complexity of hierarchic

On the parallel complexity of hierarchical clustering and CC-complete problems

✍ Raymond Greenlaw; Sanpawat Kantabutra 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

On the Additive and Multiplicative Model

On the Additive and Multiplicative Models of Relative Risk

✍ Dr. Ralph L. Kodell; D. W. Gaylor 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 672 KB

Two popular models of absence of synergism in epidemiologic cohort studies are analyzed and compared. It is shown that the statistical concept of the union of independent events that traditionally haa given rise to the "additive" model of relative risk can ale0 generate the "multiplicative" model of

On the complexity of inference about pro

On the complexity of inference about probabilistic relational models

✍ Manfred Jaeger 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 120 KB

We investigate the complexity of probabilistic inference from knowledge bases that encode probability distributions on finite domain relational structures. Our interest here lies in the complexity in terms of the domain under consideration in a specific application instance. We obtain the result tha

On the interpretation of crystal-field p

On the interpretation of crystal-field parameters with additive models

✍ M. Kibler; G. Grenet; R. Chatterjee 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 329 KB

On computational complexity of invalidat

On computational complexity of invalidating structured uncertainty models

✍ Onur Toker; Jie Chen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 102 KB

In this paper we study a class of uncertainty model validation=invalidation problems for linear discrete-time systems. We consider models described by a linear fractional transformation (LFT) of modeling uncertainties, which are structured, time invariant or time varying, and are bounded in H ∞ or '