{"title":"Consciousness and its correlates in awake condition, in different sleep stages and in epilepsy","authors":"P. Fenwick, G. Kostopoulos, L. Liu, A. Ioannides","doi":"10.1109/IJCNN.2003.1223357","DOIUrl":"https://doi.org/10.1109/IJCNN.2003.1223357","url":null,"abstract":"Old ideas about attention and consciousness seemed to be irrelevant today. We re-evaluated them here in the light of recent neuroimaging data, data from pathological conditions where attentional mechanisms are impaired and the knowledge that activity following a stimulus spreads rapidly very widely. We present the case that the multiple systems both cortical and subcortical involved in attentional processes can best be studied using tomographic, millisecond by millisecond single trial analysis of magnetoencephalographic data.","PeriodicalId":310128,"journal":{"name":"Proceedings of the International Joint Conference on Neural Networks, 2003.","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132913926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Stephen J Verzi, G. Heileman, M. Georgiopoulos, G. Anagnostopoulos
{"title":"Universal approximation with Fuzzy ART and Fuzzy ARTMAP","authors":"Stephen J Verzi, G. Heileman, M. Georgiopoulos, G. Anagnostopoulos","doi":"10.1109/IJCNN.2003.1223712","DOIUrl":"https://doi.org/10.1109/IJCNN.2003.1223712","url":null,"abstract":"A measure of success for any learning algorithm is how useful it is in a variety of learning situations. Those learning algorithms that support universal function approximation can theoretically be applied to a very large and interesting class of learning problems. Many kinds of neural network architectures have already been shown to support universal approximation. In this paper, we will provide a proof to show that Fuzzy ART augmented with a single layer of perceptrons is a universal approximator. Moreover, the Fuzzy ARTMAP neural network architecture, by itself, will be shown to be a universal approximator.","PeriodicalId":310128,"journal":{"name":"Proceedings of the International Joint Conference on Neural Networks, 2003.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132431246","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"High speed cellular array computer realizations for low power applications","authors":"M. Laiho, A. Kananen, A. Paasio, K. Halonen","doi":"10.1109/IJCNN.2003.1223920","DOIUrl":"https://doi.org/10.1109/IJCNN.2003.1223920","url":null,"abstract":"In this paper a design method for building high speed array computers on a single chip is demonstrated with two example realizations. The key idea in the method is that an array computer can be built using reusable, relatively simple building blocks. All necessary memory is distributed among processing units. The number of processing units in the array computer is selected based on speed requirements, yielding a low power, small die area realization. Two different measured array processor realizations designed using the method are depicted.","PeriodicalId":310128,"journal":{"name":"Proceedings of the International Joint Conference on Neural Networks, 2003.","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134496028","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Ensemble of classifiers based incremental learning with dynamic voting weight update","authors":"R. Polikar, S. Krause, L. Burd","doi":"10.1109/IJCNN.2003.1224006","DOIUrl":"https://doi.org/10.1109/IJCNN.2003.1224006","url":null,"abstract":"An incremental learning algorithm based on weighted majority voting of an ensemble of classifiers is introduced for supervised neural networks, where the voting weights are updated dynamically based on the current test input of unknown class. The algorithm's dynamic voting weight update feature is an enhancement to our previously introduced incremental learning algorithm, Learn++. The algorithm is capable of incrementally learning new information from additional datasets that may later become available, even when the new datasets include instances from additional classes that were not previously seen. Furthermore, the algorithm retains formerly acquired knowledge without requiring access to datasets used earlier, attaining a delicate balance on the stability-plasticity dilemma. The algorithm creates additional ensembles of classifiers based on an iteratively updated distribution function on the training data that favors training with increasingly difficult to learn, previously not learned and/or unseen instances. The final classification is made by weighted majority voting of all classifier outputs in the ensemble, where the voting weights are determined dynamically during actual testing, based on the estimated performance of each classifier on the current test data instance. We present the algorithm in its entirety, as well as its promising simulation results on two real world applications.","PeriodicalId":310128,"journal":{"name":"Proceedings of the International Joint Conference on Neural Networks, 2003.","volume":"18 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134499686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Competitive reinforcement learning in continuous control tasks","authors":"Myriam Abramson, P. Pachowicz, H. Wechsler","doi":"10.1109/IJCNN.2003.1223699","DOIUrl":"https://doi.org/10.1109/IJCNN.2003.1223699","url":null,"abstract":"This paper describes a novel hybrid reinforcement learning algorithm, Sarsa Learning Vector Quantization (SLVQ), that leaves the reinforcement part intact but employs a more effective representation of the policy function using a piecewise constant function based upon \"policy prototypes\". The prototypes correspond to the pattern classes induced by the Voronoi tessellation generated by self-organizing methods like Learning Vector Quantization (LVQ). The determination of the optimal policy function can be now viewed as a pattern recognition problem in the sense that the assignment of an action to a point in the phase space is similar to the assignment of a pattern class to a point in phase space. The distributed LVQ representation of the policy function automatically generates a piecewise constant tessellation of the state space and yields in a major simplification of the learning task relative to the standard reinforcement learning algorithms for whom a discontinuous table look function has to be learned. The feasibility and comparative advantages of the new algorithm is shown on the cart centering and mountain car problems, two control problems of increased difficulty.","PeriodicalId":310128,"journal":{"name":"Proceedings of the International Joint Conference on Neural Networks, 2003.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131311725","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Combinative neural-network-based classifiers for optical handwritten character and letter recognition","authors":"G. Daqi, Xie Chao, Nie Guiping","doi":"10.1109/IJCNN.2003.1223757","DOIUrl":"https://doi.org/10.1109/IJCNN.2003.1223757","url":null,"abstract":"This paper compares the similarities and differences between multilayer perceptrons (MLPs) and radial basis function (RBF) neural networks, proposes the method of how to decompose a large-sample and multiple-category training set into many small-sample and two-class training subsets. Further-more, we take single-hidden-layer perceptrons and RBF networks as the basis units to construct combinative neural-network-based classifiers. This kind of combinative classifiers has higher classification accuracy and better generalization performances than their component parts. The results for recognizing the handwritten numerals and English letters show that the presented combinative classifiers are quite effective for solving the large-sample, high-dimensional and multiple-category classification problems.","PeriodicalId":310128,"journal":{"name":"Proceedings of the International Joint Conference on Neural Networks, 2003.","volume":"11 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131692628","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Autonomous diagnostics and prognostics through competitive learning driven HMM-based clustering","authors":"R. Chinnam, Pundarikaksha Baruah","doi":"10.1109/IJCNN.2003.1223951","DOIUrl":"https://doi.org/10.1109/IJCNN.2003.1223951","url":null,"abstract":"A prerequisite to effective wide-spread deployment of condition-based maintenance (CBM) practices is effective diagnostics and prognostics. This paper presents a novel method for employing HMMs for autonomous diagnostics as well as prognostics. The diagnostics module exploits competitive learning to achieve HMM-based clustering. The prognostics module builds upon the diagnostics module to compute joint distributions for health-state transition times. The proposed methods were validated on a physical test bed; a drilling machine.","PeriodicalId":310128,"journal":{"name":"Proceedings of the International Joint Conference on Neural Networks, 2003.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131857595","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Binary image coding using cellular neural networks","authors":"D. Feiden, R. Tetzlaff","doi":"10.1109/IJCNN.2003.1223853","DOIUrl":"https://doi.org/10.1109/IJCNN.2003.1223853","url":null,"abstract":"Image coding still is an important research field in image processing. Although storage capacitates increase permanently, image file sizes are of high interest in the area of image transmission, e.g. in the Internet the number of bytes transmitted is directly correlated to the costs and the time consumption for the transmission. Furthermore, because of the extremely high amount of data, in video processing efficient compression methods are always point of interest. In this contribution a new approach of image coding is presented, which uses the relatively new paradigm of cellular neural networks (CN). CNN are massively parallel computing arrays which are perfectly suited for high speed image processing. Furthermore, their robustness is another outstanding feature of CNN hardware implementations, so that they predominate many other neural network implementations.","PeriodicalId":310128,"journal":{"name":"Proceedings of the International Joint Conference on Neural Networks, 2003.","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127387340","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An adaptive sub-space filter model","authors":"A. Zaknich","doi":"10.1109/IJCNN.2003.1223912","DOIUrl":"https://doi.org/10.1109/IJCNN.2003.1223912","url":null,"abstract":"A tunable approximate piecewise linear regression model [A. Zaknich, Y. Attikiouzel, December 2000] has been previously developed, which can be adjusted by a single smoothing parameter continuously from the best piecewise linear model in each sub-space to the best approximate piecewise linear model over the whole data space. A suitable value in between ensures that all neighbouring piecewise linear models merge together smoothly at their boundaries. This model was developed by making relatively minor changes to the form of the modified probabilistic neural network [A. Zaknich, July 1998], a network used for general nonlinear regression. The special modified probabilistic neural network (MPNN) structure allows it to be easily used to model a process by appropriately weighting piecewise linear models associated with each piecewise linear models associated with each of the network's radial basis functions, which together cover the data space. The model has now bee further extended to allow each piecewise linear model section to be adapted separately as new data flows through it. By doing this, the proposed adaptive sub-space filter (ASF) model represents a learning/filtering method for nonlinear processes that provides a solution to the stability/plasticity dilemma associated with standard adaptive filters.","PeriodicalId":310128,"journal":{"name":"Proceedings of the International Joint Conference on Neural Networks, 2003.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115468433","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Garrett T. Kenyon, J. Theiler, D. Marshak, B. Moore, J. Jeffs, B. Travis
{"title":"Firing correlations improve detection of moving bars","authors":"Garrett T. Kenyon, J. Theiler, D. Marshak, B. Moore, J. Jeffs, B. Travis","doi":"10.1109/IJCNN.2003.1223877","DOIUrl":"https://doi.org/10.1109/IJCNN.2003.1223877","url":null,"abstract":"Moving stimuli elicit oscillatory responses from retinal ganglion cells at frequencies between 60-100 Hz. We used a computer model of the inner retina to investigate whether the additional firing synchrony resulting from stimulus-evoked high frequency oscillations could contribute to the detection of moving bars. The responses of the model ganglion cells were similar to those of cat alpha cells. Event trains from the model ganglion cells simulated by moving bars were summed into a threshold detector with short integration window (2-4 msec) whose output was classified by an ideal observer. To isolate the contribution from firing correlations, the model ganglion cells were replaced by independent Poisson generators with matched time-dependent event rates. Compared to this control, firing correlations between the model ganglion cells allowed for improved detection of moving stimuli.","PeriodicalId":310128,"journal":{"name":"Proceedings of the International Joint Conference on Neural Networks, 2003.","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115732701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}