<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Joshi, Aniruddha</style></author><author><style face="normal" font="default" size="100%">Rajshekhar</style></author><author><style face="normal" font="default" size="100%">Chandran, S.</style></author><author><style face="normal" font="default" size="100%">Phadke, S.</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author><author><style face="normal" font="default" size="100%">Kulkarni, B. D.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Pal, S. K.</style></author><author><style face="normal" font="default" size="100%">Bandyopadhyay, Sanjoy</style></author><author><style face="normal" font="default" size="100%">Biswas, S.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Arrhythmia classification using local Holder exponents and support vector machine</style></title><secondary-title><style face="normal" font="default" size="100%">1st International Conference on Pattern Recognition and Machine Intelligence</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">LECTURE NOTES IN COMPUTER SCIENCE</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year><pub-dates><date><style  face="normal" font="default" size="100%">DEC</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Springer-Verlag Berlin, Heidelberger Platz 3, D-14197 Berlin, Germany</style></publisher><pub-location><style face="normal" font="default" size="100%"> Statist Inst. Kolkata, India</style></pub-location><volume><style face="normal" font="default" size="100%">3776</style></volume><pages><style face="normal" font="default" size="100%">242-247</style></pages><isbn><style face="normal" font="default" size="100%">3-540-30506-8</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We propose a novel hybrid Holder-SVM detection algorithm for arrhythmia classification. The Holder exponents are computed efficiently using the wavelet transform modulus maxima (WTMM) method. The hybrid system performance is evaluated using the benchmark MIT-BIH arrhythmia database. The implemented model classifies 160 of Normal sinus rhythm, 25 of Ventricular bigeminy, 155 of Atrial fibrillation and 146 of Nodal (A-V junctional) rhythm with 96.94% accuracy. The distinct scaling properties of different types of heart rhythms may be of clinical importance.&lt;/p&gt;</style></abstract><notes><style face="normal" font="default" size="100%">1st International Conference on Pattern Recognition and Machine Intelligence, Statist Inst Kolkata, Kolkata, INDIA, DEC 20-22, 2005</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Kulkarni, O. C.</style></author><author><style face="normal" font="default" size="100%">Vigneshwar, R.</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author><author><style face="normal" font="default" size="100%">Kulkarni, B. D.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Identification of coding and non-coding sequences using local holder exponent formalism</style></title><secondary-title><style face="normal" font="default" size="100%">Bioinformatics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year><pub-dates><date><style  face="normal" font="default" size="100%">OCT</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">20</style></number><publisher><style face="normal" font="default" size="100%">OXFORD UNIV PRESS</style></publisher><pub-location><style face="normal" font="default" size="100%">GREAT CLARENDON ST, OXFORD OX2 6DP, ENGLAND</style></pub-location><volume><style face="normal" font="default" size="100%">21</style></volume><pages><style face="normal" font="default" size="100%">3818-3823</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Motivation: Accurate prediction of genes in genomes has always been a challenging task for bioinformaticians and computational biologists. The discovery of existence of distinct scaling relations in coding and non-coding sequences has led to new perspectives in the understanding of the DNA sequences. This has motivated us to exploit the differences in the local singularity distributions for characterization and classification of coding and non-coding sequences. Results: The local singularity density distribution in the coding and non-coding sequences of four genomes was first estimated using the wavelet transform modulus maxima methodology. Support vector machines classifier was then trained with the extracted features. The trained classifier is able to provide an average test accuracy of 97.7%. The local singularity features in a DNA sequence can be exploited for successful identification of coding and non-coding sequences.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">20</style></issue><work-type><style face="normal" font="default" size="100%">Article</style></work-type><custom3><style face="normal" font="default" size="100%">Foreign</style></custom3><custom4><style face="normal" font="default" size="100%">5.766</style></custom4></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Kulkarni, A.</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author><author><style face="normal" font="default" size="100%">Kulkarni, B. D.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Knowledge incorporated support vector machines to detect faults in Tennessee Eastman Process</style></title><secondary-title><style face="normal" font="default" size="100%">Computers &amp; Chemical Engineering</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">fault detection</style></keyword><keyword><style  face="normal" font="default" size="100%">knowledge</style></keyword><keyword><style  face="normal" font="default" size="100%">support vector machines</style></keyword><keyword><style  face="normal" font="default" size="100%">Tennessee Eastman Process</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2005</style></year><pub-dates><date><style  face="normal" font="default" size="100%">SEP</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">10</style></number><publisher><style face="normal" font="default" size="100%">PERGAMON-ELSEVIER SCIENCE LTD</style></publisher><pub-location><style face="normal" font="default" size="100%">THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND</style></pub-location><volume><style face="normal" font="default" size="100%">29</style></volume><pages><style face="normal" font="default" size="100%">2128-2133</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;A support vector machine with knowledge incorporation is applied to detect the faults in Tennessee Eastman Process, a benchmark problem in chemical engineering. The knowledge incorporated algorithm takes advantage of the information on horizontal translation invariance in tangent direction of the instances in dataset. This essentially changes the representation of the input data while training the algorithm. These local translations do not alter the class membership of the instances in the dataset. The results on binary as well as multiple fault detection justify the use of knowledge incorporation. (c) 2005 Elsevier Ltd. All rights reserved.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">10</style></issue><work-type><style face="normal" font="default" size="100%">Article</style></work-type><custom3><style face="normal" font="default" size="100%">Foreign</style></custom3><custom4><style face="normal" font="default" size="100%">2.581</style></custom4></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Patil, N. S.</style></author><author><style face="normal" font="default" size="100%">Shelokar, P. S.</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author><author><style face="normal" font="default" size="100%">Kulkarni, B. D.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Regression models using pattern search assisted least square support vector machines</style></title><secondary-title><style face="normal" font="default" size="100%">Chemical Engineering Research and Design</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">equality constraints</style></keyword><keyword><style  face="normal" font="default" size="100%">LS-SVM</style></keyword><keyword><style  face="normal" font="default" size="100%">model selection</style></keyword><keyword><style  face="normal" font="default" size="100%">Optimization</style></keyword><keyword><style  face="normal" font="default" size="100%">pattern search</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2005</style></year><pub-dates><date><style  face="normal" font="default" size="100%">AUG</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">A8</style></number><publisher><style face="normal" font="default" size="100%">INST CHEMICAL ENGINEERS</style></publisher><pub-location><style face="normal" font="default" size="100%">165-189 RAILWAY TERRACE, DAVIS BLDG, RUGBY CV21 3HQ, ENGLAND</style></pub-location><volume><style face="normal" font="default" size="100%">83</style></volume><pages><style face="normal" font="default" size="100%">1030-1037</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Least Square Support Vector Machines (LS-SVM), a new machine-learning tool has been employed for developing data driven models of non-linear processes. The method is firmly rooted in the statistical learning theory and transforms the input data to a higher dimensional feature space where the use of appropriate kernel functions avoid computational difficulty. Further, a pattern search algorithm, which explores multiple directions and utilizes coordinate search with fixed step size, is employed for selecting optimal LS-SVM model that produces a minimum possible prediction error. To show the efficacy and efficiency of the fully automated pattern search assisted LS-SVM methodology, we have tested it on several benchmark examples. The study suggests that proposed paradigm can be a useful and viable tool in building data driven models of non-linear processes.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">8</style></issue><work-type><style face="normal" font="default" size="100%">Article</style></work-type><custom3><style face="normal" font="default" size="100%">&lt;p&gt;Foreign&lt;/p&gt;</style></custom3><custom4><style face="normal" font="default" size="100%">2.525</style></custom4></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Kumar, R.</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author><author><style face="normal" font="default" size="100%">Kulkarni, B. D.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">SVM classifier incorporating simultaneous noise reduction and feature selection: illustrative case examples</style></title><secondary-title><style face="normal" font="default" size="100%">Pattern Recognition</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">classification</style></keyword><keyword><style  face="normal" font="default" size="100%">conditional entropy</style></keyword><keyword><style  face="normal" font="default" size="100%">SVM</style></keyword><keyword><style  face="normal" font="default" size="100%">symbolization</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2005</style></year><pub-dates><date><style  face="normal" font="default" size="100%">JAN</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">1</style></number><publisher><style face="normal" font="default" size="100%">PERGAMON-ELSEVIER SCIENCE LTD</style></publisher><pub-location><style face="normal" font="default" size="100%">THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND</style></pub-location><volume><style face="normal" font="default" size="100%">38</style></volume><pages><style face="normal" font="default" size="100%">41-49</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;A hybrid technique involving symbolization of data to remove noise and use of conditional entropy minima to extract relevant and non-redundant features is proposed in conjunction with support vector machines to obtain more robust classification algorithm. The technique tested on three data sets shows improvements in classification efficiencies. (C) 2004 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">1</style></issue><work-type><style face="normal" font="default" size="100%">Article</style></work-type><custom3><style face="normal" font="default" size="100%">&lt;p&gt;Foreign&lt;/p&gt;</style></custom3><custom4><style face="normal" font="default" size="100%">3.399</style></custom4></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jade, A. M.</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author><author><style face="normal" font="default" size="100%">Kulkarni, B. D.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Improved time series prediction with a new method for selection of model parameters</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Physics A-Mathematical and General</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year><pub-dates><date><style  face="normal" font="default" size="100%">JUL</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">30</style></number><publisher><style face="normal" font="default" size="100%">IOP PUBLISHING LTD</style></publisher><pub-location><style face="normal" font="default" size="100%">DIRAC HOUSE, TEMPLE BACK, BRISTOL BS1 6BE, ENGLAND</style></pub-location><volume><style face="normal" font="default" size="100%">39</style></volume><pages><style face="normal" font="default" size="100%">L483-L491</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;A new method for model selection in prediction of time series is proposed. Apart from the conventional criterion of minimizing RMS error, the method also minimizes the error on the distribution of singularities, evaluated through the local Holder estimates and its probability density spectrum. Predictions of two simulated and one real time series have been done using kernel principal component regression (KPCR) and model parameters of KPCR have been selected employing the proposed as well as the conventional method. Results obtained demonstrate that the proposed method takes into account the sharp changes in a time series and improves the generalization capability of the KPCR model for better prediction of the unseen test data.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">30</style></issue><work-type><style face="normal" font="default" size="100%">Article</style></work-type><custom3><style face="normal" font="default" size="100%">&lt;p&gt;Foreign&lt;/p&gt;</style></custom3><custom4><style face="normal" font="default" size="100%">1.48</style></custom4></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gandhi, Ankit B.</style></author><author><style face="normal" font="default" size="100%">Joshi, Jyeshtharaj B.</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author><author><style face="normal" font="default" size="100%">Kulkarni, Bhaskar D.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Data-driven dynamic modeling and control of a surface aeration system</style></title><secondary-title><style face="normal" font="default" size="100%">Industrial &amp; Engineering Chemistry Research</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">DEC</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">25</style></number><publisher><style face="normal" font="default" size="100%">AMER CHEMICAL SOC</style></publisher><pub-location><style face="normal" font="default" size="100%">1155 16TH ST, NW, WASHINGTON, DC 20036 USA</style></pub-location><volume><style face="normal" font="default" size="100%">46</style></volume><pages><style face="normal" font="default" size="100%">8607-8613</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this study we have developed a support vector regression (SVR) based data-driven model for predicting two important design parameters of surface aerators, namely, the volumetric mass transfer coefficient (k(L)(a) under bar) and fractional gas hold-up (epsilon(G)). The dynamical state of the surface aerator system was captured by acquiring pressure fluctuation signals (PFSs) at various design and operating conditions. The most informative features from PFS were extracted using the chaos analysis technique, which includes estimation of Lyapunov exponent, correlation dimensions, and Kolmogorov entropy. At similar conditions the values of k(L)(a) under bar and epsilon(G) were also measured. Two different SVR models for predicting the volumetric mass transfer coefficient (k(L)(a) under bar) and overall gas hold-up (epsilon(G)) as a function of chaotic invariants, design parameters, and operating parameters were developed showing test accuracies of 98.8% and 97.1%, respectively. Such SVM based models for the surface aerator can be potentially useful on a commercial scale for online monitoring and control of desired process output variables.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">25</style></issue><work-type><style face="normal" font="default" size="100%">Article</style></work-type><notes><style face="normal" font="default" size="100%">Joint 6th International Symposium on Catalysis in Multiphase Reactors/5th International Symposium on Multifunctional Reactors (CAMURE-6/ISMR-5-), Pune, INDIA, JAN 14-17, 2007</style></notes><custom3><style face="normal" font="default" size="100%">Foreign</style></custom3><custom4><style face="normal" font="default" size="100%">2.567</style></custom4></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gandhi, Ankit B.</style></author><author><style face="normal" font="default" size="100%">Joshi, Jyeshtharaj B.</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author><author><style face="normal" font="default" size="100%">Kulkarni, Bhaskar D.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Development of support vector regression (SVR)-based correlation for prediction of overall gas hold-up in bubble column reactors for various gas-liquid systems</style></title><secondary-title><style face="normal" font="default" size="100%">Chemical Engineering Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">bubble column reactor</style></keyword><keyword><style  face="normal" font="default" size="100%">overall gas hold-up</style></keyword><keyword><style  face="normal" font="default" size="100%">support vector regression</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">DEC</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">24, SI</style></number><publisher><style face="normal" font="default" size="100%">PERGAMON-ELSEVIER SCIENCE LTD</style></publisher><pub-location><style face="normal" font="default" size="100%">THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND</style></pub-location><volume><style face="normal" font="default" size="100%">62</style></volume><pages><style face="normal" font="default" size="100%">7078-7089</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The objective of this study was to develop a unified data-driven correlation for the overall gas hold-up for various gas-liquid systems using support vector regression (SVR)-based modeling technique. Over the years, researchers have amply quantified the hydrodynamics of bubble column reactors in terms of the overall gas hold-up. In this work, about 1810 experimental points were collected from 40 open sources spanning the years 1965-2007. The model for overall gas hold-up was established as a function of several parameters which include superficial gas velocity, superficial liquid velocity, gas density, molecular weight of gas, sparger type, sparger hole diameter, number of sparger holes, liquid viscosity, liquid density, liquid surface tension, operating temperature, operating pressure and column diameter of the gas-liquid system. For understanding the hold-up behavior, the data used for training the model was grouped into various gas-liquid systems viz., air-water, gas-aqueous viscous liquids, gas-organic liquids, gas-aqueous electrolyte solutions and gas-liquid systems operated over a wide range of pressure. A generalized model established using SVR was evaluated for its performance for various gas-liquid systems. Statistical analysis showed that the proposed generalized SVR-based correlation for overall gas hold-up has prediction accuracy of 97% with average absolute relative error (% AARE) of 12.11%. A comparison of this correlation with the selected system specific correlations in the literature showed that the developed SVR-based correlation significantly gives enhanced prediction of overall gas hold-up. (C) 2007 Published by Elsevier Ltd.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">24</style></issue><work-type><style face="normal" font="default" size="100%">Article</style></work-type><notes><style face="normal" font="default" size="100%">8th International Conference on Gas-Liquid and Gas-Liquid-Solid Reactor Engineering, Indian Inst Technol Delhi, New Delhi, INDIA, DEC 16-19, 2007</style></notes><custom3><style face="normal" font="default" size="100%">Foreign</style></custom3><custom4><style face="normal" font="default" size="100%">2.75</style></custom4></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rajshekhar</style></author><author><style face="normal" font="default" size="100%">Gupta, Ankur</style></author><author><style face="normal" font="default" size="100%">Samanta, A. N.</style></author><author><style face="normal" font="default" size="100%">Kulkarni, B. D.</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Ghosh, A.</style></author><author><style face="normal" font="default" size="100%">De, R. K.</style></author><author><style face="normal" font="default" size="100%">Pal, S. K.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Fault diagnosis using dynamic time warping</style></title><secondary-title><style face="normal" font="default" size="100%">Pattern Recognition and Machine Intelligence, Proceedings</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">LECTURE NOTES IN COMPUTER SCIENCE</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">DEC</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Indian Stat Inst, Machine Intelligence Univ; ISI Ctr Soft Comp Res; Int Assoc Pattern Recognit; Int Ctr Pure &amp; Appl Math; Web Intelligence Consortium; Yahoo India Res &amp; Dev; Philips Res Asia</style></publisher><pub-location><style face="normal" font="default" size="100%">Heidelberger Platz 3, D-14197 Berlin, Germany</style></pub-location><volume><style face="normal" font="default" size="100%">4815</style></volume><pages><style face="normal" font="default" size="100%">57-66</style></pages><isbn><style face="normal" font="default" size="100%">978-3-540-77045-9</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Owing to the superiority of Dynamic Time Warping as a similarity measure of time series, it can become an effective tool for fault diagnosis in chemical process plants. However, direct application of Dynamic Time Warping can be computationally inefficient, given the complexity involved. In this work we have tackled this problem by employing a warping window constraint and a Lower Bounding measure. A novel methodology for online fault diagnosis with Dynamic Time Warping has been suggested and its performance has been investigated using two simulated case studies.&lt;/p&gt;</style></abstract><notes><style face="normal" font="default" size="100%">2nd International Conference on Pattern Recognition and Machine Intelligence, Calcutta, INDIA, DEC 18-22, 2007</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Kumar, Pankaj</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author><author><style face="normal" font="default" size="100%">Kulkarni, B. D.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Ghosh, A.</style></author><author><style face="normal" font="default" size="100%">De, R. K.</style></author><author><style face="normal" font="default" size="100%">Pal, S. K.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Granular support vector machine based method for prediction of solubility of proteins on overexpression in Escherichia coli</style></title><secondary-title><style face="normal" font="default" size="100%">Pattern Recognition and Machine Intelligence, Proceedings</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">LECTURE NOTES IN COMPUTER SCIENCE</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">DEC</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Indian Stat Inst, Machine Intelligence Univ; ISI Ctr Soft Comp Res; Int Assoc Pattern Recognit; Int Ctr Pure &amp; Appl Math; Web Intelligence Consortium; Yahoo India Res &amp; Dev; Philips Res Asia</style></publisher><pub-location><style face="normal" font="default" size="100%">Heidelberger Platz 3, D-14197 Berlin, Germany</style></pub-location><volume><style face="normal" font="default" size="100%">4815</style></volume><pages><style face="normal" font="default" size="100%">406-415</style></pages><isbn><style face="normal" font="default" size="100%">978-3-540-77045-9</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We employed a granular support vector Machines(GSVM) for prediction of soluble proteins on over expression in Escherichia coli. Granular computing splits the feature space into a set of subspaces (or information granules) such as classes, subsets, clusters and intervals [14]. By the principle of divide and conquer it decomposes a. bigger complex problem into smaller and computationally simpler problems. Each of the granules is then solved independently and all the results are aggregated to form the final solution. For the purpose of granulation association rules was employed. The results indicate that a difficult imbalanced classification problem can be successfully solved by employing GSVM.&lt;/p&gt;</style></abstract><notes><style face="normal" font="default" size="100%">2nd International Conference on Pattern Recognition and Machine Intelligence, Calcutta, INDIA, DEC 18-22, 2007</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mundra, Piyushkumar</style></author><author><style face="normal" font="default" size="100%">Kumar, Madhan</style></author><author><style face="normal" font="default" size="100%">Kumar, K. Krishna</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author><author><style face="normal" font="default" size="100%">Kulkarni, Bhaskar D.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Using pseudo amino acid composition to predict protein subnuclear localization: approached with PSSM</style></title><secondary-title><style face="normal" font="default" size="100%">Pattern Recognition Letters</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">factor solution score</style></keyword><keyword><style  face="normal" font="default" size="100%">multiclass SVM</style></keyword><keyword><style  face="normal" font="default" size="100%">nuclear protein</style></keyword><keyword><style  face="normal" font="default" size="100%">PSSM</style></keyword><keyword><style  face="normal" font="default" size="100%">subnuclear localization</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">OCT</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">13</style></number><publisher><style face="normal" font="default" size="100%">ELSEVIER SCIENCE BV</style></publisher><pub-location><style face="normal" font="default" size="100%">PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS</style></pub-location><volume><style face="normal" font="default" size="100%">28</style></volume><pages><style face="normal" font="default" size="100%">1610-1615</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Identification of Nuclear protein localization assumes significance as it can provide in depth insight for genome regulation and function annotation of novel proteins. A multiclass SVM classifier with various input features was employed for nuclear protein compartment identification. The input features include factor solution scores and evolutionary information (position specific scoring matrix (PSSM) score) apart from conventional dipeptide composition and pseudo amino acid composition. All the SVM classifiers with different sets of input features performed better than the previously available prediction classifiers. The jack-knife success rate thus obtained on the benchmark dataset constructed by Shen and Chou [Shen, H.B., Chou, K.C., 2005, Predicting protein subnuclear location with optimized evidence-theoretic K-nearest classifier and pseudo amino acid composition. Biochem. Biophys. Res. Commun. 337, 752-756] is 71.23%, indicating that the novel pseudo amino acid composition approach with PSSM and SVM classifier is very promising and may at least play a complimentary role to the existing methods. (c) 2007 Elsevier B.V. All rights reserved.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">13</style></issue><work-type><style face="normal" font="default" size="100%">Article</style></work-type><custom3><style face="normal" font="default" size="100%">&lt;p&gt;Foreign&lt;/p&gt;</style></custom3><custom4><style face="normal" font="default" size="100%">&lt;p&gt;1.586&lt;/p&gt;</style></custom4></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mitra, Joydeep</style></author><author><style face="normal" font="default" size="100%">Mundra, Piyushkumar</style></author><author><style face="normal" font="default" size="100%">Kulkarni, B. D.</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Using recurrence quantification analysis descriptors for protein sequence classification with support vector machines</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Biomolecular Structure &amp; Dynamics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">DEC</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">3</style></number><publisher><style face="normal" font="default" size="100%">ADENINE PRESS</style></publisher><pub-location><style face="normal" font="default" size="100%">2066 CENTRAL AVE, SCHENECTADY, NY 12304 USA</style></pub-location><volume><style face="normal" font="default" size="100%">25</style></volume><pages><style face="normal" font="default" size="100%">289-297</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this work, we integrate a non-linear signal analysis method, recurrence quantification analysis (RQA), with the well-known machine-learning algorithm, support vector machines for the binary classification of protein sequences. Two different classification problems were selected, discriminating between aggregating and non-aggregating proteins and mostly disordered and completely ordered proteins, respectively. It has also been shown that classification performance of SVM models improve on selection of the most informative RQA descriptors as SVM input features.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">3</style></issue><work-type><style face="normal" font="default" size="100%">Article</style></work-type><custom3><style face="normal" font="default" size="100%">Foreign</style></custom3><custom4><style face="normal" font="default" size="100%">2.3</style></custom4></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Shelokar, P. S.</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author><author><style face="normal" font="default" size="100%">Kulkarni, B. D.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Multicanonical jump walk annealing assisted by tabu for dynamic optimization of chemical engineering processes</style></title><secondary-title><style face="normal" font="default" size="100%">European Journal of Operational Research</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">dynamic optimization</style></keyword><keyword><style  face="normal" font="default" size="100%">metaheuristics</style></keyword><keyword><style  face="normal" font="default" size="100%">Monte Carlo simulations</style></keyword><keyword><style  face="normal" font="default" size="100%">multicanonical algorithms</style></keyword><keyword><style  face="normal" font="default" size="100%">simulated annealing</style></keyword><keyword><style  face="normal" font="default" size="100%">tabu conditions</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">MAR</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">3</style></number><publisher><style face="normal" font="default" size="100%">ELSEVIER SCIENCE BV</style></publisher><pub-location><style face="normal" font="default" size="100%">PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS</style></pub-location><volume><style face="normal" font="default" size="100%">185</style></volume><pages><style face="normal" font="default" size="100%">1213-1229</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;A hybrid methodology, viz., multicanonical jump walk annealing assisted by tabu list (MJWAT) is proposed for solving dynamic optimization problems in chemically reacting systems. This method combines the power of multicanonical sampling with the beneficial features of simulated annealing. Incorporating tabu list further enhances the efficiency of the method. The superior performance of the MJWAT is highlighted with the help of five benchmark case studies. (C) 2006 Elsevier B.V. All rights reserved.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">3</style></issue><custom3><style face="normal" font="default" size="100%">Foreign</style></custom3><custom4><style face="normal" font="default" size="100%">2.158</style></custom4></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Meshram, Mukesh</style></author><author><style face="normal" font="default" size="100%">Kulkarni, Abhijit</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author><author><style face="normal" font="default" size="100%">Kulkarni, B. D.</style></author><author><style face="normal" font="default" size="100%">Lele, S. S.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Optimal xylanase production using Penicilium janthinellum NCIM 1169: a model based approach</style></title><secondary-title><style face="normal" font="default" size="100%">Biochemical Engineering Journal</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Artificial intelligence</style></keyword><keyword><style  face="normal" font="default" size="100%">Enzyme activity</style></keyword><keyword><style  face="normal" font="default" size="100%">Fermentation</style></keyword><keyword><style  face="normal" font="default" size="100%">Modeling</style></keyword><keyword><style  face="normal" font="default" size="100%">Optimization</style></keyword><keyword><style  face="normal" font="default" size="100%">Xylanase</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">JUN</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">2</style></number><publisher><style face="normal" font="default" size="100%">ELSEVIER SCIENCE SA</style></publisher><pub-location><style face="normal" font="default" size="100%">PO BOX 564, 1001 LAUSANNE, SWITZERLAND</style></pub-location><volume><style face="normal" font="default" size="100%">40</style></volume><pages><style face="normal" font="default" size="100%">348-356</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Xylanases are an industrially important class of hydrolytic enzymes that degrade xylans. Production of xylanase from a fungal culture by submerged fermentation and optimization of the operating conditions for maximum activity are the two aims of the present study. Penicillium janthinellum NCIM 1169 with Mandels-Weber medium, sugarcane bagassse (40\#) as a carbon source and beef extract as a nitrogen source were used in the experiments. We did 41 experiments to see the effect of variations in carbon, nitrogen source, pH, and inoculum on xylanase activity. This data was then used to build an input/output model using multiple linear regression, back propagation neural network and lazy learning algorithm. It was found that lazy learning model correlated well in mapping input/output data. This model was then utilized as an objective function in genetic algorithm to find the optimal combination of the operating conditions to get the maximum xylanase activity. It was observed that with carbon source, 1.63%, nitrogen source, 0.16%, pH, 4.1, and inoculum, 5.5%, maximum xylanase activity of 28.98 +/- 1.73 U/ml was achieved. (C) 2008 Elsevier B.V. All rights reserved.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">2</style></issue><custom3><style face="normal" font="default" size="100%">Foreign</style></custom3><custom4><style face="normal" font="default" size="100%">2.692</style></custom4></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gandhi, Ankit B.</style></author><author><style face="normal" font="default" size="100%">Joshi, J. B.</style></author><author><style face="normal" font="default" size="100%">Kulkarni, A. A.</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author><author><style face="normal" font="default" size="100%">Kulkarni, B. D.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">SVR-based prediction of point gas hold-up for bubble column reactor through recurrence quantification analysis of LDA time-series</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Multiphase Flow</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Bubble column</style></keyword><keyword><style  face="normal" font="default" size="100%">Gas hold-up</style></keyword><keyword><style  face="normal" font="default" size="100%">LDA</style></keyword><keyword><style  face="normal" font="default" size="100%">Recurrence quantification analysis (RQA)</style></keyword><keyword><style  face="normal" font="default" size="100%">Support vector regression (SVR)</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">DEC</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">12</style></number><publisher><style face="normal" font="default" size="100%">PERGAMON-ELSEVIER SCIENCE LTD</style></publisher><pub-location><style face="normal" font="default" size="100%">THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND</style></pub-location><volume><style face="normal" font="default" size="100%">34</style></volume><pages><style face="normal" font="default" size="100%">1099-1107</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Recurrence quantification analysis (RQA) has emerged as a useful tool for detecting singularities in nonstationary time-series data. In this paper, we use RQA to analyze the velocity-time data acquired using laser doppler anemometry (LDA) signals in a bubble column reactor for Single point and Multipoint point spargers. The recurring dynamical states within the velocity-time-series occurring due to the bubble and the liquid passage at the point of measurement, are quantified by RQA features (namely % Recurrence, % Determinism, % Laminarity and Entropy), which in turn are regressed using support vector regression (SVR) to predict the point gas hold-up values. It has been shown that SVR-based model for the bubble column reactor can be potentially useful for online prediction and monitoring of the point gas hold-up for different sparging conditions. (C) 2008 Elsevier Ltd. All rights reserved.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">12</style></issue><custom3><style face="normal" font="default" size="100%">Foreign</style></custom3><custom4><style face="normal" font="default" size="100%">1.772</style></custom4></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gupta, Prashant P.</style></author><author><style face="normal" font="default" size="100%">Merchant, Shamel S.</style></author><author><style face="normal" font="default" size="100%">Bhat, Akshay U.</style></author><author><style face="normal" font="default" size="100%">Gandhi, Ankit B.</style></author><author><style face="normal" font="default" size="100%">Bhagwat, Sunil S.</style></author><author><style face="normal" font="default" size="100%">Joshi, Jyeshtharaj B.</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author><author><style face="normal" font="default" size="100%">Kulkarni, Bhaskar D.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Development of correlations for overall gas hold-up, volumetric mass transfer coefficient, and effective interfacial area in bubble column reactors using hybrid genetic algorithm-support vector regression technique: viscous newtonian and non-newtonian liq</style></title><secondary-title><style face="normal" font="default" size="100%">Industrial &amp; Engineering Chemistry Research</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">NOV</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">21</style></number><publisher><style face="normal" font="default" size="100%">AMER CHEMICAL SOC</style></publisher><pub-location><style face="normal" font="default" size="100%">1155 16TH ST, NW, WASHINGTON, DC 20036 USA</style></pub-location><volume><style face="normal" font="default" size="100%">48</style></volume><pages><style face="normal" font="default" size="100%">9631-9654</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The objective of this study was to develop hybrid genetic algorithm-support vector regression (GA-SVR)-based correlations for overall gas hold-up (epsilon(G)), volumetric mass-transfer coefficient (kt,a), and effective interfacial area (a) in bubble Column reactors for gas-liquid systems employing Viscous Newtonian and non-Newtonian systems as the liquid phase. The hybrid GA-SVR is a novel technique based on the feature 0 generation approach using genetic algorithm (GA). In the present study, GA has been used for nonlinear rescaling of attributes. These, exponentially scaled, are eventually subjected to SVR training The technique is an extension of conventional SVR technique, showing relatively enhanced results For this purpose an extensive literature search was done. From the published literature, 1629 data points for viscous Newtonian and 845 data points for VISCOUS non-Newtonian systems for cc;, 500 data points for viscous Newtonian and 556 data points for viscous non-Newtonian systems for k(L)a, and 208 data points for viscous non-Newtonian systems for a, respectively, were collected These data sets were collected spanning the years 1965-2007 Correlations were developed after taking into account all the parameters affecting epsilon(G), k(1)a, and a such as column and sparger geometry, gas-liquid properties, operating temperature, pressure, and Superficial gas and liquid velocities. The correlations thus developed gave prediction accuracies of 0.994 and 0.999 and average absolute relative errors (AARE) of 3.75 and 1.65% for viscous Newtonian and non-Newtonian systems for epsilon(G), prediction accuracies of 0.983 and 0.998 and AARE of 8 62 and 1.91% for viscous Newtonian and non-Newtonian systems for k(1)a, and prediction accuracy of 0.999 and AARE of 1% for viscous non-Newtonian systems for a, respectively. These correlations also showed much improved results when compared with all the existing correlations proposed in literature. To facilitate their usage, all the hybrid GA-SVR-based correlations have been uploaded on the web link http-//wwwesnips.com/web/UICT-NCL.&lt;/p&gt;</style></abstract><custom3><style face="normal" font="default" size="100%">&lt;p&gt;Foreign&lt;/p&gt;</style></custom3><custom4><style face="normal" font="default" size="100%">2.071</style></custom4></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gandhi, Ankit B.</style></author><author><style face="normal" font="default" size="100%">Gupta, Prashant P.</style></author><author><style face="normal" font="default" size="100%">Joshi, Jyeshtharaj B.</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author><author><style face="normal" font="default" size="100%">Kulkarni, Bhaskar D.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Development of unified correlations for volumetric mass-transfer coefficient and effective interfacial area in bubble column reactors for various gas-liquid systems using support vector regression</style></title><secondary-title><style face="normal" font="default" size="100%">Industrial &amp; Engineering Chemistry Research</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">MAY</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">9</style></number><publisher><style face="normal" font="default" size="100%">AMER CHEMICAL SOC</style></publisher><pub-location><style face="normal" font="default" size="100%">1155 16TH ST, NW, WASHINGTON, DC 20036 USA</style></pub-location><volume><style face="normal" font="default" size="100%">48</style></volume><pages><style face="normal" font="default" size="100%">4216-4236</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The objective of this study was to develop a unified correlation for the volumetric mass-transfer coefficient (k(L)a) and effective interfacial area (a) in bubble columns for various gas-liquid systems using support vector regression (SVR-) based modeling technique. From the data published in the open literature, 1600 data points from 27 open sources spanning the years 1965-2007 for k(L)a and 1330 data points from 28 open sources spanning the years 1968-2007 for a were collected. Generalized SVR-based models were developed for the relationship between k(L)a (and a) and each design and operating parameters such as column and sparger geometry, gas-liquid physical properties, operating temperature, pressure, superficial gas velocity, and so on. Further, these models for k(L)a and a are available online at http://www.esnips.com/web/UICT-NCL. The proposed generalized SVR-based correlations for k(L)a and a have prediction accuracies of 99.08% and 98.6% and average absolute relative errors (AAREs) of 7.12% and 5.01%, respectively. Also, the SVR-based correlation provided much improved predictions compared to those obtained using empirical correlations from the literature.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">9</style></issue><custom3><style face="normal" font="default" size="100%">Foreign</style></custom3><custom4><style face="normal" font="default" size="100%">2.071</style></custom4></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Patil, Diwakar</style></author><author><style face="normal" font="default" size="100%">Raj, Rahul</style></author><author><style face="normal" font="default" size="100%">Shingade, Prashant</style></author><author><style face="normal" font="default" size="100%">Kulkarni, Bhaskar</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Feature selection and classification employing hybrid ant colony optimization/random forest methodology</style></title><secondary-title><style face="normal" font="default" size="100%">Combinatorial Chemistry &amp; High Throughput Screening</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">JUN</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">5</style></number><publisher><style face="normal" font="default" size="100%">BENTHAM SCIENCE PUBL LTD</style></publisher><pub-location><style face="normal" font="default" size="100%">EXECUTIVE STE Y26, PO BOX 7917, SAIF ZONE, 1200 BR SHARJAH, U ARAB EMIRATES</style></pub-location><volume><style face="normal" font="default" size="100%">12</style></volume><pages><style face="normal" font="default" size="100%">507-513</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Accurate classification of instances depends on identification and removal of redundant features. Classification of data having high dimensionality is usually performed in conjunction with an appropriate feature selection method. Feature selection enables identification of the most informative feature subset from the enormously vast search space that can accurately classify the given data. We propose an ant colony optimization (ACO)/random forest based hybrid filter-wrapper search technique, which traverses the search space and selects a feature subset with high classifying ability. We evaluate the performance of our algorithm on four widely studied CoEPrA (Comparative Evaluation of Prediction Algorithms, http://coepra.org) datasets. The performance of the software ants mediated hybrid filter/wrapper approach compares well with the available competition results. Thus, the proposed Ant Colony Optimization based technique can effectively find small feature subsets capable of classifying with a very good accuracy and can be employed for feature subset selection with a high level of confidence.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">5</style></issue><custom3><style face="normal" font="default" size="100%">Foreign</style></custom3><custom4><style face="normal" font="default" size="100%">2.573</style></custom4></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Yadav, Ganapati D.</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author><author><style face="normal" font="default" size="100%">Ravikumar, V.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Festschrift in Honor of Dr. B. D. Kulkarni</style></title><secondary-title><style face="normal" font="default" size="100%">Industrial &amp; Engineering Chemistry Research</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">NOV</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">21</style></number><publisher><style face="normal" font="default" size="100%">AMER CHEMICAL SOC</style></publisher><pub-location><style face="normal" font="default" size="100%">1155 16TH ST, NW, WASHINGTON, DC 20036 USA</style></pub-location><volume><style face="normal" font="default" size="100%">48</style></volume><pages><style face="normal" font="default" size="100%">9355-9356</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">21</style></issue><custom3><style face="normal" font="default" size="100%">Foreign</style></custom3><custom4><style face="normal" font="default" size="100%">2.071</style></custom4></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Karnik, Shreyas</style></author><author><style face="normal" font="default" size="100%">Prasad, Ajay</style></author><author><style face="normal" font="default" size="100%">Diwevedi, Alok</style></author><author><style face="normal" font="default" size="100%">Sundararajan, V.</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Chaudhury, S.</style></author><author><style face="normal" font="default" size="100%">Mitra, S.</style></author><author><style face="normal" font="default" size="100%">Murthy, C. A.</style></author><author><style face="normal" font="default" size="100%">Sastry, P. S.</style></author><author><style face="normal" font="default" size="100%">Pal, S. K.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Identification of defensins employing recurrence quantification analysis and random forest classifiers</style></title><secondary-title><style face="normal" font="default" size="100%">Pattern Recognition and Machine Intelligence, Proceedings</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">DEC</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">ISI Kolkata</style></publisher><pub-location><style face="normal" font="default" size="100%">HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY</style></pub-location><volume><style face="normal" font="default" size="100%">5909</style></volume><pages><style face="normal" font="default" size="100%">152-157</style></pages><isbn><style face="normal" font="default" size="100%">978-3-642-11163-1</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Defensins represent a class of antimicrobial peptides synthesized in the body acting against various microbes. In this paper we study defensins using a non-linear signal analysis method Recurrence Quantication Analysis (RQA). We used the descriptors calculated employing RQA for the classification of defensins with Random Forest Classifier. The RQA descriptors were able to capture patterns peculiar to defensins leading to an accuracy rate of 78.12% using 10-fold cross validation.&lt;/p&gt;</style></abstract><notes><style face="normal" font="default" size="100%">3rd International Conference on Pattern Recognition and Machine Intelligence, IIT Delhi, New Delhi, INDIA, DEC 16-20, 2009</style></notes><custom3><style face="normal" font="default" size="100%">Foreign</style></custom3><custom4><style face="normal" font="default" size="100%">2.607</style></custom4></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Karnik, Shreyas</style></author><author><style face="normal" font="default" size="100%">Mitra, Joydeep</style></author><author><style face="normal" font="default" size="100%">Singh, Arunima</style></author><author><style face="normal" font="default" size="100%">Kulkarni, B. D.</style></author><author><style face="normal" font="default" size="100%">Sundarajan, V.</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Chaudhury, S.</style></author><author><style face="normal" font="default" size="100%">Mitra, S.</style></author><author><style face="normal" font="default" size="100%">Murthy, C. A.</style></author><author><style face="normal" font="default" size="100%">Sastry, P. S.</style></author><author><style face="normal" font="default" size="100%">Pal, S. K.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Identification of N-glycosylation sites with sequence and structural features employing random forests</style></title><secondary-title><style face="normal" font="default" size="100%">Pattern Recognition and Machine Intelligence, Proceedings</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">DEC</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">ISI Kolkata</style></publisher><pub-location><style face="normal" font="default" size="100%">HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY</style></pub-location><volume><style face="normal" font="default" size="100%">5909</style></volume><pages><style face="normal" font="default" size="100%">146-151</style></pages><isbn><style face="normal" font="default" size="100%">978-3-642-11163-1</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;N-Glycosylation plays a very important role in various processes like quality control of proteins produced in ER, transport of proteins and in disease control. The experimental elucidation of N-Glycosylation sites is expensive and laborious process. In this work we build models for identification of potential N-Glycosylation sites in proteins based on sequence and structural features. The best model has cross validation accuracy rate of 72.81%.&lt;/p&gt;</style></abstract><notes><style face="normal" font="default" size="100%">3rd International Conference on Pattern Recognition and Machine Intelligence, IIT Delhi, New Delhi, INDIA, DEC 16-20, 2009</style></notes><custom3><style face="normal" font="default" size="100%">Foreign</style></custom3><custom4><style face="normal" font="default" size="100%">2.607</style></custom4></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rajappan, Remya</style></author><author><style face="normal" font="default" size="100%">Shingade, Prashant D.</style></author><author><style face="normal" font="default" size="100%">Natarajan, Ramanathan</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Quantitative structure-property relationship (QSPR) prediction of liquid viscosities of pure organic compounds employing random forest regression</style></title><secondary-title><style face="normal" font="default" size="100%">Industrial &amp; Engineering Chemistry Research</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">NOV</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">21</style></number><publisher><style face="normal" font="default" size="100%">AMER CHEMICAL SOC</style></publisher><pub-location><style face="normal" font="default" size="100%">1155 16TH ST, NW, WASHINGTON, DC 20036 USA</style></pub-location><volume><style face="normal" font="default" size="100%">48</style></volume><pages><style face="normal" font="default" size="100%">9708-9712</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;A quantitative structure-property relationship (QSPR) approach was used to develop a predictive model for viscosities of pure organic liquids using a set of 403 compounds that belong to diverse classes of organic chemicals. A pool of 116 descriptors that encode topostructural, topochemical, electrotopological, geometrical, and quantum chemical properties of the organic compounds was used to develop QSPR models, based on the robust Random Forest (RF) regression algorithm. The performance of the algorithm, in terms of correlation coefficients and mean square errors, was determined to be good. The capability of the algorithm to build models and select the most-informative features simultaneously is very useful for several quantitative structure-activity/property relationship tasks. The eight most-dominant features selected by the RF regression algorithm primarily contained predictors that encode characteristics of atoms and groups that form hydrogen bonds, as well as factors involving molecular shape and size.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">21</style></issue><custom3><style face="normal" font="default" size="100%">Foreign</style></custom3><custom4><style face="normal" font="default" size="100%">2.071</style></custom4></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Kulkarni, Abhijit J.</style></author><author><style face="normal" font="default" size="100%">Jayaraman, Valadi K.</style></author><author><style face="normal" font="default" size="100%">Kulkarni, Bhaskar D.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Review on lazy learning regressors and their applications in QSAR</style></title><secondary-title><style face="normal" font="default" size="100%">Combinatorial Chemistry &amp; High Throughput Screening</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">classification</style></keyword><keyword><style  face="normal" font="default" size="100%">lazy learning</style></keyword><keyword><style  face="normal" font="default" size="100%">machine learning</style></keyword><keyword><style  face="normal" font="default" size="100%">Quantitative structure activity relationship (QSAR)</style></keyword><keyword><style  face="normal" font="default" size="100%">regression</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">MAY</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">4</style></number><publisher><style face="normal" font="default" size="100%">BENTHAM SCIENCE PUBL LTD</style></publisher><pub-location><style face="normal" font="default" size="100%">EXECUTIVE STE Y26, PO BOX 7917, SAIF ZONE, 1200 BR SHARJAH, U ARAB EMIRATES</style></pub-location><volume><style face="normal" font="default" size="100%">12</style></volume><pages><style face="normal" font="default" size="100%">440-450</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Building accurate quantitative structure-activity relationships (QSAR) is important in drug design, environmental modeling, toxicology, and chemical property prediction. QSAR methods can be utilized to solve mainly two types of problems viz., pattern recognition, (or classification) where output is discrete (i.e. class information), e. g., active or non-active molecule, binding or non-binding molecule etc., and function approximation, (i.e. regression) where the output is continuous (e.g., actual activity prediction). The present review deals with the second type of problem (regression) with specific attention to one of the most effective machine learning procedures, viz. lazy learning. The methodologies of the algorithm along with the relevant technical information are discussed in detail. We also present three real life case studies to briefly outline the typical characteristics of the modeling formalism.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">4</style></issue><custom3><style face="normal" font="default" size="100%">Foreign</style></custom3><custom4><style face="normal" font="default" size="100%">2.573</style></custom4></record></records></xml>