<div dir="ltr"><p class="MsoNormal" align="center" style="font-size:12.8000001907349px;text-align:center"><b><span style="font-family:Arial,sans-serif">Call for Papers</span></b></p><p class="MsoNormal" align="center" style="font-size:12.8000001907349px;text-align:center"><b><span style="font-family:Arial,sans-serif">IEEE Computational Intelligence Magazine</span></b></p><p class="MsoNormal" align="center" style="font-size:12.8000001907349px;text-align:center"><b><span style="font-family:Arial,sans-serif">Special Issue on “Model Complexity, Regularization and Sparsity”</span></b></p><p class="MsoNormal" align="center" style="font-size:12.8000001907349px;text-align:center"><a href="http://home.deib.polimi.it/boracchi/events/ModelComplexity.html" target="_blank"><span style="font-family:Arial,sans-serif">http://home.deib.polimi.it/boracchi/events/ModelComplexity.html</span></a></p><p class="MsoNormal" align="center" style="font-size:12.8000001907349px;text-align:center"> </p><p class="MsoNormal" style="margin-bottom:6pt;font-size:12.8000001907349px"><b>Aims and Scope</b></p><p class="MsoNormal" style="margin-bottom:6pt;font-size:12.8000001907349px"><span style="font-family:Arial,sans-serif">The effective management of solution complexity is one of the most important issues in addressing Computational Intelligence problems. Regularization techniques control model complexity by taking advantage of some prior information regarding the problem at hand, represented as penalty expressions that impose these properties on the solution. Over the past few years, one of the most prominent and successful types of regularization has been based on the <i>sparsity</i> prior, which promotes solutions that can be expressed as a linear combination of a few atoms belonging to a <i>dictionary</i>. Sparsity can in some sense be considered a “measure of simplicity“ and, as such, is compatible with many nature-inspired principles of Computational Intelligence. Nowadays, sparsity has become one of the leading approaches for learning adaptive representations for both descriptive and discriminative tasks, and has been shown to be particularly effective when dealing with structured, complex and high-dimensional data.</span></p><p class="MsoNormal" style="margin-bottom:6pt;font-size:12.8000001907349px"><span style="font-family:Arial,sans-serif">Regularization, including sparsity and other priors to control the model complexity, is often the key ingredient in the successful solution of difficult problems; it is therefore not surprising that these aspects have also recently gained a lot of attention in big-data processing, due to unprecedented challenges associated with the need to handle massive datastreams that are possibly high-dimensional and organized in complex structures.</span></p><p class="MsoNormal" style="margin-bottom:6pt;font-size:12.8000001907349px"><span style="font-family:Arial,sans-serif">This special issue aims at presenting the most relevant regularization techniques and approaches to control model complexity in Computational Intelligence. Submissions of papers presenting regularization methods for Neural Networks, Evolutionary Computation or Fuzzy Systems, are welcome. Submissions of papers presenting advanced regularization techniques in specific, but relevant, application fields such as data/datastream-mining, classification, big-data analytics, image/signal analysis, natural-language processing, are also encouraged.</span></p><p class="MsoNormal" style="margin-top:6pt;font-size:12.8000001907349px"><b>Topics of Interest</b></p><p align="left" style="margin-top:0px;margin-bottom:0px;font-size:12.8000001907349px;margin-left:35.7pt;line-height:14.9499998092651px"><span style="font-family:Symbol">·<span style="font-size:7pt;line-height:normal;font-family:'Times New Roman'"> </span></span>Regularization methods for big and high-dimensional data;</p><p align="left" style="margin-top:0px;margin-bottom:0px;font-size:12.8000001907349px;margin-left:35.7pt;line-height:14.9499998092651px"><span style="font-family:Symbol">·<span style="font-size:7pt;line-height:normal;font-family:'Times New Roman'"> </span></span>Regularization methods for supervised and unsupervised learning;</p><p align="left" style="margin-top:0px;margin-bottom:0px;font-size:12.8000001907349px;margin-left:35.7pt;line-height:14.9499998092651px"><span style="font-family:Symbol">·<span style="font-size:7pt;line-height:normal;font-family:'Times New Roman'"> </span></span>Regularization methods for ill-posed problems in Computational Intelligence;</p><p align="left" style="margin-top:0px;margin-bottom:0px;font-size:12.8000001907349px;margin-left:35.7pt;line-height:14.9499998092651px"><span style="font-family:Symbol">·<span style="font-size:7pt;line-height:normal;font-family:'Times New Roman'"> </span></span>Techniques to control model complexity;</p><p align="left" style="margin-top:0px;margin-bottom:0px;font-size:12.8000001907349px;margin-left:35.7pt;line-height:14.9499998092651px"><span style="font-family:Symbol">·<span style="font-size:7pt;line-height:normal;font-family:'Times New Roman'"> </span></span>Sparse representations in Computational Intelligence;</p><p align="left" style="margin-top:0px;margin-bottom:0px;font-size:12.8000001907349px;margin-left:35.7pt;line-height:14.9499998092651px"><span style="font-family:Symbol">·<span style="font-size:7pt;line-height:normal;font-family:'Times New Roman'"> </span></span>Managing model complexity in data analytics;</p><p align="left" style="margin-top:0px;margin-bottom:0px;font-size:12.8000001907349px;margin-left:35.7pt;line-height:14.9499998092651px"><span style="font-family:Symbol">·<span style="font-size:7pt;line-height:normal;font-family:'Times New Roman'"> </span></span>Effective priors for solving Computational Intelligence problems;</p><p align="left" style="margin-top:0px;margin-bottom:0px;font-size:12.8000001907349px;margin-left:35.7pt;line-height:14.9499998092651px"><span style="font-family:Symbol">·<span style="font-size:7pt;line-height:normal;font-family:'Times New Roman'"> </span></span>Multiple prior integration;</p><p align="left" style="margin:0cm 0cm 6pt 35.75pt;font-size:12.8000001907349px;line-height:14.9499998092651px"><span style="font-family:Symbol">·<span style="font-size:7pt;line-height:normal;font-family:'Times New Roman'"> </span></span>Regularization in kernel methods and support vector machines.</p><p class="MsoNormal" align="left" style="font-size:12.8000001907349px;line-height:14.9499998092651px"><b>Important Dates</b></p><p style="margin-top:0px;margin-bottom:0px;font-size:12.8000001907349px"><span style="font-family:Symbol">·<span style="font-size:7pt;font-family:'Times New Roman'"> </span></span>22<sup>nd</sup> January, 2016: Submission of Manuscripts</p><p style="margin-top:0px;margin-bottom:0px;font-size:12.8000001907349px"><span style="font-family:Symbol">·<span style="font-size:7pt;font-family:'Times New Roman'"> </span></span>30<sup>th</sup> March, 2016: Notification of Review Results</p><p style="margin-top:0px;margin-bottom:0px;font-size:12.8000001907349px"><span style="font-family:Symbol">·<span style="font-size:7pt;font-family:'Times New Roman'"> </span></span>30<sup>th</sup> April, 2016: Submission of Revised Manuscripts</p><p style="margin-top:0px;margin-bottom:0px;font-size:12.8000001907349px"><span style="font-family:Symbol">·<span style="font-size:7pt;font-family:'Times New Roman'"> </span></span>15<sup>th</sup> June, 2016: Submission of Final Manuscripts</p><p style="margin:0cm 0cm 6pt 36.05pt;font-size:12.8000001907349px"><span style="font-family:Symbol">·<span style="font-size:7pt;font-family:'Times New Roman'"> </span></span>November, 2016: Special Issue Publication</p><p class="MsoNormal" style="font-size:12.8000001907349px"><b>Submission Process</b></p><p class="MsoNormal" style="margin-top:6pt;font-size:12.8000001907349px"><span style="font-family:Arial,sans-serif">The maximum length for the manuscript is typically 20 pages in single column with double-spacing, including figures and references. Authors of papers should specify in the first page of their manuscripts the corresponding author’s contact and up to 5 keywords. </span>Additional information about submission guidelines and information for authors is provided at the <a href="http://cis.ieee.org/ieee-computational-intelligence-magazine/134-ieee-computational-intelligence-magazine-paper-submission-guidelines-and-information-for-authors.html" target="_blank">IEEE CIM website.</a></p><p class="MsoNormal" style="margin-top:6pt;font-size:12.8000001907349px">Submission instructions can be found at <a href="http://home.deib.polimi.it/boracchi/events/ModelComplexity.html" style="font-size:12.8000001907349px;text-align:center" target="_blank"><span style="font-family:Arial,sans-serif">http://home.deib.polimi.it/boracchi/events/ModelComplexity.html</span></a><a href="https://easychair.org/conferences/?conf=ieeecim1116" target="_blank"><b></b></a></p><p class="MsoNormal" align="left" style="margin-bottom:10pt;font-size:12.8000001907349px;line-height:14.9499998092651px"> </p><p class="MsoNormal" style="margin-top:6pt;font-size:12.8000001907349px"><b>Guest Editors</b></p><p class="MsoNormal" style="margin-top:6pt;font-size:12.8000001907349px"><b><span style="font-family:Arial,sans-serif">Prof. Cesare Alippi,</span></b></p><p class="MsoNormal" style="font-size:12.8000001907349px"><span lang="IT" style="font-family:Arial,sans-serif">Dipartimento di Elettronica, Informazione e Biongegneria, Politecnico di Milano,</span><span lang="IT"></span></p><p class="MsoNormal" style="font-size:12.8000001907349px"><span lang="IT" style="font-family:Arial,sans-serif">via Ponzio 34/5, Milano, 20133, Italy</span><span lang="IT"></span></p><p class="MsoNormal" style="font-size:12.8000001907349px"><span lang="IT" style="font-family:Arial,sans-serif">email: </span><a href="mailto:cesare.alippi@polimi.it" target="_blank"><span lang="IT" style="font-family:Arial,sans-serif">cesare.alippi@polimi.it</span></a><span lang="IT"></span></p><p class="MsoNormal" style="font-size:12.8000001907349px"><span lang="IT"> </span></p><p class="MsoNormal" style="font-size:12.8000001907349px"><b><span lang="IT" style="font-family:Arial,sans-serif">Dr. Giacomo Boracchi</span></b><span lang="IT" style="font-family:Arial,sans-serif">,</span><span lang="IT"></span></p><p class="MsoNormal" style="font-size:12.8000001907349px"><span lang="IT" style="font-family:Arial,sans-serif">Dipartimento di Elettronica, Informazione e Biongegneria, Politecnico di Milano,</span><span lang="IT"></span></p><p class="MsoNormal" style="font-size:12.8000001907349px"><span lang="IT" style="font-family:Arial,sans-serif">via Ponzio 34/5, Milano, 20133, Italy</span><span lang="IT"></span></p><p class="MsoNormal" style="font-size:12.8000001907349px"><span lang="IT">email: </span><a href="mailto:giacomo.boracchi@polimi.it" target="_blank"><span lang="IT" style="font-family:Arial,sans-serif">giacomo.boracchi@polimi.it</span></a><span lang="IT"></span></p><p class="MsoNormal" style="font-size:12.8000001907349px"><span lang="IT"> </span></p><p class="MsoNormal" style="font-size:12.8000001907349px"><b><span style="font-family:Arial,sans-serif">Dr. Brendt Wohlberg</span></b><span style="font-family:Arial,sans-serif">,</span></p><p class="MsoNormal" style="font-size:12.8000001907349px"><span style="font-family:Arial,sans-serif">Theoretical Division, Los Alamos National Laboratory,</span></p><p class="MsoNormal" style="font-size:12.8000001907349px"><span style="font-family:Arial,sans-serif">Los Alamos NM 87545, USA</span></p><p class="MsoNormal" style="font-size:12.8000001907349px"><span style="font-family:Arial,sans-serif">email: </span><a href="mailto:brendt@lanl.gov" target="_blank"><span style="font-family:Arial,sans-serif">brendt@lanl.gov</span></a></p><div><br></div>-- <br><div><div dir="ltr"><font face="arial, helvetica, sans-serif"><span style="color:rgb(0,0,0);font-style:normal;font-variant:normal;font-weight:normal;letter-spacing:normal;line-height:normal;text-align:-webkit-auto;text-indent:0px;text-transform:none;white-space:normal;word-spacing:0px;float:none;display:inline!important">Giacomo Boracchi, PhD</span></font><div><span style="font-family:arial,helvetica,sans-serif;line-height:20px">DEIB </span><span style="font-family:arial,helvetica,sans-serif">- </span><font face="arial, helvetica, sans-serif"><span style="line-height:20px">Dipartimento di Elettronica, </span></font><span style="line-height:20px;font-family:arial,helvetica,sans-serif">Informazione e Bioingegneria</span><div><font face="arial, helvetica, sans-serif"><span style="line-height:20px">Politecnico di Milano </span><br style="line-height:20px"><span style="color:rgb(0,0,0);font-style:normal;font-variant:normal;font-weight:normal;letter-spacing:normal;line-height:normal;text-align:-webkit-auto;text-indent:0px;text-transform:none;white-space:normal;word-spacing:0px;float:none;display:inline!important">Via Ponzio, 34/5 20133 Milano, Italy.</span><br style="color:rgb(0,0,0);font-style:normal;font-variant:normal;font-weight:normal;letter-spacing:normal;line-height:normal;text-align:-webkit-auto;text-indent:0px;text-transform:none;white-space:normal;word-spacing:0px"><span style="color:rgb(0,0,0);font-style:normal;font-variant:normal;font-weight:normal;letter-spacing:normal;line-height:normal;text-align:-webkit-auto;text-indent:0px;text-transform:none;white-space:normal;word-spacing:0px">Tel</span><span style="color:rgb(0,0,0);font-style:normal;font-variant:normal;font-weight:normal;letter-spacing:normal;line-height:normal;text-align:-webkit-auto;text-indent:0px;text-transform:none;white-space:normal;word-spacing:0px;float:none;display:inline!important">.<span> </span></span></font><span style="color:rgb(0,0,0);font-style:normal;font-variant:normal;font-weight:normal;letter-spacing:normal;line-height:normal;text-indent:0px;text-transform:none;white-space:normal;word-spacing:0px;float:none;display:inline!important"><font face="arial, helvetica, sans-serif"><a href="tel:%2B39%2002%202399%203467" value="+390223993467" target="_blank">+39 02 2399 3467</a></font><br></span><br><a href="http://home.dei.polimi.it/boracchi/" style="font-family:arial;font-style:normal;font-variant:normal;font-weight:normal;letter-spacing:normal;line-height:normal;text-align:-webkit-auto;text-indent:0px;text-transform:none;white-space:normal;word-spacing:0px;font-size:small" target="_blank">http://home.dei.polimi.it/boracchi/</a><br style="color:rgb(0,0,0);font-family:arial;font-style:normal;font-variant:normal;font-weight:normal;letter-spacing:normal;line-height:normal;text-align:-webkit-auto;text-indent:0px;text-transform:none;white-space:normal;word-spacing:0px;font-size:small" clear="all"><br><br></div></div></div></div>
</div>