{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T14:22:47Z","timestamp":1779286967320,"version":"3.51.4"},"reference-count":80,"publisher":"Springer Science and Business Media LLC","issue":"19","license":[{"start":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T00:00:00Z","timestamp":1688428800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T00:00:00Z","timestamp":1688428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100022664","name":"Universidad de Le\u00f3n","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100022664","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The anonymity and high security of the Tor network allow it to host a significant amount of criminal activities. Some Tor domains attract more traffic than others, as they offer better products or services to their customers. Detecting the most influential domains in Tor can help detect serious criminal activities. Therefore, in this paper, we present a novel supervised ranking framework for detecting the most influential domains. Our approach represents each domain with 40 features extracted from five sources: text, named entities, HTML markup, network topology, and visual content to train the learning-to-rank (LtR) scheme to sort the domains based on user-defined criteria. We experimented on a subset of 290 manually ranked drug-related websites from Tor and obtained the following results. First, among the explored LtR schemes, the listwise approach outperforms the benchmarked methods with an NDCG of 0.93 for the top-10 ranked domains. Second, we quantitatively proved that our framework surpasses the link-based ranking techniques. Third, we observed that using the user-visible text feature can obtain comparable performance to all the features with a decrease of 0.02 at NDCG@5. The proposed framework might support law enforcement agencies in detecting the most influential domains related to possible suspicious activities.<\/jats:p>","DOI":"10.1007\/s10489-023-04671-9","type":"journal-article","created":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T12:03:01Z","timestamp":1688472181000},"page":"22952-22968","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Supervised ranking approach to identify infLuential websites in the darknet"],"prefix":"10.1007","volume":"53","author":[{"given":"MHD Wesam","family":"Al Nabki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Fidalgo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrique","family":"Alegre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deisy","family":"Chaves","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,4]]},"reference":[{"key":"4671_CR1","unstructured":"The Tor\u00a0Project I (2022) Who uses Tor? Accessed: 17 April 2022. https:\/\/www.torproject.org\/about\/torusers.html.en"},{"key":"4671_CR2","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.eswa.2019.01.029","volume":"123","author":"MW Al-Nabki","year":"2019","unstructured":"Al-Nabki MW, Fidalgo E, Alegre E, Fern\u00e1ndez-Robles L (2019) Torank: Identifying the most influential suspicious domains in the tor network. Expert Syst Appl 123:212\u2013226. https:\/\/doi.org\/10.1016\/j.eswa.2019.01.029","journal-title":"Expert Syst Appl"},{"key":"4671_CR3","doi-asserted-by":"crossref","unstructured":"Choshen L, Eldad D, Hershcovich D, Sulem E, Abend O (2019) The language of legal and illegal activity on the darknet. In: Proc. of ACL","DOI":"10.18653\/v1\/P19-1419"},{"issue":"5","key":"4671_CR4","doi-asserted-by":"publisher","first-page":"1798","DOI":"10.1093\/rfs\/hhz015","volume":"32","author":"S Foley","year":"2019","unstructured":"Foley S, Karlsen JR, Putni\u0146\u0161 TJ (2019) Sex, drugs, and bitcoin: How much illegal activity is financed through cryptocurrencies? The Review of Financial Studies 32(5):1798\u20131853","journal-title":"The Review of Financial Studies"},{"issue":"1","key":"4671_CR5","first-page":"24","volume":"1","author":"MW Al Nabki","year":"2017","unstructured":"Al Nabki MW, Fidalgo E, Alegre E, Gonz\u00e1lez-Castro V (2017) Detecting emerging products in tor network based on k-shell graph decomposition. III Jornadas Nacionales de Investigaci\u00f3n en Ciberseguridad (JNIC) 1(1):24\u201330","journal-title":"III Jornadas Nacionales de Investigaci\u00f3n en Ciberseguridad (JNIC)"},{"key":"4671_CR6","first-page":"1","volume":"9","author":"V Ciancaglini","year":"2013","unstructured":"Ciancaglini V, Balduzzi M, Goncharov M, McArdle R (2013) Deepweb and cybercrime. Trend Micro Report 9:1\u201322","journal-title":"Deepweb and cybercrime. Trend Micro Report"},{"key":"4671_CR7","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.drugpo.2018.03.016","volume":"56","author":"L Norbutas","year":"2018","unstructured":"Norbutas L (2018) Offline constraints in online drug marketplaces: An exploratory analysis of a cryptomarket trade network. International Journal of Drug Policy 56:92\u2013100","journal-title":"International Journal of Drug Policy"},{"key":"4671_CR8","unstructured":"Anjum A, Kaur C, Kondapalli S, Hussain M, Begum A, Hassen S, Boush D, Benjeed A, Abdulraheem D (2021) A mysterious and darkside of the darknet: A qualitative study. Webology 18(4)"},{"key":"4671_CR9","doi-asserted-by":"crossref","unstructured":"Wang V, Gee J, Button M (2022) In: Gill M (ed.) Crime on the Darknet The Case of Brand Abuse pp. 447\u2013467. Springer, Cham","DOI":"10.1007\/978-3-030-91735-7_21"},{"issue":"12","key":"4671_CR10","doi-asserted-by":"publisher","first-page":"2515","DOI":"10.1109\/TIFS.2015.2465934","volume":"10","author":"Z Ling","year":"2015","unstructured":"Ling Z, Luo J, Wu K, Yu W, Fu X (2015) Torward: Discovery, blocking, and traceback of malicious traffic over tor. IEEE Trans Inf Forensics Secur 10(12):2515\u20132530","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"4671_CR11","doi-asserted-by":"publisher","unstructured":"Biswas R, Fidalgo E, Alegre E (2017) Recognition of service domains on tor dark net using perceptual hashing and image classification techniques. In: 8th International Conference on Imaging for Crime Detection and Prevention (ICDP 2017) pp. 7\u201312. https:\/\/doi.org\/10.1049\/ic.2017.0041","DOI":"10.1049\/ic.2017.0041"},{"key":"4671_CR12","doi-asserted-by":"crossref","unstructured":"Al\u00a0Nabki MW, Fidalgo E, Alegre E, de Paz I (2017) Classifying illegal activities on tor network based on web textual contents. In: Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers vol. 1 pp. 35\u201343","DOI":"10.18653\/v1\/E17-1004"},{"issue":"5","key":"4671_CR13","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.emj.2008.05.003","volume":"26","author":"G Probst","year":"2008","unstructured":"Probst G, Borzillo S (2008) Why communities of practice succeed and why they fail. Eur Manag J 26(5):335\u2013347","journal-title":"Eur Manag J"},{"key":"4671_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.neucom.2017.01.123","volume":"326\u2013327","author":"SA R\u00edos","year":"2019","unstructured":"R\u00edos SA, Aguilera F, Nu\u00f1ez-Gonzalez JD, Gra\u00f1a M (2019) Semantically enhanced network analysis for influencer identification in online social networks. Neurocomputing 326\u2013327:71\u201381","journal-title":"Neurocomputing"},{"issue":"1","key":"4671_CR15","first-page":"23","volume":"3","author":"A Bourhis","year":"2005","unstructured":"Bourhis A, Dub\u00e9 L, Jacob R et al (2005) The success of virtual communities of practice: The leadership factor. The Electronic Journal of Knowledge Management 3(1):23\u201334","journal-title":"The Electronic Journal of Knowledge Management"},{"key":"4671_CR16","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/j.eswa.2017.10.006","volume":"92","author":"AB Eliacik","year":"2018","unstructured":"Eliacik AB, Erdogan N (2018) Influential user weighted sentiment analysis on topic based microblogging community. Expert Syst Appl 92:403\u2013418","journal-title":"Expert Syst Appl"},{"key":"4671_CR17","doi-asserted-by":"crossref","unstructured":"Berzinji A, Kaati L, Rezine A (2012) Detecting key players in terrorist networks. In: Intelligence and Security Informatics Conference (EISIC), 2012 European pp. 297\u2013302. IEEE","DOI":"10.1109\/EISIC.2012.13"},{"issue":"1","key":"4671_CR18","first-page":"27","volume":"2","author":"FS Gohari","year":"2014","unstructured":"Gohari FS, Mohammadi S (2014) A comprehensive framework for identifying viral marketing\u2019s influencers in twitter. International SAMANM Journal of Marketing and Management 2(1):27\u201343","journal-title":"International SAMANM Journal of Marketing and Management"},{"key":"4671_CR19","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.drugalcdep.2017.05.018","volume":"178","author":"J Nurmi","year":"2017","unstructured":"Nurmi J, Kaskela T, Per\u00e4l\u00e4 J, Oksanen A (2017) Seller\u2019s reputation and capacity on the illicit drug markets: 11-month study on the finnish version of the silk road. Drug Alcohol Depend 178:201\u2013207. https:\/\/doi.org\/10.1016\/j.drugalcdep.2017.05.018","journal-title":"Drug Alcohol Depend"},{"issue":"3","key":"4671_CR20","first-page":"515","volume":"12","author":"RA Hardy","year":"2016","unstructured":"Hardy RA, Norgaard JR (2016) Reputation in the internet black market: an empirical and theoretical analysis of the deep web. J Inst Econ 12(3):515\u2013539","journal-title":"J Inst Econ"},{"key":"4671_CR21","unstructured":"Accessed: 17 May 2022 (2019). https:\/\/blog.torproject.org\/one-cell-enough-break-tors-anonymity"},{"key":"4671_CR22","doi-asserted-by":"crossref","unstructured":"Chaabane A, Manils P, Kaafar MA (2010) Digging into anonymous traffic: A deep analysis of the tor anonymizing network. In: 2010 Fourth International Conference on Network and System Security pp. 167\u2013174. IEEE","DOI":"10.1109\/NSS.2010.47"},{"key":"4671_CR23","doi-asserted-by":"crossref","unstructured":"Biryukov A, Pustogarov I, Thill F, Weinmann RP (2014) Content and popularity analysis of tor hidden services. In: Distributed Computing Systems Workshops (ICDCSW), 2014 IEEE 34th International Conference On pp. 188\u2013193. IEEE","DOI":"10.1109\/ICDCSW.2014.20"},{"key":"4671_CR24","doi-asserted-by":"crossref","unstructured":"Elahi T, Bauer K, AlSabah M, Dingledine R, Goldberg I (2012) Changing of the guards: A framework for understanding and improving entry guard selection in tor. In: Proceedings of the 2012 ACM Workshop on Privacy in the Electronic Society pp. 43\u201354. ACM","DOI":"10.1145\/2381966.2381973"},{"key":"4671_CR25","unstructured":"Page L, Brin S, Motwani R, Winograd T (November 1999) The pagerank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab . http:\/\/ilpubs.stanford.edu:8090\/422\/"},{"issue":"5","key":"4671_CR26","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg JM (1999) Authoritative sources in a hyperlinked environment. Journal of the ACM (JACM) 46(5):604\u2013632","journal-title":"Journal of the ACM (JACM)"},{"issue":"1","key":"4671_CR27","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18(1):39\u201343","journal-title":"Psychometrika"},{"issue":"4","key":"4671_CR28","first-page":"24","volume":"11","author":"M Bernaschi","year":"2017","unstructured":"Bernaschi M, Celestini A, Guarino S, Lombardi F (2017) Exploring and analyzing the tor hidden services graph. ACM Transactions on the Web (TWEB) 11(4):24","journal-title":"ACM Transactions on the Web (TWEB)"},{"issue":"10","key":"4671_CR29","doi-asserted-by":"publisher","first-page":"1854","DOI":"10.1587\/transinf.E94.D.1854","volume":"94","author":"H Li","year":"2011","unstructured":"Li H (2011) A short introduction to learning to rank. IEICE Trans Inf Syst 94(10):1854\u20131862","journal-title":"IEICE Trans Inf Syst"},{"issue":"7","key":"4671_CR30","doi-asserted-by":"publisher","first-page":"3107","DOI":"10.1007\/s00521-017-3257-4","volume":"31","author":"J Yao","year":"2019","unstructured":"Yao J, Liu F, Geng Y (2019) Query-specific optimal convolutional neural ranker. Neural Comput Appl 31(7):3107\u20133116","journal-title":"Neural Comput Appl"},{"issue":"1","key":"4671_CR31","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s00521-018-3640-9","volume":"31","author":"W Yu","year":"2019","unstructured":"Yu W, Li S, Tang X, Wang K (2019) An efficient top-k ranking method for service selection based on $$\\varepsilon $$-admopso algorithm. Neural Comput Appl 31(1):77\u201392","journal-title":"Neural Comput Appl"},{"key":"4671_CR32","unstructured":"Dean B (2018) Google\u2019s 200 Ranking Factors: The Complete List. Accessed: 17 April 2022. https:\/\/backlinko.com\/google-ranking-factors"},{"key":"4671_CR33","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.forsciint.2016.02.045","volume":"264","author":"J Bros\u00e9us","year":"2016","unstructured":"Bros\u00e9us J, Rhumorbarbe D, Mireault C, Ouellette V, Crispino F, D\u00e9cary-H\u00e9tu D (2016) Studying illicit drug trafficking on darknet markets: structure and organisation from a canadian perspective. Forensic Sci Int 264:7\u201314","journal-title":"Forensic Sci Int"},{"key":"4671_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.drugpo.2016.07.005","volume":"35","author":"MJ Barratt","year":"2016","unstructured":"Barratt MJ, Aldridge J (2016) Everything you always wanted to know about drug cryptomarkets*(* but were afraid to ask). International Journal of Drug Policy 35:1\u20136","journal-title":"International Journal of Drug Policy"},{"issue":"11","key":"4671_CR35","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1016\/j.drugpo.2015.01.008","volume":"26","author":"DS Dolliver","year":"2015","unstructured":"Dolliver DS (2015) Evaluating drug trafficking on the tor network: Silk road 2, the sequel. International Journal of Drug Policy 26(11):1113\u20131123","journal-title":"International Journal of Drug Policy"},{"issue":"3","key":"4671_CR36","first-page":"40","volume":"10","author":"G Weimann","year":"2016","unstructured":"Weimann G (2016) Terrorist migration to the dark web. Perspectives on Terrorism 10(3):40\u201344","journal-title":"Perspectives on Terrorism"},{"issue":"8","key":"4671_CR37","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1002\/asi.20838","volume":"59","author":"H Chen","year":"2008","unstructured":"Chen H, Chung W, Qin J, Reid E, Sageman M, Weimann G (2008) Uncovering the dark web: A case study of jihad on the web. J Am Soc Inform Sci Technol 59(8):1347\u20131359","journal-title":"J Am Soc Inform Sci Technol"},{"key":"4671_CR38","doi-asserted-by":"publisher","unstructured":"Nunes E, Diab A, Gunn A, Marin E, Mishra V, Paliath V, Robertson J, Shakarian J, Thart A, Shakarian P (2016) Darknet and deepnet mining for proactive cybersecurity threat intelligence. In: IEEE International Conference on Intelligence and Security Informatics: Cybersecurity and Big Data, ISI 2016, pp. 7\u201312. Institute of Electrical and Electronics Engineers Inc., United States. https:\/\/doi.org\/10.1109\/ISI.2016.7745435","DOI":"10.1109\/ISI.2016.7745435"},{"key":"4671_CR39","doi-asserted-by":"crossref","unstructured":"Chen H (2011) Dark Web: Exploring and Data Mining the Dark Side of the Web. Springer","DOI":"10.1007\/978-1-4614-1557-2"},{"key":"4671_CR40","doi-asserted-by":"crossref","unstructured":"Wasserman S, Faust K (1994) Social Network Analysis: Methods and Applications. Cambridge University press","DOI":"10.1017\/CBO9780511815478"},{"key":"4671_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.tele.2020.101504","volume":"56","author":"Y-J Choi","year":"2021","unstructured":"Choi Y-J, Jeon B-J, Kim H-W (2021) Identification of key cyberbullies: A text mining and social network analysis approach. Telematics Inform 56:101504","journal-title":"Telematics Inform"},{"key":"4671_CR42","doi-asserted-by":"crossref","unstructured":"Oroh AJ, Bandung Y, Zagi LM (2021) Detection of the key actor of issues spreading based on social network analysis in twitter social media. In: 2021 IEEE Asia Pacific Conference on Wireless and Mobile (APWiMob), pp. 206\u2013212. IEEE","DOI":"10.1109\/APWiMob51111.2021.9435268"},{"issue":"6","key":"4671_CR43","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIFS.2015.2407313","volume":"10","author":"T Anwar","year":"2015","unstructured":"Anwar T, Abulaish M (2015) Ranking radically influential web forum users. IEEE Trans Inf Forensics Secur 10(6):1289\u20131298","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"4671_CR44","doi-asserted-by":"crossref","unstructured":"Liu TY, et al (2009) Learning to rank for information retrieval. Foundations and Trends\u00ae in Information Retrieval 3(3), 225\u2013331","DOI":"10.1561\/1500000016"},{"key":"4671_CR45","doi-asserted-by":"publisher","unstructured":"Jiang H, Nie L, Sun Z, Ren Z, Kong W, Zhang T, Luo X (2016) Rosf: Leveraging information retrieval and supervised learning for recommending code snippets. IEEE Transactions on Services Computing 34\u201346. https:\/\/doi.org\/10.1109\/TSC.2016.2592909","DOI":"10.1109\/TSC.2016.2592909"},{"issue":"5","key":"4671_CR46","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/s10791-012-9209-9","volume":"16","author":"C Macdonald","year":"2013","unstructured":"Macdonald C, Santos RLT, Ounis I (2013) The whens and hows of learning to rank for web search. Inf Retrieval 16(5):584\u2013628. https:\/\/doi.org\/10.1007\/s10791-012-9209-9","journal-title":"Inf Retrieval"},{"issue":"3","key":"4671_CR47","doi-asserted-by":"publisher","first-page":"3156","DOI":"10.1007\/s10489-021-02592-z","volume":"52","author":"E Ghanbari","year":"2022","unstructured":"Ghanbari E, Shakery A (2022) A learning to rank framework based on cross-lingual loss function for cross-lingual information retrieval. Appl Intell 52(3):3156\u20133174","journal-title":"Appl Intell"},{"key":"4671_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TSC.2018.2789893","volume":"1","author":"J Li","year":"2018","unstructured":"Li J, Xing Z, Kabir A (2018) Leveraging official content and social context to recommend software documentation. IEEE Trans Serv Comput 1:1\u20131","journal-title":"IEEE Trans Serv Comput"},{"key":"4671_CR49","doi-asserted-by":"crossref","unstructured":"Agichtein E, Brill E, Dumais S (2006) Improving web search ranking by incorporating user behavior information. In: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval pp. 19\u201326. ACM","DOI":"10.1145\/1148170.1148177"},{"key":"4671_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TSC.2017.2777487","volume":"01","author":"S Wang","year":"2017","unstructured":"Wang S, Zou Y, Ng J, Ng T (2017) Context-aware service input ranking by learning from historical information. IEEE Trans Serv Comput 01:1\u20131. https:\/\/doi.org\/10.1109\/TSC.2017.2777487","journal-title":"IEEE Trans Serv Comput"},{"key":"4671_CR51","unstructured":"Duan Y, Jiang L, Qin T, Zhou M, Shum HY (2010) An empirical study on learning to rank of tweets. In: Proceedings of the 23rd International Conference on Computational Linguistics pp. 295\u2013303. Association for Computational Linguistics"},{"key":"4671_CR52","doi-asserted-by":"crossref","unstructured":"Li M, Luo L, Miao L, Xue Y, Zhao Z, Wang Z (2016) Friendrank: A personalized approach for tweets ranking in social networks. In: Advances in Social Networks Analysis and Mining (ASONAM), 2016 IEEE\/ACM International Conference On pp. 896\u2013900. IEEE","DOI":"10.1109\/ASONAM.2016.7752345"},{"key":"4671_CR53","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109220","volume":"251","author":"C Liu","year":"2022","unstructured":"Liu C, Cao T, Zhou L (2022) Learning to rank complex network node based on the self-supervised graph convolution model. Knowl-Based Syst 251:109220. https:\/\/doi.org\/10.1016\/j.knosys.2022.109220","journal-title":"Knowl-Based Syst"},{"key":"4671_CR54","doi-asserted-by":"crossref","unstructured":"Li R, Lei KH, Khadiwala R, Chang KCC (2012) Tedas: A twitter-based event detection and analysis system. In: Data Engineering (icde), 2012 Ieee 28th International Conference On pp. 1273\u20131276. IEEE","DOI":"10.1109\/ICDE.2012.125"},{"key":"4671_CR55","doi-asserted-by":"publisher","unstructured":"Hucka M (2018) Nostril: A nonsense string evaluator written in python. Journal of Open Source Software 3(25), 596. https:\/\/doi.org\/10.21105\/joss.00596","DOI":"10.21105\/joss.00596"},{"key":"4671_CR56","doi-asserted-by":"crossref","unstructured":"Rivest R (1992) The md5 message-digest algorithm. Internet Engineering Task Force","DOI":"10.17487\/rfc1321"},{"key":"4671_CR57","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.neucom.2019.11.072","volume":"382","author":"MW Al-Nabki","year":"2020","unstructured":"Al-Nabki MW, Fidalgo E, Alegre E, Fern\u00e1ndez-Robles L (2020) Improving named entity recognition in noisy user-generated text with local distance neighbor feature. Neurocomputing 382:1\u201311","journal-title":"Neurocomputing"},{"key":"4671_CR58","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1162\/tacl_a_00386","volume":"9","author":"A Ghaddar","year":"2021","unstructured":"Ghaddar A, Langlais P, Rashid A, Rezagholizadeh M (2021) Context-aware adversarial training for name regularity bias in named entity recognition. Transactions of the Association for Computational Linguistics 9:586\u2013604","journal-title":"Transactions of the Association for Computational Linguistics"},{"issue":"27","key":"4671_CR59","doi-asserted-by":"publisher","first-page":"11150","DOI":"10.1073\/pnas.0701175104","volume":"104","author":"S Carmi","year":"2007","unstructured":"Carmi S, Havlin S, Kirkpatrick S, Shavitt Y, Shir E (2007) A model of internet topology using k-shell decomposition. Proc Natl Acad Sci 104(27):11150\u201311154","journal-title":"Proc Natl Acad Sci"},{"key":"4671_CR60","doi-asserted-by":"crossref","unstructured":"Szegedy C, Ioffe S, Vanhoucke V, Alemi AA (2017) Inception-v4, inception-resnet and the impact of residual connections on learning. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA. pp. 4278\u20134284","DOI":"10.1609\/aaai.v31i1.11231"},{"issue":"3","key":"4671_CR61","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification. Social networks 1(3):215\u2013239","journal-title":"Social networks"},{"issue":"1","key":"4671_CR62","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"MEJ Newman","year":"2005","unstructured":"Newman MEJ (2005) A measure of betweenness centrality based on random walks. Social Networks 27(1):39\u201354. https:\/\/doi.org\/10.1016\/j.socnet.2004.11.009","journal-title":"Social Networks"},{"issue":"4","key":"4671_CR63","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/S0378-8733(00)00031-9","volume":"22","author":"B Ruhnau","year":"2000","unstructured":"Ruhnau B (2000) Eigenvector-centrality - a node-centrality? Social Networks 22(4):357\u2013365. https:\/\/doi.org\/10.1016\/S0378-8733(00)00031-9","journal-title":"Social Networks"},{"key":"4671_CR64","doi-asserted-by":"crossref","unstructured":"G\u00f3mez S (2019) Centrality in networks: Finding the most important nodes. In: Business and Consumer Analytics: New Ideas, pp. 401\u2013433. Springer","DOI":"10.1007\/978-3-030-06222-4_8"},{"issue":"1","key":"4671_CR65","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-031-02155-8","volume":"4","author":"H Li","year":"2011","unstructured":"Li H (2011) Learning to rank for information retrieval and natural language processing. Synthesis Lectures on Human Language Technologies 4(1):1\u2013113","journal-title":"Synthesis Lectures on Human Language Technologies"},{"issue":"5","key":"4671_CR66","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"JH Friedman","year":"2001","unstructured":"Friedman JH (2001) Greedy function approximation: A gradient boosting machine. Ann. Statist. 29(5):1189\u20131232. https:\/\/doi.org\/10.1214\/aos\/1013203451","journal-title":"Ann. Statist."},{"key":"4671_CR67","doi-asserted-by":"crossref","unstructured":"Ciaramita M, Murdock V, Plachouras V (2008) Online learning from click data for sponsored search. In: Proceedings of the 17th International Conference on World Wide Web pp. 227\u2013236. ACM","DOI":"10.1145\/1367497.1367529"},{"key":"4671_CR68","doi-asserted-by":"crossref","unstructured":"Burges C, Shaked T, Renshaw E, Lazier A, Deeds M, Hamilton N, Hullender G (2005) Learning to rank using gradient descent. In: Proceedings of the 22nd International Conference on Machine Learning pp. 89\u201396. ACM","DOI":"10.1145\/1102351.1102363"},{"key":"4671_CR69","doi-asserted-by":"crossref","unstructured":"Xia F, Liu TY, Wang J, Zhang W, Li H (2008) Listwise approach to learning to rank: theory and algorithm. In: Proceedings of the 25th International Conference on Machine Learning pp. 1192\u20131199. ACM","DOI":"10.1145\/1390156.1390306"},{"key":"4671_CR70","doi-asserted-by":"crossref","unstructured":"Cao Z, Qin T, Liu TY, Tsai MF, Li H (2007) Learning to rank: from pairwise approach to listwise approach. In: Proceedings of the 24th International Conference on Machine Learning pp. 129\u2013136. ACM","DOI":"10.1145\/1273496.1273513"},{"key":"4671_CR71","doi-asserted-by":"crossref","unstructured":"Ceberio J, Mendiburu A, Lozano JA (2013) The plackett-luce ranking model on permutation-based optimization problems. In: 2013 IEEE Congress on Evolutionary Computation, pp. 494\u2013501. IEEE","DOI":"10.1109\/CEC.2013.6557609"},{"key":"4671_CR72","doi-asserted-by":"crossref","unstructured":"J\u00e4rvelin K, Kek\u00e4l\u00e4inen J (2000) Ir evaluation methods for retrieving highly relevant documents. In: Proceedings of the 23rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval pp. 41\u201348. ACM","DOI":"10.1145\/345508.345545"},{"issue":"1","key":"4671_CR73","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1017\/S1351324909005129","volume":"16","author":"C Manning","year":"2010","unstructured":"Manning C, Raghavan P, Sch\u00fctze H (2010) Introduction to information retrieval. Nat Lang Eng 16(1):100\u2013103","journal-title":"Nat Lang Eng"},{"issue":"6","key":"4671_CR74","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1109\/TC.2012.62","volume":"62","author":"H Lai","year":"2013","unstructured":"Lai H, Pan Y, Liu C, Lin L, Wu J (2013) Sparse learning-to-rank via an efficient primal-dual algorithm. IEEE Trans Comput 62(6):1221\u20131233","journal-title":"IEEE Trans Comput"},{"key":"4671_CR75","unstructured":"Xu B, Wang N, Chen T, Li M (2015) Empirical evaluation of rectified activations in convolutional network. In: Deep Learning Workshop, ICML 15"},{"issue":"8","key":"4671_CR76","doi-asserted-by":"publisher","first-page":"1771","DOI":"10.1162\/089976602760128018","volume":"14","author":"GE Hinton","year":"2002","unstructured":"Hinton GE (2002) Training products of experts by minimizing contrastive divergence. Neural Comput 14(8):1771\u20131800","journal-title":"Neural Comput"},{"key":"4671_CR77","doi-asserted-by":"crossref","unstructured":"Cao Y, Xu J, Liu TY, Li H, Huang Y, Hon HW (2006) Adapting ranking svm to document retrieval. In: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval pp. 186\u2013193. ACM","DOI":"10.1145\/1148170.1148205"},{"issue":"1","key":"4671_CR78","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep30308","volume":"6","author":"Y Cong","year":"2016","unstructured":"Cong Y, Chan Y-B, Ragan MA (2016) A novel alignment-free method for detection of lateral genetic transfer based on tf-idf. Sci Rep 6(1):1\u201313","journal-title":"Sci Rep"},{"issue":"3","key":"4671_CR79","doi-asserted-by":"publisher","first-page":"1166","DOI":"10.3390\/app10031166","volume":"10","author":"K Jiang","year":"2020","unstructured":"Jiang K, Zhang J, Wu H, Wang A, Iwahori Y (2020) A novel digital modulation recognition algorithm based on deep convolutional neural network. Appl Sci 10(3):1166","journal-title":"Appl Sci"},{"key":"4671_CR80","unstructured":"Kenton, JDMWC, Toutanova LK (2019) Bert: Pre-training of deep bidirectional transformers for language understanding. In: Proceedings of naacL-HLT pp. 4171\u20134186"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04671-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-04671-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04671-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T13:30:07Z","timestamp":1697635807000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-04671-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,4]]},"references-count":80,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["4671"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-04671-9","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,4]]},"assertion":[{"value":"25 April 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2023","order":2,"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 conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}