Fast and Scalable Multi-Kernel Encoder Classifier
arXiv:2406.02189 · doi:10.1007/978-3-031-73125-9_10
Abstract
This paper introduces a new kernel-based classifier by viewing kernel matrices as generalized graphs and leveraging recent progress in graph embedding techniques. The proposed method facilitates fast and scalable kernel matrix embedding, and seamlessly integrates multiple kernels to enhance the learning process. Our theoretical analysis offers a population-level characterization of this approach using random variables. Empirically, our method demonstrates superior running time compared to standard approaches such as support vector machines and two-layer neural network, while achieving comparable classification accuracy across various simulated and real datasets.
12 pages main + 3 pages appendix
References in corpus (14)
- The structure and function of complex networks
- Community structure in social and biological networks
- Structural Properties of the Caenorhabditis elegans Neuronal Network
- Spectral clustering and the high-dimensional stochastic blockmodel
- On a 'Two Truths' Phenomenon in Spectral Graph Clustering
- One-Hot Graph Encoder Embedding
- The Exact Equivalence of Distance and Kernel Methods for Hypothesis Testing
- Simulating and Modeling the Risk of Conversational Search
- Discovering Communication Pattern Shifts in Large-Scale Labeled Networks using Encoder Embedding and Vertex Dynamics
- Graph Encoder Ensemble for Simultaneous Vertex Embedding and Community Detection
- Synergistic Graph Fusion via Encoder Embedding
- Discovering the Signal Subgraph: An Iterative Screening Approach on Graphs
- Encoder Embedding for General Graph and Node Classification
- Efficient Graph Encoder Embedding for Large Sparse Graphs in Python