Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Ardavan Saeedi is active.

Publication


Featured researches published by Ardavan Saeedi.


PLOS ONE | 2012

The Prognostic Value of BRAF Mutation in Colorectal Cancer and Melanoma: A Systematic Review and Meta-Analysis

Gholamreza Safaee Ardekani; Seyed Mehdi Jafarnejad; Larry Tan; Ardavan Saeedi; Gang Li

Background Mutation of BRAF is a predominant event in cancers with poor prognosis such as melanoma and colorectal cancer. BRAF mutation leads to a constitutive activation of mitogen activated protein kinase pathway which is essential for cell proliferation and tumor progression. Despite tremendous efforts made to target BRAF for cancer treatment, the correlation between BRAF mutation and patient survival is still a matter of controversy. Methods/Principal Findings Clinical studies on the correlation between BRAF mutation and patient survival were retrieved from MEDLINE and EMBASE databases between June 2002 and December 2011. One hundred twenty relevant full text studies were categorized based on study design and cancer type. Publication bias was evaluated for each category and pooled hazard ratio (HR) with 95% confidence interval (CI) was calculated using random or fixed effect meta-analysis based on the percentage of heterogeneity. Twenty six studies on colorectal cancer (11,773 patients) and four studies on melanoma (674 patients) were included in our final meta-analysis. The average prevalence of BRAF mutation was 9.6% in colorectal cancer, and 47.8% in melanoma reports. We found that BRAF mutation increases the risk of mortality in colorectal cancer patients for more than two times; HR = 2.25 (95% CI, 1.82–2.83). In addition, we revealed that BRAF mutation also increases the risk of mortality in melanoma patients by 1.7 times (95% CI, 1.37–2.12). Conclusions We revealed that BRAF mutation is an absolute risk factor for patient survival in colorectal cancer and melanoma.


meeting of the association for computational linguistics | 2016

Nonparametric Spherical Topic Modeling with Word Embeddings.

Kayhan N. Batmanghelich; Ardavan Saeedi; Karthik Narasimhan; Samuel J. Gershman

Traditional topic models do not account for semantic regularities in language. Recent distributional representations of words exhibit semantic consistency over directional metrics such as cosine similarity. However, neither categorical nor Gaussian observational distributions used in existing topic models are appropriate to leverage such correlations. In this paper, we propose to use the von Mises-Fisher distribution to model the density of words over a unit sphere. Such a representation is well-suited for directional data. We use a Hierarchical Dirichlet Process for our base topic model and propose an efficient inference algorithm based on Stochastic Variational Inference. This model enables us to naturally exploit the semantic structures of word embeddings while flexibly discovering the number of topics. Experiments demonstrate that our method outperforms competitive approaches in terms of topic coherence on two different text corpora while offering efficient inference.


MCV/BAMBI@MICCAI | 2016

Inferring Disease Status by Non-parametric Probabilistic Embedding

Nematollah Batmanghelich; Ardavan Saeedi; Raúl San José Estépar; Michael H. Cho; William M. Wells

Computing similarity between all pairs of patients in a dataset enables us to group the subjects into disease subtypes and infer their disease status. However, robust and efficient computation of pairwise similarity is a challenging task for large-scale medical image datasets. We specifically target diseases where multiple subtypes of pathology present simultaneously, rendering the definition of the similarity a difficult task. To define pairwise patient similarity, we characterize each subject by a probability distribution that generates its local image descriptors. We adopt a notion of affinity between probability distributions which lends itself to similarity between subjects. Instead of approximating the distributions by a parametric family, we propose to compute the affinity measure indirectly using an approximate nearest neighbor estimator. Computing pairwise similarities enables us to embed the entire patient population into a lower dimensional manifold, mapping each subject from high-dimensional image space to an informative low-dimensional representation. We validate our method on a large-scale lung CT scan study and demonstrate the state-of-the-art prediction on an important physiologic measure of airflow (the forced expiratory volume in one second, FEV1) in addition to a 5-category clinical rating (so-called GOLD score).


neural information processing systems | 2016

Hierarchical Deep Reinforcement Learning: Integrating Temporal Abstraction and Intrinsic Motivation

Tejas D. Kulkarni; Karthik Narasimhan; Ardavan Saeedi; Joshua B. Tenenbaum


arXiv: Machine Learning | 2016

Deep Successor Reinforcement Learning.

Tejas D. Kulkarni; Ardavan Saeedi; Simanta Gautam; Samuel J. Gershman


neural information processing systems | 2011

Priors over Recurrent Continuous Time Processes

Ardavan Saeedi; Alexandre Bouchard-Côté


Journal of Machine Learning Research | 2017

Variational Particle Approximations

Ardavan Saeedi; Tejas D. Kulkarni; Vikash K. Mansinghka; Samuel J. Gershman


international conference on machine learning | 2015

JUMP-Means: Small-Variance Asymptotics for Markov Jump Processes

Jonathan H. Huggins; Karthik Narasimhan; Ardavan Saeedi; Vikash K. Mansinghka


international conference on machine learning | 2016

The segmented iHMM: a simple, efficient hierarchical infinite HMM

Ardavan Saeedi; Matthew D. Hoffman; Matthew J. Johnson; Ryan P. Adams


international conference on artificial intelligence and statistics | 2018

Multimodal Prediction and Personalization of Photo Edits with Deep Generative Models

Ardavan Saeedi; Matthew D. Hoffman; Stephen J. DiVerdi; Asma Ghandeharioun; Matthew J. Johnson; Ryan P. Adams

Collaboration


Dive into the Ardavan Saeedi's collaboration.

Top Co-Authors

Avatar

Karthik Narasimhan

Massachusetts Institute of Technology

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Tejas D. Kulkarni

Massachusetts Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Vikash K. Mansinghka

Massachusetts Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Jonathan H. Huggins

Massachusetts Institute of Technology

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge