{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:56:15Z","timestamp":1764784575295,"version":"3.41.2"},"reference-count":25,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,1,15]],"date-time":"2021-01-15T00:00:00Z","timestamp":1610668800000},"content-version":"vor","delay-in-days":14,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61873117"],"award-info":[{"award-number":["61873117"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Computational Intelligence and Neuroscience"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>With the rapid development of big data, big data research in the security protection industry has been increasingly regarded as a hot spot. This article mainly aims at solving the problem of predicting the tendency of juvenile delinquency based on the experimental data of juvenile blindly following psychological crime. To solve this problem, this paper proposes a rough ant colony classification algorithm, referred to as RoughAC, which first uses the concept of upper and lower approximate sets in rough sets to determine the degree of membership. In addition, in the ant colony algorithm, we use the membership value to update the pheromone. Experiments show that the algorithm can not only solve the premature convergence problem caused by stagnation near the local optimal solution but also solve the continuous domain and combinatorial optimization problems and achieve better classification results. Moreover, the algorithm has a good effect on predicting classification and can provide guidance for predicting the tendency of juvenile delinquency.<\/jats:p>","DOI":"10.1155\/2021\/6636150","type":"journal-article","created":{"date-parts":[[2021,1,16]],"date-time":"2021-01-16T06:05:08Z","timestamp":1610777108000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Application of Rough Ant Colony Algorithm in Adolescent Psychology"],"prefix":"10.1155","volume":"2021","author":[{"given":"Tao","family":"Cong","sequence":"first","affiliation":[]},{"given":"Lin","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Qihang","family":"Sun","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4772-3607","authenticated-orcid":false,"given":"Yang","family":"Li","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,1,15]]},"reference":[{"key":"e_1_2_10_1_2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-405163-8.00001-6"},{"key":"e_1_2_10_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2016.2591064"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-011-0065-9"},{"key":"e_1_2_10_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.enconman.2014.12.037"},{"key":"e_1_2_10_5_2","unstructured":"NayyarA.andSinghR. Ant colony optimization\u2014computational swarm intelligence technique Proceedings of the International Conference on Computing for Sustainable Global Development March 2016 New Delhi India IEEE."},{"key":"e_1_2_10_6_2","doi-asserted-by":"crossref","unstructured":"Ku-MahamudK. R.andNasirH. J. A. Ant colony algorithm for job scheduling in grid computing Proceedings of the 2010 Fourth Asia International Conference on Mathematical\/Analytical Modelling and Computer Simulation May 2010 Bornea Malaysia IEEE 40\u201345.","DOI":"10.1109\/AMS.2010.21"},{"key":"e_1_2_10_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.proeng.2011.08.515"},{"key":"e_1_2_10_8_2","doi-asserted-by":"crossref","unstructured":"YanK. XueG. andYaoS. W. An optimization ant colony algorithm for composition of semantic web services Proceedings of the Computational Intelligence and Industrial Applications 2009. PACIIA 2009 November 2010 Wuhan China IEEE 262\u2013265.","DOI":"10.1109\/PACIIA.2009.5406653"},{"volume-title":"A New Global Optimization Algorithm Based upon Gradient Search","year":"1997","author":"Zheng L.","key":"e_1_2_10_9_2"},{"key":"e_1_2_10_10_2","first-page":"40","article-title":"Hybrid particle swarm optimization algorithm based on gradient method","volume":"44","author":"Huang J. Z.","year":"2008","journal-title":"Computer Engineering & Applications"},{"key":"e_1_2_10_11_2","first-page":"4401","article-title":"A multi-objective optimization algorithm based on gradient information","volume":"64","author":"Qi R.","year":"2013","journal-title":"CIESC Journal"},{"key":"e_1_2_10_12_2","first-page":"422","article-title":"Multi-granularity search algorithm based on probability statistics","volume":"28","author":"Zhang Q. H.","year":"2015","journal-title":"Pattern Recognition & Artificial Intelligence"},{"key":"e_1_2_10_13_2","doi-asserted-by":"crossref","unstructured":"JayaswalD. J.andZaveriM. A. Probability based search motion estimation algorithm Proceedings of the International Conference on Computational Intelligence Communication Systems and Networks July 2009 Bali Indonesia IEEE 357\u2013362.","DOI":"10.1109\/CICSYN.2009.66"},{"key":"e_1_2_10_14_2","doi-asserted-by":"publisher","DOI":"10.1504\/ijci.2014.064853"},{"key":"e_1_2_10_15_2","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/amm.275-277.2501"},{"key":"e_1_2_10_16_2","doi-asserted-by":"crossref","unstructured":"QinH. ZhouS. HuoL.et al. A new ant colony algorithm based on dynamic local search for TSP Proceedings of the International Conference on Communication Systems & Network Technologies April 2015 Bhopal India IEEE 913\u2013917.","DOI":"10.1109\/CSNT.2015.241"},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-009-0031-y"},{"key":"e_1_2_10_18_2","first-page":"3423","article-title":"Ant colony optimization based on an improvement local search strategy","volume":"6","author":"Yuan X.","year":"2010","journal-title":"Journal of Computational Information Systems"},{"key":"e_1_2_10_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.11.060"},{"key":"e_1_2_10_20_2","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010749.ch26"},{"key":"e_1_2_10_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/bf01001956"},{"key":"e_1_2_10_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2011.03.001"},{"key":"e_1_2_10_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2014.05.009"},{"key":"e_1_2_10_24_2","article-title":"rEDA: reverse estimation of distribution algorithm for classification","volume":"6","author":"Jian C. F.","year":"2015","journal-title":"International Journal of Innovative Computing & Applications"},{"key":"e_1_2_10_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.07.029"}],"container-title":["Computational Intelligence and Neuroscience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2021\/6636150.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2021\/6636150.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/6636150","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T12:27:00Z","timestamp":1722947220000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/6636150"}},"subtitle":[],"editor":[{"given":"Jos\u00e9 Alfredo","family":"Hern\u00e1ndez-P\u00e9rez","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/6636150"],"URL":"https:\/\/doi.org\/10.1155\/2021\/6636150","archive":["Portico"],"relation":{},"ISSN":["1687-5265","1687-5273"],"issn-type":[{"type":"print","value":"1687-5265"},{"type":"electronic","value":"1687-5273"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2020-11-18","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-01-02","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-01-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"6636150"}}