Adil M. Bagirov

Orcid: 0000-0003-2075-1699

According to our database1, Adil M. Bagirov authored at least 90 papers between 2000 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Nonsmooth Optimization-Based Model and Algorithm for Semisupervised Clustering.
IEEE Trans. Neural Networks Learn. Syst., September, 2023

Methods and Applications of Clusterwise Linear Regression: A Survey and Comparison.
ACM Trans. Knowl. Discov. Data, April, 2023

A novel optimization approach towards improving separability of clusters.
Comput. Oper. Res., April, 2023

Finding compact and well-separated clusters: Clustering using silhouette coefficients.
Pattern Recognit., 2023

Nonsmooth Optimization-Based Hyperparameter-Free Neural Networks for Large-Scale Regression.
Algorithms, 2023

Bundle Enrichment Method for Nonsmooth Difference of Convex Programming Problems.
Algorithms, 2023

2022
Missing Value Imputation via Clusterwise Linear Regression.
IEEE Trans. Knowl. Data Eng., 2022

Robust piecewise linear <i>L</i><sub>1</sub>-regression via nonsmooth DC optimization.
Optim. Methods Softw., 2022

2021
Aggregate subgradient method for nonsmooth DC optimization.
Optim. Lett., 2021

Incremental DC optimization algorithm for large-scale clusterwise linear regression.
J. Comput. Appl. Math., 2021

An augmented subgradient method for minimizing nonsmooth DC functions.
Comput. Optim. Appl., 2021

2020
A biased-randomised algorithm for the capacitated facility location problem with soft constraints.
J. Oper. Res. Soc., 2020

Cyberattack triage using incremental clustering for intrusion detection systems.
Int. J. Inf. Sec., 2020

Prediction of gold-bearing localised occurrences from limited exploration data.
Int. J. Comput. Sci. Eng., 2020

New gene selection algorithm using hypeboxes to improve performance of classifiers.
Int. J. Bioinform. Res. Appl., 2020

Clusterwise support vector linear regression.
Eur. J. Oper. Res., 2020

Partial Undersampling of Imbalanced Data for Cyber Threats Detection.
Proceedings of the Australasian Computer Science Week, 2020

2019
A sharp augmented Lagrangian-based method in constrained non-convex optimization.
Optim. Methods Softw., 2019

A simulated annealing-based maximum-margin clustering algorithm.
Comput. Intell., 2019

Multi-Source Cyber-Attacks Detection using Machine Learning.
Proceedings of the IEEE International Conference on Industrial Technology, 2019

A Comparative Study of Unsupervised Classification Algorithms in Multi-Sized Data Sets.
Proceedings of the AICCC 2019: 2nd Artificial Intelligence and Cloud Computing Conference, 2019

2018
Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming.
SIAM J. Optim., 2018

Clustering in large data sets with the limited memory bundle method.
Pattern Recognit., 2018

Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms.
Optim. Methods Softw., 2018

Preface of the special issue: the 6th International Conference on Optimization and Control with Applications (6th OCA).
Optim. Lett., 2018

Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations.
J. Glob. Optim., 2018

A Server Side Solution for Detecting WebInject: A Machine Learning Approach.
Proceedings of the Trends and Applications in Knowledge Discovery and Data Mining, 2018

SMGKM: An Efficient Incremental Algorithm for Clustering Document Collections.
Proceedings of the Computational Linguistics and Intelligent Text Processing, 2018

2017
Optimization Based Clustering Algorithms for Authorship Analysis of Phishing Emails.
Neural Process. Lett., 2017

A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes.
J. Glob. Optim., 2017

New diagonal bundle method for clustering problems in large data sets.
Eur. J. Oper. Res., 2017

2016
Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems.
Pattern Recognit., 2016

Constrained Self Organizing Maps for Data Clusters Visualization.
Neural Process. Lett., 2016

An Algorithm for Clustering Using <i>L</i><sub>1</sub>-Norm Based on Hyperbolic Smoothing Technique.
Comput. Intell., 2016

2015
An algorithm for clusterwise linear regression based on smoothing techniques.
Optim. Lett., 2015

An incremental piecewise linear classifier based on polyhedral conic separation.
Mach. Learn., 2015

Nonsmooth Optimization Algorithm for Solving Clusterwise Linear Regression Problems.
J. Optim. Theory Appl., 2015

A heuristic algorithm for solving the minimum sum-of-squares clustering problems.
J. Glob. Optim., 2015

Solving DC programs using the cutting angle method.
J. Glob. Optim., 2015

Modified self-organising maps with a new topology and initialisation algorithm.
J. Exp. Theor. Artif. Intell., 2015

An incremental clustering algorithm based on hyperbolic smoothing.
Comput. Optim. Appl., 2015

Diagnostic with incomplete nominal/discrete data.
Artif. Intell. Res., 2015

2014
A convolutional recursive modified Self Organizing Map for handwritten digits recognition.
Neural Networks, 2014

Preface of the special issue OR: connecting sciences supported by global optimization related to the 25th European conference on operational research (EURO XXV 2012).
J. Glob. Optim., 2014

Aggregate codifferential method for nonsmooth DC optimization.
J. Comput. Appl. Math., 2014

CR-Modified SOM to the Problem of Handwritten Digits Recognition.
Proceedings of the Research and Development in Intelligent Systems XXXI, 2014

2013
An algorithm for minimization of pumping costs in water distribution systems using a novel approach to pump scheduling.
Math. Comput. Model., 2013

Subgradient Method for Nonconvex Nonsmooth Optimization.
J. Optim. Theory Appl., 2013

Nonsmooth nonconvex optimization approach to clusterwise linear regression problems.
Eur. J. Oper. Res., 2013

2012
Comparing different nonsmooth minimization methods and software.
Optim. Methods Softw., 2012

2011
Fast modified global k-means algorithm for incremental cluster construction.
Pattern Recognit., 2011

Classification through incremental max-min separability.
Pattern Anal. Appl., 2011

Codifferential method for minimizing nonsmooth DC functions.
J. Glob. Optim., 2011

An efficient algorithm for the incremental construction of a piecewise linear classifier.
Inf. Syst., 2011

A novel hybrid neural learning algorithm using simulated annealing and quasisecant method.
Proceedings of the Ninth Australasian Data Mining Conference, AusDM 2011, Ballarat, 2011

Improving Naive Bayes Classifier Using Conditional Probabilities.
Proceedings of the Ninth Australasian Data Mining Conference, AusDM 2011, Ballarat, 2011

Feature Selection using Misclassification Counts.
Proceedings of the Ninth Australasian Data Mining Conference, AusDM 2011, Ballarat, 2011

2010
An L2-boosting algorithm for estimation of a regression function.
IEEE Trans. Inf. Theory, 2010

A quasisecant method for minimizing nonsmooth functions.
Optim. Methods Softw., 2010

An algorithm for the estimation of a regression function by continuous piecewise linear functions.
Comput. Optim. Appl., 2010

2009
Global Optimization: Cutting Angle Method.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Nonsmooth Optimization Approach to Clustering.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Derivative-Free Methods for Non-smooth Optimization.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Continuous Approximations to Subdifferentials.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Estimation of a Regression Function by Maxima of Minima of Linear Functions.
IEEE Trans. Inf. Theory, 2009

2008
Modified global k-means algorithm for minimum sum-of-squares clustering problems.
Pattern Recognit., 2008

An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization.
Math. Methods Oper. Res., 2008

2007
Visual Tools for Analysing Evolution, Emergence, and Error in Data Streams.
Proceedings of the 6th Annual IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007), 2007

2006
Piecewise Partially Separable Functions and a Derivative-free Algorithm for Large Scale Nonsmooth Optimization.
J. Glob. Optim., 2006

A Hybrid Neural Learning Algorithm Using Evolutionary Learning and Derivative Free Local Search Method.
Int. J. Neural Syst., 2006

A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems.
Eur. J. Oper. Res., 2006

Derivative Free Stochastic Discrete Gradient Method with Adaptive Mutation.
Proceedings of the Advances in Data Mining, 2006

2005
Max-min separability.
Optim. Methods Softw., 2005

Data Mining with Combined Use of Optimization Techniques and Self-Organizing Maps for Improving Risk Grouping Rules: Application to Prostate Cancer Patients.
J. Manag. Inf. Syst., 2005

Local Optimization Method with Global Multidimensional Search.
J. Glob. Optim., 2005

Determining Regularization Parameters for Derivative Free Neural Learning.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2005

Comparative Analysis of Genetic Algorithm, Simulated Annealing and Cutting Angle Method for Artificial Neural Networks.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2005

Fusion Strategies for Neural Learning Algorithms using Evolutionary and Discrete Gradient Approaches.
Proceedings of the IASTED International Conference on Artificial Intelligence and Applications, 2005

2004
Improving Risk Grouping Rules for Prostate Cancer Patients with Optimization.
Proceedings of the 37th Hawaii International Conference on System Sciences (HICSS-37 2004), 2004

2003
Cutting Angle Method and a Local Search.
J. Glob. Optim., 2003

New algorithms for multi-class cancer diagnosis using tumor gene expression signatures.
Bioinform., 2003

Parallelization of the Discrete Gradient Method of Non-smooth Optimization and Its Applications.
Proceedings of the Computational Science - ICCS 2003, 2003

An Optimization-Based Approach to Patient Grouping for Acute Healthcare in Australia.
Proceedings of the Computational Science - ICCS 2003, 2003

The discrete gradient evolutionary strategy method for global optimization.
Proceedings of the IEEE Congress on Evolutionary Computation, 2003

2002
Penalty functions with a small penalty parameter.
Optim. Methods Softw., 2002

A Method for Minimization of Quasidifferentiable Functions.
Optim. Methods Softw., 2002

A method of truncated codifferential with application to some problems of cluster analysis.
J. Glob. Optim., 2002

2001
Global Optimization of Marginal Functions with Applications to Economic Equilibrium.
J. Glob. Optim., 2001

A Global Optimization Approach to Classification in Medical Diagnosis and Prognosis.
Proceedings of the 34th Annual Hawaii International Conference on System Sciences (HICSS-34), 2001

2000
Global Minimization of Increasing Positively Homogeneous Functions over the Unit Simplex.
Ann. Oper. Res., 2000


  Loading...