151
|
Incremental Learning by Heterogeneous Bagging Ensemble. ADVANCED DATA MINING AND APPLICATIONS 2010. [DOI: 10.1007/978-3-642-17313-4_1] [Citation(s) in RCA: 12] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 01/15/2023]
|
152
|
Tang K, Lin M, Minku FL, Yao X. Selective negative correlation learning approach to incremental learning. Neurocomputing 2009. [DOI: 10.1016/j.neucom.2008.09.022] [Citation(s) in RCA: 12] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/20/2022]
|
153
|
Ternary reversible extreme learning machines: the incremental tri-training method for semi-supervised classification. Knowl Inf Syst 2009. [DOI: 10.1007/s10115-009-0220-4] [Citation(s) in RCA: 9] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/26/2022]
|
154
|
Garcia-Pedrajas N. Constructing Ensembles of Classifiers by Means of Weighted Instance Selection. ACTA ACUST UNITED AC 2009; 20:258-77. [DOI: 10.1109/tnn.2008.2005496] [Citation(s) in RCA: 83] [Impact Index Per Article: 5.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
|
155
|
Park MS, Choi JY. Evolving logic networks with real-valued inputs for fast incremental learning. IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS. PART B, CYBERNETICS : A PUBLICATION OF THE IEEE SYSTEMS, MAN, AND CYBERNETICS SOCIETY 2009; 39:254-267. [PMID: 19068435 DOI: 10.1109/tsmcb.2008.2005483] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/27/2023]
Abstract
In this paper, we present a neural network structure and a fast incremental learning algorithm using this network. The proposed network structure, named Evolving Logic Networks for Real-valued inputs (ELN-R), is a data structure for storing and using the knowledge. A distinctive feature of ELN-R is that the previously learned knowledge stored in ELN-R can be used as a kind of building block in constructing new knowledge. Using this feature, the proposed learning algorithm can enhance the stability and plasticity at the same time, and as a result, the fast incremental learning can be realized. The performance of the proposed scheme is shown by a theoretical analysis and an experimental study on two benchmark problems.
Collapse
Affiliation(s)
- Myoung Soo Park
- School of Electrical Engineering and Computer Science, Automation and Systems Research Institute, Seoul National University, Seoul 151-744, Korea
| | | |
Collapse
|
156
|
Muhlbaier M, Topalis A, Polikar R. Learn$^{++}$.NC: Combining Ensemble of Classifiers With Dynamically Weighted Consult-and-Vote for Efficient Incremental Learning of New Classes. ACTA ACUST UNITED AC 2009; 20:152-68. [DOI: 10.1109/tnn.2008.2008326] [Citation(s) in RCA: 139] [Impact Index Per Article: 8.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
|
157
|
Teixeira LF, Corte-Real L. Video object matching across multiple independent views using local descriptors and adaptive learning. Pattern Recognit Lett 2009. [DOI: 10.1016/j.patrec.2008.04.001] [Citation(s) in RCA: 17] [Impact Index Per Article: 1.1] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/22/2022]
|
158
|
Akhbardeh A, Nikhil, Koskinen PE, Yli-Harja O. Towards the experimental evaluation of novel supervised fuzzy adaptive resonance theory for pattern classification. Pattern Recognit Lett 2008. [DOI: 10.1016/j.patrec.2007.10.017] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/25/2022]
|
159
|
Ozawa S, Pang S, Kasabov N. Incremental Learning of Chunk Data for Online Pattern Classification Systems. ACTA ACUST UNITED AC 2008; 19:1061-74. [DOI: 10.1109/tnn.2007.2000059] [Citation(s) in RCA: 92] [Impact Index Per Article: 5.4] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/07/2022]
|
160
|
Abstract
Dimensionality reduction methods have been successfully employed for face recognition. Among the various dimensionality reduction algorithms, linear (Fisher) discriminant analysis (LDA) is one of the popular supervised dimensionality reduction methods, and many LDA-based face recognition algorithms/systems have been reported in the last decade. However, the LDA-based face recognition systems suffer from the scalability problem. To overcome this limitation, an incremental approach is a natural solution. The main difficulty in developing the incremental LDA (ILDA) is to handle the inverse of the within-class scatter matrix. In this paper, based on the generalized singular value decomposition LDA (LDA/GSVD), we develop a new ILDA algorithm called GSVD-ILDA. Different from the existing techniques in which the new projection matrix is found in a restricted subspace, the proposed GSVD-ILDA determines the projection matrix in full space. Extensive experiments are performed to compare the proposed GSVD-ILDA with the LDA/GSVD as well as the existing ILDA methods using the face recognition technology face database and the Carneggie Mellon University Pose, Illumination, and Expression face database. Experimental results show that the proposed GSVD-ILDA algorithm gives the same performance as the LDA/GSVD with much smaller computational complexity. The experimental results also show that the proposed GSVD-ILDA gives better classification performance than the other recently proposed ILDA algorithms.
Collapse
Affiliation(s)
- Haitao Zhao
- Institute of Aerospace Science and Technology, Shanghai Jiao Tong University, Shanghai 200030, China.
| | | |
Collapse
|
161
|
Combining Online Classification Approaches for Changing Environments. LECTURE NOTES IN COMPUTER SCIENCE 2008. [DOI: 10.1007/978-3-540-89689-0_56] [Citation(s) in RCA: 14] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 01/09/2023]
|
162
|
A hybrid neural network classifier combining ordered fuzzy ARTMAP and the dynamic decay adjustment algorithm. Soft comput 2007. [DOI: 10.1007/s00500-007-0235-2] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/26/2022]
|
163
|
Abstract
This paper introduces Learn++, an ensemble of classifiers based algorithm originally developed for incremental learning, and now adapted for information/data fusion applications. Recognizing the conceptual similarity between incremental learning and data fusion, Learn++ follows an alternative approach to data fusion, i.e., sequentially generating an ensemble of classifiers that specifically seek the most discriminating information from each data set. It was observed that Learn++ based data fusion consistently outperforms a similarly configured ensemble classifier trained on any of the individual data sources across several applications. Furthermore, even if the classifiers trained on individual data sources are fine tuned for the given problem, Learn++ can still achieve a statistically significant improvement by combining them, if the additional data sets carry complementary information. The algorithm can also identify-albeit indirectly-those data sets that do not carry such additional information. Finally, it was shown that the algorithm can consecutively learn both the supplementary novel information coming from additional data of the same source, and the complementary information coming from new data sources without requiring access to any of the previously seen data.
Collapse
Affiliation(s)
- Devi Parikh
- Electrical and Computer Engineering, Rowan University, Glassboro, NJ 08028, USA
| | | |
Collapse
|
164
|
Polikar R, Topalis A, Green D, Kounios J, Clark CM. Comparative multiresolution wavelet analysis of ERP spectral bands using an ensemble of classifiers approach for early diagnosis of Alzheimer's disease. Comput Biol Med 2007; 37:542-58. [PMID: 16989799 PMCID: PMC1994255 DOI: 10.1016/j.compbiomed.2006.08.012] [Citation(s) in RCA: 54] [Impact Index Per Article: 3.0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/20/2022]
Abstract
Early diagnosis of Alzheimer's disease (AD) is becoming an increasingly important healthcare concern. Prior approaches analyzing event-related potentials (ERPs) had varying degrees of success, primarily due to smaller study cohorts, and the inherent difficulty of the problem. A new effort using multiresolution analysis of ERPs is described. Distinctions of this study include analyzing a larger cohort, comparing different wavelets and different frequency bands, using ensemble-based decisions and, most importantly, aiming the earliest possible diagnosis of the disease. Surprising yet promising outcomes indicate that ERPs in response to novel sounds of oddball paradigm may be more reliable as a biomarker than the more commonly used responses to target sounds.
Collapse
Affiliation(s)
- Robi Polikar
- Electrical and Computer Engineering, Rowan University, Glassboro, NJ 08028, USA.
| | | | | | | | | |
Collapse
|
165
|
Parikh D, Stepenosky N, Topalis A, Green D, Kounios J, Clark C, Polikar R. Ensemble based data fusion for early diagnosis of Alzheimer's disease. CONFERENCE PROCEEDINGS : ... ANNUAL INTERNATIONAL CONFERENCE OF THE IEEE ENGINEERING IN MEDICINE AND BIOLOGY SOCIETY. IEEE ENGINEERING IN MEDICINE AND BIOLOGY SOCIETY. ANNUAL CONFERENCE 2007; 2005:2479-82. [PMID: 17282740 DOI: 10.1109/iembs.2005.1616971] [Citation(s) in RCA: 7] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Abstract] [Subscribe] [Scholar Register] [Indexed: 11/06/2022]
Abstract
We describe an ensemble of classifiers based data fusion approach to combine information from two sources, believed to contain complimentary information, for early diagnosis of Alzheimer's disease. Specifically, we use the event related potentials recorded from the Pz and Cz electrodes of the EEG, which are further analyzed using multiresolution wavelet analysis. The proposed data fusion approach includes generating multiple classifiers trained with strategically selected subsets of the training data from each source, which are then combined through a weighted majority voting. Several factors set this study apart from similar prior efforts: we use a larger cohort, specifically target early diagnosis of the disease, use an ensemble based approach rather then a single classifier, and most importantly, we combine information from multiple sources, rather then using a single modality. We present promising results obtained from the first 35 (of 80) patients whose data are analyzed thus far.
Collapse
Affiliation(s)
- Devi Parikh
- Department of Electrical and Computer Engineering, Rowan University, Glassboro, New Jersey, USA
| | | | | | | | | | | | | |
Collapse
|
166
|
Stepenosky N, Topalis A, Syed H, Green D, Kounios J, Clark C, Polikar R. Boosting based classification of event related potentials for early diagnosis of Alzheimer's disease. CONFERENCE PROCEEDINGS : ... ANNUAL INTERNATIONAL CONFERENCE OF THE IEEE ENGINEERING IN MEDICINE AND BIOLOGY SOCIETY. IEEE ENGINEERING IN MEDICINE AND BIOLOGY SOCIETY. ANNUAL CONFERENCE 2007; 2005:2494-7. [PMID: 17282744 DOI: 10.1109/iembs.2005.1616975] [Citation(s) in RCA: 5] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/06/2022]
Abstract
With the number of the elderly population affected by Alzheimer's disease (AD) rising, the need to find an accurate, inexpensive and non-intrusive procedure that can be made available to community healthcare providers for early diagnosis of Alzheimer's disease is becoming more and more urgent as a major health concern. Several recent studies have looked at analyzing electroencephalogram signals through the use of wavelets and neural networks. In this study, multiresolution wavelet analysis, coupled with the ensemble of classifiers based boosting algorithm is used on the P300 component of the event related potentials (ERP) to determine the feasibility of the approach as a diagnostic tool for early diagnosis of AD. The technique and its promising initial results are presented.
Collapse
Affiliation(s)
- Nicholas Stepenosky
- Department of Electrical and Computer Engineering, Rowan University, Glassboro, New Jersey, USA
| | | | | | | | | | | | | |
Collapse
|
167
|
Abstract
In this paper, a novel stochastic (or online) training algorithm for neural networks, named parameter incremental learning (PIL) algorithm, is proposed and developed. The main idea of the PIL strategy is that the learning algorithm should not only adapt to the newly presented input-output training pattern by adjusting parameters, but also preserve the prior results. A general PIL algorithm for feedforward neural networks is accordingly presented as the first-order approximate solution to an optimization problem, where the performance index is the combination of proper measures of preservation and adaptation. The PIL algorithms for the multilayer perceptron (MLP) are subsequently derived. Numerical studies show that for all the three benchmark problems used in this paper the PIL algorithm for MLP is measurably superior to the standard online backpropagation (BP) algorithm and the stochastic diagonal Levenberg-Marquardt (SDLM) algorithm in terms of the convergence speed and accuracy. Other appealing features of the PIL algorithm are that it is computationally as simple as the BP algorithm, and as easy to use as the BP algorithm. It, therefore, can be applied, with better performance, to any situations where the standard online BP algorithm is applicable.
Collapse
Affiliation(s)
- Sheng Wan
- Mechanical and Aerospace Engineering Department, West Virginia University, Morgantown, WV 26505, USA.
| | | |
Collapse
|
168
|
|
169
|
Abstract
We introduce a new fuzzy ARTMAP (FAM) neural network: Fuzzy ARTMAP with relevance factor (FAMR). The FAMR architecture is able to incrementally "grow" and to sequentially accommodate input-output sample pairs. Each training pair has a relevance factor assigned to it, proportional to the importance of that pair during the learning phase. The relevance factors are user-defined or computed. The FAMR can be trained as a classifier and, at the same time, as a nonparametric estimator of the probability that an input belongs to a given class. The FAMR probability estimation converges almost surely and in the mean square to the posterior probability. Our theoretical results also characterize the convergence rate of the approximation. Using a relevance factor adds more flexibility to the training phase, allowing ranking of sample pairs according to the confidence we have in the information source. We analyze the FAMR capability for mapping noisy functions when training data originates from multiple sources with known levels of noise.
Collapse
Affiliation(s)
- Răzvan Andonie
- Computer Science Department, Central Washington University, Ellensburg 98926, USA.
| | | |
Collapse
|
170
|
|
171
|
Mohammed HS, Leander J, Marbach M, Polikar R. Can AdaBoost.M1 Learn Incrementally? A Comparison to Learn + + Under Different Combination Rules. ARTIFICIAL NEURAL NETWORKS – ICANN 2006 2006. [DOI: 10.1007/11840817_27] [Citation(s) in RCA: 7] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 01/24/2023]
|
172
|
|
173
|
Wilson SB. A neural network method for automatic and incremental learning applied to patient-dependent seizure detection. Clin Neurophysiol 2005; 116:1785-95. [PMID: 16005680 DOI: 10.1016/j.clinph.2005.04.025] [Citation(s) in RCA: 26] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/23/2004] [Revised: 04/04/2005] [Accepted: 04/11/2005] [Indexed: 11/19/2022]
Abstract
OBJECTIVE Describe and evaluate a neural network method for automatic and incremental learning applied to patient-dependent seizure detection. Compare the classification ability of various time-frequency methods including FFT spectrogram, spectral edge frequency and bicoherence. METHODS 57 seizures from 10 epilepsy patients are used. A probabilistic neural network (PNN) is trained and incrementally updated in a novel fashion. The speed and accuracy of the method is evaluated with different training parameters and time-frequency methods. RESULTS Training the PNN on a single seizure from each record offers better performance (sensitivity = 0.89 and false-positive-rate = 0.56/h) than 3 patient-independent seizure detection algorithms. The method is virtually unaffected by the settings of various training parameters. Training is very fast (0.9 s), and the accuracy improves as more examples are added incrementally (without retraining). The overall best time-frequency method was the FFT spectrogram. The bicoherence plus the FFT spectrogram was the best method on 4 records, improving the correlation from 0.111 to 0.940 on one and from 0.288 to 0.612 on another. CONCLUSIONS The proposed method offers accurate, robust and virtually instantaneous training and incremental learning when applied to patient-dependent seizure detection. SIGNIFICANCE Accurate seizure detection can improve patient care in both the epilepsy monitoring unit and the intensive care unit. Future applications include patient-independent algorithms that continue to learn as new examples are encountered.
Collapse
Affiliation(s)
- Scott B Wilson
- Persyst Development Corporation, 1060 Sandretto Drive, Suite E2, Prescott, AZ 86305, USA.
| |
Collapse
|
174
|
Abstract
Incremental learning has been widely addressed in the machine learning literature to cope with learning tasks where the learning environment is ever changing or training samples become available over time. However, most research work explores incremental learning with statistical algorithms or neural networks, rather than evolutionary algorithms. The work in this paper employs genetic algorithms (GAs) as basic learning algorithms for incremental learning within one or more classifier agents in a multiagent environment. Four new approaches with different initialization schemes are proposed. They keep the old solutions and use an "integration" operation to integrate them with new elements to accommodate new attributes, while biased mutation and crossover operations are adopted to further evolve a reinforced solution. The simulation results on benchmark classification data sets show that the proposed approaches can deal with the arrival of new input attributes and integrate them with the original input space. It is also shown that the proposed approaches can be successfully used for incremental learning and improve classification rates as compared to the retraining GA. Possible applications for continuous incremental training and feature selection are also discussed.
Collapse
Affiliation(s)
- Sheng-Uei Guan
- Department of Electrical and Computer Engineering, National University of Singapore, Singapore 119260.
| | | |
Collapse
|
175
|
|
176
|
Muhlbaier M, Topalis A, Polikar R. Ensemble Confidence Estimates Posterior Probability. MULTIPLE CLASSIFIER SYSTEMS 2005. [DOI: 10.1007/11494683_33] [Citation(s) in RCA: 12] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/12/2022]
|
177
|
|
178
|
|
179
|
Lecoeuche S, Lurette C, Lalot S. New supervision architecture based on on-line modelling of non-stationary data. Neural Comput Appl 2004. [DOI: 10.1007/s00521-004-0427-y] [Citation(s) in RCA: 7] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/26/2022]
|
180
|
Polikar R, Udpa L, Udpa S, Honavar V. An incremental learning algorithm with confidence estimation for automated identification of NDE signals. IEEE TRANSACTIONS ON ULTRASONICS, FERROELECTRICS, AND FREQUENCY CONTROL 2004; 51:990-1001. [PMID: 15344404 DOI: 10.1109/tuffc.2004.1324403] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/24/2023]
Abstract
An incremental learning algorithm is introduced for learning new information from additional data that may later become available, after a classifier has already been trained using a previously available database. The proposed algorithm is capable of incrementally learning new information without forgetting previously acquired knowledge and without requiring access to the original database, even when new data include examples of previously unseen classes. Scenarios requiring such a learning algorithm are encountered often in nondestructive evaluation (NDE) in which large volumes of data are collected in batches over a period of time, and new defect types may become available in subsequent databases. The algorithm, named Learn++, takes advantage of synergistic generalization performance of an ensemble of classifiers in which each classifier is trained with a strategically chosen subset of the training databases that subsequently become available. The ensemble of classifiers then is combined through a weighted majority voting procedure. Learn++ is independent of the specific classifier(s) comprising the ensemble, and hence may be used with any supervised learning algorithm. The voting procedure also allows Learn++ to estimate the confidence in its own decision. We present the algorithm and its promising results on two separate ultrasonic weld inspection applications.
Collapse
Affiliation(s)
- Robi Polikar
- Department of Electrical and Computer Engineering, Rowan University, Glassboro, NJ 08028, USA.
| | | | | | | |
Collapse
|
181
|
Abstract
This paper proposes a new neocognitron that accepts incremental learning, without giving a severe damage to old memories or reducing learning speed. The new neocognitron uses a competitive learning, and the learning of all stages of the hierarchical network progresses simultaneously. To increase the learning speed, conventional neocognitrons of recent versions sacrificed the ability of incremental learning, and used a technique of sequential construction of layers, by which the learning of a layer started after the learning of the preceding layers had completely finished. If the learning speed is simply set high for the conventional neocognitron, simultaneous construction of layers produces many garbage cells, which become always silent after having finished the learning. The proposed neocognitron with a new learning method can prevent the generation of such garbage cells even with a high learning speed, allowing incremental learning.
Collapse
Affiliation(s)
- Kunihiko Fukushima
- School of Media Science, Tokyo University of Technology, 1404-1 Katakura Hachioji, Tokyo 192-0982, Japan.
| |
Collapse
|
182
|
Muhlbaier M, Topalis A, Polikar R. Learn++.MT: A New Approach to Incremental Learning. MULTIPLE CLASSIFIER SYSTEMS 2004. [DOI: 10.1007/978-3-540-25966-4_5] [Citation(s) in RCA: 23] [Impact Index Per Article: 1.1] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/12/2022]
|
183
|
|
184
|
On the capability of accommodating new classes within probabilistic neural networks. ACTA ACUST UNITED AC 2003; 14:450-3. [DOI: 10.1109/tnn.2003.809417] [Citation(s) in RCA: 19] [Impact Index Per Article: 0.9] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/06/2022]
|