{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T13:33:47Z","timestamp":1769002427606,"version":"3.49.0"},"reference-count":36,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2018,2,14]],"date-time":"2018-02-14T00:00:00Z","timestamp":1518566400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12,18]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Since the last decade, the collective intelligent behavior of groups of animals, birds or insects have attracted the attention of researchers. Swarm intelligence is the branch of artificial intelligence that deals with the implementation of intelligent systems by taking inspiration from the collective behavior of social insects and other societies of animals. Many meta-heuristic algorithms based on aggregative conduct of swarms through complex interactions with no supervision have been used to solve complex optimization problems. Data clustering organizes data into groups called clusters, such that each cluster has similar data. It also produces clusters that could be disjoint. Accuracy and efficiency are the important measures in data clustering. Several recent studies describe bio-inspired systems as information processing systems capable of some cognitive ability. However, existing popular bio-inspired algorithms for data clustering ignored good balance between exploration and exploitation for producing better clustering results. In this article, we propose a bio-inspired algorithm, namely social spider optimization (SSO), for clustering that maintains a good balance between exploration and exploitation using female and male spiders, respectively. We compare results of the proposed algorithm SSO with K means and other nature-inspired algorithms such as particle swarm optimization (PSO), ant colony optimization (ACO) and improved bee colony optimization (IBCO). We find it to be more robust as it produces better clustering results. Although SSO solves the problem of getting stuck in the local optimum, it needs to be modified for locating the best solution in the proximity of the generated global solution. Hence, we hybridize SSO with K means, which produces good results in local searches. We compare proposed hybrid algorithms SSO+K means (SSOKC), integrated SSOKC (ISSOKC), and interleaved SSOKC (ILSSOKC) with K means+PSO (KPSO), K means+genetic algorithm (KGA), K means+artificial bee colony (KABC) and interleaved K means+IBCO (IKIBCO) and find better clustering results. We use sum of intra-cluster distances (SICD), average cosine similarity, accuracy and inter-cluster distance to measure and validate the performance and efficiency of the proposed clustering techniques.<\/jats:p>","DOI":"10.1515\/jisys-2017-0178","type":"journal-article","created":{"date-parts":[[2018,2,14]],"date-time":"2018-02-14T05:01:16Z","timestamp":1518584476000},"page":"311-326","source":"Crossref","is-referenced-by-count":8,"title":["A Novel Bio-Inspired Algorithm Based on Social Spiders for Improving Performance and Efficiency of Data Clustering"],"prefix":"10.1515","volume":"29","author":[{"given":"Ravi Chandran","family":"Thalamala","sequence":"first","affiliation":[{"name":"National Institute of Technology , Trichy, Tamil Nadu , India"}]},{"given":"A.","family":"Venkata Swamy Reddy","sequence":"additional","affiliation":[{"name":"National Institute of Technology , Trichy, Tamil Nadu , India"}]},{"given":"B.","family":"Janet","sequence":"additional","affiliation":[{"name":"National Institute of Technology , Trichy, Tamil Nadu , India"}]}],"member":"374","published-online":{"date-parts":[[2018,2,14]]},"reference":[{"key":"2025120523331659972_j_jisys-2017-0178_ref_001","doi-asserted-by":"crossref","unstructured":"A. Ahmadyfard and H. Modares, Combining PSO and k-means to enhance data clustering, in: Telecommunications, 2008. IST 2008. International Symposium on, pp. 688\u2013691, IEEE, Tehran, Iran, 2008.","DOI":"10.1109\/ISTEL.2008.4651388"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_002","doi-asserted-by":"crossref","unstructured":"S. Alam, G. Dobbie and P. Riddle, An evolutionary particle swarm optimization algorithm for data clustering, in: Swarm Intelligence Symposium, 2008, pp. 1\u20136, IEEE, 2008.","DOI":"10.1109\/SIS.2008.4668294"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_003","doi-asserted-by":"crossref","unstructured":"S. Alam, G. Dobbie and S. Ur Rehman, Analysis of particle swarm optimization based hierarchical data clustering approaches, Swarm Evol. Comput. 25 (2015), 36\u201351.","DOI":"10.1016\/j.swevo.2015.10.003"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_004","doi-asserted-by":"crossref","unstructured":"L. Aviles, Sex-ratio bias and possible group selection in the social spider Anelosimus eximius, Am. Nat. 128 (1986), 1\u201312.","DOI":"10.1086\/284535"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_005","doi-asserted-by":"crossref","unstructured":"K. K. Bharti and P. K. Singh, Chaotic gradient artificial bee colony for text clustering, Fourth International Conference of Emerging Applications of Information Technology, pp. 337\u2013343, IEEE, Kolkata, India, 2014.","DOI":"10.1109\/EAIT.2014.48"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_006","doi-asserted-by":"crossref","unstructured":"L. Cagnina, M. Errecalde, D. Ingaramo and P. Rosso, An efficient particle swarm optimization approach to cluster short texts, Inform. Sci. (Ny) 265 (2014), 36\u201349.","DOI":"10.1016\/j.ins.2013.12.010"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_007","doi-asserted-by":"crossref","unstructured":"C.-Y. Chen and F. Ye, Particle swarm optimization algorithm and its application to clustering analysis, in: Networking, Sensing and Control, 2004 IEEE International Conference on, 2, pp. 789\u2013794, IEEE, Tehran, Iran, 2004.","DOI":"10.1109\/ICNSC.2004.1297047"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_008","doi-asserted-by":"crossref","unstructured":"K. J. Cios, W. Pedrycz and R. W. Swiniarski, Data mining and knowledge discovery, Springer Science & Business Media, 1998.","DOI":"10.1007\/978-1-4615-5589-6"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_009","doi-asserted-by":"crossref","unstructured":"P. Cudr\u00e9-Mauroux, S. Agarwal and K. Aberer, Gridvine: an infrastructure for peer information management, IEEE Internet Comput. 11 (2007), 36\u201344.","DOI":"10.1109\/MIC.2007.108"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_010","doi-asserted-by":"crossref","unstructured":"E. Cuevas and M. Cienfuegos, A new algorithm inspired in the behavior of the social-spider for constrained optimization, Expert Syst. Appl. 41 (2014), 412\u2013425.","DOI":"10.1016\/j.eswa.2013.07.067"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_011","doi-asserted-by":"crossref","unstructured":"E. Cuevas, M. Cienfuegos, D. Zaldvar and M. P\u00e9rez-Cisneros, A swarm optimization algorithm inspired in the behavior of the social-spider, Expert Syst. Appl. 40 (2013), 6374\u20136384.","DOI":"10.1016\/j.eswa.2013.05.041"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_012","doi-asserted-by":"crossref","unstructured":"L. F. da Cruz Nassif and E. R. Hruschka, Document clustering for forensic analysis: an approach for improving computer inspection, IEEE Trans. Inf. Forensics Security 8 (2013), 46\u201354.","DOI":"10.1109\/TIFS.2012.2223679"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_013","doi-asserted-by":"crossref","unstructured":"S. Das, A. Chowdhury and A. Abraham, A bacterial evolutionary algorithm for automatic data clustering, in: Evolutionary Computation, 2009. CEC\u201909. IEEE Congress on, pp. 2403\u20132410, IEEE, Trondheim, Norway, 2009.","DOI":"10.1109\/CEC.2009.4983241"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_014","doi-asserted-by":"crossref","unstructured":"I. S. Dhillon and D. S. Modha, Concept decompositions for large sparse text data using clustering, Machine Learning 42 (2001), 143\u2013175.","DOI":"10.1023\/A:1007612920971"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_015","doi-asserted-by":"crossref","unstructured":"A. Elkamel, M. Gzara and H. Ben Abdallah, A bio-inspired hierarchical clustering algorithm with backtracking strategy, Appl. Intel. 42 (2015), 174\u2013194.","DOI":"10.1007\/s10489-014-0573-6"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_016","doi-asserted-by":"crossref","unstructured":"C. Eric and K. S. Yip, Cooperative capture of large prey solves scaling challenge faced by spider societies, in: Proceedings of the National Academy of Sciences of the United States of America, 105, pp. 11818\u201311822, Washington, USA, 2008.","DOI":"10.1073\/pnas.0710603105"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_017","doi-asserted-by":"crossref","unstructured":"R. Forsati, A. Keikha and M. Shamsfard, An improved bee colony optimization algorithm with an application to document clustering, Neurocomputing 159 (2015), 9\u201326.","DOI":"10.1016\/j.neucom.2015.02.048"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_018","unstructured":"D. E. Goldberg, Genetic algorithms in search optimization and machine learning, 412, Addison-Wesley Reading, Menlo Park, CA, 1989."},{"key":"2025120523331659972_j_jisys-2017-0178_ref_019","doi-asserted-by":"crossref","unstructured":"D. Gordon, The organization of work in social insect colonies, Complexity 8 (2003), 43\u201346.","DOI":"10.1002\/cplx.10048"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_020","unstructured":"M. Gupta and R. Jain, A performance evaluation of SMCA using similarity association & proximity coefficient relation for hierarchical clustering, Int. J. Eng. Trend. Technol. (IJETT) 15 (2014), 354."},{"key":"2025120523331659972_j_jisys-2017-0178_ref_021","doi-asserted-by":"crossref","unstructured":"M. T. Hassan, A. Karim, J.-B. Kim and M. Jeon, Document clustering by discrimination information maximization, Inf. Sci. 316 (2015), 87\u2013106.","DOI":"10.1016\/j.ins.2015.04.009"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_022","doi-asserted-by":"crossref","unstructured":"Y. Ioannidis, D. Maier, S. Abiteboul, P. Buneman, S. Davidson, E. Fox, A. Halevy, C. Knoblock, F. Rabitti, H. Schek, G. Weikum, Digital library information-technology infrastructures, Int. J. Digit. Lib. 5 (2005), 266\u2013274.","DOI":"10.1007\/s00799-004-0094-8"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_023","doi-asserted-by":"crossref","unstructured":"N. Jabeur, A firefly-inspired micro and macro clustering approach for wireless sensor networks, Procedia Comput. Sci 98 (2016), 132\u2013139.","DOI":"10.1016\/j.procs.2016.09.021"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_024","doi-asserted-by":"crossref","unstructured":"T. Kanungo, D. M. Mount, N. S. Netanyahu, C. Piatko, R. Silverman and A. Y. Wu, The analysis of a simple k-means clustering algorithm, in: Proceedings of the Sixteenth Annual Symposium on Computational Geometry, pp. 100\u2013109, ACM, Clear Water Bay, Hong Kong, 2000.","DOI":"10.1145\/336154.336189"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_025","doi-asserted-by":"crossref","unstructured":"S. Karol and V. Mangat, Evaluation of text document clustering approach based on particle swarm optimization, Open Comput. Sci. 3 (2013), 69\u201390.","DOI":"10.2478\/s13537-013-0104-2"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_026","doi-asserted-by":"crossref","unstructured":"R. C. Eberhart and J. Kennedy, A new optimizer using particle swarm theory, in: Proceedings of the sixth international symposium on micro machine and human science, Vol. 1, pp. 39\u201343, Nagoya, Japan, 1995.","DOI":"10.1109\/MHS.1995.494215"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_027","doi-asserted-by":"crossref","unstructured":"K. Krishna and M. N. Murty, Genetic K-means algorithm, IEEE Trans. Syst. Man. Cybern. B (Cybern.) 29 (1999), 433\u2013439.","DOI":"10.1109\/3477.764879"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_028","doi-asserted-by":"crossref","unstructured":"M. Krishnamoorthi and A. M. Natarajan, ABK-means: an algorithm for data clustering using ABC and K-means algorithm, Int. J. Comput. Sci. Eng. 8 (2013), 383\u2013391.","DOI":"10.1504\/IJCSE.2013.057304"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_029","unstructured":"M. Lickman, UC irvine machine learning repository, 2013."},{"key":"2025120523331659972_j_jisys-2017-0178_ref_030","doi-asserted-by":"crossref","unstructured":"S. Maxence, Social organization of the colonial spider Leucauge sp. in the Neotropics: vertical stratification within colonies, J. Arachnol. 39 (2010), 446\u2013451.","DOI":"10.1636\/Hi09-99.1"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_031","unstructured":"S. K. Popat and M. Emmanuel, Review and comparative study of clustering techniques, Int. J. Comp. Sci. Inform. Technol. 5 (2014), 805\u2013812."},{"key":"2025120523331659972_j_jisys-2017-0178_ref_032","doi-asserted-by":"crossref","unstructured":"T. Ravi Chandran, A. V. Reddy and B. Janet, A social spider optimization approach for clustering text documents, in: Proceedings of the 2nd International Conference on Advances in Electrical and Electronics, Information Communication and Bio Informatics, pp. 22\u201326, IEEE, 2016.","DOI":"10.1109\/AEEICB.2016.7538275"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_033","unstructured":"T. Ravi Chandran, A. V. Reddy and B. Janet, Text clustering quality improvement using a hybrid social spider optimization, Int. J. Appl. Eng. Res. 12 (2017), 995\u20131008."},{"key":"2025120523331659972_j_jisys-2017-0178_ref_034","doi-asserted-by":"crossref","unstructured":"P. S. Shelokar, V. K. Jayaraman and B. D. Kulkarni, An ant colony approach for clustering, Anal. Chim. Acta 509 (2004), 187\u2013195.","DOI":"10.1016\/j.aca.2003.12.032"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_035","doi-asserted-by":"crossref","unstructured":"D. W. Van der Merwe and A. P. Engelbrecht, Data clustering using particle swarm optimization, in: Evolutionary Computation, 2003. CEC\u201903. The 2003 Congress on, 1, pp. 215\u2013220, IEEE, Canberra, ACT, Australia, 2003.","DOI":"10.1109\/CEC.2003.1299577"},{"key":"2025120523331659972_j_jisys-2017-0178_ref_036","unstructured":"X. S. Yang and Z. W. Geem, Music-inspired harmony search algorithm: theory and applications, Springer, Part of the Studies in Computational Intelligence book series (SCI, volume 191), 2009."}],"container-title":["Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/jisys\/29\/1\/article-p311.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2017-0178\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2017-0178\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:34:09Z","timestamp":1764977649000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2017-0178\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,14]]},"references-count":36,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2018,1,10]]},"published-print":{"date-parts":[[2019,12,18]]}},"alternative-id":["10.1515\/jisys-2017-0178"],"URL":"https:\/\/doi.org\/10.1515\/jisys-2017-0178","relation":{},"ISSN":["2191-026X","0334-1860"],"issn-type":[{"value":"2191-026X","type":"electronic"},{"value":"0334-1860","type":"print"}],"subject":[],"published":{"date-parts":[[2018,2,14]]}}}