Seventh IEEE International Conference on Data Mining (ICDM 2007)最新文献

筛选

英文中文

Efficient Kernel Discriminant Analysis via Spectral Regression 基于谱回归的高效核判别分析

Seventh IEEE International Conference on Data Mining (ICDM 2007) Pub Date : 2007-10-01 DOI: 10.1109/icdm.2007.88

Deng Cai, Xiaofei He, Jiawei Han

{"title":"Efficient Kernel Discriminant Analysis via Spectral Regression","authors":"Deng Cai, Xiaofei He, Jiawei Han","doi":"10.1109/icdm.2007.88","DOIUrl":"https://doi.org/10.1109/icdm.2007.88","url":null,"abstract":"Linear discriminant analysis (LDA) has been a popular method for extracting features which preserve class separability. The projection vectors are commonly obtained by maximizing the between class covariance and simultaneously minimizing the within class covariance. LDA can be performed either in the original input space or in the reproducing kernel Hilbert space (RKHS) into which data points are mapped, which leads to Kernel Discriminant Analysis (KDA). When the data are highly nonlinear distributed, KDA can achieve better performance than LDA. However, computing the projective functions in KDA involves eigen-decomposition of kernel matrix, which is very expensive when a large number of training samples exist. In this paper, we present a new algorithm for kernel discriminant analysis, called spectral regression kernel discriminant analysis (SRKDA). By using spectral graph analysis, SRKDA casts discriminant analysis into a regression framework which facilitates both efficient computation and the use of regularization techniques. Specifically, SRKDA only needs to solve a set of regularized regression problems and there is no eigenvector computation involved, which is a huge save of computational cost. Our computational analysis shows that SRKDA is 27 times faster than the ordinary KDA. Moreover, the new formulation makes it very easy to develop incremental version of the algorithm which can fully utilize the computational results of the existing training samples. Experiments on face recognition demonstrate the effectiveness and efficiency of the proposed algorithm.","PeriodicalId":233758,"journal":{"name":"Seventh IEEE International Conference on Data Mining (ICDM 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129354771","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}

引用次数: 146

Mining Interpretable Human Strategies: A Case Study 挖掘可解释的人类策略:一个案例研究

Seventh IEEE International Conference on Data Mining (ICDM 2007) Pub Date : 2007-10-01 DOI: 10.1109/ICDM.2007.19

Xiaoli Z. Fern, Chaitanya Komireddy, M. Burnett

引用次数: 6

Tutorials and Their Descriptions 教程及其描述

Seventh IEEE International Conference on Data Mining (ICDM 2007) Pub Date : 1900-01-01 DOI: 10.1109/icdm.2007.115

Guozhu Dong

引用次数: 0

首页上一页