{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T04:19:35Z","timestamp":1780460375635,"version":"3.54.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,4,9]],"date-time":"2011-04-09T00:00:00Z","timestamp":1302307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10844-011-0158-3","type":"journal-article","created":{"date-parts":[[2011,4,8]],"date-time":"2011-04-08T06:30:22Z","timestamp":1302244222000},"page":"321-341","source":"Crossref","is-referenced-by-count":53,"title":["Data clustering using bacterial foraging optimization"],"prefix":"10.1007","volume":"38","author":[{"given":"Miao","family":"Wan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lixiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinghua","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yixian","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,4,9]]},"reference":[{"key":"158_CR1","unstructured":"Arthur, D., & Vassilvitskii, S. (2007). k-means++: The advantages of careful seeding. In N. Bansal, K. Pruhs, & C. Stein (Eds.), Proc. of the eighteenth anual ACMSIAM symposium on discrete algorithms, SODA (pp. 1027\u20131035)."},{"key":"158_CR2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-1-4757-0450-1_4","volume-title":"Pattern recognition with fuzzy objective function algorithms","author":"JC Bezdek","year":"1981","unstructured":"Bezdek, J. C. (1981). Pattern recognition with fuzzy objective function algorithms (pp. 95\u2013107). New York: Plenum Press."},{"issue":"1","key":"158_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society. Series B (Methodological), 39(1), 1\u201338.","journal-title":"Journal of the Royal Statistical Society. Series B (Methodological)"},{"key":"158_CR4","unstructured":"Dhillon, I. S., Guan, Y., & Kulis, B. (2005). A unified view of kernel k-means, spectral clustering and graph partitioning. Technical Report TR-04\u201325, UTCS."},{"issue":"11","key":"158_CR5","doi-asserted-by":"crossref","first-page":"1944","DOI":"10.1109\/TPAMI.2007.1115","volume":"29","author":"IS Dhillon","year":"2007","unstructured":"Dhillon, I. S., Guan, Y., & Kulis, B. (2007). Weighted graph cuts without eigenvectors: A multilevel approach. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(11), 1944\u20131957.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"1","key":"158_CR6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., & Maniezzo, V. (1996). Ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 26(1), 29\u201341.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B"},{"key":"158_CR7","volume-title":"Computational intelligence: An introduction","author":"AP Englebrecht","year":"2002","unstructured":"Englebrecht, A. P. (2002). Computational intelligence: An introduction. New York: Wiley."},{"issue":"1","key":"158_CR8","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.patcog.2007.05.018","volume":"41","author":"M Filippone","year":"2008","unstructured":"Filippone, M., Camastra, F., Masulli, F., & Rovetta, S. (2008). A survey on spectral and kernel methods for clustering. Pattern Recognition, 41(1), 176\u2013190.","journal-title":"Pattern Recognition"},{"key":"158_CR9","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R., & Shim, K. (1998). Cure: An efficient clustering algorithm for large databases. In Proceedings of ACM SIGMOD conference on management of data (pp. 73\u201384).","DOI":"10.1145\/276305.276312"},{"key":"158_CR10","doi-asserted-by":"crossref","first-page":"475","DOI":"10.2528\/PIER07110705","volume":"79","author":"K Guney","year":"2008","unstructured":"Guney, K., & Basbug, S. (2008). Interference suppression of linear antenna arrays by amplitude-only control using a bacterial foraging algorithm. Progress in Electromagnetics Research, 79, 475\u2013497.","journal-title":"Progress in Electromagnetics Research"},{"key":"158_CR11","unstructured":"Handl, J, & Knowles, J. (2008). Cluster generators: synthetic data for the evaluation of clustering algorithms. http:\/\/dbkgroup.org\/handl\/generators\/ ."},{"issue":"1","key":"158_CR12","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1162\/106454606775186400","volume":"12","author":"J Handl","year":"2006","unstructured":"Handl, J., Knowles, J., & Dorigo, M. (2006). Ant-based clustering and topographic mapping. Artificial Life, 12(1), 35\u201362.","journal-title":"Artificial Life"},{"key":"158_CR13","unstructured":"Hinneburg, A., & Keim, D. (1998). An efficient approach to clustering in large multimedia databases with noise. In Proceedings of the 4th international conference on knowledge discovery and data mining (KDD-98) (pp. 58\u201365)."},{"issue":"13","key":"158_CR14","doi-asserted-by":"crossref","first-page":"1898","DOI":"10.1016\/j.ins.2005.07.015","volume":"176","author":"E Hruschka","year":"2006","unstructured":"Hruschka, E., Campello, R., & de Castro, L. (2006). Evolving clusters in gene-expression data. Information Sciences, 176(13), 1898\u20131927.","journal-title":"Information Sciences"},{"issue":"3","key":"158_CR15","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain, A. K., Murty, M. N., & Flyn, P. J. (1999). Data clustering: A review. ACM Computing Surveys, 31(3), 264\u2013323.","journal-title":"ACM Computing Surveys"},{"issue":"2\u20133","key":"158_CR16","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.comgeo.2004.03.003","volume":"28","author":"T Kanungo","year":"2004","unstructured":"Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2004). A local search approximation algorithm for k-means clustering. Computational Geometry, 28(2\u20133), 89\u2013112.","journal-title":"Computational Geometry"},{"key":"158_CR17","doi-asserted-by":"crossref","unstructured":"Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceedings of the IEEE international joint conference on neural networks (ICW) (Vol. 4, pp. 1942\u20131948). Perth, Australia.","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"18","key":"158_CR18","doi-asserted-by":"crossref","first-page":"3918","DOI":"10.1016\/j.ins.2007.04.002","volume":"177","author":"DH Kim","year":"2007","unstructured":"Kim, D. H., Abraham, A., & Cho, J. H. (2007). A hybrid genetic algorithm and bacterial foraging approach for global optimization. Information Sciences, 177(18), 3918\u20133937.","journal-title":"Information Sciences"},{"key":"158_CR19","unstructured":"Kim, D. H., & Cho, J. H. (2005). Bacterial foraging based neural network fuzzy learning (pp. 2030\u20132036). IICAI."},{"key":"158_CR20","doi-asserted-by":"crossref","first-page":"2351","DOI":"10.1142\/S0218127406016100","volume":"16","author":"L Li","year":"2006","unstructured":"Li, L., Yang, Y., Peng, H., & Wang, X. (2006). An optimization method inspired by chaotic ant behavior. International Journal of Bifurcation and Chaos, 16, 2351\u20132364.","journal-title":"International Journal of Bifurcation and Chaos"},{"key":"158_CR21","unstructured":"MacQueen, J. (1967). Some methods for classification and analysis of multivariate observations. In Proceedings of the 5th Berkeley symposium on mathematical statistics and probability (pp. 281\u2013297)."},{"issue":"1","key":"158_CR22","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1109\/TPWRD.2006.876651","volume":"22","author":"S Mishra","year":"2007","unstructured":"Mishra, S., & Bhende, C. N. (2007). Bacterial foraging technique-based optimized active power filter for load compensation. IEEE Transactions on Power Delivery, 22(1), 457\u2013465.","journal-title":"IEEE Transactions on Power Delivery"},{"key":"158_CR23","unstructured":"Ng, R. T., & Han, J. (1994). Efficient and effective clustering methods for spatial data mining. In Proceedings of the 20th international conference on very large data bases conference (pp. 144\u2013155)."},{"issue":"11","key":"158_CR24","doi-asserted-by":"crossref","first-page":"2269","DOI":"10.1080\/01431160050029567","volume":"21","author":"SK Pal","year":"2000","unstructured":"Pal, S. K., Ghosh, A., & Uma Shankar, B. (2000). Segmentation of remotely sensed images with fuzzy thresholding and quantitative evaluation. International Journal on Remote Sensing, 21(11), 2269\u20132300.","journal-title":"International Journal on Remote Sensing"},{"issue":"3","key":"158_CR25","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/MCS.2002.1004010","volume":"22","author":"KM Passino","year":"2002","unstructured":"Passino, K. M. (2002). Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Systems Magazine, 22(3), 52\u201367.","journal-title":"IEEE Control Systems Magazine"},{"key":"158_CR26","unstructured":"Sheikholeslami, G., Chatterjee, S., & Zhang, A. D. (1998). WaveCluster: A multi-resolution clustering approach for very large spatial databases. In Proceedings of the 24th international conference on very large data bases (pp. 428\u2013439)."},{"key":"158_CR27","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.aca.2003.12.032","volume":"509","author":"PS Shelokar","year":"2004","unstructured":"Shelokar, P. S., Jayaraman, V. K., & Kulkarni, B. D. (2004). An ant colony approach for clustering. Analytica Chimica Acta, 509, 187\u2013195.","journal-title":"Analytica Chimica Acta"},{"key":"158_CR28","volume-title":"Introduction to data mining","author":"P-N Tan","year":"2006","unstructured":"Tan, P.-N., Steinbach, M., & Kumar, V. (2006). Introduction to data mining. Reading, MA: Addison-Wesley."},{"key":"158_CR29","volume-title":"Pattern recognition","author":"S Theodoridis","year":"2006","unstructured":"Theodoridis, S., & Koutroumbas, K. (2006). Pattern recognition 3rd ed. New York: Academic."},{"key":"158_CR30","unstructured":"UCI Machine Learning Repository (2007). http:\/\/archive.ics.uci.edu\/ml\/index.html . Univ. of California, Irvine, Dept. of Information and Computer Science, Center for Machine Learning and Intelligent Systems."},{"key":"158_CR31","unstructured":"van den Bergh, F. (2002). An analysis of particle swarm optimizers. PhD Thesis, Department of Computer Science, University of Pretoria, Pretoria, South Africa."},{"key":"158_CR32","doi-asserted-by":"crossref","unstructured":"van der Merwe, D. W., & Engelbrecht, A. P. (2003). Data clustering using particle swarm optimization. In Proceedings of IEEE congress on evolutionary computation (pp. 215\u2013220).","DOI":"10.1109\/CEC.2003.1299577"},{"issue":"3","key":"158_CR33","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s11071-010-9653-2","volume":"61","author":"M Wan","year":"2010","unstructured":"Wan, M., Li, L., Xiao, J., Yang, Y.,Wang, C., & Guo, X. (2010). CAS based clustering algorithm for web users. Nonlinear Dynamics, 61(3), 347\u2013361.","journal-title":"Nonlinear Dynamics"},{"issue":"1","key":"158_CR34","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D. H., & Macready, W. G. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1), 67\u201382.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"158_CR35","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/TFUZZ.2004.825079","volume":"12","author":"J Zhang","year":"2004","unstructured":"Zhang, J., & Leung, Y. (2004). Improved possibilistic C-means clustering algorithms. IEEE Transactions on Fuzzy Systems, 12(2), 209\u2013217.","journal-title":"IEEE Transactions on Fuzzy Systems"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-011-0158-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-011-0158-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-011-0158-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T17:08:27Z","timestamp":1560100107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-011-0158-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,9]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["158"],"URL":"https:\/\/doi.org\/10.1007\/s10844-011-0158-3","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,9]]}}}