Eran Kaufman
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Eran Kaufman has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Lee-Ad Gottlieb
Ariel University
6 shared publications - Aryeh Kontorovich
Department of Computer Science Ben-Gurion University of the Negev Beer Sheva Israel
5 shared publications - Gabriel Nivasch
Ariel University Ariel Israel
3 shared publications Ahmed El Hilali Alaoui
Euromed University of Fes, UEMF, Morocco
2 shared publications- Avivit Levy
Department of Software Engineering, Shenkar College, Ramat-Gan, Israel
2 shared publications - Kaloma Usman Majikumna
School of Digital Engineering and Artificial Intelligence, Euromed University of Fes, Fes-Meknes 30030, Morocco
2 shared publications
Latest Publications
- Open Access
- 12 May 2026
- Published by Elsevier in Neurocomputing
- Vol. 694
Near misses analysis (NMA): A new explainable AI approach for model understanding, comparison, debugging and adversarial attack detection
- 12 May 2026
- Published by Elsevier in Neurocomputing
- Vol. 694
Open AccessNear misses analysis (NMA): A new explainable AI approach for model understanding, comparison, debugging and adversarial attack detection
- Open Access
Scaffolding Creativity: How Divergent and Convergent LLM Personas Shape Human Machine Creative Problem-Solving
Large language models (LLMs) are increasingly shaping creative work and problem-solving; however, prior research suggests that they may diminish unassisted creativity. To address this tension, a coach-like LLM environment was developed that embodies divergent and convergent thinking personas as two complementary processes. Effectiveness and user behavior were assessed through a controlled experiment in which participants interacted with either persona, while a control group engaged with a standard LLM providing direct answers. Notably, users' perceptions of which persona best supported their creativity often diverged from objective performance measures. Trait-based analyses revealed that individual differences predict when people utilize divergent versus convergent personas, suggesting opportunities for adaptive sequencing. Furthermore, interaction patterns reflected the design thinking model, demonstrating how persona-guided support shapes creative problem-solving. Our findings provide design principles for creativity support systems that strike a balance between exploration and convergence through persona-based guidance and personalization. These insights advance human-AI collaboration tools that scaffold rather than overshadow human creativity.
Open AccessScaffolding Creativity: How Divergent and Convergent LLM Personas Shape Human Machine Creative Problem-Solving
Large language models (LLMs) are increasingly shaping creative work and problem-solving; however, prior research suggests that they may diminish unassisted creativity. To address this tension, a coach-like LLM environment was developed that embodies divergent and convergent thinking personas as two complementary processes. Effectiveness and user behavior were assessed through a controlled experiment in which participants interacted with either persona, while a control group engaged with a standard LLM providing direct answers. Notably, users' perceptions of which persona best supported their creativity often diverged from objective performance measures. Trait-based analyses revealed that individual differences predict when people utilize divergent versus convergent personas, suggesting opportunities for adaptive sequencing. Furthermore, interaction patterns reflected the design thinking model, demonstrating how persona-guided support shapes creative problem-solving. Our findings provide design principles for creativity support systems that strike a balance between exploration and convergence through persona-based guidance and personalization. These insights advance human-AI collaboration tools that scaffold rather than overshadow human creativity.
- Open Access
- 1 September 2025
- Published by Elsevier in Data in Brief
- Vol. 62, 112026
Comprehensive dataset for olive tree varieties responses to different level of drought stress
- 1 September 2025
- Published by Elsevier in Data in Brief
- Vol. 62, 112026
Open AccessComprehensive dataset for olive tree varieties responses to different level of drought stress
- Open Access
Explainable AI Approach using Near Misses Analysis
This paper introduces a novel XAI approach based on near-misses analysis (NMA). This approach reveals a hierarchy of logical 'concepts' inferred from the latent decision-making process of a Neural Network (NN) without delving into its explicit structure. We examined our proposed XAI approach on different network architectures that vary in size and shape (e.g., ResNet, VGG, EfficientNet, MobileNet) on several datasets (ImageNet and CIFAR100). The results demonstrate its usability to reflect NNs latent process of concepts generation. We generated a new metric for explainability. Moreover, our experiments suggest that efficient architectures, which achieve a similar accuracy level with much less neurons may still pay the price of explainability and robustness in terms of concepts generation. We, thus, pave a promising new path for XAI research to follow.
Open AccessExplainable AI Approach using Near Misses Analysis
This paper introduces a novel XAI approach based on near-misses analysis (NMA). This approach reveals a hierarchy of logical 'concepts' inferred from the latent decision-making process of a Neural Network (NN) without delving into its explicit structure. We examined our proposed XAI approach on different network architectures that vary in size and shape (e.g., ResNet, VGG, EfficientNet, MobileNet) on several datasets (ImageNet and CIFAR100). The results demonstrate its usability to reflect NNs latent process of concepts generation. We generated a new metric for explainability. Moreover, our experiments suggest that efficient architectures, which achieve a similar accuracy level with much less neurons may still pay the price of explainability and robustness in terms of concepts generation. We, thus, pave a promising new path for XAI research to follow.
- Open Access
- 22 November 2024
- Published by Elsevier in Desalination and Water Treatment
- Vol. 321
A hybrid machine learning approach for imbalanced irrigation water quality classification
- 22 November 2024
- Published by Elsevier in Desalination and Water Treatment
- Vol. 321
Open AccessA hybrid machine learning approach for imbalanced irrigation water quality classification
- Open Access
- 5 September 2024
- Published by Springer Nature in Machine Learning
- Vol. 113 (10) , 7807-7840
Nested barycentric coordinate system as an explicit feature map for polyhedra approximation and learning tasks
We introduce a new embedding technique based on a nested barycentric coordinate system. We show that our embedding can be used to transform the problems of polyhedron approximation, piecewise linear classification and convex regression into one of finding a linear classifier or regressor in a higher dimensional (but nevertheless quite sparse) representation. Our embedding maps a piecewise linear function into an everywhere-linear function, and allows us to invoke well-known algorithms for the latter problem to solve the former. We explain the applications of our embedding to the problems of approximating separating polyhedra—in fact, it can approximate any convex body and unions of convex bodies—as well as to classification by separating polyhedra, and to piecewise linear regression.
- 5 September 2024
- Published by Springer Nature in Machine Learning
- Vol. 113 (10) , 7807-7840
Open AccessNested barycentric coordinate system as an explicit feature map for polyhedra approximation and learning tasks
We introduce a new embedding technique based on a nested barycentric coordinate system. We show that our embedding can be used to transform the problems of polyhedron approximation, piecewise linear classification and convex regression into one of finding a linear classifier or regressor in a higher dimensional (but nevertheless quite sparse) representation. Our embedding maps a piecewise linear function into an everywhere-linear function, and allows us to invoke well-known algorithms for the latter problem to solve the former. We explain the applications of our embedding to the problems of approximating separating polyhedra—in fact, it can approximate any convex body and unions of convex bodies—as well as to classification by separating polyhedra, and to piecewise linear regression.
- Open Access
Using Deepfake Technologies for Word Emphasis Detection
In this work, we consider the task of automated emphasis detection for spoken language. This problem is challenging in that emphasis is affected by the particularities of speech of the subject, for example the subject accent, dialect or voice. To address this task, we propose to utilize deep fake technology to produce an emphasis devoid speech for this speaker. This requires extracting the text of the spoken voice, and then using a voice sample from the same speaker to produce emphasis devoid speech for this task. By comparing the generated speech with the spoken voice, we are able to isolate patterns of emphasis which are relatively easy to detect.
Open AccessUsing Deepfake Technologies for Word Emphasis Detection
In this work, we consider the task of automated emphasis detection for spoken language. This problem is challenging in that emphasis is affected by the particularities of speech of the subject, for example the subject accent, dialect or voice. To address this task, we propose to utilize deep fake technology to produce an emphasis devoid speech for this speaker. This requires extracting the text of the spoken voice, and then using a voice sample from the same speaker to produce emphasis devoid speech for this task. By comparing the generated speech with the spoken voice, we are able to isolate patterns of emphasis which are relatively easy to detect.
- 13 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 68 (3) , 1976-1984
Learning Convex Polyhedra With Margin
We present an improved algorithm for quasi-properly learning convex polyhedra in the realizable PAC setting from data with a margin. Our learning algorithm constructs a consistent polyhedron as an intersection of about $t \log t$ halfspaces with constant-size margins in time polynomial in $t$ (where $t$ is the number of halfspaces forming an optimal polyhedron). We also identify distinct generalizations of the notion of margin from hyperplanes to polyhedra and investigate how they relate geometrically; this result may have ramifications beyond the learning setting.
- 13 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 68 (3) , 1976-1984
Learning Convex Polyhedra With Margin
We present an improved algorithm for quasi-properly learning convex polyhedra in the realizable PAC setting from data with a margin. Our learning algorithm constructs a consistent polyhedron as an intersection of about $t \log t$ halfspaces with constant-size margins in time polynomial in $t$ (where $t$ is the number of halfspaces forming an optimal polyhedron). We also identify distinct generalizations of the notion of margin from hyperplanes to polyhedra and investigate how they relate geometrically; this result may have ramifications beyond the learning setting.
- Open Access
Learning convex polyhedra with margin
We present an improved algorithm for {\em quasi-properly} learning convex polyhedra in the realizable PAC setting from data with a margin. Our learning algorithm constructs a consistent polyhedron as an intersection of about $t \log t$ halfspaces with constant-size margins in time polynomial in $t$ (where $t$ is the number of halfspaces forming an optimal polyhedron). We also identify distinct generalizations of the notion of margin from hyperplanes to polyhedra and investigate how they relate geometrically; this result may have ramifications beyond the learning setting.Open AccessLearning convex polyhedra with margin
We present an improved algorithm for {\em quasi-properly} learning convex polyhedra in the realizable PAC setting from data with a margin. Our learning algorithm constructs a consistent polyhedron as an intersection of about $t \log t$ halfspaces with constant-size margins in time polynomial in $t$ (where $t$ is the number of halfspaces forming an optimal polyhedron). We also identify distinct generalizations of the notion of margin from hyperplanes to polyhedra and investigate how they relate geometrically; this result may have ramifications beyond the learning setting. - 8 October 2021
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 89 (12) , 1215-1235
Apportioned margin approach for cost sensitive large margin classifiers
- 8 October 2021
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 89 (12) , 1215-1235
Apportioned margin approach for cost sensitive large margin classifiers