Proceedings Article10.1109/FUZZ-IEEE.2013.6622312
Multiple kernel aggregation using fuzzy integrals
Lequn Hu,Derek T. Anderson,Timothy C. Havens +2 more
- 07 Jul 2013
- pp 1-7
TL;DR: A new method for kernel aggregation, fuzzy integral aggregation of MKs (FI-MK), which ensures production of an aggregated kernel that is a valid Mercer kernel, and shows that the Choquet integral (CI) achieves this goal for matrix-wise aggregation.
read more
Abstract: The so-called kernel-trick is a well-known method for mapping data in a lower dimensional space into a higher dimensional space to measure the similarity (inner product) of the data elements without ever explicitly performing the mapping. The hope is to induce an improved feature space in which to carry out pattern analysis. However, important questions remain, such as i) what is the best kernel, and ii) do some features or sensors require different kernels? One elegant way to address these problems is multiple kernel (MK) aggregation. To date, the research on MKs has predominately studied linear aggregation of kernels, namely weighted sums, e.g., conic and convex sums. In this paper, we propose a new method for kernel aggregation, fuzzy integral aggregation of MKs (FI-MK). We study different FI formulations to determine which ensures production of an aggregated kernel that is a valid Mercer kernel. We show that the Choquet integral (CI) achieves this goal for matrix-wise aggregation. We leverage our theoretical results to propose a genetic algorithm-based classification scheme called FIGA. Experiments on publicly available data sets are provided that demonstrate our FIGA algorithm produces superior results in the context of support vector machine (SVM)-based classification.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Extension of the Fuzzy Integral for General Fuzzy Set-Valued Information
Derek T. Anderson,Timothy C. Havens,Christian Wagner,James M. Keller,Melissa F. Anderson,Daniel J. Wescott +5 more
TL;DR: A new definition of the fuzzy integral, called the generalized FI (gFI), and efficient algorithm for calculation for FS-valued integrands, showing there is not one supreme technique and multiple extensions are of benefit in different contexts and applications are shown.
Fuzzy Choquet Integration of Deep Convolutional Neural Networks for Remote Sensing
Derek T. Anderson,Grant J. Scott,Muhammad Aminul Islam,Bryce Murray,Richard A. Marcum +4 more
- 01 Jan 2018
TL;DR: This work explores the advantage of data-driven optimization of fusing different deep nets–GoogleNet, CaffeNet and ResNet–at a per class (neuron) or shared weight (single data fusion across classes) fashion and shows that fusion is the top performer.
37
Visualization and learning of the Choquet integral with limited training data
Anthony J. Pinar,Timothy C. Havens,Muhammad Aminul Islam,Derek T. Anderson +3 more
- 01 Jul 2017
TL;DR: This paper reviews a data-driven method of learning the FM via minimizing the sum-of-squared error (SSE) in the context of decision-level fusion and proposes an extension allowing knowledge of the underlying FM to be encoded in the algorithm.
20
Binary fuzzy measures and Choquet integration for multi-source fusion
Derek T. Anderson,Muhammad Aminul Islam,Roger L. King,Nicolas H. Younan,Joshua R. Fairley,Stacy E. Howington,Frederick E. Petry,Paul A. Elmore,Alina Zare +8 more
- 01 May 2017
TL;DR: It is proved that two fuzzy integrals, the ChI and the Sugeno integral, are equivalent for a BFM, and only a small subset of BFM variables need be stored, which reduces the BChI to a relatively simple look up operation.
15
References
Genetic algorithms in search, optimization and machine learning
David E. Goldberg
- 01 Jan 1989
TL;DR: This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
58.6K
•Book
Genetic algorithms in search, optimization, and machine learning
David E. Goldberg
- 01 Sep 1988
TL;DR: In this article, the authors present the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields, including computer programming and mathematics.
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Bernhard Schölkopf,Alexander J. Smola +1 more
- 01 Dec 2001
TL;DR: Learning with Kernels provides an introduction to SVMs and related kernel methods that provide all of the concepts necessary to enable a reader equipped with some basic mathematical knowledge to enter the world of machine learning using theoretically well-founded yet easy-to-use kernel algorithms.
10.2K
•Journal Article
Learning with kernels : Support vector machines, regularization, optimization, and beyond
Abstract: Chapters 2–7 make up Part II of the book: artificial neural networks. After introducing the basic concepts of neurons and artificial neuron learning rules in Chapter 2, Chapter 3 describes a particular formalism, based on signal-plus-noise, for the learning problem in general. After presenting the basic neural network types this chapter reviews the principal algorithms for error function minimization/optimization and shows how these learning issues are addressed in various supervised models. Chapter 4 deals with issues in unsupervised learning networks, such as the Hebbian learning rule, principal component learning, and learning vector quantization. Various techniques and learning paradigms are covered in Chapters 3–6, and especially the properties and relative merits of the multilayer perceptron networks, radial basis function networks, self-organizing feature maps and reinforcement learning are discussed in the respective four chapters. Chapter 7 presents an in-depth examination of performance issues in supervised learning, such as accuracy, complexity, convergence, weight initialization, architecture selection, and active learning. Par III (Chapters 8–15) offers an extensive presentation of techniques and issues in evolutionary computing. Besides the introduction to the basic concepts in evolutionary computing, it elaborates on the more important and most frequently used techniques on evolutionary computing paradigm, such as genetic algorithms, genetic programming, evolutionary programming, evolutionary strategies, differential evolution, cultural evolution, and co-evolution, including design aspects, representation, operators and performance issues of each paradigm. The differences between evolutionary computing and classical optimization are also explained. Part IV (Chapters 16 and 17) introduces swarm intelligence. It provides a representative selection of recent literature on swarm intelligence in a coherent and readable form. It illustrates the similarities and differences between swarm optimization and evolutionary computing. Both particle swarm optimization and ant colonies optimization are discussed in the two chapters, which serve as a guide to bringing together existing work to enlighten the readers, and to lay a foundation for any further studies. Part V (Chapters 18–21) presents fuzzy systems, with topics ranging from fuzzy sets, fuzzy inference systems, fuzzy controllers, to rough sets. The basic terminology, underlying motivation and key mathematical models used in the field are covered to illustrate how these mathematical tools can be used to handle vagueness and uncertainty. This book is clearly written and it brings together the latest concepts in computational intelligence in a friendly and complete format for undergraduate/postgraduate students as well as professionals new to the field. With about 250 pages covering such a wide variety of topics, it would be impossible to handle everything at a great length. Nonetheless, this book is an excellent choice for readers who wish to familiarize themselves with computational intelligence techniques or for an overview/introductory course in the field of computational intelligence. Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond—Bernhard Schölkopf and Alexander Smola, (MIT Press, Cambridge, MA, 2002, ISBN 0-262-19475-9). Reviewed by Amir F. Atiya.
6.4K