By Topic

Polymer property prediction and optimization using neural networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Roy, N.K. ; Dept. of Chem., Brandeis Univ., Waltham, MA, USA ; Potter, W.D. ; Landau, D.P.

Prediction and optimization of polymer properties is a complex and highly nonlinear problem with no easy method to predict polymer properties directly and accurately. The problem is especially complicated with high molecular weight polymers such as engineering plastics which have the greatest use in industry. The effect of modifying a monomer (polymer repeat unit) on polymerization and the resulting polymer properties is not easy to investigate experimentally given the large number of possible changes. This severely curtails the design of new polymers with specific end-use properties. In this paper, we show how properties of modified monomers can be predicted using neural networks. We utilize a database of polymer properties and employ a variety of networks ranging from backpropagation networks to unsupervised self-associating maps. We select particular networks that accurately predict specific polymer properties. These networks are classified into groups that range from those that provide quick training to those that provide excellent generalization. We also show how the available polymer database can be used to accurately predict and optimize polymer properties.

Published in:

Neural Networks, IEEE Transactions on  (Volume:17 ,  Issue: 4 )