DOCSLIB.ORG

Semi-Supervised Image Classification with Laplacian Support Vector

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Semi-Supervised Image Classification with Laplacian Support Vector IEEE GEOSCIENCE AND REMOTE SENSING LETTERS, VOL. XX, NO. Y, MONTH Z 2007 1 Semi-supervised Image Classification with Laplacian Support Vector Machines Luis G´omez-Chova, Gustavo Camps-Valls, Senior Member, IEEE, Jordi Mu˜noz-Mar´ı, and Javier Calpe, Member, IEEE Abstract— This paper presents a semi-supervised method for methods are computationally demanding and generally do not remote sensing image classification based on kernel machines and yield a final decision function but only prediction labels. graph theory. The support vector machine (SVM) is regularized In this paper, we present a recently introduced semi- with the un-normalized graph Laplacian, thus leading to the Laplacian SVM. The method is tested in the challenging problems supervised framework that incorporates labeled and unlabeled of urban monitoring and cloud screening, in which an adequate data in any general-purpose learner [12], [13]. We focus on exploitation of the wealth of unlabeled samples is of critical. a semi-supervised extension of the SVM, which introduces Results obtained using different sensors, and with low number an additional regularization term on the geometry of both of training samples demonstrate the potential of the proposed labeled and unlabeled samples by using the graph Laplacian Laplacian SVM for remote sensing image classification. [14], thus leading to the so-called Laplacian SVM (LapSVM). Index Terms— Semi-supervised learning, regularization, kernel This methodology follows a non-iterative optimization proce- methods, manifold learning, support vector machines. dure in contrast to most transductive learning methods, and provides out-of-sample predictions in contrast to graph-based approaches. In addition, hard-margin SVM, directed graph I. INTRODUCTION methods, label propagation methods and spectral clustering In remote sensing image classification, we are usually given solutions are obtained for particular free parameters. a reduced set of labeled samples to develop the classifier. The performance of the LapSVM is illustrated in two Supervised classifiers such as support vector machines (SVMs) challenging problems: the urban classification problem using [1], [2] excel in using the labeled information, being (reg- multispectral (LandSat TM) and radar (ERS2 SAR) data [15], ularized) maximum margin classifiers also equipped with an and the cloud screening problem using the MEdium Resolution appropriate loss function [3], [4]. These methods, nevertheless, Imaging Spectrometer (MERIS) instrument on board the ESA need to be reformulated to exploit the information contained ENVIronmental SATellite (ENVISAT) [16]. On the one hand, in the wealth of unlabeled samples, which is known as semi- monitoring urban areas at a regional scale, and even at a global supervised classification. In semi-supervised learning (SSL), scale, has become an increasingly important topic in the last the algorithm is provided with some available supervised decades in order to keep track of the loss of natural areas due information in addition to the unlabeled data. The framework to urban development. The classification of urban areas is, of semi-supervised learning is very active and has recently at- however, a complex problem, specially when different sensor tracted a considerable amount of research [5], [6]. Essentially, sources are used, as they induce a highly variable input feature three different classes of SSL algorithms are encountered in space. On the other hand, the amount of images acquired the literature: over the globe every day by Earth Observation (EO) satellites makes inevitable the presence of clouds. Therefore, accurate 1) Generative models involve estimating the conditional cloud masking in acquired scenes is of paramount importance density, such as expectation-maximization (EM) algo- to avoid errors on the study of the true ground reflectance, and rithms with finite mixture models [7], which have been to permit multitemporal studies, as it is no longer necessary to extensively applied in the context of remotely sensed discard the whole image. However, very few labeled cloud pix- image classification [8]. els are tipically available, and cloud features change to a great 2) Low density separation algorithms maximize the margin extent depending on the cloud type, thickness, transparency, for labeled and unlabeled samples simultaneously, such height, or background. In addition, cloud screening must be as Transductive SVM (TSVM) [9], which have been carried out before atmospheric correction, being the input data recently applied to hyperspectral image classification affected by the atmospheric conditions. [10]. In machine learning, these problems constitute clear ex- 3) Graph-based methods, in which each sample spreads its amples of classification in complex manifolds and ill-posed label information to its neighbors until a global stable problems, respectively. A manifold is a topological space that state is achieved on the whole dataset [11]. is locally Euclidean, but in which the global structure may In the last years, TSVM and graph-based methods have be more complicated. In both settings, the use of LapSVM captured great attention. However, some specific problems are is motivated since it permits using the labeled samples, identified in both of them. In particular, TSVM is sensitive and efficiently exploiting the information contained in the to local minima and requires convergence heuristics by using high number of available unlabeled pixels to characterize the an (unknown) number of unlabeled samples. Graph-based marginal distribution of the class of interest. The rest of the paper is outlined as follows. Section II Manuscript received July 2007; reviews the framework of semi-supervised learning paying Dept. Enginyeria Electr`onica. Escola T`ecnica Superior d’Enginyeria. Uni- versitat de Val`encia. C/ Dr. Moliner, 50. 46100 Burjassot (Val`encia) Spain. attention to the minimization functional and the need for differ- E-mail: [email protected] ent types of regularization. Section III presents the formulation 2 IEEE GEOSCIENCE AND REMOTE SENSING LETTERS, VOL. XX, NO. Y, MONTH Z 2007 of the Laplacian SVM. Section IV shows the experimental without considering the mapping φ explicitly, a non-linear results. Finally, Section V concludes and outlines further work. classifier can be constructed by selecting the proper kernel. Also, the regularization term can be fully expressed in terms II. SEMI-SUPERVISED LEARNING FRAMEWORK of the kernel matrix and the expansion coefficients: Regularization is necessary to produce smooth decision 2 2 fH = w =(Φα) (Φα)=α Kα. (4) functions and thus avoiding overfitting to the training data. Since the work of Tikhonov [17], many regularized algorithms have been proposed to control the capacity of the classifier [1], C. Manifold regularization [18]. The regularization framework has been recently extended The geometry of the data is modeled with a graph in which to the use of unlabeled samples [13] as follows. nodes represent both labeled and unlabeled samples connected Notationally, we are given a set of l labeled samples, {x }l {x }l+u by weights Wij [5], [14]. Regularizing the graph follows from i,yi i=1, and a set of u unlabeled samples i i=l+1, the smoothness (or manifold) assumption and intuitively is x ∈ RN ∈{−1 +1} where i and yi , . Let us now assume equivalent to penalize the “rapid changes” of the classification a general-purpose decision function f. The regularized func- function evaluated between close samples in the graph: tional to be minimized is defined as: l+u l 1 2 1 2 2 2 fM = Wij (f(xi) − f(xj)) = f Lf, (5) L = V (xi,yi,f)+γLfH + γM fM, (1) ( + )2 l u i,j=1 l i=1 where V represents a generic cost function of the committed where L = D − W is the graph Laplacian, D is the diagonal l+u errors on the labeled samples, γL controls the complexity of degree matrix of W given by Dii = j=1 Wij , and f = H f in the associated Hilbert space , and γM controls its [f(x1),...,f(xl+u)] = Kα, where we have deliberately complexity in the intrinsic geometry of the marginal data dropped the bias term b. distribution. For example, if the probability distribution is 2 supported on a low-dimensional manifold, f M penalizes f along that manifold M. Note that this functional constitutes D. Formulation a general regularization framework that takes into account all By plugging (2)-(5) into (1), we obtain the regularized the available knowledge. function to be minimized: l III. LAPLACIAN SUPPORT VECTOR MACHINES 1 γM min ξi + γLα Kα + α KLKα (6) l 2 ξi∈R l (l + u) The previous semi-supervised learning framework allows us l+u i=1 to develop many different algorithms just by playing around α∈R with the loss function, V , and the regularizers, f 2. In this subject to: paper, we focus on the Laplacian SVM formulation, which l+u basically uses a SVM as the learner core and the graph (x x )+ ≥ 1 − =1 Laplacian for manifold regularization. In the following, we yi αjK i, j b ξi,i ,...,l (7) review all the ingredients of the formulation. j=1 ξi ≥ 0 i =1,...,l (8) A. Cost function of the errors where ξi are slack variables to deal with committed errors in The Laplacian SVM uses the same hinge loss function as the labeled samples. Introducing restrictions (7)-(8) into the the traditional SVM: primal functional (6) through Lagrange multipliers, β i and ηi, and taking derivatives w.r.t. b and ξi, we obtain: V (xi,yi,f)=max{0, 1 − yif(xi)}, (2) 1 2γM where f represents the decision function implemented by the min α 2γLK + KLK α α,β 2 ( + )2 selected classifier. l u l −α KJ Yβ + i=1 βi , (9) B. Decision function We use as the decision function f(x∗)=w, φ(x∗) + b, where J =[I0] is an l × (l + u) matrix with I as the where φ(·) is a nonlinear mapping to a higher (possibly l × l identity matrix (the first l points are labeled) and Y = infinite) dimensional Hilbert space H, and w and b define diag(y1,...,yl).
Load more

Recommended publications
  • ECS289: Scalable Machine Learning
    ECS289: Scalable Machine Learning Cho-Jui Hsieh UC Davis Nov 3, 2015 Outline PageRank Semi-supervised Learning Label Propagation Manifold regularization PageRank Ranking Websites Text based ranking systems (a dominated approach in the early 90s) Compute the similarity between query and websites (documents) Keywords are a very limited way to express a complex information Need to rank websites by \popularity", \authority", . PageRank: Developed by Brin and Page (1999) Determine the authority and popularity by hyperlinks PageRank Main idea: estimate the ranking of websites by the link structure. Topology of Websites Transform the hyperlinks to a directed graph: The adjacency matrix A such that Aij = 1 if page j points to page i Transition Matrix Normalize the adjacency matrix so that the matrix is a stochastic matrix (each column sum up to 1) Pij : probability that arriving at page i from page j P: a stochastic matrix or a transition matrix Random walk: step 1 Random walk through the transition matrix Start from [1; 0; 0; 0] (can use any initialization) Random walk: step 1 Random walk through the transition matrix xt+1 = Pxt Random walk: step 2 Random walk through the transition matrix Random walk: step 2 Random walk through the transition matrix xt+2 = Pxt+1 PageRank (convergence) P Start from an initial vector x with i xi = 1 (the initial distribution) For t = 1; 2;::: xt+1 = Pxt Each xt is a probability distribution (sums up to 1) Converges to a stationary distribution π such that π = Pπ if P satisfies the following two conditions: t 1 P is irreducible: for all i; j, there exists some t such that (P )i;j > 0 t 2 P is aperiodic: for all i; j, we have gcdft :(P )i;j > 0g = 1 π is the unique right eigenvector of P with eigenvalue 1.
    [Show full text]
  • Semi-Supervised Classification Using Local and Global Regularization
    Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008) Semi- supervised Classification Using Local and Global Regularization Fei Wang1, Tao Li2, Gang Wang3, Changshui Zhang1 1Department of Automation, Tsinghua University, Beijing, China 2School of Computing and Information Sciences, Florida International University, Miami, FL, USA 3Microsoft China Research, Beijing, China Abstract works concentrate on the derivation of different forms of In this paper, we propose a semi-supervised learning (SSL) smoothness regularizers, such as the ones using combinato- algorithm based on local and global regularization. In the lo- rial graph Laplacian (Zhu et al., 2003)(Belkin et al., 2006), cal regularization part, our algorithm constructs a regularized normalized graph Laplacian (Zhou et al., 2004), exponen- classifier for each data point using its neighborhood, while tial/iterative graph Laplacian (Belkin et al., 2004), local lin- the global regularization part adopts a Laplacian regularizer ear regularization (Wang & Zhang, 2006)and local learning to smooth the data labels predicted by those local classifiers. regularization (Wu & Sch¨olkopf, 2007), but rarely touch the We show that some existing SSL algorithms can be derived problem of how to derive a more efficient loss function. from our framework. Finally we present some experimental In this paper, we argue that rather than applying a global results to show the effectiveness of our method. loss function which is based on the construction of a global predictor using the whole data set, it would be more desir- Introduction able to measure such loss locally by building some local pre- Semi-supervised learning (SSL), which aims at learning dictors for different regions of the input data space.
    [Show full text]
  • Linear Manifold Regularization for Large Scale Semi-Supervised Learning
    Linear Manifold Regularization for Large Scale Semi-supervised Learning Vikas Sindhwani [email protected] Partha Niyogi [email protected] Mikhail Belkin [email protected] Department of Computer Science, University of Chicago, Hyde Park, Chicago, IL 60637 Sathiya Keerthi [email protected] Yahoo! Research Labs, 210 S Delacey Avenue, Pasadena, CA 91105 Abstract tion (Belkin, Niyogi & Sindhwani, 2004; Sindhwani, The enormous wealth of unlabeled data in Niyogi and Belkin, 2005). In this framework, unla- many applications of machine learning is be- beled data is incorporated within a geometrically mo- ginning to pose challenges to the designers tivated regularizer. We specialize this framework for of semi-supervised learning methods. We linear classification, and focus on the problem of deal- are interested in developing linear classifica- ing with large amounts of data. tion algorithms to efficiently learn from mas- This paper is organized as follows: In section 2, we sive partially labeled datasets. In this paper, setup the problem of linear semi-supervised learning we propose Linear Laplacian Support Vector and discuss some prior work. The general Manifold Machines and Linear Laplacian Regularized Regularization framework is reviewed in section 3. In Least Squares as promising solutions to this section 4, we discuss our methods. Section 5 outlines problem. some research in progress. 1. Introduction 2. Linear Semi-supervised Learning The problem of linear semi-supervised clasification is A single web-crawl by search engines like Yahoo and setup as follows: We are given l labeled examples Google indexes billions of webpages. Only a very l l+u fxi; yigi=1 and u unlabeled examples fxigi=l+1, where small fraction of these web-pages can be hand-labeled d and assembled into topic directories.
    [Show full text]
  • Semi-Supervised Deep Learning Using Improved Unsupervised Discriminant Projection?
    Semi-Supervised Deep Learning Using Improved Unsupervised Discriminant Projection? Xiao Han∗, Zihao Wang∗, Enmei Tu, Gunnam Suryanarayana, and Jie Yang School of Electronics, Information and Electrical Engineering, Shanghai Jiao Tong University, China [email protected], [email protected], [email protected] Abstract. Deep learning demands a huge amount of well-labeled data to train the network parameters. How to use the least amount of labeled data to obtain the desired classification accuracy is of great practical significance, because for many real-world applications (such as medical diagnosis), it is difficult to obtain so many labeled samples. In this paper, modify the unsupervised discriminant projection algorithm from dimen- sion reduction and apply it as a regularization term to propose a new semi-supervised deep learning algorithm, which is able to utilize both the local and nonlocal distribution of abundant unlabeled samples to improve classification performance. Experiments show that given dozens of labeled samples, the proposed algorithm can train a deep network to attain satisfactory classification results. Keywords: Manifold Regularization · Semi-supervised learning · Deep learning. 1 Introduction In reality, one of the main difficulties faced by many machine learning tasks is manually tagging large amounts of data. This is especially prominent for deep learning, which usually demands a huge number of well-labeled samples. There- fore, how to use the least amount of labeled data to train a deep network has become an important topic in the area. To overcome this problem, researchers proposed that the use of a large number of unlabeled data can extract the topol- ogy of the overall data's distribution.
    [Show full text]
  • Hyper-Parameter Optimization for Manifold Regularization Learning
    Cassiano Ot´avio Becker Hyper-parameter Optimization for Manifold Regularization Learning Otimiza¸cao~ de Hiperparametros^ para Aprendizado do Computador por Regulariza¸cao~ em Variedades Campinas 2013 i ii Universidade Estadual de Campinas Faculdade de Engenharia Eletrica´ e de Computa¸cao~ Cassiano Ot´avio Becker Hyper-parameter Optimization for Manifold Regularization Learning Otimiza¸cao~ de Hiperparametros^ para Aprendizado do Computador por Regulariza¸cao~ em Variedades Master dissertation presented to the School of Electrical and Computer Engineering in partial fulfillment of the requirements for the degree of Master in Electrical Engineering. Concentration area: Automation. Disserta¸c~ao de Mestrado apresentada ao Programa de P´os- Gradua¸c~ao em Engenharia El´etrica da Faculdade de Engenharia El´etrica e de Computa¸c~ao da Universidade Estadual de Campinas como parte dos requisitos exigidos para a obten¸c~ao do t´ıtulo de Mestre em Engenharia El´etrica. Area´ de concentra¸c~ao: Automa¸c~ao. Orientador (Advisor): Prof. Dr. Paulo Augusto Valente Ferreira Este exemplar corresponde `a vers~ao final da disserta¸c~aodefendida pelo aluno Cassiano Ot´avio Becker, e orientada pelo Prof. Dr. Paulo Augusto Valente Ferreira. Campinas 2013 iii Ficha catalográfica Universidade Estadual de Campinas Biblioteca da Área de Engenharia e Arquitetura Rose Meire da Silva - CRB 8/5974 Becker, Cassiano Otávio, 1977- B388h BecHyper-parameter optimization for manifold regularization learning / Cassiano Otávio Becker. – Campinas, SP : [s.n.], 2013. BecOrientador: Paulo Augusto Valente Ferreira. BecDissertação (mestrado) – Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação. Bec1. Aprendizado do computador. 2. Aprendizado semi-supervisionado. 3. Otimização matemática. 4.
    [Show full text]
  • Zero Shot Learning Via Multi-Scale Manifold Regularization
    Zero Shot Learning via Multi-Scale Manifold Regularization Shay Deutsch 1,2 Soheil Kolouri 3 Kyungnam Kim 3 Yuri Owechko 3 Stefano Soatto 1 1 UCLA Vision Lab, University of California, Los Angeles, CA 90095 2 Department of Mathematics, University of California Los Angeles 3 HRL Laboratories, LLC, Malibu, CA {shaydeu@math., soatto@cs.}ucla.edu {skolouri, kkim, yowechko,}@hrl.com Abstract performed in a transductive setting, using all unlabeled data where the classification and learning process on the transfer We address zero-shot learning using a new manifold data is entirely unsupervised. alignment framework based on a localized multi-scale While our suggested approach is similar in scope to other transform on graphs. Our inference approach includes a ”visual-semantic alignment” methods (see [5, 10] and ref- smoothness criterion for a function mapping nodes on a erences therein) it is, to the best of our knowledge, the first graph (visual representation) onto a linear space (semantic to use multi-scale localized representations that respect the representation), which we optimize using multi-scale graph global (non-flat) geometry of the data space and the fine- wavelets. The robustness of the ensuing scheme allows us scale structure of the local semantic representation. More- to operate with automatically generated semantic annota- over, learning the relationship between visual features and tions, resulting in an algorithm that is entirely free of man- semantic attributes is unified into a single process, whereas ual supervision, and yet improves the state-of-the-art as in most ZSL approaches it is divided into a number of inde- measured on benchmark datasets.
    [Show full text]
  • Semi-Supervised Deep Metric Learning Networks for Classification of Polarimetric SAR Data
    remote sensing Letter Semi-Supervised Deep Metric Learning Networks for Classification of Polarimetric SAR Data Hongying Liu , Ruyi Luo, Fanhua Shang * , Xuechun Meng, Shuiping Gou and Biao Hou Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education, School of Artificial Intelligence, Xidian University, Xi’an 710071, China; [email protected] (H.L.); [email protected] (R.L.); [email protected] (X.M.); [email protected] (S.G.); [email protected] (B.H.) * Corresponding authors: [email protected] Received: 7 April 2020; Accepted: 14 May 2020; Published: 17 May 2020 Abstract: Recently, classification methods based on deep learning have attained sound results for the classification of Polarimetric synthetic aperture radar (PolSAR) data. However, they generally require a great deal of labeled data to train their models, which limits their potential real-world applications. This paper proposes a novel semi-supervised deep metric learning network (SSDMLN) for feature learning and classification of PolSAR data. Inspired by distance metric learning, we construct a network, which transforms the linear mapping of metric learning into the non-linear projection in the layer-by-layer learning. With the prior knowledge of the sample categories, the network also learns a distance metric under which all pairs of similarly labeled samples are closer and dissimilar samples have larger relative distances. Moreover, we introduce a new manifold regularization to reduce the distance between neighboring samples since they are more likely to be homogeneous. The categorizing is achieved by using a simple classifier. Several experiments on both synthetic and real-world PolSAR data from different sensors are conducted and they demonstrate the effectiveness of SSDMLN with limited labeled samples, and SSDMLN is superior to state-of-the-art methods.
    [Show full text]
  • Manifold Regularization and Semi-Supervised Learning: Some Theoretical Analyses
    Manifold Regularization and Semi-supervised Learning: Some Theoretical Analyses Partha Niyogi∗ January 22, 2008 Abstract Manifold regularization (Belkin, Niyogi, Sindhwani, 2004)isage- ometrically motivated framework for machine learning within which several semi-supervised algorithms have been constructed. Here we try to provide some theoretical understanding of this approach. Our main result is to expose the natural structure of a class of problems on which manifold regularization methods are helpful. We show that for such problems, no supervised learner can learn effectively. On the other hand, a manifold based learner (that knows the manifold or “learns” it from unlabeled examples) can learn with relatively few labeled examples. Our analysis follows a minimax style with an em- phasis on finite sample results (in terms of n: the number of labeled examples). These results allow us to properly interpret manifold reg- ularization and its potential use in semi-supervised learning. 1 Introduction A learning problem is specified by a probability distribution p on X × Y according to which labelled examples zi = (xi, yi) pairs are drawn and presented to a learning algorithm (estimation procedure). We are interested in an understanding of the case in which X = IRD, ∗Departments of Computer Science, Statistics, The University of Chicago 1 Y ⊂ IR but pX (the marginal distribution of p on X) is supported on some submanifold M ⊂ X. In particular, we are interested in understanding how knowledge of this submanifold may potentially help a learning algorithm1. To this end, we will consider two kinds of learning algorithms: 1. Algorithms that have no knowledge of the submanifold M but learn from (xi, yi) pairs in a purely supervised way.
    [Show full text]
  • A Graph Based Approach to Semi-Supervised Learning
    A graph based approach to semi-supervised learning Michael Lim 1 Feb 2011 Michael Lim A graph based approach to semi-supervised learning Two papers M. Belkin, P. Niyogi, and V Sindhwani. Manifold regularization: a geometric framework for learning from labeled and unlabeled examples. Journal of Machine Learning Research 1-48, 2006. M. Belkin, P. Niyogi. Towards a Theoretical Foundation for Laplacian Based Manifold Methods. Journal of Computer and System Sciences, 2007. Michael Lim A graph based approach to semi-supervised learning What is semi-supervised learning? Prediction, but with the help of unsupervised examples. Michael Lim A graph based approach to semi-supervised learning Practical reasons: unlabeled data cheap More natural model of human learning Why semi-supervised learning? Michael Lim A graph based approach to semi-supervised learning More natural model of human learning Why semi-supervised learning? Practical reasons: unlabeled data cheap Michael Lim A graph based approach to semi-supervised learning Why semi-supervised learning? Practical reasons: unlabeled data cheap More natural model of human learning Michael Lim A graph based approach to semi-supervised learning An example Michael Lim A graph based approach to semi-supervised learning An example Michael Lim A graph based approach to semi-supervised learning An example Michael Lim A graph based approach to semi-supervised learning An example Michael Lim A graph based approach to semi-supervised learning Semi-supervised learning framework 1 l labeled examples (x; y) generated
    [Show full text]
  • Cross-Modal and Multimodal Data Analysis Based on Functional Mapping of Spectral Descriptors and Manifold Regularization
    Journal of Machine Learning Research 1 (2021) 1-37 Submitted 4/21; Published 00/00 Cross-Modal and Multimodal Data Analysis Based on Functional Mapping of Spectral Descriptors and Manifold Regularization Maysam Behmanesh [email protected] Artificial Intelligence Department, Faculty of Computer Engineering, University of Isfahan, Iran Peyman Adibi [email protected] Artificial Intelligence Department, Faculty of Computer Engineering, University of Isfahan, Iran Jocelyn Chanussot [email protected] Univ. Grenoble Alpes, CNRS, Grenoble INP, GIPSA-lab, 38000 Grenoble, France Sayyed Mohammad Saeed Ehsani [email protected] Artificial Intelligence Department, Faculty of Computer Engineering, University of Isfahan, Iran Editor: Abstract Multimodal manifold modeling methods extend the spectral geometry-aware data analysis to learning from several related and complementary modalities. Most of these methods work based on two major assumptions: 1) there are the same number of homogeneous data sam- ples in each modality, and 2) at least partial correspondences between modalities are given in advance as prior knowledge. This work proposes two new multimodal modeling methods. The first method establishes a general analyzing framework to deal with the multimodal information problem for heterogeneous data without any specific prior knowledge. For this purpose, first, we identify the localities of each manifold by extracting local descriptors via spectral graph wavelet signatures (SGWS). Then, we propose a manifold regulariza- tion framework based on the functional mapping between SGWS descriptors (FMBSD) for finding the pointwise correspondences. The second method is a manifold regularized mul- timodal classification based on pointwise correspondences (M2CPC) used for the problem of multiclass classification of multimodal heterogeneous, which the correspondences be- tween modalities are determined based on the FMBSD method.
    [Show full text]
  • Classification by Discriminative Regularization
    Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008) Classification by Discriminative Regularization 1¤ 2 3 1 1 Bin Zhang , Fei Wang , Ta-Hsin Li , Wen jun Yin , Jin Dong 1IBM China Research Lab, Beijing, China 2Department of Automation, Tsinghua University, Beijing, China 3IBM Watson Research Center, Yorktown Heights, NY, USA ¤Corresponding author, email: [email protected] Abstract Generally achieving a good classifier needs a sufficiently ² ^ Classification is one of the most fundamental problems large amount of training data points (such that may have a better approximation of ), however, in realJ world in machine learning, which aims to separate the data J from different classes as far away as possible. A com- applications, it is usually expensive and time consuming mon way to get a good classification function is to min- to get enough labeled points. imize its empirical prediction loss or structural loss. In Even if we have enough training data points, and the con- this paper, we point out that we can also enhance the ² structed classifier may fit very well on the training set, it discriminality of those classifiers by further incorporat- may not have a good generalization ability on the testing ing the discriminative information contained in the data set as a prior into the classifier construction process. In set. This is the problem we called overfitting. such a way, we will show that the constructed classifiers Regularization is one of the most important techniques will be more powerful, and this will also be validated by to handle the above two problems. First, for the overfitting the final empirical study on several benchmark data sets.
    [Show full text]
  • Approximate Manifold Regularization: Scalable Algorithm and Generalization Analysis
    Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI-19) Approximate Manifold Regularization: Scalable Algorithm and Generalization Analysis Jian Li1;2 , Yong Liu1 , Rong Yin1;2 and Weiping Wang1∗ 1Institute of Information Engineering, Chinese Academy of Sciences 2School of Cyber Security, University of Chinese Academy of Sciences flijian9026, liuyong, yinrong, [email protected] Abstract vised to approximate Laplacian graph by a line or spanning tree [Cesa-Bianchi et al., 2013] and improved by minimiz- Graph-based semi-supervised learning is one of ing tree cut (MTC) in [Zhang et al., 2016]. (2) Acceler- the most popular and successful semi-supervised ate operations associated with kernel matrix. Several dis- learning approaches. Unfortunately, it suffers from tributed approaches have been applied to semi-supervised high time and space complexity, at least quadratic learning [Chang et al., 2017], decomposing a large scale with the number of training samples. In this pa- problem into smaller ones. Anchor Graph regularization per, we propose an efficient graph-based semi- (Anchor) constructs an anchor graph with the training sam- supervised algorithm with a sound theoretical guar- ples and a few anchor points to approximate Laplacian graph antee. The proposed method combines Nystrom [Liu et al., 2010]. The work of [McWilliams et al., 2013; subsampling and preconditioned conjugate gradi- Rastogi and Sampath, 2017] applied random projections in- ent descent, substantially improving computational cluding Nystrom¨ methods and random features into mani- efficiency and reducing memory requirements. Ex- fold regularization. Gradient methods are introduced to solve tensive empirical results reveal that our method manifold regularization on the primal problem, such as pre- achieves the state-of-the-art performance in a short conditioned conjugate gradient [Melacci and Belkin, 2011], time even with limited computing resources.
    [Show full text]