{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T14:38:57Z","timestamp":1754145537377,"version":"3.41.2"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T00:00:00Z","timestamp":1752710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T00:00:00Z","timestamp":1752710400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["71772107"],"award-info":[{"award-number":["71772107"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2023MF070","ZR2020MF044","ZR202102230289"],"award-info":[{"award-number":["ZR2023MF070","ZR2020MF044","ZR202102230289"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Open Research Fund of Anhui Province Engineering Laboratory for Big Data Analysis and Early Warning Technology of Coal Mine Safety","award":["NO. CSBD2022-ZD01"],"award-info":[{"award-number":["NO. CSBD2022-ZD01"]}]},{"name":"Shandong Education Quality Improvement Plan for Postgraduate"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>The problem of collaborative spamming in e-commerce is gradually increasing, and traditional spammer group detection algorithms usually seem cumbersome and time-consuming when dealing with massive user review data. Thus, this research proposes a spammer group detection algorithm based on cascading and clustering of core figures. First, we extract user evaluation features to identify core figures. Then, we use four user interaction features to assess user collusion degree, construct a weighted homogeneous graph by cascading neighbor nodes around core figures, and apply the Louvain weighted clustering algorithm to obtain candidate groups. Finally, we classify candidate groups based on group spam features. Experimental results based on the Amazon reviews dataset demonstrate the algorithm's effectiveness in identifying groups of spammers.<\/jats:p>","DOI":"10.1186\/s42400-024-00313-w","type":"journal-article","created":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T03:03:13Z","timestamp":1752721393000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Spammer group detection based on cascading and clustering of core figures"],"prefix":"10.1186","volume":"8","author":[{"given":"Qianqian","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Chunrong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Ning","family":"Li","sequence":"additional","affiliation":[]},{"given":"Dickson K. W.","family":"Chiu","sequence":"additional","affiliation":[]},{"given":"Xianwen","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Shujuan","family":"Ji","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,17]]},"reference":[{"key":"313_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal S, Mehta S (2018) Social influence maximization using genetic algorithm with dynamic probabilities. In: 2018 eleventh international conference on contemporary computing (IC3). IEEE, pp 1\u20136","DOI":"10.1109\/IC3.2018.8530626"},{"key":"313_CR2","doi-asserted-by":"crossref","unstructured":"Allahbakhsh M, Ignjatovic A, Benatallah B, et al (2013) Collusion detection in online rating systems. In: Web technologies and applications: 15th Asia-Pacific web conference, APWeb 2013, Sydney, Australia, April 4\u20136, 2013. Proceedings 15. Springer, Berlin, pp 196\u2013207","DOI":"10.1007\/978-3-642-37401-2_21"},{"issue":"1","key":"313_CR3","first-page":"25","volume":"36","author":"K Arai","year":"2007","unstructured":"Arai K, Barakbah AR (2007) Hierarchical K-means: an algorithm for centroids initialization for K-means. Rep Fac Sci Eng 36(1):25\u201331","journal-title":"Rep Fac Sci Eng"},{"key":"313_CR4","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes J, et al (2014) Maximizing social influence in nearly optimal time. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, pp 946\u2013957","DOI":"10.1137\/1.9781611973402.70"},{"key":"313_CR5","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"313_CR6","doi-asserted-by":"crossref","unstructured":"Chen W, Yuan Y, Zhang L (2010) Scalable influence maximization in social networks under the linear threshold model. In: 2010 IEEE international conference on data mining. IEEE, pp 88\u201397","DOI":"10.1109\/ICDM.2010.118"},{"issue":"04","key":"313_CR7","doi-asserted-by":"publisher","first-page":"1950011","DOI":"10.1142\/S0218843019500114","volume":"28","author":"R Chen","year":"2019","unstructured":"Chen R, Wu Q, Guo W et al (2019) Overlaping community discovery based on the combination of node influence and \u03b2-connected neighbors. Int J Coop Inf Syst 28(04):1950011","journal-title":"Int J Coop Inf Syst"},{"issue":"2","key":"313_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.4018\/JGIM.2021030104","volume":"29","author":"LC Cheng","year":"2021","unstructured":"Cheng LC, Hu HW, Wu CC (2021) Spammer group detection using machine learning technology for observation of new spammer behavioral features. J Glob Inf Manag 29(2):61\u201376","journal-title":"J Glob Inf Manag"},{"issue":"1","key":"313_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1609\/icwsm.v7i1.14400","volume":"7","author":"G Fei","year":"2013","unstructured":"Fei G, Mukherjee A, Liu B et al (2013) Exploiting burstiness in reviews for review spammer detection. Proc Int AAAI Conf Web Soc Media 7(1):175\u2013184","journal-title":"Proc Int AAAI Conf Web Soc Media"},{"key":"313_CR10","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LVS (2011) Celf++ optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on World wide web, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"313_CR11","doi-asserted-by":"crossref","unstructured":"Guo B, Wang H, Yu Z et al (2017) Detecting the Internet Water Army via comprehensive behavioral features using large-scale E-commerce reviews. In: 2017 International conference on computer, information and telecommunication systems (CITS). IEEE, pp 88\u201392","DOI":"10.1109\/CITS.2017.8035320"},{"issue":"7","key":"313_CR12","doi-asserted-by":"publisher","first-page":"9891","DOI":"10.1007\/s11042-022-13633-1","volume":"82","author":"Y He","year":"2023","unstructured":"He Y, Yang P, Cheng P (2023) Semi-supervised internet water army detection based on graph embedding. Multimed Tools Appl 82(7):9891\u20139912","journal-title":"Multimed Tools Appl"},{"key":"313_CR13","doi-asserted-by":"crossref","unstructured":"Hu M, Xu G, Ma C et al (2019) Detecting review spammer groups in dynamic review networks. In: Proceedings of the ACM turing celebration conference-China. pp 1\u20136","DOI":"10.1145\/3321408.3323077"},{"key":"313_CR14","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.472","volume":"7","author":"N Hussain","year":"2021","unstructured":"Hussain N, Mirza HT, Ali A et al (2021) Spammer group detection and diversification of customers\u2019 reviews. PeerJ Comput Sci 7:e472","journal-title":"PeerJ Comput Sci"},{"key":"313_CR15","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/j.ins.2020.05.084","volume":"536","author":"S Ji","year":"2020","unstructured":"Ji S, Zhang Q, Li J et al (2020) A burst-based unsupervised method for detecting review spammer groups. Inf Sci 536:454\u2013469","journal-title":"Inf Sci"},{"key":"313_CR17","doi-asserted-by":"crossref","unstructured":"Jindal N, Liu B (2008) Opinion spam and analysis. In: Proceedings of the 2008 international conference on web search and data mining, pp 219\u2013230","DOI":"10.1145\/1341531.1341560"},{"key":"313_CR19","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s12626-018-0022-9","volume":"12","author":"Z Li","year":"2018","unstructured":"Li Z, Shimizu A (2018) Impact of online customer reviews on sales outcomes: an empirical study based on prospect theory. Rev Socionetw Strateg 12:135\u2013151","journal-title":"Rev Socionetw Strateg"},{"key":"313_CR20","unstructured":"Li F H, Huang M, Yang Y, et al (2011) Learning to identify review spam. In: Twenty-second international joint conference on artificial intelligence"},{"key":"313_CR21","doi-asserted-by":"crossref","unstructured":"Li H, Fei G, Wang S et al (2017) Bimodal distribution and co-bursting in review spam detection. In: Proceedings of the 26th international conference on world wide web, pp 1063\u20131072","DOI":"10.1145\/3038912.3052582"},{"key":"313_CR22","doi-asserted-by":"crossref","unstructured":"Lim EP, Nguyen VA, Jindal N et al (2010) Detecting product review spammers using rating behaviors. In: Proceedings of the 19th ACM international conference on information and knowledge management. ACM Press, New York, pp 939\u2013948","DOI":"10.1145\/1871437.1871557"},{"issue":"12","key":"313_CR23","doi-asserted-by":"publisher","first-page":"2235","DOI":"10.1109\/TKDE.2018.2876531","volume":"31","author":"S Liu","year":"2018","unstructured":"Liu S, Hooi B, Faloutsos C (2018) A contrast metric for fraud detection in rich graphs. IEEE Trans Knowl Data Eng 31(12):2235\u20132248","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"313_CR24","doi-asserted-by":"publisher","first-page":"1818","DOI":"10.1007\/s11227-023-05537-0","volume":"80","author":"A Mewada","year":"2024","unstructured":"Mewada A, Dewang RK (2024) NRWalk2Vec-HIN: spammer group detection based on heterogeneous information network embedding over social media. J Supercomput 80(2):1818\u20131851","journal-title":"J Supercomput"},{"key":"313_CR25","doi-asserted-by":"crossref","unstructured":"Mukherjee A, Liu B, Glance N (2012) Spotting fake reviewer groups in consumer reviews. In: Proceedings of the 21st international conference on world wide web, pp 191\u2013200","DOI":"10.1145\/2187836.2187863"},{"key":"313_CR27","unstructured":"Observer Network (2023) Amazon Fake Review Chaos Investigated: Positive Reviews Are Worth Hundred of Dollars, Deleting Negative Ones Costs 800 Yuan. Accessed on December 22, 2023, available at http:\/\/finance.sina.com.cn\/roll\/2019-04-18\/doc-ihvhiqax3717268.shtml"},{"key":"313_CR28","doi-asserted-by":"crossref","unstructured":"Ren Y, Zhu H, Zhang J et al (2021) Ensemfdet: an ensemble approach to fraud detection based on bipartite graph. In: 2021 IEEE 37th international conference on data engineering (ICDE). IEEE, pp 2039\u20132044","DOI":"10.1109\/ICDE51399.2021.00197"},{"key":"313_CR29","doi-asserted-by":"crossref","unstructured":"Su C, Wang Y, Zhang L (2014) A new method for community detection using seed nodes. In: 2014 IEEE\/WIC\/ACM international joint conferences on web intelligence (WI) and intelligent agent technologies (IAT) vol 2. IEEE, pp 429-435","DOI":"10.1109\/WI-IAT.2014.129"},{"key":"313_CR30","doi-asserted-by":"crossref","unstructured":"Thahira A, Sabitha S (2021) Graphical framework for review spammer group detection using metadata. In: 2021 2nd international conference on computation, automation and knowledge management (ICCAKM). IEEE, pp 145\u2013150","DOI":"10.1109\/ICCAKM50778.2021.9357734"},{"issue":"6","key":"313_CR31","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1093\/comjnl\/bxv068","volume":"59","author":"Z Wang","year":"2016","unstructured":"Wang Z, Hou T, Song D et al (2016) Detecting review spammer groups via bipartite graph projection. Comput J 59(6):861\u2013874","journal-title":"Comput J"},{"key":"313_CR32","doi-asserted-by":"crossref","unstructured":"Xie S, Wang G, Lin S et al (2012) Review spam detection via temporal pattern discovery. In: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 823\u2013831","DOI":"10.1145\/2339530.2339662"},{"key":"313_CR33","doi-asserted-by":"crossref","unstructured":"Xu C, Zhang J (2015) Combating product review spam campaigns via multiple heterogeneous pairwise features. In: Proceedings of the 2015 SIAM international conference on data mining. Society for Industrial and Applied Mathematics, pp 172\u2013180","DOI":"10.1137\/1.9781611974010.20"},{"key":"313_CR34","doi-asserted-by":"crossref","unstructured":"Xu C, Zhang J (2015) Towards collusive fraud detection in online reviews. In: 2015 IEEE international conference on data mining. IEEE, pp 1051\u20131056","DOI":"10.1109\/ICDM.2015.62"},{"key":"313_CR35","doi-asserted-by":"crossref","unstructured":"Xu B, Liang Z, Jia Y et al (2012) Local community detection using seeds expansion. In: 2012 Second International conference on cloud and green computing. IEEE, pp 557\u2013562","DOI":"10.1109\/CGC.2012.69"},{"key":"313_CR36","doi-asserted-by":"crossref","unstructured":"Ye J, Akoglu L (2015) Discovering opinion spammer groups by network footprints. In: Machine learning and knowledge discovery in databases: European conference, ECML PKDD 2015, Porto, Portugal, September 7\u201311, 2015, Proceedings, Part I 15. Springer International Publishing, pp 267\u2013282","DOI":"10.1007\/978-3-319-23528-8_17"},{"issue":"20","key":"313_CR37","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4686","volume":"30","author":"L Zhang","year":"2018","unstructured":"Zhang L, He G, Cao J et al (2018) Spotting review spammer groups: a cosine pattern and network based method. Concurr Comput Pract Exp 30(20):e4686","journal-title":"Concurr Comput Pract Exp"},{"key":"313_CR38","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.ins.2022.05.086","volume":"606","author":"F Zhang","year":"2022","unstructured":"Zhang F, Yuan S, Zhang P et al (2022a) Detecting review spammer groups based on generative adversarial networks. Inf Sci 606:819\u2013836","journal-title":"Inf Sci"},{"key":"313_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117482","volume":"203","author":"F Zhang","year":"2022","unstructured":"Zhang F, Yuan S, Wu J et al (2022b) Detecting collusive spammers on e-commerce websites based on reinforcement learning and adversarial autoencoder. Expert Syst Appl 203:117482","journal-title":"Expert Syst Appl"},{"issue":"1","key":"313_CR40","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1186\/s42400-023-00159-8","volume":"6","author":"Q Zhang","year":"2023","unstructured":"Zhang Q, Liang Z, Ji S et al (2023a) Detecting fake reviewers in heterogeneous networks of buyers and sellers: a collaborative training-based spammer group algorithm. Cybersecurity 6(1):26","journal-title":"Cybersecurity"},{"issue":"3","key":"313_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2023.103282","volume":"60","author":"F Zhang","year":"2023","unstructured":"Zhang F, Wu J, Zhang P et al (2023b) Detecting collusive spammers with heterogeneous graph attention network. Inf Process Manag 60(3):103282","journal-title":"Inf Process Manag"},{"issue":"2","key":"313_CR42","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1509\/jm.74.2.133","volume":"74","author":"F Zhu","year":"2010","unstructured":"Zhu F, Zhang X (2010) Impact of online consumer reviews on sales: the moderating role of product and consumer characteristics. J Mark 74(2):133\u2013148","journal-title":"J Mark"},{"issue":"2","key":"313_CR43","first-page":"317","volume":"58","author":"C Zhu","year":"2019","unstructured":"Zhu C, Zhao W, Li Q et al (2019) Network embedding-based anomalous density searching for multi-group collaborative fraudsters detection in socialmedia. Comput Mater Contin 58(2):317\u2013333","journal-title":"Comput Mater Contin"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-024-00313-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-024-00313-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-024-00313-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T03:03:21Z","timestamp":1752721401000},"score":1,"resource":{"primary":{"URL":"https:\/\/cybersecurity.springeropen.com\/articles\/10.1186\/s42400-024-00313-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,17]]},"references-count":40,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["313"],"URL":"https:\/\/doi.org\/10.1186\/s42400-024-00313-w","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,17]]},"assertion":[{"value":"5 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"47"}}