Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Principal component analysis derivation, algorithms

The field points must then be fitted to predict the activity. There are generally far more field points than known compound activities to be fitted. The least-squares algorithms used in QSAR studies do not function for such an underdetermined system. A partial least squares (PLS) algorithm is used for this type of fitting. This method starts with matrices of field data and activity data. These matrices are then used to derive two new matrices containing a description of the system and the residual noise in the data. Earlier studies used a similar technique, called principal component analysis (PCA). PLS is generally considered to be superior. [Pg.248]

The extent of homogeneous mixing of pharmaceutical components such as active drug and excipients has been studied by near-IR spectroscopy. In an application note from NIRSystems, Inc. [47], principal component analysis and spectral matching techniques were used to develop a near-IR technique/algorithm for determination of an optimal mixture based upon spectral comparison with a standard mixture. One advantage of this technique is the use of second-derivative spectroscopy techniques to remove any slight baseline differences due to particle size variations. [Pg.81]

Cluster analysis was considered in our discussion of conformational analysis (see Section 9.13) for compound selection one would typically want to select a representative molecule or molecules from each cluster. A practical consideration when deciding which cluster analysis method to use is that for large numbers of molecules some algorithms may not be feasible because they require an excessive amount of memory or may have a long execution time. Another consideration with cluster analysis (and with some of the other methods that we will discuss) is the need to calculate the distance between each pair of molecules from the vector of descriptors (or from their scaled derivatives or from a set of principal components, if these are being used). For binary descriptors such as molecular fingerprints this distance is often given by 1 — S, where S is the similarity coefficient (Table 12.3). [Pg.682]


See other pages where Principal component analysis derivation, algorithms is mentioned: [Pg.268]    [Pg.205]    [Pg.150]    [Pg.285]    [Pg.603]    [Pg.145]    [Pg.245]    [Pg.45]    [Pg.325]    [Pg.638]    [Pg.347]    [Pg.272]    [Pg.330]    [Pg.431]    [Pg.103]    [Pg.40]    [Pg.224]    [Pg.8]    [Pg.102]    [Pg.254]    [Pg.226]    [Pg.929]    [Pg.233]    [Pg.1132]    [Pg.300]   
See also in sourсe #XX -- [ Pg.71 , Pg.71 ]




SEARCH



Algorithm analysis

Algorithms principal components analysis

Analysis derivatives

Component analysis

Principal Component Analysis

Principal analysis

Principal component analysi

© 2024 chempedia.info