Loading...
Search for: domain-adaptation
0.01 seconds

    Images Classification with Limited Number of Labeled Data Using Domain Adaptation

    , M.Sc. Thesis Sharif University of Technology Taheri, Sahar (Author) ; Jamzad, Mansour (Supervisor)
    Abstract
    The traditional machine learning methods assume that the training data and the test data are drawn from the same distribution (or drawn from the same domain). In practice, in many computer vision applications, this assumption may not hold. Unfortunately, the performance of these methods degrades on dataset drawn from a different domain. Domain adaptation attempts to minimize this degradation caused by distribution mismatch between the training and test data. Domain adaptation tries to adapt a model trainded from one domain to another domain. We focus on supervised domain adaptation method in which limited labeled data is available from the target domain. We propose a new domain adaptation... 

    Deep Learning Approach for Domain Adaptation

    , M.Sc. Thesis Sharif University of Technology Aminzadeh, Majid (Author) ; Soleymani Baghshah, Mahdieh (Supervisor)
    Abstract
    A predefined assumption in many learning algorithms is that the training and test data must be in thesame feature space and have the same distribution.However, this assumption may not hold in all of these algorithms and in the real world there might be difference between the source and the targer domian, whether in the feature space or the distribution. Moreover, there might be a few number of labled data of the target domain which causes difficulty in learning an accurate classifier. In such cases, transferring knowledge can be useful if can be done successfully and transfer learning was introduced for this purpose. Domain Adaptation is one of the transfer leaning problems that assume some... 

    Domain Adaptation Using Source Classifier for Object Detection

    , Ph.D. Dissertation Sharif University of Technology Mozafari, Azadeh Sadat (Author) ; Jamzad, Mansour (Supervisor)
    Abstract
    Detection degradation caused by distribution discrepancy between the training and testing domains is a common problem in object detection systems. The difference between training and testing domains’ distribution mainly happenes because of the different ways of collecting and gathering data. For instance, datasets which have images with different illumination, view point, resolution, background and are obtained by different acquisition systems, have variance in distribution. The solution toward improving the detection rate of the classifier trained on training (source) domain when it is applied on testing (target) domain is to use Domain Adaptation (DA) techniques. One of important branches... 

    Joint predictive model and representation learning for visual domain adaptation

    , Article Engineering Applications of Artificial Intelligence ; Volume 58 , 2017 , Pages 157-170 ; 09521976 (ISSN) Gheisari, M ; Soleymani Baghshah, M ; Sharif University of Technology
    Elsevier Ltd  2017
    Abstract
    Traditional learning algorithms cannot perform well in scenarios where training data (source domain data) that are used to learn the model have a different distribution with test data (target domain data). The domain adaptation that intends to compensate this problem is an important capability for an intelligent agent. This paper presents a domain adaptation method which learns to adapt the data distribution of the source domain to that of the target domain where no labeled data of the target domain is available (and just unlabeled data are available for the target domain). Our method jointly learns a low dimensional representation space and an adaptive classifier. In fact, we try to find a... 

    Adaptation for Evolving Domains

    , M.Sc. Thesis Sharif University of Technology Bitarafan, Adeleh (Author) ; Soleymani Baghshah, Mahdieh (Supervisor)
    Abstract
    Until now many domain adaptation methods have been proposed. A major limitation of almost all of these methods is their assumption that all test data belong to a single stationary target distribution and a large amount of unlabeled data is available for modeling this target distribution. In fact, in many real world applications, such as classifying scene image with gradually changing lighting and spam email identification, data arrives sequentially and the data distribution is continuously evolving. In this thesis, we tackle the problem of adaptation to a continuously evolving target domain that has been recently introduced and propose the Evolving Domain Adaptation (EDA) method to classify... 

    Deep Probabilistic Models for Continual Learning

    , M.Sc. Thesis Sharif University of Technology Yazdanifar, Mohammad Reza (Author) ; Soleymani Baghshah, Mahdieh (Supervisor)
    Abstract
    Recent advances in deep neural networks have shown significant potential; however, they still face challenges when it comes to non-stationary environments. Continual learning is related to deep neural networks with limited capacity that should perform well on a sequence of tasks. On the other hand, studies have shown that neural networks are sensitive to covariate shifts. But in many cases, the distribution of data varies with time. Domain Adaptation tries to improve the performance of a model on an unlabeled target domain by using the knowledge of other related labeled data coming from a different distribution. Many studies on domain adaptation have optimistic assumptions that are not... 

    Incremental evolving domain adaptation

    , Article IEEE Transactions on Knowledge and Data Engineering ; Volume 28, Issue 8 , 2016 , Pages 2128-2141 ; 10414347 (ISSN) Bitarafan, A ; Soleymani Baghshah, M ; Gheisari, M ; Sharif University of Technology
    IEEE Computer Society 
    Abstract
    Almost all of the existing domain adaptation methods assume that all test data belong to a single stationary target distribution. However, in many real world applications, data arrive sequentially and the data distribution is continuously evolving. In this paper, we tackle the problem of adaptation to a continuously evolving target domain that has been recently introduced. We assume that the available data for the source domain are labeled but the examples of the target domain can be unlabeled and arrive sequentially. Moreover, the distribution of the target domain can evolve continuously over time. We propose the Evolving Domain Adaptation (EDA) method that first finds a new feature space... 

    Cluster-based adaptive SVM: a latent subdomains discovery method for domain adaptation problems

    , Article Computer Vision and Image Understanding ; Volume 162 , 2017 , Pages 116-134 ; 10773142 (ISSN) Sadat Mozafari, A ; Jamzad, M ; Sharif University of Technology
    Abstract
    Machine learning algorithms often suffer from good generalization in testing domains especially when the training (source) and test (target) domains do not have similar distributions. To address this problem, several domain adaptation techniques have been proposed to improve the performance of the learning algorithms when they face accuracy degradation caused by the domain shift problem. In this paper, we focus on the non-homogeneous distributed target domains and propose a new latent subdomain discovery model to divide the target domain into subdomains while adapting them. It is expected that applying adaptation on subdomains increase the rate of detection in comparing with the situation... 

    Unsupervised domain adaptation via representation learning and adaptive classifier learning

    , Article Neurocomputing ; Volume 165 , 2015 , Pages 300-311 ; 09252312 (ISSN) Gheisari, M ; Baghshah Soleimani, M ; Sharif University of Technology
    Abstract
    The existing learning methods usually assume that training data and test data follow the same distribution, while this is not always true. Thus, in many cases the performance of these methods on the test data will be severely degraded. In this paper, we study the problem of unsupervised domain adaptation, where no labeled data in the target domain is available. The proposed method first finds a new representation for both the source and the target domain and then learns a prediction function for the classifier by optimizing an objective function which simultaneously tries to minimize the loss function on the source domain while also maximizes the consistency of manifold (which is based on... 

    Unsupervised Domain Adaptation via Representation Learning

    , M.Sc. Thesis Sharif University of Technology Gheisary, Marzieh (Author) ; Soleymani, Mahdieh (Supervisor)
    Abstract
    The existing learning methods usually assume that training and test data follow the same distribution, while this is not always true. Thus, in many cases the performance of these learning methods on the test data will be severely degraded. We often have sufficient labeled training data from a source domain but wish to learn a classifier which performs well on a target domain with a different distribution and no labeled training data. In this thesis, we study the problem of unsupervised domain adaptation, where no labeled data in the target domain is available. We propose a framework which finds a new representation for both the source and the target domain in which the distance between these... 

    Prediction of Customer Churn From Subscription Services in Response to Recommendations: With Emphasis on MCI Data

    , M.Sc. Thesis Sharif University of Technology Shirali, Ali (Author) ; Amini, Arash (Supervisor) ; Kazemi, Reza (Supervisor)
    Abstract
    In competitive markets where a product or service is provided by multiple providers, as the telecom market, keeping active users is expected to be less expensive than attracting new users. In this regard, first of all, churning should be predicted for active users, and secondly, proper recommendations should be provided to prevent churning. In this thesis, by modeling customer churn as a response to the recommendations, we study the churn prediction and prevention problem as a recommender system. This model enables us to select the best offer for each user to prevent it from churning.Modeling customer churn in a recommender system introduces new challenges, including delay in observing... 

    Cross-Domain EEG-Based Emotion Recognition

    , M.Sc. Thesis Sharif University of Technology Shirkarami, Mohsen (Author) ; Mohammadzadeh, Hoda (Supervisor)
    Abstract
    The non-stationary nature of brain activity signals and their many inter-subject differences have created many challenges in the practical applications of emotion recognition based on electroencephalogram (EEG) signals, such as brain-computer interfaces. In such a way, the use of traditional classifiers in classifying these signals leads to a significant decrease in accuracy when applying the classifier to a new subject. Domain Adaptation methods seem to be an effective way to solve this problem by minimizing the difference between the EEG signals of different subjects. But in the basic techniques for domain adaptation, looking at all subjects' data in the same look causes the loss of a part... 

    Semi-supervised parallel shared encoders for speech emotion recognition

    , Article Digital Signal Processing: A Review Journal ; Volume 118 , 2021 ; 10512004 (ISSN) Pourebrahim, Y ; Razzazi, F ; Sameti, H ; Sharif University of Technology
    Elsevier Inc  2021
    Abstract
    Supervised speech emotion recognition requires a large number of labeled samples that limit its use in practice. Due to easy access to unlabeled samples, a new semi-supervised method based on auto-encoders is proposed in this paper for speech emotion recognition. The proposed method performed the classification operation by extracting the information contained in unlabeled samples and combining it with the information in labeled samples. In addition, it employed maximum mean discrepancy cost function to reduce the distribution difference when the labeled and unlabeled samples were gathered from different datasets. Experimental results obtained on different emotional speech datasets... 

    Object detection based on weighted adaptive prediction in lifting scheme transform

    , Article ISM 2006 - 8th IEEE International Symposium on Multimedia, San Diego, CA, 11 December 2006 through 13 December 2006 ; 2006 , Pages 652-656 ; 0769527469 (ISBN); 9780769527468 (ISBN) Amiri, M ; Rabiee, H. R ; Sharif University of Technology
    2006
    Abstract
    This paper presents a new algorithm for detecting user-selected objects in a sequence of images based on a new weighted adaptive lifting scheme transform. In our algorithm, we first select a set of coefficients as object features in the wavelet transform domain and then build an adaptive transform considering the selected features. The goal of the designed adaptive transform is to "vanish" the selected features as much as possible in the transform domain. After applying both non-adaptive and adaptive transforms to a given test image, the corresponding transform domain coefficients are compared for detecting the object of interest. We have verified our claim with experimental results on 1-D...