Majid Mohammadi

Majid Mohammadi

Auto-generated profile, based on publicly available information

Majid Mohammadi

Vrije Universiteit Amsterdam Amsterdam The Netherlands

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2020 in Omega
Verified
Journal Article
Closed access
MMMajid Mohammadi
Majid Mohammadi
JRJafar Rezaei
Jafar Rezaei

16 August 2019 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
AFAmir Ebrahimi Fard
Amir Ebrahimi Fard
MMMajid Mohammadi
Majid Mohammadi
YCYang Chen
Yang Chen
BWBartel Van de Walle
Bartel Van de Walle
Rumor spreading in online social networks can inflict serious damages on individual, organizational, and societal levels. This problem has been addressed via computational approach in recent years. The dominant computational technique for the identification of rumors is the binary classification that uses rumor and non-rumor for the training. In this method, the way of annotating training data points determines how each class is defined for the classifier. Unlike rumor samples that often are annotated similarly, non-rumors get their labels arbitrarily based on annotators' volition. Such an approach leads to unreliable classifiers that cannot distinguish rumor from non-rumor consistently. In this paper, we tackle this problem via a novel classification approach called one-class classification (OCC). In this approach, the classifier is trained with only rumors, which means that we do not need the non-rumor data points at all. For this study, we use two primary Twitter data sets in this field and extract 86 features from each tweet. We then apply seven one-class classifiers from three different paradigms and compare their performance. Our results show that this approach can recognize rumors with a high level of F1-score. This approach may influence the predominant mentality of scholars about computational rumor detection and puts forward a new research path toward dealing with this problem.

30 May 2018 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
MMMajid Mohammadi
Majid Mohammadi
WHWout Hofman
Wout Hofman
YTYao-Hua Tan
Yao-Hua Tan
Comparing ontology matching systems are typically performed by comparing their average performances over multiple datasets. However, this paper examines the alignment systems using statistical inference since averaging is statistically unsafe and inappropriate. The statistical tests for comparison of two or multiple alignment systems are theoretically and empirically reviewed. For comparison of two systems, the Wilcoxon signed-rank and McNemar's mid-p and asymptotic tests are recommended due to their robustness and statistical safety in different circumstances. The Friedman and Quade tests with their corresponding post-hoc procedures are studied for comparison of multiple systems, and their [dis]advantages are discussed. The statistical methods are then applied to benchmark and multifarm tracks from the ontology matching evaluation initiative (OAEI) 2015 and their results are reported and visualized by critical difference diagrams.

20 September 2018 in IEEE Journal of Biomedical and Health Informatics
Verified
Journal Article
Closed access
MMMajid Mohammadi
Majid Mohammadi
AMAmin Mansoori
Amin Mansoori
The identification of copy number variations (CNVs) helps the diagnosis of many diseases. One major hurdle in the path of CNVs discovery is that the boundaries of normal and aberrant regions cannot be distinguished from the raw data since various types of noise contaminate them. To tackle this challenge, the total variation regularization is mostly used in the optimization problems to approximate the noise-free data from corrupted observations. The minimization using such regularization is challenging to deal with since it is non-differentiable. In this paper, we propose a projection neural network to solve the non-smooth problem. The proposed neural network has a simple one-layer structure and is theoretically assured to have the global exponential convergence to the solution of the total variation-regularized problem. The experiments on several real and simulated datasets illustrate the reasonable performance of the proposed neural network and show that its performance is comparable with those of more sophisticated algorithms.

31 March 2019 in ACM Transactions on Management Information Systems
Verified
Journal Article
Open access
PDF file
MMMajid Mohammadi
Majid Mohammadi
WHWout Hofman
Wout Hofman
YTYao-Hua Tan
Yao-Hua Tan
Ontology alignment is a fundamental task to reconcile the heterogeneity among various information systems using distinct information sources. The evolutionary algorithms (EAs) have been already considered as the primary strategy to develop an ontology alignment system. However, such systems have two significant drawbacks: they either need a ground truth that is often unavailable, or they utilize the population-based EAs in a way that they require massive computation and memory. This article presents a new ontology alignment system, called SANOM, which uses the well-known simulated annealing as the principal technique to find the mappings between two given ontologies while no ground truth is available. In contrast to population-based EAs, the simulated annealing need not generate populations, which makes it significantly swift and memory-efficient for the ontology alignment problem. This article models the ontology alignment problem as optimizing the fitness of a state whose optimum is obtained by using the simulated annealing. A complex fitness function is developed that takes advantage of various similarity metrics including string, linguistic, and structural similarities. A randomized warm initialization is specially tailored for the simulated annealing to expedite its convergence. The experiments illustrate that SANOM is competitive with the state-of-the-art and is significantly superior to other EA-based systems.

7 August 2019 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
MMMajid Mohammadi
Majid Mohammadi
The generalized lasso (GLasso) is an extension of the lasso regression in which there is an l₁ penalty term (or regularization) of the linearly transformed coefficient vector. Finding the optimal solution of GLasso is not straightforward since the penalty term is not differentiable. This brief presents a novel one-layer neural network to solve the generalized lasso for a wide range of penalty transformation matrices. The proposed neural network is proven to be stable in the sense of Lyapunov and converges globally to the optimal solution of the GLasso. It is also shown that the proposed neural solution can solve many optimization problems, including sparse and weighted sparse representations, (weighted) total variation denoising, fused lasso signal approximator, and trend filtering. Disparate experiments on the above problems illustrate and confirm the excellent performance of the proposed neural network in comparison to other competing techniques.