Loading...
Search for: farajtabar--m
0.004 seconds

    From local similarity to global coding: An application to image classification

    , Article Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Portland, OR ; 2013 , Pages 2794-2801 ; 10636919 (ISSN) Shaban, A ; Rabiee, H. R ; Farajtabar, M ; Ghazvininejad, M ; Sharif University of Technology
    2013
    Abstract
    Bag of words models for feature extraction have demonstrated top-notch performance in image classification. These representations are usually accompanied by a coding method. Recently, methods that code a descriptor giving regard to its nearby bases have proved efficacious. These methods take into account the nonlinear structure of descriptors, since local similarities are a good approximation of global similarities. However, they confine their usage of the global similarities to nearby bases. In this paper, we propose a coding scheme that brings into focus the manifold structure of descriptors, and devise a method to compute the global similarities of descriptors to the bases. Given a local... 

    Online object representation learning and its application to object tracking

    , Article AAAI Spring Symposium - Technical Report ; Volume SS-13-05 , 2013 , Pages 40-45 ; 9781577356028 (ISBN) Shaban, A ; Rabiee, H. R ; Farajtabar, M ; Fadaee, M ; Sharif University of Technology
    2013
    Abstract
    Tracking by detection is the topic of recent research that has received considerable attention in computer vision community. Mainly off-line classification methods have been used, however, they perform weakly in the case of appearance changes. Training theclassifier incrementally and in an online manner solves this problem, but nevertheless, raises drifting due to soft or hard labeling in the online adaptation. In this paper a novel semi-supervised online tracking algorithm based on manifold assumption is proposed. Target object and background patches lie near low-dimensional manifolds. This motivates us to make use of the intrinsic structure of data in classification, and benefit from the... 

    Recurrent poisson factorization for temporal recommendation

    , Article Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 13 August 2017 through 17 August 2017 ; Volume Part F129685 , 2017 , Pages 847-855 ; 9781450348874 (ISBN) Hosseini, S. A ; Alizadeh, K ; Khodadadi, A ; Arabzadeh, A ; Farajtabar, M ; Zha, H ; Rabiee, H. R ; Sharif University of Technology
    Abstract
    Poisson factorization is a probabilistic model of users and items for recommendation systems, where the so-called implicit consumer data is modeled by a factorized Poisson distribution. There are many variants of Poisson factorization methods who show state-of-the-art performance on real-world recommendation tasks. However, most of them do not explicitly take into account the temporal behavior and the recurrent activities of users which is essential to recommend the right item to the right user at the right time. In this paper, we introduce Recurrent Poisson Factorization (RPF) framework that generalizes the classical PF methods by utilizing a Poisson process for modeling the implicit... 

    Recurrent poisson factorization for temporal recommendation

    , Article IEEE Transactions on Knowledge and Data Engineering ; 2018 ; 10414347 (ISSN) Hosseini, S ; Khodadadi, A ; Alizadeh, K ; Arabzadeh, A ; Farajtabar, M ; Zha, H ; Rabiee, H. R. R ; Sharif University of Technology
    IEEE Computer Society  2018
    Abstract
    Poisson Factorization (PF) is the gold standard framework for recommendation systems with implicit feedback whose variants show state-of-the-art performance on real-world recommendation tasks. However, most of the previous work do not explicitly take into account the temporal behavior of users which is essential to recommend the right item to the right user at the right time. In this paper, we introduce a Recurrent Poisson Factorization (RPF) framework that generalizes the classical PF methods by utilizing a Poisson process for modeling the implicit feedback. RPF treats time as a natural constituent of the model, and takes important factors for recommendation into consideration to provide a... 

    Recurrent poisson factorization for temporal recommendation

    , Article IEEE Transactions on Knowledge and Data Engineering ; Volume 32, Issue 1 , 2020 , Pages 121-134 Hosseini, S. A ; Khodadadi, A ; Alizadeh, K ; Arabzadeh, A ; Farajtabar, M ; Zha, H ; Rabiee, H. R ; Sharif University of Technology
    IEEE Computer Society  2020
    Abstract
    Poisson Factorization (PF) is the gold standard framework for recommendation systems with implicit feedback whose variants show state-of-the-art performance on real-world recommendation tasks. However, they do not explicitly take into account the temporal behavior of users which is essential to recommend the right item to the right user at the right time. In this paper, we introduce Recurrent Poisson Factorization (RPF) framework that generalizes the classical PF methods by utilizing a Poisson process for modeling the implicit feedback. RPF treats time as a natural constituent of the model, and takes important factors for recommendation into consideration to provide a rich family of... 

    Correlated cascades: Compete or cooperate

    , Article 31st AAAI Conference on Artificial Intelligence, AAAI 2017, 4 February 2017 through 10 February 2017 ; 2017 , Pages 238-244 Zarezade, A ; Khodadadi, A ; Farajtabar, M ; Rabiee, H. R ; Zha, H ; Amazon; Artificial Intelligence; Baidu; et al.; IBM; Tencent ; Sharif University of Technology
    AAAI press  2017
    Abstract
    In real world social networks, there are multiple cascades which are rarely independent. They usually compete or cooperate with each other. Motivated by the reinforcement theory in sociology we leverage the fact that adoption of a user to any behavior is modeled by the aggregation of behaviors of its neighbors. We use a multidimensional marked Hawkes process to model users product adoption and consequently spread of cascades in social networks. The resulting inference problem is proved to be convex and is solved in parallel by using the barrier method. The advantage of the proposed model is twofold; it models correlated cascades and also learns the latent diffusion network. Experimental...