Literature Review on Big Data Analytics Methods

Companies and industries are faced with a huge amount of raw data, which have information and knowledge in their hidden layer. Also, the format, size, variety, and velocity of generated data bring complexity for industries to apply them in an efficient and effective way. So, complexity in data analysis and interpretation incline organizations to deploy advanced tools and techniques to overcome the difficulties of managing raw data. Big data analytics is the advanced method that has the capability for managing data. It deploys machine learning techniques and deep learning methods to benefit from gathered data. In this research, the methods of both ML and DL have been discussed, and an ML/DL deployment model for IOT data has been proposed

Improved Firefly Algorithm with Variable Neighborhood Search for Data Clustering

من بين الخوارزميات الأدلة العليا (الميتاهيورستك)، تعد الخوارزميات القائمة على البحوث المتعددة (المجتمع) خوارزمية بحث استكشافية متفوقة كخوارزمية البحث المحلية من حيث استكشاف مساحة البحث للعثور على الحلول المثلى العالمية. ومع ذلك، فإن الجانب السلبي الأساسي للخوارزميات القائمة على البحوث المتعددة (المجتمع) هو قدرتها الاستغلالية المنخفضة، مما يمنع توسع منطقة البحث عن الحلول المثلى. خوارزمية اليَرَاعَة المضيئة (Firefly (FA هي خوارزمية تعتمد على المجتمع والتي تم استخدامها على نطاق واسع في مشاكل التجميع. ومع ذلك، فإن FA مقيد بتقاربها السابق لأوانه عندما لا يتم استخدام استراتيجيات بحث محلي لتحسين جودة حلول المجموعات في منطقة المجاورة واستكشاف المناطق العالمية في مساحة البحث. على هذا الأساس، فإن الهدف من هذا العمل هو تحسين FA باستخدام البحث المتغير في الأحياء (VNS) كطريقة بحث محلية (FA-VNS)، وبالتالي توفير فائدة VNS للمفاضلة بين قدرات الاستكشاف والاستغلال. يسمح FA-VNS المقترح لليراعات بتحسين حلول التجميع مع القدرة على تعزيز حلول التجميع والحفاظ على تنوع حلول التجميع أثناء عملية البحث باستخدام مشغلي الاضطراب في VNS. لتقييم أداء الخوارزمية، يتم استخدام ثماني مجموعات بيانات معيارية مع أربع خوارزميات تجميع معروفة. تشير المقارنة وفقًا لمقاييس التقييم الداخلية والخارجية إلى أن FA-VNS المقترحة يمكن أن تنتج حلول تجميع أكثر إحكاما من خوارزميات التجميع المعروفة.Among the metaheuristic algorithms, population-based algorithms are an explorative search algorithm superior to the local search algorithm in terms of exploring the search space to find globally optimal solutions. However, the primary downside of such algorithms is their low exploitative capability, which prevents the expansion of the search space neighborhood for more optimal solutions. The firefly algorithm (FA) is a population-based algorithm that has been widely used in clustering problems. However, FA is limited in terms of its premature convergence when no neighborhood search strategies are employed to improve the quality of clustering solutions in the neighborhood region and exploring the global regions in the search space. On these bases, this work aims to improve FA using variable neighborhood search (VNS) as a local search method, providing VNS the benefit of the trade-off between the exploration and exploitation abilities. The proposed FA-VNS allows fireflies to improve the clustering solutions with the ability to enhance the clustering solutions and maintain the diversity of the clustering solutions during the search process using the perturbation operators of VNS. To evaluate the performance of the algorithm, eight benchmark datasets are utilized with four well-known clustering algorithms. The comparison according to the internal and external evaluation metrics indicates that the proposed FA-VNS can produce more compact clustering solutions than the well-known clustering algorithms

Randomly attracted firefly algorithm with neighborhood search and dynamic parameter adjustment mechanism

Firefly algorithm (FA) is a new swarm intelligence optimization algorithm, which has shown an effective performance on many optimization problems. However, it may suffer from premature convergence when solving complex optimization problems. In this paper, we propose a new FA variant, called NSRaFA, which employs a random attraction model and three neighborhood search strategies to obtain a trade-off between exploration and exploitation abilities. Moreover, a dynamic parameter adjustment mechanism is used to automatically adjust the control parameters. Experiments are conducted on a set of well-known benchmark functions. Results show that our approach achieves much better solutions than the standard FA and five other recently proposed FA variants

Passive localization model in wireless sensor networks based on adaptive hybrid heuristic algorithms

Предмет истраживања ове докторске дисертације је проблем пасивног лоцирања заснован на мерењу времена пропагације сигнала (Time of Arrival, ТОА), или временске разлике пропагације сигнала (Time Difference of Arrival, TDOA) ради одређивања непознате локације неког објекта. За постављене моделе лоцирања формирана је функција максималне веродостојности (Maximum Likelihood, ML) са Гаусовом случајном расподелом за грешку мерења. Разматрани естимациони модел описан је нелинеарном, неконвексном функцијом циља, односно мултимодалном функцијом. При томе, за формирану функцију циља, глобално оптимално решење не може се нумерички одредити класичним методама оптимизације...The research in this dissertation is focused on the problem of passive target localization based on the noisy time of arrival (TOA) or time Difference of Arrival (TDOA) measurements, with the aim to accurately estimate the unknown passive target location. The maximum likelihood (ML) estimation problem is formulated for the considered localization problem, with measurement errors modelled as Gaussian distributed random variables. However, the ML objective function of the considered estimation problem is nonlinear and multimodal function, and in this case, the global optimal solution cannot be determined numerically by classical optimization methods..