Semi-supervised Laplacian eigenmaps for dimensionality reduction

Author(s):  
Feng Zheng ◽  
Na Chen ◽  
Luoqing Li
2020 ◽  
Author(s):  
Elnaz Lashgari ◽  
Uri Maoz

AbstractElectromyography (EMG) is a simple, non-invasive, and cost-effective technology for sensing muscle activity. However, EMG is also noisy, complex, and high-dimensional. It has nevertheless been widely used in a host of human-machine-interface applications (electrical wheelchairs, virtual computer mice, prosthesis, robotic fingers, etc.) and in particular to measure reaching and grasping motions of the human hand. Here, we developd a more automated pipeline to predict object weight in a reach-and-grasp task from an open dataset relying only on EMG data. In that we shifted the focus from manual feature-engineering to automated feature-extraction by using raw (filtered) EMG signals and thus letting the algorithms select the features. We further compared intrinsic EMG features, derived from several dimensionality-reduction methods, and then ran some classification algorithms on these low-dimensional representations. We found that the Laplacian Eigenmap algorithm generally outperformed other dimensionality-reduction methods. What is more, optimal classification accuracy was achieved using a combination of Laplacian Eigenmaps (simple-minded) and k-Nearest Neighbors (88% for 3-way classification). Our results, using EMG alone, are comparable to others in the literature that used EMG and EEG together. They also demonstrate the usefulness of dimensionality reduction when classifying movement based on EMG signals and more generally the usefulness of EMG for movement classification.


2018 ◽  
Vol 10 (2) ◽  
pp. 397-411 ◽  
Author(s):  
Minghua Ma ◽  
Tingquan Deng ◽  
Ning Wang ◽  
Yanmei Chen

As a member of many dimensionalityreduction algorithms, manifold learning is the hotspot ofrecent dimensionality reduction algorithm. Despite it isgood at retaining the original space structure, there is nodenying that its effect of classifying still has room forimprovement. Based on Laplacian Eigenmap, which is oneof the manifold learning algorithm, this paper committed tooptimize the algorithm combined with a semi-supervisedlearning ideas, which can improve the recognition rate.Finally, the better method of two forms is tested in thesurface electromyography system and plant leafidentification system. The experimental results show thatthis semi-supervised method does well in classifying.


Biosensors ◽  
2021 ◽  
Vol 11 (5) ◽  
pp. 161
Author(s):  
Monica Fira ◽  
Hariton-Nicolae Costin ◽  
Liviu Goraș

Classification performances for some classes of electrocardiographic (ECG) and electroencephalographic (EEG) signals processed to dimensionality reduction with different degrees are investigated. Results got with various classification methods are given and discussed. So far we investigated three techniques for reducing dimensionality: Laplacian eigenmaps (LE), locality preserving projections (LPP) and compressed sensing (CS). The first two methods are related to manifold learning while the third addresses signal acquisition and reconstruction from random projections under the supposition of signal sparsity. Our aim is to evaluate the benefits and drawbacks of various methods and to find to what extent they can be considered remarkable. The assessment of the effect of dimensionality decrease was made by considering the classification rates for the processed biosignals in the new spaces. Besides, the classification accuracies of the initial input data were evaluated with respect to the corresponding accuracies in the new spaces using different classifiers.


2011 ◽  
Vol 403-408 ◽  
pp. 2679-2682
Author(s):  
Quan Sheng Jiang ◽  
Su Ping Li

Manifold learning algorithms are nonlinear dimensionality reduction algorithms rising in recent years. Laplacian Eigenmaps is a typical manifold learning algorithms. Aim to the difficulty of selecting neighborhood parameter on the algorithm, a neighborhood parameter optimization method based on classification criterion is proposed in the paper. From the point of the classification performance, the classification criterion function is constructed to reflect the distance of within-class and between-class. The optimization of the neighborhood is obtained according to the minimum of the criterion function. The experimental results on IRIS validate the optimization of the neighborhood and the effectiveness of feature classification.


Sign in / Sign up

Export Citation Format

Share Document