BiCSA-PUL: binary crow search algorithm for enhancing positive and unlabeled learning

This paper presents a novel metaheuristic binary crow search algorithm (CSA) designed for positive-unlabeled (PU) learning, a paradigm where only positive and unlabeled data are available, with applications in many diversified fields, such as medical diagnosis and fraud detection. The algorithm repr...

Full description

Saved in:
Bibliographic Details
Published in:International journal of information technology (Singapore. Online) Vol. 17; no. 3; pp. 1729 - 1743
Main Authors: Azizi, Nabil, Ben Othmane, Mohamed, Hamouma, Moumen, Siam, Abderrahim, Haouassi, Hichem, Ledmi, Makhlouf, Hamdi-Cherif, Aboubekeur
Format: Journal Article
Language:English
Published: Singapore Springer Nature Singapore 01.04.2025
Springer Nature B.V
Subjects:
ISSN:2511-2104, 2511-2112
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract This paper presents a novel metaheuristic binary crow search algorithm (CSA) designed for positive-unlabeled (PU) learning, a paradigm where only positive and unlabeled data are available, with applications in many diversified fields, such as medical diagnosis and fraud detection. The algorithm represent a useful adaptation of CSA, itself inspired by the food-hiding behavior of crows. The proposed BiCSA-PUL (binary crow search algorithm for positive-unlabeled learning) selects reliable negative samples from unlabeled data using binary vectors, and updates positions employing Hamming distance, guided by a modified F1-score, as fitness function. The algorithm was tested on 30 samples from 10 diverse datasets, outperforming seven state-of-the-art PU learning methods. The results reveal that BiCSA-PUL provides a robust and efficient approach for PU learning, significantly improving fitness and reliability. This work opens new avenues for applying metaheuristic optimization methods to challenging classification problems with limited labeled data. The main limitations are the potentially time-intensive process of parameters tuning and reliance on initial sampling.
AbstractList This paper presents a novel metaheuristic binary crow search algorithm (CSA) designed for positive-unlabeled (PU) learning, a paradigm where only positive and unlabeled data are available, with applications in many diversified fields, such as medical diagnosis and fraud detection. The algorithm represent a useful adaptation of CSA, itself inspired by the food-hiding behavior of crows. The proposed BiCSA-PUL (binary crow search algorithm for positive-unlabeled learning) selects reliable negative samples from unlabeled data using binary vectors, and updates positions employing Hamming distance, guided by a modified F1-score, as fitness function. The algorithm was tested on 30 samples from 10 diverse datasets, outperforming seven state-of-the-art PU learning methods. The results reveal that BiCSA-PUL provides a robust and efficient approach for PU learning, significantly improving fitness and reliability. This work opens new avenues for applying metaheuristic optimization methods to challenging classification problems with limited labeled data. The main limitations are the potentially time-intensive process of parameters tuning and reliance on initial sampling.
Author Ben Othmane, Mohamed
Hamdi-Cherif, Aboubekeur
Haouassi, Hichem
Siam, Abderrahim
Azizi, Nabil
Ledmi, Makhlouf
Hamouma, Moumen
Author_xml – sequence: 1
  givenname: Nabil
  orcidid: 0009-0008-4207-483X
  surname: Azizi
  fullname: Azizi, Nabil
  email: azizi.nabil@univ-khenchela.dz
  organization: Department of Computer Science, Mostefa Ben Boulaid University, Department of Computer Science, Abbes Laghrour University, Knowledge Engineering and IT Security Laboratory (ICOSI), Abbes Laghrour University
– sequence: 2
  givenname: Mohamed
  surname: Ben Othmane
  fullname: Ben Othmane, Mohamed
  organization: Department of Computer Science, Abbes Laghrour University
– sequence: 3
  givenname: Moumen
  surname: Hamouma
  fullname: Hamouma, Moumen
  organization: Department of Computer Science, Mostefa Ben Boulaid University
– sequence: 4
  givenname: Abderrahim
  surname: Siam
  fullname: Siam, Abderrahim
  organization: Department of Computer Science, Abbes Laghrour University, Knowledge Engineering and IT Security Laboratory (ICOSI), Abbes Laghrour University
– sequence: 5
  givenname: Hichem
  surname: Haouassi
  fullname: Haouassi, Hichem
  organization: Department of Computer Science, Abbes Laghrour University, Knowledge Engineering and IT Security Laboratory (ICOSI), Abbes Laghrour University
– sequence: 6
  givenname: Makhlouf
  surname: Ledmi
  fullname: Ledmi, Makhlouf
  organization: Department of Computer Science, Abbes Laghrour University, Knowledge Engineering and IT Security Laboratory (ICOSI), Abbes Laghrour University
– sequence: 7
  givenname: Aboubekeur
  surname: Hamdi-Cherif
  fullname: Hamdi-Cherif, Aboubekeur
  organization: Department of Computer Science, Ferhat Abbas University of Setif 1
BookMark eNp9kE9LAzEQxYNUsNZ-AU8Bz6uZJNtsvdViVSgoaM8hmz9tZJutSavstze6ojcPwwzM-83w3ikahDZYhM6BXAIh4ipxqAQpCOW52EQU3REa0hKgoAB08DsTfoLGKfmaMKATVgoYotWNnz_PiqfV8hrXPqjYYR3bD5ysinqDVbNuo99vtti1EduwUUH7sMa7Nvm9f7dYBYMPoVG1bazBTaZC3p-hY6eaZMc_fYRWi9uX-X2xfLx7mM-WhYaq7ApWg5tyI4xwxlJFaM2M5co6QbielhqAiJJVQlW6EgYsBa2UdpRnfEKdYiN00d_dxfbtYNNevraHGPJLyWhZUgaimmYV7VXZWUrROrmLfputSiDyK0HZJyhzgvI7QdlliPVQyuKwtvHv9D_UJ5x-dh0
Cites_doi 10.1609/aaai.v37i6.25889
10.1007/978-981-15-8045-1_2
10.1016/j.ins.2020.03.021
10.1186/s42400-022-00124-x
10.1016/j.engappai.2020.104006
10.3390/math12101454
10.1016/j.ipm.2023.103381
10.1016/j.ins.2022.04.015
10.1109/TIM.2024.3372221
10.1007/s10994-020-05877-5
10.1109/ICPECTS56089.2022.10047014
10.1109/ICDM.2003.1250918
10.1016/j.isatra.2019.09.004
10.1109/TPAMI.2023.3319431
10.1016/j.compstruc.2016.03.001
10.1016/j.isci.2024.109086
10.48550/arXiv.2205.09485
10.1007/s41870-024-02120-5
10.1109/IISA.2019.8900698
10.1007/s41870-020-00550-5
10.1609/aaai.v38i8.28665
10.1007/s10489-023-04732-z
10.1007/s10489-017-1076-z
10.1016/j.physa.2018.05.128
10.1007/s10618-023-00925-9
10.48550/arXiv.2105.02250
10.1186/s40537-020-00305-w
10.1109/TCSVT.2019.2903563
10.24963/ijcai.2017/444
10.1016/j.neucom.2016.01.089
10.1007/s10994-016-5604-6
10.1145/3503161.3548045
10.1109/TPAMI.2018.2860995
10.1007/s41870-018-0251-8
10.1016/j.eswa.2020.113572
10.1145/775047.775083
10.48550/arXiv.2201.13192
10.1109/ICIP46576.2022.9897738
10.1007/s41870-024-01740-1
10.1016/j.fmre.2022.09.019
10.1007/s41870-023-01288-6
10.48550/arXiv.2404.00145
10.1109/ACCESS.2021.3054799
10.1016/j.knosys.2023.110819
10.1007/s10462-020-09911-9
10.1007/s41870-021-00676-0
10.1007/978-3-642-31362-2_21
10.1093/bib/bbab461
10.1109/ACCESS.2020.3024108
10.1109/ACCESS.2019.2911629
10.1016/j.patrec.2013.06.010
10.48550/arXiv.2201.06277
10.1007/s10844-019-00549-w
ContentType Journal Article
Copyright Bharati Vidyapeeth's Institute of Computer Applications and Management 2024 Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
Bharati Vidyapeeth's Institute of Computer Applications and Management 2024.
Copyright_xml – notice: Bharati Vidyapeeth's Institute of Computer Applications and Management 2024 Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
– notice: Bharati Vidyapeeth's Institute of Computer Applications and Management 2024.
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1007/s41870-024-02367-y
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts

DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 2511-2112
EndPage 1743
ExternalDocumentID 10_1007_s41870_024_02367_y
GroupedDBID 0R~
406
AACDK
AAHNG
AAIAL
AAJBT
AANZL
AASML
AATNV
AATVU
AAUYE
ABAKF
ABDBE
ABDZT
ABECU
ABFTV
ABJNI
ABJOX
ABKCH
ABMQK
ABQBU
ABTEG
ABTKH
ABTMW
ABXPI
ACAOD
ACDTI
ACGFS
ACHSB
ACMLO
ACOKC
ACPIV
ACZOJ
ADHHG
ADKNI
ADKPE
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFQL
AEJRE
AEMSY
AEOHA
AESKC
AEVLU
AEXYK
AFBBN
AFQWF
AGDGC
AGMZJ
AGQEE
AGRTI
AHSBF
AIAKS
AIGIU
AILAN
AITGF
AJRNO
AJZVZ
ALFXC
ALMA_UNASSIGNED_HOLDINGS
AMKLP
AMXSW
AMYLF
AMYQR
AXYYD
BGNMA
CSCUP
DNIVK
DPUIP
EBLON
EBS
EIOEI
EJD
FERAY
FIGPU
FINBP
FNLPD
FSGXE
GGCAI
GJIRD
IKXTQ
IWAJR
J-C
JZLTJ
KOV
LLZTM
M4Y
NPVJJ
NQJWS
NU0
O9J
PT4
RLLFE
ROL
RSV
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
TSG
UOJIU
UTJUX
UZXMN
VFIZW
ZMTXR
AAYXX
ABBRH
ABFSG
ABRTQ
ABUWG
ACSTC
AEZWR
AFDZB
AFHIU
AFKRA
AFOHR
AHPBZ
AHWEU
AIXLP
ARAPS
ATHPR
AYFIA
AZQEC
BENPR
BGLVJ
CCPQU
CITATION
DWQXO
GNUQQ
HCIFZ
K7-
PHGZM
PHGZT
PQGLB
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c185y-3b1f94d7d7fde2a02b3de4aef704c95c11075387a8c87d1e21caacf24c1862fa3
IEDL.DBID RSV
ISSN 2511-2104
IngestDate Tue Sep 30 03:21:24 EDT 2025
Sat Nov 29 08:10:45 EST 2025
Tue Mar 04 01:16:08 EST 2025
IsPeerReviewed false
IsScholarly true
Issue 3
Keywords Metaheuristic optimization
Positive and unlabeled learning
Raw search algorithm
Two-step algorithms
Classification
Machine learning
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c185y-3b1f94d7d7fde2a02b3de4aef704c95c11075387a8c87d1e21caacf24c1862fa3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0009-0008-4207-483X
PQID 3255231789
PQPubID 2034493
PageCount 15
ParticipantIDs proquest_journals_3255231789
crossref_primary_10_1007_s41870_024_02367_y
springer_journals_10_1007_s41870_024_02367_y
PublicationCentury 2000
PublicationDate 20250400
2025-04-00
20250401
PublicationDateYYYYMMDD 2025-04-01
PublicationDate_xml – month: 4
  year: 2025
  text: 20250400
PublicationDecade 2020
PublicationPlace Singapore
PublicationPlace_xml – name: Singapore
– name: Heidelberg
PublicationSubtitle An Official Journal of Bharati Vidyapeeth's Institute of Computer Applications and Management
PublicationTitle International journal of information technology (Singapore. Online)
PublicationTitleAbbrev Int. j. inf. tecnol
PublicationYear 2025
Publisher Springer Nature Singapore
Springer Nature B.V
Publisher_xml – name: Springer Nature Singapore
– name: Springer Nature B.V
References MC Plessis (2367_CR8) 2017; 106
EA Nehary (2367_CR25) 2024; 73
J Bekker (2367_CR1) 2020; 109
A Sheta (2367_CR21) 2023; 53
2367_CR39
A Askarzadeh (2367_CR17) 2016; 169
2367_CR38
2367_CR36
2367_CR35
Y Liu (2367_CR12) 2023
S Xu (2367_CR24) 2024
2367_CR33
2367_CR2
H Ju (2367_CR5) 2020; 523
2367_CR4
2367_CR7
KA Bhat (2367_CR9) 2024
S Tuarob (2367_CR30) 2023; 60
Y Yuan (2367_CR16) 2024; 12
C Qu (2367_CR50) 2019; 7
B Kotiyal (2367_CR32) 2023; 15
2367_CR27
2367_CR26
F Li (2367_CR23) 2022; 23
Z Fan (2367_CR28) 2022; 5
D Ienco (2367_CR6) 2016; 196
T Ke (2367_CR14) 2018; 509
PS Singh (2367_CR29) 2022; 14
Y Meraihi (2367_CR19) 2021; 54
E Sansone (2367_CR45) 2019; 41
GH Al-Gaphari (2367_CR53) 2021; 97
Y Jiang (2367_CR41) 2023; 45
2367_CR13
2367_CR55
2367_CR54
2367_CR52
JT Hancock (2367_CR57) 2020; 7
AMUD Khanday (2367_CR31) 2021; 13
S Das (2367_CR10) 2024; 16
C Ortega Vázquez (2367_CR37) 2023; 37
F Mordelet (2367_CR15) 2014; 37
P Kaur (2367_CR11) 2022; 14
S Shekhawat (2367_CR20) 2020; 99
T Ke (2367_CR34) 2018; 48
L Cao (2367_CR51) 2021; 9
L Zhang (2367_CR49) 2022; 601
TMA Basile (2367_CR56) 2019; 53
C Gong (2367_CR3) 2022
2367_CR48
2367_CR47
2367_CR44
2367_CR43
C Gong (2367_CR46) 2020; 30
2367_CR42
2367_CR40
S Ouadfel (2367_CR22) 2020; 159
AG Hussien (2367_CR18) 2020; 8
References_xml – ident: 2367_CR36
  doi: 10.1609/aaai.v37i6.25889
– ident: 2367_CR52
  doi: 10.1007/978-981-15-8045-1_2
– volume: 523
  start-page: 167
  year: 2020
  ident: 2367_CR5
  publication-title: Inf Sci
  doi: 10.1016/j.ins.2020.03.021
– volume: 5
  start-page: 19
  issue: 1
  year: 2022
  ident: 2367_CR28
  publication-title: Cybersecurity
  doi: 10.1186/s42400-022-00124-x
– volume: 97
  year: 2021
  ident: 2367_CR53
  publication-title: Eng Appl Artif Intell
  doi: 10.1016/j.engappai.2020.104006
– volume: 12
  start-page: 1454
  issue: 10
  year: 2024
  ident: 2367_CR16
  publication-title: Mathematics
  doi: 10.3390/math12101454
– volume: 60
  issue: 4
  year: 2023
  ident: 2367_CR30
  publication-title: Inform Process Manag
  doi: 10.1016/j.ipm.2023.103381
– volume: 601
  start-page: 71
  year: 2022
  ident: 2367_CR49
  publication-title: Inf Sci
  doi: 10.1016/j.ins.2022.04.015
– volume: 73
  start-page: 1
  year: 2024
  ident: 2367_CR25
  publication-title: IEEE Trans Instrum Meas
  doi: 10.1109/TIM.2024.3372221
– volume: 109
  start-page: 719
  issue: 4
  year: 2020
  ident: 2367_CR1
  publication-title: Mach Learn
  doi: 10.1007/s10994-020-05877-5
– ident: 2367_CR2
  doi: 10.1109/ICPECTS56089.2022.10047014
– ident: 2367_CR33
  doi: 10.1109/ICDM.2003.1250918
– volume: 99
  start-page: 210
  year: 2020
  ident: 2367_CR20
  publication-title: ISA Trans
  doi: 10.1016/j.isatra.2019.09.004
– volume: 45
  start-page: 15345
  issue: 12
  year: 2023
  ident: 2367_CR41
  publication-title: IEEE Trans Pattern Anal Mach Intell
  doi: 10.1109/TPAMI.2023.3319431
– volume: 169
  start-page: 1
  year: 2016
  ident: 2367_CR17
  publication-title: Comput Struct
  doi: 10.1016/j.compstruc.2016.03.001
– year: 2024
  ident: 2367_CR24
  publication-title: iScience
  doi: 10.1016/j.isci.2024.109086
– ident: 2367_CR48
  doi: 10.48550/arXiv.2205.09485
– year: 2024
  ident: 2367_CR9
  publication-title: Int J Inf Technol
  doi: 10.1007/s41870-024-02120-5
– ident: 2367_CR4
  doi: 10.1109/IISA.2019.8900698
– volume: 13
  start-page: 115
  issue: 1
  year: 2021
  ident: 2367_CR31
  publication-title: Int J Inf Technol
  doi: 10.1007/s41870-020-00550-5
– ident: 2367_CR26
  doi: 10.1609/aaai.v38i8.28665
– volume: 53
  start-page: 26840
  issue: 22
  year: 2023
  ident: 2367_CR21
  publication-title: Appl Intell
  doi: 10.1007/s10489-023-04732-z
– volume: 48
  start-page: 2373
  issue: 8
  year: 2018
  ident: 2367_CR34
  publication-title: Appl Intell
  doi: 10.1007/s10489-017-1076-z
– volume: 509
  start-page: 422
  year: 2018
  ident: 2367_CR14
  publication-title: Phys A
  doi: 10.1016/j.physa.2018.05.128
– volume: 37
  start-page: 1301
  issue: 3
  year: 2023
  ident: 2367_CR37
  publication-title: Data Min Knowl Disc
  doi: 10.1007/s10618-023-00925-9
– ident: 2367_CR35
  doi: 10.48550/arXiv.2105.02250
– volume: 7
  start-page: 28
  issue: 1
  year: 2020
  ident: 2367_CR57
  publication-title: J Big Data
  doi: 10.1186/s40537-020-00305-w
– volume: 30
  start-page: 1396
  issue: 5
  year: 2020
  ident: 2367_CR46
  publication-title: IEEE Trans Circ Syst Video Technol
  doi: 10.1109/TCSVT.2019.2903563
– ident: 2367_CR13
  doi: 10.24963/ijcai.2017/444
– volume: 196
  start-page: 113
  issue: july
  year: 2016
  ident: 2367_CR6
  publication-title: Neurocomputing
  doi: 10.1016/j.neucom.2016.01.089
– ident: 2367_CR40
– volume: 106
  start-page: 463
  issue: 4
  year: 2017
  ident: 2367_CR8
  publication-title: Mach Learn
  doi: 10.1007/s10994-016-5604-6
– ident: 2367_CR42
  doi: 10.1145/3503161.3548045
– volume: 41
  start-page: 2584
  issue: 11
  year: 2019
  ident: 2367_CR45
  publication-title: IEEE Trans Pattern Anal Mach Intell
  doi: 10.1109/TPAMI.2018.2860995
– volume: 14
  start-page: 539
  issue: 1
  year: 2022
  ident: 2367_CR11
  publication-title: Int J Inf Technol
  doi: 10.1007/s41870-018-0251-8
– volume: 159
  year: 2020
  ident: 2367_CR22
  publication-title: Expert Syst Appl
  doi: 10.1016/j.eswa.2020.113572
– ident: 2367_CR39
  doi: 10.1145/775047.775083
– ident: 2367_CR7
  doi: 10.48550/arXiv.2201.13192
– ident: 2367_CR44
  doi: 10.1109/ICIP46576.2022.9897738
– volume: 16
  start-page: 2177
  issue: 4
  year: 2024
  ident: 2367_CR10
  publication-title: Int J Inf Technol
  doi: 10.1007/s41870-024-01740-1
– ident: 2367_CR54
– year: 2022
  ident: 2367_CR3
  publication-title: Fundam Res
  doi: 10.1016/j.fmre.2022.09.019
– volume: 15
  start-page: 2569
  issue: 5
  year: 2023
  ident: 2367_CR32
  publication-title: Int J Inf Technol
  doi: 10.1007/s41870-023-01288-6
– ident: 2367_CR47
  doi: 10.48550/arXiv.2404.00145
– volume: 9
  start-page: 20051
  year: 2021
  ident: 2367_CR51
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2021.3054799
– year: 2023
  ident: 2367_CR12
  publication-title: Know-Based Syst
  doi: 10.1016/j.knosys.2023.110819
– volume: 54
  start-page: 2669
  issue: 4
  year: 2021
  ident: 2367_CR19
  publication-title: Artif Intell Rev
  doi: 10.1007/s10462-020-09911-9
– volume: 14
  start-page: 389
  issue: 1
  year: 2022
  ident: 2367_CR29
  publication-title: Int J Inf Technol
  doi: 10.1007/s41870-021-00676-0
– ident: 2367_CR27
  doi: 10.1007/978-3-642-31362-2_21
– volume: 23
  start-page: 461
  issue: 1
  year: 2022
  ident: 2367_CR23
  publication-title: Brief Bioinform
  doi: 10.1093/bib/bbab461
– ident: 2367_CR55
– volume: 8
  start-page: 173548
  year: 2020
  ident: 2367_CR18
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2020.3024108
– volume: 7
  start-page: 52871
  year: 2019
  ident: 2367_CR50
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2019.2911629
– ident: 2367_CR38
– volume: 37
  start-page: 201
  year: 2014
  ident: 2367_CR15
  publication-title: Pattern Recogn Lett
  doi: 10.1016/j.patrec.2013.06.010
– ident: 2367_CR43
  doi: 10.48550/arXiv.2201.06277
– volume: 53
  start-page: 199
  issue: 2
  year: 2019
  ident: 2367_CR56
  publication-title: J Intell Inform Syst
  doi: 10.1007/s10844-019-00549-w
SSID ssib031263571
ssj0002710285
Score 2.2872398
Snippet This paper presents a novel metaheuristic binary crow search algorithm (CSA) designed for positive-unlabeled (PU) learning, a paradigm where only positive and...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Index Database
Publisher
StartPage 1729
SubjectTerms Accuracy
Adaptation
Algorithms
Artificial Intelligence
Bias
Classification
Computer Imaging
Computer Science
Datasets
Distance learning
Heuristic methods
Image Processing and Computer Vision
Machine Learning
Medical diagnosis
Methods
Optimization techniques
Original Research
Pattern Recognition and Graphics
Samples
Search algorithms
Social networks
Software Engineering
Support vector machines
Vision
Title BiCSA-PUL: binary crow search algorithm for enhancing positive and unlabeled learning
URI https://link.springer.com/article/10.1007/s41870-024-02367-y
https://www.proquest.com/docview/3255231789
Volume 17
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 2511-2112
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002710285
  issn: 2511-2104
  databaseCode: RSV
  dateStart: 20170301
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV09T8MwED1BYYCBQgFRKMgDG1hK4qRJ2EpFxYCqilLULXJspxRBivqF-u85O0kLCAZY82FF57PvXXz3HsB54luSOVZM7VjVMUFhgvJE_23ylIg1gTpeMWITfrsd9PthJ28KmxTV7sWRpNmpl81urh1okRTHpZr13KeLddjAcBdowYb77mPhRczW_Co5yHk2R2s6iOpaRg2nKeY4bt498_OwXyPUCnZ-Oyk1AahV_t-n78JODjhJI_OQPVhTaQXKhZgDydd2BbY_MRPuQ-962Ow2aKd3d0Vi07JL8GvfSbYwCH8ZjMbD6dMrQcxLVPqkWTvSAclKwOaK8FSSWYoehlFNklyaYnAAvdbNQ_OW5goMVGAcX1AW20noSl_6iVQOt5yYSeVyhTPsitATOnnEHdPngQh8aSvHFpyLxHHx9bqTcHYIpXSUqiMgSjHEnoldTwTuG0qEyvM8weuSWTETlqzCRWH16C0j2oiWlMrGfhHaLzL2ixZVqBUTE-WLbhIxTI8QrvpBWIXLYiJWt38f7fhvj5_AlqNVgE39Tg1K0_FMncKmmE-Hk_GZccYPc0zYXA
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8MwDLZ4ScCBwQAxnjlwg0ht064tN0BMIMaEYEO7VWmSbkNQ0F5o_x4nbcdDcIBr20SR48Sfa_szwGHiW5I5VkztWFXRQWGC8kT_bfKUiDWBOj4xzSb8RiNot8PbvChsUGS7FyFJc1NPi91cO9BNUhyXatZzn05mYd5Fi6UZ8-_uHwotYrbmV8lBzqMJrWkjqnMZNZym6OO4efXMz9N-tVAfsPNbpNQYoFrpf0tfhZUccJLTTEPWYEalZSgVzRxIfrbLsPyJmXAdWme98_tTetuqn5DYlOwSXO0byQ4G4U-dl35v2H0miHmJSruatSPtkCwFbKwITyUZpahhaNUkyVtTdDagVbtonl_SvAMDFWjHJ5TFdhK60pd-IpXDLSdmUrlc4Q67IvSEdh7xxvR5IAJf2sqxBecicVwcXnUSzjZhLn1J1RYQpRhiz8SuJgLvDSVC5Xme4FXJrJgJS1bgqJB69JoRbURTSmUjvwjlFxn5RZMK7BYbE-WHbhAxdI8QrvpBWIHjYiM-Xv8-2_bfPj-AxcvmTT2qXzWud2DJ0R2BTS7PLswN-yO1BwtiPOwN-vtGMd8BoLHbQA
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8JAEJ4oGqMHH6gRRd2DN93YdlvaesMH0UgICWK4Ndt9AEYLAdTw793dtohGD8ZrH5t2Znbnm92ZbwBOpG9x4lgxtmNRUQEKYZhKvdvkCRZrAnV1xTSb8BuNoNMJm3NV_CbbPT-STGsaNEtTMjkfcnk-K3xz7UA3THFcrBnQfTxdhCVXJ9LreL31mFsUsTXXSgZ4nswxm3aoOq9RQ2us4h03q6T5ediv3uoTgn47NTXOqLbx_9_YhPUMiKJqajlbsCCSImzkTR5QNueLsDbHWLgN7cv-VauKm-36BYpNKS9SX_6O0gmD6HN3MOpPei9IYWEkkp5m80i6KE0NexOIJhy9JsrylLfjKGtZ0d2Bdu3m4eoWZ50ZMFP-fYpJbMvQ5T73JRcOtZyYcOFSoTTvstBjOqhUK6lPAxb43BaOzShl0nHV6xVHUrILhWSQiD1AQhCFSaVdkUytJ4KFwvM8RiucWDFhFi_Baa6BaJgScEQzqmUjv0jJLzLyi6YlKOdKirLJOI6ICpsUjPWDsARnuVI-b_8-2v7fHj-GleZ1LarfNe4PYNXRjYJNik8ZCpPRqziEZfY26Y9HR8ZGPwBt6eQk
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=BiCSA-PUL%3A+binary+crow+search+algorithm+for+enhancing+positive+and+unlabeled+learning&rft.jtitle=International+journal+of+information+technology+%28Singapore.+Online%29&rft.au=Azizi%2C+Nabil&rft.au=Ben+Othmane%2C+Mohamed&rft.au=Hamouma%2C+Moumen&rft.au=Siam%2C+Abderrahim&rft.date=2025-04-01&rft.issn=2511-2104&rft.eissn=2511-2112&rft.volume=17&rft.issue=3&rft.spage=1729&rft.epage=1743&rft_id=info:doi/10.1007%2Fs41870-024-02367-y&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s41870_024_02367_y
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2511-2104&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2511-2104&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2511-2104&client=summon