default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohd. Arshad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j6]Mushir Akhtar
, M. Tanveer, Mohd. Arshad:
RoBoSS: A Robust, Bounded, Sparse, and Smooth Loss Function for Supervised Learning. IEEE Trans. Pattern Anal. Mach. Intell. 47(1): 149-160 (2025)- 2024
- [j5]Anuradha Kumari, Mushir Akhtar, Muhammad Tanveer, Mohd. Arshad:
Diagnosis of breast cancer using flexible pinball loss support vector machine. Appl. Soft Comput. 157: 111454 (2024) - [j4]Mohd. Arshad, Mukti Khetan, Vijay Kumar, Ashok Kumar Pathak:
Record-based transmuted generalized linear exponential distribution with increasing, decreasing and bathtub shaped failure rates. Commun. Stat. Simul. Comput. 53(7): 3489-3513 (2024) - [j3]Mushir Akhtar, Muhammad Tanveer, Mohd. Arshad:
Advancing Supervised Learning with the Wave Loss Function: A Robust and Smooth Approach. Pattern Recognit. 155: 110637 (2024) - 2023
- [j2]Mohd. Arshad, Qazi Azhad Jamal, Neetu Gupta, Ashok Kumar Pathak:
Bayesian inference of Unit Gompertz distribution based on dual generalized order statistics. Commun. Stat. Simul. Comput. 52(8): 3657-3675 (2023) - 2021
- [j1]Umar Muhammad Modibbo, Mohd. Arshad, Omer Abdalghani, Irfan Ali:
Optimization and estimation in system reliability allocation problem. Reliab. Eng. Syst. Saf. 212: 107620 (2021)
Conference and Workshop Papers
- 2024
- [c1]Mushir Akhtar, M. Tanveer, Mohd. Arshad:
GL-TSVM: A Robust and Smooth Twin Support Vector Machine with Guardian Loss Function. ICPR (2) 2024: 63-78
Informal and Other Publications
- 2024
- [i7]Mushir Akhtar, M. Tanveer, Mohd. Arshad:
Enhancing Efficiency and Robustness in Support Vector Regression with HawkEye Loss. CoRR abs/2401.16785 (2024) - [i6]Mushir Akhtar, Muhammad Tanveer, Mohd. Arshad:
Advancing Supervised Learning with the Wave Loss Function: A Robust and Smooth Approach. CoRR abs/2404.18101 (2024) - [i5]Mohd. Arshad, Swaroop Georgy Zachariah, Ashok Kumar Pathak:
Multivariate Information Measures: A Copula-based Approach. CoRR abs/2408.02028 (2024) - [i4]Mushir Akhtar, Muhammad Tanveer, Mohd. Arshad:
GL-TSVM: A robust and smooth twin support vector machine with guardian loss function. CoRR abs/2408.16336 (2024) - [i3]Mushir Akhtar, Ritik Mishra, M. Tanveer, Mohd. Arshad:
Advancing RVFL networks: Robust classification with the HawkEye loss function. CoRR abs/2410.00510 (2024) - [i2]Mushir Akhtar, Abdul Quadir, M. Tanveer, Mohd. Arshad:
Flexi-Fuzz least squares SVM for Alzheimer's diagnosis: Tackling noise, outliers, and class imbalance. CoRR abs/2410.14207 (2024) - 2023
- [i1]Mushir Akhtar, M. Tanveer, Mohd. Arshad:
RoBoSS: A Robust, Bounded, Sparse, and Smooth Loss Function for Supervised Learning. CoRR abs/2309.02250 (2023)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
