Jafar Tahmoresnezhad
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jafar Tahmoresnezhad has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Adolfo Iulianelli
Institute of Membrane Technology of the National Research Council (CNR-ITM), Via P. Bucci 17C, 87036 Rende, Italy
1 shared publication - Ali Hamzeh
Shiraz University
1 shared publication - Kamran Ghasemzadeh
School of Engineering, University of Edinburgh, Edinburgh EH9 3JW, UK
1 shared publication - Mahsa Jafar Harasy
Computer Engineering Department, Urmia University, Urmia 5716617165, Iran
1 shared publication Mehri Mardani
1 shared publicationMozhdeh Zandifar
Faculty of IT & Computer Engineering, Urmia University of Technology, Urmia, Iran
1 shared publication
Latest Publications
- Open Access
Machine Learning–Driven Surrogate Modeling and Operating-Point Selection for a Microfluidic Diffusion-Membrane Platform for Transdermal Drug Delivery
Microfluidic diffusion systems provide a powerful in vitro platform for evaluating transdermal drug delivery (TDD), yet their predictive capability is often constrained by limited experimental datasets and nonlinear transport behavior across membrane—device configurations. This study integrates machine learning (ML) with microfluidic experimentation to develop accurate and generalizable surrogate models for cumulative drug permeation under different hydrodynamic and membrane conditions. This work presents an ML-augmented microfluidic TDD framework for predicting cumulative drug permeation from small experimental datasets. Caffeine cream permeation was examined across twelve device—membrane configurations (sMDC, mMDC, and LiveBox2 paired with PET, CA, rat skin, and alginate) at three perfusion flow rates. For each configuration, SVR, MLP, RFR, GBR, XGB, and KNN models were trained and cross-validated using only 33 experimental measurements. SVR showed the strongest overall performance among the evaluated models, achieving test R2 values typically above 0.97 and RMSE values of 2, accurately capturing the nonlinear time-flow-cumulative mass behavior of TDD profiles. A domain-bounded Gaussian-noise augmentation strategy was used to increase local sampling density while keeping augmented values within the experimentally observed time and cumulative-mass ranges. Polynomial equations were obtained from the predictions of SVR to capture the interaction between inputs and outputs. The trained SVR surrogates were then used for automated steady-state identification and surrogate-based operating-point selection, revealing the dependence of the selected flow rate on membrane permeability and device geometry. Alginate consistently delivered the highest steady-state cumulative mass across all systems (up to ~448 µg/cm2), establishing it as the most efficient TDD membrane among those evaluated. Finally, compact third-degree polynomial equations were derived from the SVR predictions, enabling explicit analytical prediction and rapid design-space exploration. Overall, these ML-derived models and analytical equations provide a fast, low-cost tool for predictive design, enabling rapid microfluidic system evaluation and operating-condition selection, and significantly accelerating the development and screening of next-generation TDD platforms.
Open AccessMachine Learning–Driven Surrogate Modeling and Operating-Point Selection for a Microfluidic Diffusion-Membrane Platform for Transdermal Drug Delivery
Microfluidic diffusion systems provide a powerful in vitro platform for evaluating transdermal drug delivery (TDD), yet their predictive capability is often constrained by limited experimental datasets and nonlinear transport behavior across membrane—device configurations. This study integrates machine learning (ML) with microfluidic experimentation to develop accurate and generalizable surrogate models for cumulative drug permeation under different hydrodynamic and membrane conditions. This work presents an ML-augmented microfluidic TDD framework for predicting cumulative drug permeation from small experimental datasets. Caffeine cream permeation was examined across twelve device—membrane configurations (sMDC, mMDC, and LiveBox2 paired with PET, CA, rat skin, and alginate) at three perfusion flow rates. For each configuration, SVR, MLP, RFR, GBR, XGB, and KNN models were trained and cross-validated using only 33 experimental measurements. SVR showed the strongest overall performance among the evaluated models, achieving test R2 values typically above 0.97 and RMSE values of 2, accurately capturing the nonlinear time-flow-cumulative mass behavior of TDD profiles. A domain-bounded Gaussian-noise augmentation strategy was used to increase local sampling density while keeping augmented values within the experimentally observed time and cumulative-mass ranges. Polynomial equations were obtained from the predictions of SVR to capture the interaction between inputs and outputs. The trained SVR surrogates were then used for automated steady-state identification and surrogate-based operating-point selection, revealing the dependence of the selected flow rate on membrane permeability and device geometry. Alginate consistently delivered the highest steady-state cumulative mass across all systems (up to ~448 µg/cm2), establishing it as the most efficient TDD membrane among those evaluated. Finally, compact third-degree polynomial equations were derived from the SVR predictions, enabling explicit analytical prediction and rapid design-space exploration. Overall, these ML-derived models and analytical equations provide a fast, low-cost tool for predictive design, enabling rapid microfluidic system evaluation and operating-condition selection, and significantly accelerating the development and screening of next-generation TDD platforms.
- 7 July 2021
- Published by SCI AND TECH UNIVERSAL INC in Scientia Iranica
- Vol. 28 (6) , 3273-3292
Domain Adaptation via Bregman divergence minimization
In recent years, Fisher linear discriminant analysis (FLDA) based classifi- cation is one of the most successful approaches and has been shown effective performance in different classification tasks. However, when the learning data (source domain) have a different distribution against the testing data (tar- get domain), the FLDA-based models may not be optimal, and the perfor- mance will be degraded, dramatically. To face this problem, in this paper, we propose an optimal domain adaptation via Bregman divergence minimization (DAB) approach, in which the discriminative features of source and target do- mains are simultaneously learned via domain invariant representation. DAB is designed based on the constraints of FLDA, with the objective to adapt the coupled marginal and conditional distribution mismatches with Breg- man divergence minimization. Thus, the resulting representation can have well functionality like FLDA and simultaneously have better discrimination ability. Moreover, our proposed approach can be easily kernelized to deal with nonlinear tasks. Extensive experiments on various benchmark datasets show that our DAB can effectively deal with the cross domain divergence and outperforms several state-of-the-art domain adaptation approaches on cross- distribution domains.
- 7 July 2021
- Published by SCI AND TECH UNIVERSAL INC in Scientia Iranica
- Vol. 28 (6) , 3273-3292
Domain Adaptation via Bregman divergence minimization
In recent years, Fisher linear discriminant analysis (FLDA) based classifi- cation is one of the most successful approaches and has been shown effective performance in different classification tasks. However, when the learning data (source domain) have a different distribution against the testing data (tar- get domain), the FLDA-based models may not be optimal, and the perfor- mance will be degraded, dramatically. To face this problem, in this paper, we propose an optimal domain adaptation via Bregman divergence minimization (DAB) approach, in which the discriminative features of source and target do- mains are simultaneously learned via domain invariant representation. DAB is designed based on the constraints of FLDA, with the objective to adapt the coupled marginal and conditional distribution mismatches with Breg- man divergence minimization. Thus, the resulting representation can have well functionality like FLDA and simultaneously have better discrimination ability. Moreover, our proposed approach can be easily kernelized to deal with nonlinear tasks. Extensive experiments on various benchmark datasets show that our DAB can effectively deal with the cross domain divergence and outperforms several state-of-the-art domain adaptation approaches on cross- distribution domains.
- 8 December 2018
- Published by SCI AND TECH UNIVERSAL INC in Scientia Iranica
Joint Distribution Adaptation via Feature and Model Matching
It is usually supposed that the training (source domain) and test (target domain) data follow a similar distribution and feature space in most pattern recognition tasks. However, in many real-world applications, particularly in visual recognition, this hypothesis has been frequently violated. This problem is known as domain shift problem. Domain adaptation and transfer learning are promising techniques to learn an effective and robust classifier to tackle shift problem. In this paper, we propose a novel scheme for domain adaptation, entitled as Joint Distribution Adaptation via Feature and Model Matching (JDAFMM), in which feature transform and model matching are jointly optimized. Due to joint optimization, we can have a robust model with feasible feature transformation and model parameter adaptation. By introducing regularization operated between the marginal and conditional distributions’ shifts across domains, we can successfully adapt data drift as much as possible along with empirical risk minimization and rate of consistency maximization between manifold and prediction function. We conduct extensive experiments to evaluate the performance of the proposed model against those of other machine learning and domain adaptation methods in three types of visual benchmark datasets. Our experiments illustrate that our JDAFMM significantly outperforms other baseline and state-of-the-art methods.
- 8 December 2018
- Published by SCI AND TECH UNIVERSAL INC in Scientia Iranica
Joint Distribution Adaptation via Feature and Model Matching
It is usually supposed that the training (source domain) and test (target domain) data follow a similar distribution and feature space in most pattern recognition tasks. However, in many real-world applications, particularly in visual recognition, this hypothesis has been frequently violated. This problem is known as domain shift problem. Domain adaptation and transfer learning are promising techniques to learn an effective and robust classifier to tackle shift problem. In this paper, we propose a novel scheme for domain adaptation, entitled as Joint Distribution Adaptation via Feature and Model Matching (JDAFMM), in which feature transform and model matching are jointly optimized. Due to joint optimization, we can have a robust model with feasible feature transformation and model parameter adaptation. By introducing regularization operated between the marginal and conditional distributions’ shifts across domains, we can successfully adapt data drift as much as possible along with empirical risk minimization and rate of consistency maximization between manifold and prediction function. We conduct extensive experiments to evaluate the performance of the proposed model against those of other machine learning and domain adaptation methods in three types of visual benchmark datasets. Our experiments illustrate that our JDAFMM significantly outperforms other baseline and state-of-the-art methods.
- 1 December 2018
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 9 (12) , 2093-2104
Domain invariant feature extraction against evasion attack
- 1 December 2018
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 9 (12) , 2093-2104
Domain invariant feature extraction against evasion attack