scholarly journals Opinion mining using combinational approach for different domains

2019 ◽  
Vol 9 (4) ◽  
pp. 3307
Author(s):  
Jyoti Sandesh Deshmukh ◽  
Amiya Kumar Tripathy ◽  
Dilendra Hiran
Keyword(s):  
Maximum Entropy ◽  
Cross Validation ◽  
Opinion Mining ◽  
Domain Adaptation ◽  
Online Reviews ◽  
Research Area ◽  
Source Domain ◽  
Different Types ◽  
Fold Cross Validation ◽  
Target Data

An increase in use of web produces large content of information about products. Online reviews are used to make decision by peoples. Opinion mining is vast research area in which different types of reviews are analyzed. Several issues are existing in this area. Domain adaptation is emerging issue in opinion mining. Labling of data for every domain is time consuming and costly task. Hence the need arises for model that train one domain and applied it on other domain reducing cost aswell as time. This is called domain adaptation which is addressed in this paper. Using maximum entropy and clustering technique source domains data is trained. Trained data from source domain is applied on target data to labeling purpose A result shows moderate accuracy for 5 fold cross validation and combination of source domains for Blitzer et al (2007) multi domain product dataset.

ITERATIVE SELF-LABELING DOMAIN ADAPTATION FOR LINEAR STRUCTURED IMAGE CLASSIFICATION

2013 ◽  
Vol 22 (05) ◽  
pp. 1360005 ◽  
Author(s):  
AMAURY HABRARD ◽  
JEAN-PHILIPPE PEYRACHE ◽  
MARC SEBBAN
Keyword(s):  
Image Classification ◽  
Domain Adaptation ◽  
Research Area ◽  
Target Domain ◽  
Sparse Models ◽  
Similarity Functions ◽  
Generalization Bounds ◽  
Source Data ◽  
New Research ◽  
Target Data

A strong assumption to derive generalization guarantees in the standard PAC framework is that training (or source) data and test (or target) data are drawn according to the same distribution. Because of the presence of possibly outdated data in the training set, or the use of biased collections, this assumption is often violated in real-world applications leading to different source and target distributions. To go around this problem, a new research area known as Domain Adaptation (DA) has recently been introduced giving rise to many adaptation algorithms and theoretical results in the form of generalization bounds. This paper deals with self-labeling DA whose goal is to iteratively incorporate semi-labeled target data in the learning set to progressively adapt the classifier from the source to the target domain. The contribution of this work is three-fold: First, we provide the minimum and necessary theoretical conditions for a self-labeling DA algorithm to perform an actual domain adaptation. Second, following these theoretical recommendations, we design a new iterative DA algorithm, called GESIDA, able to deal with structured data. This algorithm makes use of the new theory of learning with (ε,γ,τ)-good similarity functions introduced by Balcan et al., which does not require the use of a valid kernel to learn well and allows us to induce sparse models. Finally, we apply our algorithm on a structured image classification task and show that self-labeling domain adaptation is a new original way to deal with scaling and rotation problems.

scholarly journals Synthetic Source Universal Domain Adaptation through Contrastive Learning

Sensors ◽  
2021 ◽  
Vol 21 (22) ◽  
pp. 7539
Author(s):  
Jungchan Cho
Keyword(s):  
Domain Adaptation ◽  
Synthetic Data ◽  
Real Data ◽  
Target Domain ◽  
Source Domain ◽  
Universal Domain ◽  
Model Training ◽  
Using Data ◽  
Imaging Sensors ◽  
Target Data

Universal domain adaptation (UDA) is a crucial research topic for efficient deep learning model training using data from various imaging sensors. However, its development is affected by unlabeled target data. Moreover, the nonexistence of prior knowledge of the source and target domain makes it more challenging for UDA to train models. I hypothesize that the degradation of trained models in the target domain is caused by the lack of direct training loss to improve the discriminative power of the target domain data. As a result, the target data adapted to the source representations is biased toward the source domain. I found that the degradation was more pronounced when I used synthetic data for the source domain and real data for the target domain. In this paper, I propose a UDA method with target domain contrastive learning. The proposed method enables models to leverage synthetic data for the source domain and train the discriminativeness of target features in an unsupervised manner. In addition, the target domain feature extraction network is shared with the source domain classification task, preventing unnecessary computational growth. Extensive experimental results on VisDa-2017 and MNIST to SVHN demonstrated that the proposed method significantly outperforms the baseline by 2.7% and 5.1%, respectively.

scholarly journals Multi-EPL: Accurate multi-source domain adaptation

PLoS ONE ◽  
2021 ◽  
Vol 16 (8) ◽  
pp. e0255754
Author(s):  
Seongmin Lee ◽  
Hyunsik Jeon ◽  
U. Kang
Keyword(s):  
Domain Adaptation ◽  
State Of The Art ◽  
Multiple Source ◽  
Conditional Distributions ◽  
Source Domain ◽  
Multiple Feature ◽  
Crucial Problem ◽  
Novel Method ◽  
Privacy Issues ◽  
Target Data

Given multiple source datasets with labels, how can we train a target model with no labeled data? Multi-source domain adaptation (MSDA) aims to train a model using multiple source datasets different from a target dataset in the absence of target data labels. MSDA is a crucial problem applicable to many practical cases where labels for the target data are unavailable due to privacy issues. Existing MSDA frameworks are limited since they align data without considering labels of the features of each domain. They also do not fully utilize the target data without labels and rely on limited feature extraction with a single extractor. In this paper, we propose Multi-EPL, a novel method for MSDA. Multi-EPL exploits label-wise moment matching to align the conditional distributions of the features for the labels, uses pseudolabels for the unavailable target labels, and introduces an ensemble of multiple feature extractors for accurate domain adaptation. Extensive experiments show that Multi-EPL provides the state-of-the-art performance for MSDA tasks in both image domains and text domains, improving the accuracy by up to 13.20%.

scholarly journals Domain Adaptation for Semantic Parsing

2020 ◽  
Author(s):  
Zechang Li ◽  
Yuxuan Lai ◽  
Yansong Feng ◽  
Dongyan Zhao
Keyword(s):  
Domain Adaptation ◽  
Specific Information ◽  
Semantic Parsing ◽  
Target Domain ◽  
Source Domain ◽  
Domain Specific ◽  
The Difference ◽  
Two Stages ◽  
Coarse To Fine ◽  
Target Data

Recently, semantic parsing has attracted much attention in the community. Although many neural modeling efforts have greatly improved the performance, it still suffers from the data scarcity issue. In this paper, we propose a novel semantic parser for domain adaptation, where we have much fewer annotated data in the target domain compared to the source domain. Our semantic parser benefits from a two-stage coarse-to-fine framework, thus can provide different and accurate treatments for the two stages, i.e., focusing on domain invariant and domain specific information, respectively. In the coarse stage, our novel domain discrimination component and domain relevance attention encourage the model to learn transferable domain general structures. In the fine stage, the model is guided to concentrate on domain related details. Experiments on a benchmark dataset show that our method consistently outperforms several popular domain adaptation strategies. Additionally, we show that our model can well exploit limited target data to capture the difference between the source and target domain, even when the target domain has far fewer training instances.

scholarly journals Unsupervised multi-source domain adaptation with no observable source data

PLoS ONE ◽  
2021 ◽  
Vol 16 (7) ◽  
pp. e0253415
Author(s):  
Hyunsik Jeon ◽  
Seongmin Lee ◽  
U Kang
Keyword(s):  
Real World ◽  
Domain Adaptation ◽  
State Of The Art ◽  
Multiple Source ◽  
Multiple Sources ◽  
Target Domain ◽  
Source Domain ◽  
Source Data ◽  
Real World Datasets ◽  
Target Data

Given trained models from multiple source domains, how can we predict the labels of unlabeled data in a target domain? Unsupervised multi-source domain adaptation (UMDA) aims for predicting the labels of unlabeled target data by transferring the knowledge of multiple source domains. UMDA is a crucial problem in many real-world scenarios where no labeled target data are available. Previous approaches in UMDA assume that data are observable over all domains. However, source data are not easily accessible due to privacy or confidentiality issues in a lot of practical scenarios, although classifiers learned in source domains are readily available. In this work, we target data-free UMDA where source data are not observable at all, a novel problem that has not been studied before despite being very realistic and crucial. To solve data-free UMDA, we propose DEMS (Data-free Exploitation of Multiple Sources), a novel architecture that adapts target data to source domains without exploiting any source data, and estimates the target labels by exploiting pre-trained source classifiers. Extensive experiments for data-free UMDA on real-world datasets show that DEMS provides the state-of-the-art accuracy which is up to 27.5% point higher than that of the best baseline.

Predicting the interaction biomolecule types for lncRNA: an ensemble deep learning approach

2020 ◽  
Author(s):  
Yu Zhang ◽  
Cangzhi Jia ◽  
Chee Keong Kwoh
Keyword(s):  
Deep Learning ◽  
Molecular Mechanisms ◽  
Operating Characteristic ◽  
Cross Validation ◽  
Characteristic Curve ◽  
Published Data ◽  
Different Types ◽  
Precision Recall Curve ◽  
Deep Learning Model ◽  
Fold Cross Validation

Abstract Long noncoding RNAs (lncRNAs) play significant roles in various physiological and pathological processes via their interactions with biomolecules like DNA, RNA and protein. The existing in silico methods used for predicting the functions of lncRNA mainly rely on calculating the similarity of lncRNA or investigating whether an lncRNA can interact with a specific biomolecule or disease. In this work, we explored the functions of lncRNA from a different perspective: we presented a tool for predicting the interaction biomolecule type for a given lncRNA. For this purpose, we first investigated the main molecular mechanisms of the interactions of lncRNA–RNA, lncRNA–protein and lncRNA–DNA. Then, we developed an ensemble deep learning model: lncIBTP (lncRNA Interaction Biomolecule Type Prediction). This model predicted the interactions between lncRNA and different types of biomolecules. On the 5-fold cross-validation, the lncIBTP achieves average values of 0.7042 in accuracy, 0.7903 and 0.6421 in macro-average area under receiver operating characteristic curve and precision–recall curve, respectively, which illustrates the model effectiveness. Besides, based on the analysis of the collected published data and prediction results, we hypothesized that the characteristics of lncRNAs that interacted with DNA may be different from those that interacted with only RNA.

scholarly journals Research of Machine Learning algorithms using K-fold cross validation

2019 ◽  
Vol 8 (6S) ◽  
pp. 215-218
Keyword(s):  
Machine Learning ◽  
Cross Validation ◽  
Research Area ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Breast Cancer Dataset ◽  
Cancer Dataset ◽  
Validation Data ◽  
Machine Learning Classification ◽  
Fold Cross Validation

In machine learning, Classification is one of the most important research area. Classification allocates the given input to a known category. In this paper different machine algorithms like Logistic regression (LR), Decision tree (DT), Support vector machine (SVM), K nearest neighbors (KNN) were implemented on UCI breast cancer dataset with preprocessing. The models were trained and tested with k-fold cross validation data. Accuracy and run time execution of each classifier are implemented in python.

scholarly journals Cross-Domain End-To-End Aspect-Based Sentiment Analysis with Domain-Dependent Embeddings

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Yingjie Tian ◽  
Linrui Yang ◽  
Yunchuan Sun ◽  
Dalian. Liu
Keyword(s):  
Sentiment Analysis ◽  
Opinion Mining ◽  
Learning Strategy ◽  
Domain Adaptation ◽  
Online Reviews ◽  
Domain Model ◽  
Fine Grained ◽  
Cross Domain ◽  
End To End ◽  
Public Datasets

With the development of sentiment analysis, studies have been gradually classified based on different researched candidates. Among them, aspect-based sentiment analysis plays an important role in subtle opinion mining for online reviews. It used to be treated as a group of pipeline tasks but has been proved to be analysed well in an end-to-end model recently. Due to less labelled resources, the need for cross-domain aspect-based sentiment analysis has started to get attention. However, challenges exist when seeking domain-invariant features and keeping domain-dependent features to achieve domain adaptation within a fine-grained task. This paper utilizes the domain-dependent embeddings and designs the model CD-E2EABSA to achieve cross-domain aspect-based sentiment analysis in an end-to-end fashion. The proposed model utilizes the domain-dependent embeddings with a multitask learning strategy to capture both domain-invariant and domain-dependent knowledge. Various experiments are conducted and show the effectiveness of all components on two public datasets. Also, it is also proved that as a cross-domain model, CD-E2EABSA can perform better than most of the in-domain ABSA methods.

scholarly journals Differentially Private Correlation Alignment for Domain Adaptation

2021 ◽  
Author(s):  
Kaizhong Jin ◽  
Xiang Cheng ◽  
Jiaxi Yang ◽  
Kaiyuan Shen
Keyword(s):  
Covariance Matrix ◽  
Domain Adaptation ◽  
Estimation Method ◽  
Training Data ◽  
Target Domain ◽  
Source Domain ◽  
Feature Spaces ◽  
Benchmark Datasets ◽  
Low Dimensional ◽  
Target Data

Domain adaptation solves a learning problem in a target domain by utilizing the training data in a different but related source domain. As a simple and efficient method for domain adaptation, correlation alignment transforms the distribution of the source domain by utilizing the covariance matrix of the target domain, such that a model trained on the transformed source data can be applied to the target data. However, when source and target domains come from different institutes, exchanging information between the two domains might pose a potential privacy risk. In this paper, for the first time, we propose a differentially private correlation alignment approach for domain adaptation called PRIMA, which can provide privacy guarantees for both the source and target data. In PRIMA, to relieve the performance degradation caused by perturbing the covariance matrix in high dimensional setting, we present a random subspace ensemble based covariance estimation method which splits the feature spaces of source and target data into several low dimensional subspaces. Moreover, since perturbing the covariance matrix may destroy its positive semi-definiteness, we develop a shrinking based method for the recovery of positive semi-definiteness of the covariance matrix. Experimental results on standard benchmark datasets confirm the effectiveness of our approach.

KOMPARASI ALGORITMA NAIVE BAYES DAN SUPPORT VECTOR MACHINE UNTUK ANALISA SENTIMEN REVIEW FILM

2018 ◽  
Vol 14 (2) ◽  
pp. 175
Author(s):  
Elly Indrayuni
Keyword(s):  
Support Vector Machine ◽  
Support Vector Machines ◽  
Cross Validation ◽  
Opinion Mining ◽  
Naive Bayes ◽  
Confusion Matrix ◽  
Naïve Bayes ◽  
Support Vector ◽  
Vector Machines ◽  
Fold Cross Validation

Film merupakan subjek yang diminati oleh sejumlah besar orang diantara komunitas jaringan sosial yang memiliki perbedaan signifikan dalam pendapat atau sentimen mereka. Analisa sentimen atau opinion mining merupakan salah satu solusi mengatasi masalah untuk mengelompokan opini atau review menjadi opini positif atau negatif secara otomatis. Teknik yang digunakan dalam penelitian ini adalah Naive Bayes dan Support Vector Machines (SVM). Naive Bayes memiliki kelebihan yaitu sederhana, cepat dan memiliki akurasi yang tinggi. Sedangkan SVM  mampu mengidentifikasi hyperplane terpisah yang memaksimalkan margin antara dua kelas yang berbeda. Hasil klasifikasi sentimen pada penelitian ini terdiri dari dua label class, yaitu positif dan negatif. Nilai akurasi yang dihasilkan akan menjadi tolak  ukur untuk mencari model pengujian terbaik untuk kasus klasifikasi sentimen. Evaluasi dilakukan menggunakan 10 fold cross validation. Pengukuran akurasi diukur dengan confusion matrix dan kurva ROC. Hasil penelitian menunjukkan nilai akurasi untuk algoritma Naive Bayes sebesar 84.50%. Sedangkan nilai akurasi algoritma Support Vector Machine (SVM) lebih besar dari Naive Bayes yaitu sebesar 90.00%.

Sign in / Sign up

Export Citation Format

Share Document