scholarly journals Deep Belief Network-Based Multifeature Fusion Music Classification Algorithm and Simulation

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Tianzhuo Gong
Keyword(s):  
Recognition Rate ◽  
Classification Performance ◽  
Mean Value ◽  
Classification Algorithm ◽  
Statistical Features ◽  
Endpoint Detection ◽  
Excellent Performance ◽  
Music Classification ◽  
Label Information ◽  
Multilevel Classification

In this paper, the multifeature fusion music classification algorithm and its simulation results are studied by deep confidence networks, the multifeature fusion music database is established and preprocessed, and then features are extracted. The simulation is carried out using multifeature fusion music data. The multifeature fusion music preprocessing includes endpoint detection, framing, windowing, and pre-emphasis. In this paper, we extracted the rhythm features, sound quality features, and spectral features, including energy, cross-zero rate, fundamental frequency, harmonic noise ratio, and 12 statistical features, including maximum value, mean value, and linear slope. A total of 384-dimensional statistical features was extracted and compared with the classification ability of different emotional features. The deficiencies of the traditional classification algorithm are first studied, and then by introducing confusion, constructing multilevel classifiers, and tuning each level of the classifier, better recognition rates than traditional primary classification are obtained. This paper introduces label information for supervised training to further improve the features of multifunctional fusion music. Experiments show that this information has excellent performance in multifunctional fusion music recognition. The experiments compare the multilevel classifier with primary classification, and the multilevel classification with the primary classification and the classification performance is improved, and the recognition rate of the multilevel classification algorithm is also improved over the multilevel classification algorithm, proving that the excellent performance with multiple levels of classification.

AUTOMATED RECOGNITION OF SINGLE & HYBRID POWER QUALITY DISTURBANCES USING WAVELET TRANSFORM BASED SUPPORT VECTOR MACHINE

2016 ◽  
Vol 79 (1) ◽  
Author(s):  
Suhail Khokhar ◽  
A. A. Mohd Zin ◽  
M. A. Bhayo ◽  
A. S. Mokhtar
Keyword(s):  
Neural Network ◽  
Support Vector Machine ◽  
Wavelet Transform ◽  
Power Quality ◽  
Probabilistic Neural Network ◽  
Recognition Rate ◽  
Classification Performance ◽  
Support Vector ◽  
Discrete Wavelet ◽  
Feed Forward Neural Network

The monitoring of power quality (PQ) disturbances in a systematic and automated way is an important issue to prevent detrimental effects on power system. The development of new methods for the automatic recognition of single and hybrid PQ disturbances is at present a major concern. This paper presents a combined approach of wavelet transform based support vector machine (WT-SVM) for the automatic classification of single and hybrid PQ disturbances. The proposed approach is applied by using synthetic models of various single and hybrid PQ signals. The suitable features of the PQ waveforms were first extracted by using discrete wavelet transform. Then SVM classifies the type of PQ disturbances based on these features. The classification performance of the proposed algorithm is also compared with wavelet based radial basis function neural network, probabilistic neural network and feed-forward neural network. The experimental results show that the recognition rate of the proposed WT-SVM based classification system is more accurate and much better than the other classifiers. 

A systematical approach to classification problems with feature space heterogeneity

Kybernetes ◽  
2019 ◽  
Vol 48 (9) ◽  
pp. 2006-2029
Author(s):  
Hongshan Xiao ◽  
Yu Wang
Keyword(s):  
Factor Analysis ◽  
Meta Analysis ◽  
Feature Space ◽  
Classification Performance ◽  
Classification Algorithm ◽  
Significant Feature ◽  
Data Sets ◽  
Data Set ◽  
Classification Techniques ◽  
Content Type

Purpose Feature space heterogeneity exists widely in various application fields of classification techniques, such as customs inspection decision, credit scoring and medical diagnosis. This paper aims to study the relationship between feature space heterogeneity and classification performance. Design/methodology/approach A measurement is first developed for measuring and identifying any significant heterogeneity that exists in the feature space of a data set. The main idea of this measurement is derived from a meta-analysis. For the data set with significant feature space heterogeneity, a classification algorithm based on factor analysis and clustering is proposed to learn the data patterns, which, in turn, are used for data classification. Findings The proposed approach has two main advantages over the previous methods. The first advantage lies in feature transform using orthogonal factor analysis, which results in new features without redundancy and irrelevance. The second advantage rests on samples partitioning to capture the feature space heterogeneity reflected by differences of factor scores. The validity and effectiveness of the proposed approach is verified on a number of benchmarking data sets. Research limitations/implications Measurement should be used to guide the heterogeneity elimination process, which is an interesting topic in future research. In addition, to develop a classification algorithm that enables scalable and incremental learning for large data sets with significant feature space heterogeneity is also an important issue. Practical implications Measuring and eliminating the feature space heterogeneity possibly existing in the data are important for accurate classification. This study provides a systematical approach to feature space heterogeneity measurement and elimination for better classification performance, which is favorable for applications of classification techniques in real-word problems. Originality/value A measurement based on meta-analysis for measuring and identifying any significant feature space heterogeneity in a classification problem is developed, and an ensemble classification framework is proposed to deal with the feature space heterogeneity and improve the classification accuracy.

Automatic Paroxysmal Atrial Fibrillation Based on not Fibrillating ECGs

2004 ◽  
Vol 43 (01) ◽  
pp. 94-98 ◽  
Author(s):  
S. Mota ◽  
F. J. Toro ◽  
A. F. Díaz ◽  
F. J. Fernández ◽  
E. Ros
Keyword(s):  
Atrial Fibrillation ◽  
Paroxysmal Atrial Fibrillation ◽  
Classification Performance ◽  
Classification Algorithm ◽  
Parametric Approach ◽  
Classification Rate ◽  
Discrimination Power ◽  
Atrial Fibrillation Episode ◽  
Scanning Strategies ◽  
Automatic Algorithm

Summary Objectives: The objective of the paper is to describe an automatic algorithm for Paroxysmal Atrial Fibrillation (PAF) Detection, based on parameters extracted from ECG traces with no atrial fibrillation episode. The modular automatic classification algorithm for PAF diagnosis is developed and evaluated with different parameter configurations. Methods: The database used in this study was provided by Physiobank for The Computers in Cardiology Challenge 2001. Each ECG file in this database was translated into a 48 parameter vector. The modular classification algorithm used for PAF diagnosis was based on the nearest K-neighbours. Several configuration options were evaluated to optimize the classification performance. Results: Different configurations of the proposed modular classification algorithm were tested. The uni-parametric approach achieved a top classification rate value of 76%. A multi-parametric approach was configured using the 5 parameters with highest discrimination power, and a top classification rate of 80% was achieved; different functions to typify the parameters were tested. Finally, two automatic parametric scanning strategies, Forward and Backward methods, were adopted. The results obtained with these approaches achieved a top classification rate of 92%. Conclusions: A modular classification algorithm based on the nearest K-neighbours was designed. The classification performance of the algorithm was evaluated using different parameter configurations, typification functions and number of K-neighbors. The automatic parametric scanning techniques achieved much better results than previously tested configurations.

scholarly journals EEG data processing in ADHD diagnosis and neurofeedback

2020 ◽  
Vol 40 (3) ◽  
pp. 116-123
Author(s):  
Zoran Šverko ◽  
Ivan Markovinović ◽  
Miroslav Vrankić ◽  
Saša Vlahinić
Keyword(s):  
Data Processing ◽  
Mean Value ◽  
Adhd Group ◽  
Eeg Signal ◽  
Statistical Features ◽  
Eeg Signals ◽  
New Approach ◽  
Mean Values ◽  
Adhd Diagnosis ◽  
Eeg Data

In this paper, EEG data processing was conducted in order to define the parameters for neurofeedback. A new survey was conducted based on a brief review of previous research. Two groups of participants were chosen: ADHD (3) and nonADHD (14). The main part of this study includes EEG signal data pre-processing and processing. We have outlined statistical features of observed EEG signals such as mean value, grand-mean value and their ratios. It can be concluded that an increase in grand-mean values of power theta-low beta ratio on Cz electrode gives confirmation of previous research. The value of alpha-delta power ratio higher than 1 on C3, Cz, P3, Pz, P4 in ADHD group is proposed as a new approach to classification. Based on these conclusions we will design a neurofeedback protocol as a continuation of this work.

A New SVM Multi-Class Classification Algorithm Based on Sample Scale and Distribution Area

2013 ◽  
Vol 712-715 ◽  
pp. 2529-2533
Author(s):  
Yu Ping Qin ◽  
Peng Da Qin ◽  
Shu Xian Lun ◽  
Yi Wang
Keyword(s):  
Binary Tree ◽  
Classification Performance ◽  
Classification Algorithm ◽  
Experimental Results ◽  
Leaf Node ◽  
Distribution Area ◽  
Root Node ◽  
Multi Class Classification

A new SVM multi-class classification algorithm is proposed. Firstly, the optimal binary tree is constructed by the scale and the distribution area of every class sample, and then the sub-classifiers are trained for every non-leaf node in the binary tree. For the sample to be classified, the classification is done from the root node until someone leaf node, and the corresponding class of the leaf node is the class of the sample. The experimental results show that the algorithm improves the classification precision and classification speed, especially in the situation that the sample scale is less but its distribution area is bigger, the algorithm can improve greatly the classification performance.

scholarly journals Novel Alphabet Deduction Using MATLAB by Neural Networks and Comparison with the Fuzzy Classifier

2021 ◽  
Vol 36 (1) ◽  
pp. 623-628
Author(s):  
Bapatu Siva Kumar Reddy ◽  
P. Vishnu Vardhan
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Character Recognition ◽  
Recognition Rate ◽  
Software Tool ◽  
Mean Value ◽  
Fuzzy Classifier ◽  
The Neural Network ◽  
Accuracy Level ◽  
The Neural Networks

Aim: The study aims to identify or recognize the alphabets using neural networks and fuzzy classifier/logic. Methods and materials: Neural network and fuzzy classifier are used for comparing the recognition of characters. For each classifier sample size is 20. Character recognition was developed using MATLAB R2018a, a software tool. The algorithm is again compared with the Fuzzy classifier to know the accuracy level. Results: Performance of both fuzzy classifier and neural networks are calculated by the accuracy value. The mean value of the fuzzy classifier is 82 and the neural network is 77. The recognition rate (accuracy) with the data features is found to be 98.06%. Fuzzy classifier shows higher significant value of P=0.002 < P=0.005 than the neural networks in recognition of characters. Conclusion: The independent tests for this study shows a higher accuracy level of alphabetical character recognition for Fuzzy classifier when compared with neural networks. Henceforth, the fuzzy classifier shows higher significant than the neural networks in recognition of characters.

scholarly journals Local Non Zero Eigen Value Preservation Based Expression Recognition

2020 ◽  
Vol 8 (6) ◽  
pp. 3823-3832
Keyword(s):  
Discriminant Analysis ◽  
Feature Vector ◽  
Feature Fusion ◽  
Recognition Rate ◽  
Fusion Rule ◽  
Classification Performance ◽  
Support Vector ◽  
Expression Recognition ◽  
Fisher Discriminant Analysis ◽  
Fisher Discriminant

This work proposes an finest mapping from features space to inherited space using kernel locality non zero eigen values protecting Fisher discriminant analysis subspace approach. This approach is designed by cascading analytical and non-inherited face texture features. Both Gabor magnitude feature vector (GMFV) and phase feature vector (GPFV) are independently accessed. Feature fusion is carried out by cascading geometrical distance feature vector (GDFV) with Gabor magnitude and phase vectors. Feature fusion dataset space is converted into short dimensional inherited space by kernel locality protecting Fisher discriminant analysis method and projected space is normalized by suitable normalization technique to prevent dissimilarity between scores. Final scores of projected domains are fused using greatest fusion rule. Expressions are classified using Euclidean distance matching and support vector machine radial basis function kernel classifier. An experimental outcome emphasizes that the proposed approach is efficient for dimension reduction, competent recognition and classification. Performance of proposed approach is deliberated in comparison with connected subspace approaches. The finest average recognition rate achieves 97.61% for JAFFE and 81.48% YALE database respectively.

scholarly journals Classification and Representation Joint Learning via Deep Networks

2017 ◽  
Author(s):  
Ya Li ◽  
Xinmei Tian ◽  
Xu Shen ◽  
Dacheng Tao
Keyword(s):  
Spatial Distribution ◽  
Deep Learning ◽  
Feature Learning ◽  
Classification Performance ◽  
Local Distribution ◽  
Classification Problems ◽  
Class Label ◽  
Channel Network ◽  
Training Samples ◽  
Label Information

Deep learning has been proven to be effective for classification problems. However, the majority of previous works trained classifiers by considering only class label information and ignoring the local information from the spatial distribution of training samples. In this paper, we propose a deep learning framework that considers both class label information and local spatial distribution information between training samples. A two-channel network with shared weights is used to measure the local distribution. The classification performance can be improved with more detailed information provided by the local distribution, particularly when the training samples are insufficient. Additionally, the class label information can help to learn better feature representations compared with other feature learning methods that use only local distribution information between samples. The local distribution constraint between sample pairs can also be viewed as a regularization of the network, which can efficiently prevent the overfitting problem. Extensive experiments are conducted on several benchmark image classification datasets, and the results demonstrate the effectiveness of our proposed method.

scholarly journals Nonuniform Granularity-Based Classification in Social Interest Detection

2017 ◽  
Vol 2017 ◽  
pp. 1-10
Author(s):  
Wenjuan Shao ◽  
Qingguo Shen ◽  
Xianli Jin ◽  
Liaoruo Huang ◽  
Jingjing Chen
Keyword(s):  
Large Scale ◽  
Clustering Algorithm ◽  
Nearest Neighbor ◽  
Social Interest ◽  
Classification Performance ◽  
Classification Algorithm ◽  
Computing Paradigm ◽  
The Social ◽  
Interest Detection

Social interest detection is a new computing paradigm which processes a great variety of large scale resources. Effective classification of these resources is necessary for the social interest detection. In this paper, we describe some concepts and principles about classification and present a novel classification algorithm based on nonuniform granularity. Clustering algorithm is used to generate a clustering pedigree chart. By using suitable classification cutting values to cut the chart, we can get different branches which are used as categories. The size of cutting value is vital to the performance and can be dynamically adapted in the proposed algorithm. Experiments results carried on the blog posts illustrate the effectiveness of the proposed algorithm. Furthermore, the results for comparing with Naive Bayes, k-nearest neighbor, and so forth validate the better classification performance of the proposed algorithm for large scale resources.

Sign in / Sign up

Export Citation Format

Share Document