Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Mathematical programming  (2)
  • nonhierarchical clustering  (2)
  • (Bacillus thuringiensis var. israelensis)  (1)
  • 18-hydroxy-11-deoxycorticosterone, 18,21-hydroxy-4-pregnene-3,20-dione  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Amsterdam : Elsevier
    Journal of Steroid Biochemistry 14 (1981), S. 989-995 
    ISSN: 0022-4731
    Keywords: (18-OH-DOC) ; (DOCA) ; 11-deoxy-corticosterone acetate, 21-hydroxy-4-pregnene-3,20-dione acetate ; 18-hydroxy-11-deoxycorticosterone, 18,21-hydroxy-4-pregnene-3,20-dione
    Source: Elsevier Journal Backfiles on ScienceDirect 1907 - 2002
    Topics: Biology , Chemistry and Pharmacology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    ISSN: 0014-5793
    Keywords: (Bacillus thuringiensis var. israelensis) ; Endotoxin, δ- ; Ion channel ; Planar lipid bilayer
    Source: Elsevier Journal Backfiles on ScienceDirect 1907 - 2002
    Topics: Biology , Chemistry and Pharmacology , Physics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Journal of classification 2 (1985), S. 173-192 
    ISSN: 1432-1343
    Keywords: Ultrametric trees ; Mathematical programming ; Variable importance
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper presents the development of a new methodology which simultaneously estimates in a least-squares fashion both an ultrametric tree and respective variable weightings for profile data that have been converted into (weighted) Euclidean distances. We first review the relevant classification literature on this topic. The new methodology is presented including the alternating least-squares algorithm used to estimate the parameters. The method is applied to a synthetic data set with known structure as a test of its operation. An application of this new methodology to ethnic group rating data is also discussed. Finally, extensions of the procedure to model additive, multiple, and three-way trees are mentioned.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    ISSN: 1432-1343
    Keywords: Hierarchical clustering ; Path length trees ; Mathematical programming ; Constrained classification methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A mathematical programming algorithm is developed for fitting ultrametric or additive trees to proximity data where external constraints are imposed on the topology of the tree. The two procedures minimize a least squares loss function. The method is illustrated on both synthetic and real data. A constrained ultrametric tree analysis was performed on similarities between 32 subjects based on preferences for ten odors, while a constrained additive tree analysis was carried out on some proximity data between kinship terms. Finally, some extensions of the methodology to other tree fitting procedures are mentioned.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Psychometrika 45 (1980), S. 211-235 
    ISSN: 1860-0980
    Keywords: additive clustering ; nonhierarchical clustering ; alternating least squares
    Source: Springer Online Journal Archives 1860-2000
    Topics: Psychology
    Notes: Abstract We present a new algorithm, MAPCLUS (MAthematicalProgrammingCLUStering), for fitting the Shepard-Arabie ADCLUS (forADditiveCLUStering) model. MAPCLUS utilizes an alternating least squares method combined with a mathematical programming optimization procedure based on a penalty function approach, to impose discrete (0,1) constraints on parameters defining cluster membership. This procedure is supplemented by several other numerical techniques (notably a heuristically based combinatorial optimization procedure) to provide an efficient general-purpose computer implemented algorithm for obtaining ADCLUS representations. MAPCLUS is illustrated with an application to one of the examples given by Shepard and Arabie using the older ADCLUS procedure. The MAPCLUS solution uses half as many clusters to achieve nearly the same level of goodness-of-fit. Finally, we consider an extension of the present approach to fitting a three-way generalization of the ADCLUS model, called INDCLUS (INdividualDifferencesCLUStering).
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Psychometrika 48 (1983), S. 157-169 
    ISSN: 1860-0980
    Keywords: additive clustering ; nonhierarchical clustering ; combinatorial optimization ; three-way clustering ; individual differences clustering
    Source: Springer Online Journal Archives 1860-2000
    Topics: Psychology
    Notes: Abstract We present a new model and associated algorithm, INDCLUS, that generalizes the Shepard-Arabie ADCLUS (ADditive CLUStering) model and the MAPCLUS algorithm, so as to represent in a clustering solution individual differences among subjects or other sources of data. Like MAPCLUS, the INDCLUS generalization utilizes an alternating least squares method combined with a mathematical programming optimization procedure based on a penalty function approach to impose discrete (0,1) constraints on parameters defining cluster membership. All subjects in an INDCLUS analysis are assumed to have a common set of clusters, which are differentially weighted by subjects in order to portray individual differences. As such, INDCLUS provides a (discrete) clustering counterpart to the Carroll-Chang INDSCAL model for (continuous) spatial representations. Finally, we consider possible generalizations of the INDCLUS model and algorithm.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...