Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Ionut E. Iacob has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Manuscripts Character Recognition Using Machine Learning and Deep Learning

    by Mohammad Anwarul Islam, Ionut E. Iacob

    The automatic character recognition of historic documents gained more attention from scholars recently, due to the big improvements in computer vision, image processing, and digitization. While Neural Networks, the current state-of-the-art models used for image recognition, are very performant, they typically suffer from using large amounts of training data. In our study we manually built our own relatively small dataset of 404 characters by cropping letter images from a popular historic manuscript, the Electronic Beowulf. To compensate for the small dataset we use ImageDataGenerator, a Python library was used to augment our Beowulf manuscript’s dataset. The training dataset was augmented once, twice, and thrice, which we call resampling 1, resampling 2, and resampling 3, respectively. To classify the manuscript’s character images efficiently, we developed a customized Convolutional Neural Network (CNN) model. We conducted a comparative analysis of the results achieved by our proposed model with other machine learning (ML) models such as support vector machine (SVM), K-nearest neighbor (KNN), decision tree (DT), random forest (RF), and XGBoost. We used pretrained models such as VGG16, MobileNet, and ResNet50 to extract features from character images. We then trained and tested the above ML models and recorded the results. Moreover, we validated our proposed CNN model against the well-established MNIST dataset. Our proposed CNN model achieves very good recognition accuracies of 88.67%, 90.91%, and 98.86% in the cases of resampling 1, resampling 2, and resampling 3, respectively, for the Beowulf manuscript’s data. Additionally, our CNN model achieves the benchmark recognition accuracy of 99.03% for the MNIST dataset.


  • Open Access

    DCSVM: Fast Multi-class Classification using Support Vector Machines

    by Duleep Rathgamage Don, Ionut E. Iacob

    We present DCSVM, an efficient algorithm for multi-class classification using Support Vector Machines. DCSVM is a divide and conquer algorithm which relies on data sparsity in high dimensional space and performs a smart partitioning of the whole training data set into disjoint subsets that are easily separable. A single prediction performed between two partitions eliminates at once one or more classes in one partition, leaving only a reduced number of candidate classes for subsequent steps. The algorithm continues recursively, reducing the number of classes at each step, until a final binary decision is made between the last two classes left in the competition. In the best case scenario, our algorithm makes a final decision between $k$ classes in $O(\log k)$ decision steps and in the worst case scenario DCSVM makes a final decision in $k-1$ steps, which is not worse than the existent techniques.

  • A Concise Proof of the Triangle Inequality for the Jaccard Distance

    by Artur Grygorian, Ionut E. Iacob

    (2018). A Concise Proof of the Triangle Inequality for the Jaccard Distance. The College Mathematics Journal: Vol. 49, No. 5, pp. 363-365.


  • Grouping of Variables to Facilitate SDL Methods in Multivariate Data Sets

    by Anna Oganian, Ionut Iacob, Goran Lesaja

    Data sets that are subject to Statistical Disclosure Limitation (SDL) often have many variables of different types that need to be altered for disclosure limitation. To produce a good quality public data set, the data protector needs to account for the relationships between the variables. Hence, ideally SDL methods should not be univariate, that is, treating each variable independently of others, but multivariate, handling many variables at the same time. However, if a data set has many variables, as most government survey data do, the task of developing and implementing a multivariate approach for SDL becomes difficult. In this paper we propose a pre-masking data processing procedure which consists of clustering the variables of high dimensional data sets, so that different groups of variables can be masked independently, thus reducing the complexity of SDL. We consider different hierarchical clustering methods, including our version of hierarchical clustering algorithm, that we call K-Link, and outline how the data protector can define an appropriate number of clusters for these methods. We implemented and applied these methods to two genuine multivariate data sets. The results of the experiments show that K-Link has a potential to solve this problem efficiently. The success of the method, however, depends on the correlation structure of the data. For the data sets where most of the variables are correlated, clustering of variables and subsequent independent application of SDL methods to different clusters may lead to attenuated correlation in the masked data, even for efficient clustering methods. Thereby, the proposed approach is a trade-off between the computational complexity of multivariate SDL methods and data utility loss due to independent treatment of different clusters by SDL methods. Keywords Statistical Disclosure Limitation (SDL) Hierarchical clustering Dimensionality reduction


  • Open Access

    Finding, Stabilizing, and Verifying Cycles of Nonlinear Dynamical Systems

    by D. Dmitrishin, I. E. Iacob, I. Skrinnik, A. Stokolos

    We present a new solution for fundamental problems in nonlinear dynamical systems: finding, verifying, and stabilizing cycles. The solution we propose consists of a new control method based on mixing previous states of the system (or the functions of these states). This approach allows us to locally stabilize and to find a priori unknown cycles of a given length. Our method generalizes and improves on the existing one dimensional space solutions to multi-dimensional space while using the geometric complex functions theory rather than a linear algebra approach. Several numerical examples are considered. All statements and formulas are given in final form. The formulas derivation and reasoning may be found in the cited references. The article focuses on practical applications of methods and algorithms.