I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
An Adaptive Graph Cut Algorithm for Spammer Group Detection..:
, In:
2021 2nd International Conference on Robotics, Electrical and Signal Processing Techniques (ICREST)
,
Sultana, Naznin
;
Palaniappan, Sellappan
;
Saha, Pratim
- p. 21-26 , 2021
Link:
https://doi.org/10.1109/ICREST51555.2021.9331015
RT T1 <cTitle>2021 2nd International Conference on Robotics, Electrical and Signal Processing Techniques (ICREST)</cTitle>: T1 <Title>An Adaptive Graph Cut Algorithm for Spammer Group Detection from Weighted One Mode Projection of Bipartite Graph</Title> UL https://suche.suub.uni-bremen.de/peid=ieee-9331015&Exemplar=1&LAN=DE A1 Sultana, Naznin A1 Palaniappan, Sellappan A1 Saha, Pratim YR 2021 K1 Machine learning algorithms K1 Signal processing algorithms K1 Signal processing K1 Feature extraction K1 Usability K1 Robots K1 Business K1 opinion mining K1 spammer group K1 bipartite projection graph K1 connected components K1 divide and conquer SP 21 OP 26 LK http://dx.doi.org/https://doi.org/10.1109/ICREST51555.2021.9331015 DO https://doi.org/10.1109/ICREST51555.2021.9331015 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
