Learning Distance to Subspace for the Nearest Subspace Methods in High-Dimensional Data Classification

Information Sciences - Netherlands
doi 10.1016/j.ins.2018.12.061
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Density-Connected Subspace Clustering for High-Dimensional Data

2004English

Analyzing High-Dimensional Data by Subspace Validity

English

A Novel Algorithm for Fast and Scalable Subspace Clustering of High-Dimensional Data

Journal of Big Data
Information SystemsComputer NetworksHardwareCommunicationsManagementArchitecture
2015English

Generalized Subspace Based High Dimensional Density Estimation

2011English

Combination of Difference Subspace and Oppurtunistic Clustering on High Dimensional Data

Journal of Computer Science
Computer NetworksSoftwareArtificial IntelligenceCommunications
2014English

Semantic Subspace Learning for Text Classification Using Hybrid Intelligent Techniques

International Journal of Hybrid Intelligent Systems
2011English

An Efficient Density Parameter-Light in Enhanced Subspace Clustering in High Dimensional Data

International Journal of Advanced Science and Technology
EnergyEngineeringComputer Science
2019English

Nearest-Regularized Subspace Classification for PolSAR Imagery Using Polarimetric Feature Vector and Spatial Information

Remote Sensing
EarthPlanetary Sciences
2017English

On the Orthogonal Distance to Class Subspaces for High-Dimensional Data Classification

Information Sciences
ControlSystems EngineeringManagementTheoretical Computer ScienceComputer Science ApplicationsInformation SystemsArtificial IntelligenceSoftware
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy