scholarly journals Modeling of Recommendation System Based on Emotional Information and Collaborative Filtering

Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 1997
Author(s):  
Tae-Yeun Kim ◽  
Hoon Ko ◽  
Sung-Hwan Kim ◽  
Ho-Da Kim
Keyword(s):  
Collaborative Filtering ◽  
Kernel Function ◽  
User Satisfaction ◽  
Recommendation System ◽  
Feature Selection Method ◽  
Support Vector ◽  
Emotional States ◽  
User Characteristics ◽  
Rbf Kernel ◽  
Optimal Kernel

Emotion information represents a user’s current emotional state and can be used in a variety of applications, such as cultural content services that recommend music according to user emotional states and user emotion monitoring. To increase user satisfaction, recommendation methods must understand and reflect user characteristics and circumstances, such as individual preferences and emotions. However, most recommendation methods do not reflect such characteristics accurately and are unable to increase user satisfaction. In this paper, six human emotions (neutral, happy, sad, angry, surprised, and bored) are broadly defined to consider user speech emotion information and recommend matching content. The “genetic algorithms as a feature selection method” (GAFS) algorithm was used to classify normalized speech according to speech emotion information. We used a support vector machine (SVM) algorithm and selected an optimal kernel function for recognizing the six target emotions. Performance evaluation results for each kernel function revealed that the radial basis function (RBF) kernel function yielded the highest emotion recognition accuracy of 86.98%. Additionally, content data (images and music) were classified based on emotion information using factor analysis, correspondence analysis, and Euclidean distance. Finally, speech information that was classified based on emotions and emotion information that was recognized through a collaborative filtering technique were used to predict user emotional preferences and recommend content that matched user emotions in a mobile application.

scholarly journals A COMPARISON STUDY OF DIFFERENT KERNEL FUNCTIONS FOR SVM-BASED CLASSIFICATION OF MULTI-TEMPORAL POLARIMETRY SAR DATA

2014 ◽  
Vol XL-2/W3 ◽  
pp. 281-285 ◽  
Author(s):  
B. Yekkehkhany ◽  
A. Safari ◽  
S. Homayouni ◽  
M. Hasanlou
Keyword(s):  
Kernel Function ◽  
Temporal Integration ◽  
Experimental Tests ◽  
Kernel Functions ◽  
Polynomial Kernel ◽  
Support Vector ◽  
Svm Classifier ◽  
Rbf Kernel ◽  
Multi Temporal ◽  
Dimension Space

In this paper, a framework is developed based on Support Vector Machines (SVM) for crop classification using polarimetric features extracted from multi-temporal Synthetic Aperture Radar (SAR) imageries. The multi-temporal integration of data not only improves the overall retrieval accuracy but also provides more reliable estimates with respect to single-date data. Several kernel functions are employed and compared in this study for mapping the input space to higher Hilbert dimension space. These kernel functions include linear, polynomials and Radial Based Function (RBF). <br><br> The method is applied to several UAVSAR L-band SAR images acquired over an agricultural area near Winnipeg, Manitoba, Canada. In this research, the temporal alpha features of H/A/α decomposition method are used in classification. The experimental tests show an SVM classifier with RBF kernel for three dates of data increases the Overall Accuracy (OA) to up to 3% in comparison to using linear kernel function, and up to 1% in comparison to a 3rd degree polynomial kernel function.

scholarly journals A Machine Learning Approach to EEG-based Prediction of Human Affective States Using Recursive Feature Elimination Method

2021 ◽  
Vol 335 ◽  
pp. 04001
Author(s):  
Didar Dadebayev ◽  
Goh Wei Wei ◽  
Tan Ee Xion
Keyword(s):  
Feature Selection ◽  
Fractal Dimension ◽  
Emotion Recognition ◽  
Affective Computing ◽  
Feature Selection Method ◽  
Recursive Feature Elimination ◽  
Support Vector ◽  
Emotional States ◽  
Affective States ◽  
Emotion Classification

Emotion recognition, as a branch of affective computing, has attracted great attention in the last decades as it can enable more natural brain-computer interface systems. Electroencephalography (EEG) has proven to be an effective modality for emotion recognition, with which user affective states can be tracked and recorded, especially for primitive emotional events such as arousal and valence. Although brain signals have been shown to correlate with emotional states, the effectiveness of proposed models is somewhat limited. The challenge is improving accuracy, while appropriate extraction of valuable features might be a key to success. This study proposes a framework based on incorporating fractal dimension features and recursive feature elimination approach to enhance the accuracy of EEG-based emotion recognition. The fractal dimension and spectrum-based features to be extracted and used for more accurate emotional state recognition. Recursive Feature Elimination will be used as a feature selection method, whereas the classification of emotions will be performed by the Support Vector Machine (SVM) algorithm. The proposed framework will be tested with a widely used public database, and results are expected to demonstrate higher accuracy and robustness compared to other studies. The contributions of this study are primarily about the improvement of the EEG-based emotion classification accuracy. There is a potential restriction of how generic the results can be as different EEG dataset might yield different results for the same framework. Therefore, experimenting with different EEG dataset and testing alternative feature selection schemes can be very interesting for future work.

scholarly journals MINING TRUST VALUES FROM RECOMMENDATION ERRORS

2006 ◽  
Vol 15 (06) ◽  
pp. 945-962 ◽  
Author(s):  
JOHN O'DONOVAN ◽  
BARRY SMYTH
Keyword(s):  
Collaborative Filtering ◽  
User Satisfaction ◽  
Information Needs ◽  
Recommendation System ◽  
Predictive Accuracy ◽  
Target User ◽  
Fair Comparison ◽  
Collaborative Filtering Algorithm ◽  
History Of ◽  
User Trust

Increasing availability of information has furthered the need for recommender systems across a variety of domains. These systems are designed to tailor each user's information space to suit their particular information needs. Collaborative filtering is a successful and popular technique for producing recommendations based on similarities in users' tastes and opinions. Our work focusses on these similarities and the fact that current techniques for defining which users contribute to recommendation are in need of improvement. In this paper we propose the use of trustworthiness as an improvement to this situation. In particular, we define and empirically test a technique for eliciting trust values for each producer of a recommendation based on that user's history of contributions to recommendations. We compute a recommendation range to present to a target user. This is done by leveraging under/overestimate errors in users' past contributions in the recommendation process. We present three different models to compute this range. Our evaluation shows how this trust-based technique can be easily incorporated into a standard collaborative filtering algorithm and we define a fair comparison in which our technique outperforms a benchmark algorithm in predictive accuracy. We aim to show that the presentation of absolute rating predictions to users is more likely to reduce user trust in the recommendation system than presentation of a range of rating predictions. To evaluate the trust benefits resulting from the transparency of our recommendation range techniques, we carry out user-satisfaction trials on BoozerChoozer, a pub recommendation system. Our user-satisfaction results show that the recommendation range techniques perform up to twice as well as the benchmark.

Anomaly Intrusion Detection Based on Support Vector Machine with Mexico Hat Wavelet Kernel Function

2014 ◽  
Vol 687-691 ◽  
pp. 3897-3900 ◽  
Author(s):  
Ping An Wang ◽  
Xu Sheng Gan ◽  
Deng Kai Yao
Keyword(s):  
Support Vector Machine ◽  
Intrusion Detection ◽  
Kernel Function ◽  
Great Influence ◽  
Model Performance ◽  
Necessary Condition ◽  
Support Vector ◽  
Rbf Kernel ◽  
Wavelet Kernel Function ◽  
Anomaly Intrusion Detection

The selection of kernel function in Support Vector Machine (SVM) has a great influence on the model performance. In the paper, Mexico hat wavelet kernel is introduced to employ the kernel function of SVM, and theoretically it has be prove that, Mexico hat wavelet kernel satisfies the Merce condition, that is the necessary condition as the kernel function of SVM. Simulation on the anomaly detection shows that the capability of SVM based on Mexico hat wavelet kernel is better than that of SVM based on RBF kernel with a satisfactory result for anomaly intrusion detection.

scholarly journals Prediksi Risiko Perjalanan Transportasi Online Dari Data Telematik Menggunakan Algoritma Support Vector Machine

2020 ◽  
Vol 6 (2) ◽  
Author(s):  
Christ Memory Sitorus ◽  
Adhi Rizal ◽  
Mohamad Jajuli
Keyword(s):  
Support Vector Machine ◽  
User Satisfaction ◽  
Internet Technology ◽  
Training Data ◽  
Support Vector ◽  
Data Set ◽  
K Value ◽  
Movement Data ◽  
Svm Algorithm ◽  
Rbf Kernel

The ride-hailing service is now booming because it has been helped by internet technology, therefore many call this service online transportation. The magnitude of the potential for growth in online transportation service users also increases the risk of user satisfaction which could have declined therefore the company is increasing in its service. Both in terms of application and services provided by partners/drivers of the company. During each trip, the online transportation application will record device movement data and send it to the server. This data set is usually called telematic data. This telematics data if processed can have enormous benefits. In this study, an analysis will be conducted to predict the risk of online transportation trips using the Support Vector Machine (SVM) algorithm based on the obtained telematic data. The data obtained is telematic data so it must be processed first using feature engineering to obtain 51 features, then trained using the SVM algorithm with RBF kernel and modified C values. Every C value that is changed will be used K-Fold cross-validation first to separate the testing data and training data. The specified k value is 5. The results for each trial obtained accuracy, Receiver Operating Characteristic (ROC) and Area Under the Curves (AUC), for the best that is at C = 100 while the worst at C = 0.001.

Linguistic Rule Extraction from Support Vector Machine Classifiers

2008 ◽  
pp. 1269-1279
Author(s):  
Xiuju Fu ◽  
Lipo Wang ◽  
GihGuang Hung ◽  
Liping Goh
Keyword(s):  
Support Vector Machine ◽  
Kernel Function ◽  
Rule Extraction ◽  
Support Vector ◽  
Svm Classifier ◽  
Data Sets ◽  
Linear Kernel ◽  
Linguistic Rule ◽  
Linguistic Rules ◽  
Rbf Kernel

Classification decisions from linguistic rules are more desirable compared to complex mathematical formulas from support vector machine (SVM) classifiers due to the explicit explanation capability of linguistic rules. Linguistic rule extraction has been attracting much attention in explaining knowledge hidden in data. In this chapter, we show that the decisions from an SVM classifier can be decoded into linguistic rules based on the information provided by support vectors and decision function. Given a support vector of a certain class, cross points between each line, which is extended from the support vector along each axis, and an SVM decision hyper-curve are searched first. A hyper-rectangular rule is derived from these cross points. The hyper-rectangle is tuned by a tuning phase in order to exclude those out-class data points. Finally, redundant rules are merged to produce a compact rule set. Simultaneously, important attributes could be highlighted in the extracted rules. Rule extraction results from our proposed method could follow SVM classifier decisions very well. We compare the rule extraction results from SVM with RBF kernel function and linear kernel function. Experiment results show that rules extracted from SVM with RBF nonlinear kernel function are with better accuracy than rules extracted from SVM with linear kernel function. Comparisons between our method and other rule extraction methods are also carried out on several benchmark data sets. Higher rule accuracy is obtained in our method with fewer number of premises in each rule.

Linguistic Rule Extraction from Support Vector Machine Classifiers

2007 ◽  
pp. 276-290
Author(s):  
Xiuju Fu ◽  
Lipo Wang ◽  
GihGuang Hung ◽  
Liping Goh
Keyword(s):  
Support Vector Machine ◽  
Kernel Function ◽  
Rule Extraction ◽  
Support Vector ◽  
Svm Classifier ◽  
Data Sets ◽  
Linear Kernel ◽  
Linguistic Rule ◽  
Linguistic Rules ◽  
Rbf Kernel

Classification decisions from linguistic rules are more desirable compared to complex mathematical formulas from support vector machine (SVM) classifiers due to the explicit explanation capability of linguistic rules. Linguistic rule extraction has been attracting much attention in explaining knowledge hidden in data. In this chapter, we show that the decisions from an SVM classifier can be decoded into linguistic rules based on the information provided by support vectors and decision function. Given a support vector of a certain class, cross points between each line, which is extended from the support vector along each axis, and an SVM decision hyper-curve are searched first. A hyper-rectangular rule is derived from these cross points. The hyper-rectangle is tuned by a tuning phase in order to exclude those out-class data points. Finally, redundant rules are merged to produce a compact rule set. Simultaneously, important attributes could be highlighted in the extracted rules. Rule extraction results from our proposed method could follow SVM classifier decisions very well. We compare the rule extraction results from SVM with RBF kernel function and linear kernel function. Experiment results show that rules extracted from SVM with RBF nonlinear kernel function are with better accuracy than rules extracted from SVM with linear kernel function. Comparisons between our method and other rule extraction methods are also carried out on several benchmark data sets. Higher rule accuracy is obtained in our method with fewer number of premises in each rule.

Sign in / Sign up

Export Citation Format

Share Document