Preferred Language
Articles
/
ijs-1024
Finding Best Clustering For Big Networks with Minimum Objective Function by Using Probabilistic Tabu Search
...Show More Authors

     Fuzzy C-means (FCM) is a clustering method used for collecting similar data elements within the group according to specific measurements. Tabu is a heuristic algorithm. In this paper, Probabilistic Tabu Search for FCM implemented to find a global clustering based on the minimum value of the Fuzzy objective function. The experiments designed for different networks, and cluster’s number the results show the best performance based on the comparison that is done between the values of the objective function in the case of using standard FCM and Tabu-FCM, for the average of ten runs.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Thu Aug 30 2018
Journal Name
Iraqi Journal Of Science
Best Approximation in Modular Spaces By Type of Nonexpansive Maps
...Show More Authors

This paper presents results about the existence of best approximations via nonexpansive type maps defined on modular spaces. 

View Publication Preview PDF
Publication Date
Sun Jan 01 2023
Journal Name
2nd International Conference On Mathematical Techniques And Applications: Icmta2021
Review of clustering for gene expression data
...Show More Authors

View Publication
Crossref
Publication Date
Thu Jan 05 2023
Journal Name
Mathematical Theory And Modeling
(Tc) Technique for Finding Optimal Solution To Transportation Problem
...Show More Authors

Given the importance of increasing economic openness transport companies’ face various issues arising at present time, this required importing different types of goods with different means of transport. Therefore, these companies pay great attention to reducing total costs of transporting commodities by using numbers means of transport methods from their sources to the destinations. The majority of private companies do not acquire the knowledge of using operations research methods, especially transport models, through which the total costs can be reduced, resulting in the importance and need to solve such a problem. This research presents a proposed method for the sum of Total Costs (Tc) of rows and columns, in order to arrive at the init

... Show More
Preview PDF
Publication Date
Sun May 26 2019
Journal Name
Iraqi Journal Of Science
Exact and Local Search Methods for Solving Travelling Salesman Problem with Practical Application
...Show More Authors

This paper investigates some exact and local search methods to solve the traveling salesman problem. The Branch and Bound technique (BABT) is proposed, as an exact method, with two models. In addition, the classical Genetic Algorithm (GA) and Simulated Annealing (SA) are discussed and applied as local search methods. To improve the performance of GA we propose two kinds of improvements for GA; the first is called improved GA (IGA) and the second is Hybrid GA (HGA).

The IGA gives best results than GA and SA, while the HGA is the best local search method for all within a reasonable time for 5 ≤ n ≤ 2000, where n is the number of visited cities. An effective method of reducing the size of the TSP matrix was proposed with

... Show More
View Publication Preview PDF
Scopus (3)
Crossref (1)
Scopus Crossref
Publication Date
Sun Apr 30 2023
Journal Name
Iraqi Journal Of Science
Using K-mean Clustering to Classify the Kidney Images
...Show More Authors

      This study has applied digital image processing on three-dimensional C.T. images to detect and diagnose kidney diseases.  Medical images of different cases of kidney diseases were compared with those of   healthy cases. Four different kidneys disorders, such as stones, tumors (cancer), cysts, and renal fibrosis were considered in additional to healthy tissues. This method helps in differentiating between the healthy and diseased kidney tissues. It can detect tumors in its very early stages, before they grow large enough to be seen by the human eye. The method used for segmentation and texture analysis was the k-means with co-occurrence matrix. The k-means separates the healthy classes and the tumor classes, and the affected

... Show More
View Publication Preview PDF
Scopus Crossref
Publication Date
Sun Nov 01 2020
Journal Name
2020 2nd Annual International Conference On Information And Sciences (aicis)
An Enhanced Multi-Objective Evolutionary Algorithm with Decomposition for Signed Community Detection Problem
...Show More Authors

View Publication
Scopus (3)
Crossref (1)
Scopus Crossref
Publication Date
Tue Mar 01 2022
Journal Name
International Journal Of Nonlinear Analysis And Applications
Semi-parametric regression function estimation for environmental pollution with measurement error using artificial flower pollination algorithm
...Show More Authors

Artificial Intelligence Algorithms have been used in recent years in many scientific fields. We suggest employing flower pollination algorithm in the environmental field to find the best estimate of the semi-parametric regression function with measurement errors in the explanatory variables and the dependent variable, where measurement errors appear frequently in fields such as chemistry, biological sciences, medicine, and epidemiological studies, rather than an exact measurement. We estimate the regression function of the semi-parametric model by estimating the parametric model and estimating the non-parametric model, the parametric model is estimated by using an instrumental variables method (Wald method, Bartlett’s method, and Durbin

... Show More
Publication Date
Fri Dec 08 2023
Journal Name
Iraqi Journal Of Science
Video Image Compression Using Absolute Moment Block Truncation Method with Orthogonal Search Motion Estimation Technique
...Show More Authors

Image compression has become one of the most important applications of the image processing field because of the rapid growth in computer power. The corresponding growth in the multimedia market, and the advent of the World Wide Web, which makes the internet easily accessible for everyone. Since the early 1980, digital image sequence processing has been an attractive research area because an image sequence, as acollection of images, may provide much compression than a single image frame. The increased computational complexity and memory space required for image sequence processing, has in fact, becoming more attainable. this research absolute Moment Block Truncation compression technique which is depend on adopting the good points of oth

... Show More
View Publication Preview PDF
Publication Date
Sat Jul 01 2017
Journal Name
2017 Computing Conference
Protecting a sensitive dataset using a time based password in big data
...Show More Authors

View Publication
Crossref (1)
Crossref
Publication Date
Fri Sep 30 2022
Journal Name
Journal Of The Iraqi University
Exclusion optimal portfolio from outlier by using fuzzy c-means clustering - analytical research at the Iraqi Stock Exchange
...Show More Authors

This research aims to solve the problem of selection using clustering algorithm, in this research optimal portfolio is formation using the single index model, and the real data are consisting from the stocks Iraqi Stock Exchange in the period 1/1/2007 to 31/12/2019. because the data series have missing values ,we used the two-stage missing value compensation method, the knowledge gap was inability the portfolio models to reduce The estimation error , inaccuracy of the cut-off rate and the Treynor ratio combine stocks into the portfolio that caused to decline in their performance, all these problems required employing clustering technic to data mining and regrouping it within clusters with similar characteristics to outperform the portfolio

... Show More
View Publication Preview PDF