A novel artificial bee colony based clustering algorithm for categorical data. Ji, J., Pang, W., Zheng, Y., Wang, Z., & Ma, Z. PLoS ONE, Public Library of Science, May, 2015. Funding: This work was supported by the National Natural Science Foundation of China (NSFC) under Grant Nos. (21127010, 61202309, http://www.nsfc.gov.cn/), China Postdoctoral Science Foundation under Grant No. 2013M530956 (http://res.chinapostdoctor.org.cn), the UK Economic & Social Research Council (ESRC): award reference: ES/M001628/1 (http://www.esrc.ac.uk/), Science and Technology Development Plan of Jilin province under Grant No. 20140520068JH (http://www.jlkjt.gov.cn), Fundamental Research Funds for the Central Universities under No. 14QNJJ028 (http://www.nenu.edu.cn), the open project program of Key Laboratory of Symbolic Computation andKnowledge Engineering of Ministry of Education, Jilin University under Grant No. 93K172014K07 (http://www.jlu.edu.cn). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. M1 - e0127125doi abstract bibtex Data with categorical attributes are ubiquitous in the real world. However, existing partitional clustering algorithms for categorical data are prone to fall into local optima. To address this issue, in this paper we propose a novel clustering algorithm, ABC-K-Modes (Artificial Bee Colony clustering based on K-Modes), based on the traditional k-modes clustering algorithm and the artificial bee colony approach. In our approach, we first introduce a one-step k-modes procedure, and then integrate this procedure with the artificial bee colony approach to deal with categorical data. In the search process performed by scout bees, we adopt the multi-source search inspired by the idea of batch processing to accelerate the convergence of ABC-K-Modes. The performance of ABC-K-Modes is evaluated by a series of experiments in comparison with that of the other popular algorithms for categorical data.
@article{734d92e0a17a4d7982d53debb75c122b, title = "A novel artificial bee colony based clustering algorithm for categorical data", abstract = "Data with categorical attributes are ubiquitous in the real world. However, existing partitional clustering algorithms for categorical data are prone to fall into local optima. To address this issue, in this paper we propose a novel clustering algorithm, ABC-K-Modes (Artificial Bee Colony clustering based on K-Modes), based on the traditional k-modes clustering algorithm and the artificial bee colony approach. In our approach, we first introduce a one-step k-modes procedure, and then integrate this procedure with the artificial bee colony approach to deal with categorical data. In the search process performed by scout bees, we adopt the multi-source search inspired by the idea of batch processing to accelerate the convergence of ABC-K-Modes. The performance of ABC-K-Modes is evaluated by a series of experiments in comparison with that of the other popular algorithms for categorical data.", author = "Jinchao Ji and Wei Pang and Yanlin Zheng and Zhe Wang and Zhiqiang Ma", note = "Funding: This work was supported by the National Natural Science Foundation of China (NSFC) under Grant Nos. (21127010, 61202309, http://www.nsfc.gov.cn/), China Postdoctoral Science Foundation under Grant No. 2013M530956 (http://res.chinapostdoctor.org.cn), the UK Economic & Social Research Council (ESRC): award reference: ES/M001628/1 (http://www.esrc.ac.uk/), Science and Technology Development Plan of Jilin province under Grant No. 20140520068JH (http://www.jlkjt.gov.cn), Fundamental Research Funds for the Central Universities under No. 14QNJJ028 (http://www.nenu.edu.cn), the open project program of Key Laboratory of Symbolic Computation andKnowledge Engineering of Ministry of Education, Jilin University under Grant No. 93K172014K07 (http://www.jlu.edu.cn). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. M1 - e0127125", year = "2015", month = may, day = "20", doi = "10.1371/journal.pone.0127125", language = "English", volume = "10", journal = "PLoS ONE", issn = "1932-6203", publisher = "Public Library of Science", number = "5", }
Downloads: 0
{"_id":"3S8aEXYyh9ogHJRvB","bibbaseid":"ji-pang-zheng-wang-ma-anovelartificialbeecolonybasedclusteringalgorithmforcategoricaldata-2015","authorIDs":["9H3ryb5or9a4Sw2jW"],"author_short":["Ji, J.","Pang, W.","Zheng, Y.","Wang, Z.","Ma, Z."],"bibdata":{"bibtype":"article","type":"article","title":"A novel artificial bee colony based clustering algorithm for categorical data","abstract":"Data with categorical attributes are ubiquitous in the real world. However, existing partitional clustering algorithms for categorical data are prone to fall into local optima. To address this issue, in this paper we propose a novel clustering algorithm, ABC-K-Modes (Artificial Bee Colony clustering based on K-Modes), based on the traditional k-modes clustering algorithm and the artificial bee colony approach. In our approach, we first introduce a one-step k-modes procedure, and then integrate this procedure with the artificial bee colony approach to deal with categorical data. In the search process performed by scout bees, we adopt the multi-source search inspired by the idea of batch processing to accelerate the convergence of ABC-K-Modes. The performance of ABC-K-Modes is evaluated by a series of experiments in comparison with that of the other popular algorithms for categorical data.","author":[{"firstnames":["Jinchao"],"propositions":[],"lastnames":["Ji"],"suffixes":[]},{"firstnames":["Wei"],"propositions":[],"lastnames":["Pang"],"suffixes":[]},{"firstnames":["Yanlin"],"propositions":[],"lastnames":["Zheng"],"suffixes":[]},{"firstnames":["Zhe"],"propositions":[],"lastnames":["Wang"],"suffixes":[]},{"firstnames":["Zhiqiang"],"propositions":[],"lastnames":["Ma"],"suffixes":[]}],"note":"Funding: This work was supported by the National Natural Science Foundation of China (NSFC) under Grant Nos. (21127010, 61202309, http://www.nsfc.gov.cn/), China Postdoctoral Science Foundation under Grant No. 2013M530956 (http://res.chinapostdoctor.org.cn), the UK Economic & Social Research Council (ESRC): award reference: ES/M001628/1 (http://www.esrc.ac.uk/), Science and Technology Development Plan of Jilin province under Grant No. 20140520068JH (http://www.jlkjt.gov.cn), Fundamental Research Funds for the Central Universities under No. 14QNJJ028 (http://www.nenu.edu.cn), the open project program of Key Laboratory of Symbolic Computation andKnowledge Engineering of Ministry of Education, Jilin University under Grant No. 93K172014K07 (http://www.jlu.edu.cn). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. M1 - e0127125","year":"2015","month":"May","day":"20","doi":"10.1371/journal.pone.0127125","language":"English","volume":"10","journal":"PLoS ONE","issn":"1932-6203","publisher":"Public Library of Science","number":"5","bibtex":"@article{734d92e0a17a4d7982d53debb75c122b, title = \"A novel artificial bee colony based clustering algorithm for categorical data\", abstract = \"Data with categorical attributes are ubiquitous in the real world. However, existing partitional clustering algorithms for categorical data are prone to fall into local optima. To address this issue, in this paper we propose a novel clustering algorithm, ABC-K-Modes (Artificial Bee Colony clustering based on K-Modes), based on the traditional k-modes clustering algorithm and the artificial bee colony approach. In our approach, we first introduce a one-step k-modes procedure, and then integrate this procedure with the artificial bee colony approach to deal with categorical data. In the search process performed by scout bees, we adopt the multi-source search inspired by the idea of batch processing to accelerate the convergence of ABC-K-Modes. The performance of ABC-K-Modes is evaluated by a series of experiments in comparison with that of the other popular algorithms for categorical data.\", author = \"Jinchao Ji and Wei Pang and Yanlin Zheng and Zhe Wang and Zhiqiang Ma\", note = \"Funding: This work was supported by the National Natural Science Foundation of China (NSFC) under Grant Nos. (21127010, 61202309, http://www.nsfc.gov.cn/), China Postdoctoral Science Foundation under Grant No. 2013M530956 (http://res.chinapostdoctor.org.cn), the UK Economic & Social Research Council (ESRC): award reference: ES/M001628/1 (http://www.esrc.ac.uk/), Science and Technology Development Plan of Jilin province under Grant No. 20140520068JH (http://www.jlkjt.gov.cn), Fundamental Research Funds for the Central Universities under No. 14QNJJ028 (http://www.nenu.edu.cn), the open project program of Key Laboratory of Symbolic Computation andKnowledge Engineering of Ministry of Education, Jilin University under Grant No. 93K172014K07 (http://www.jlu.edu.cn). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. M1 - e0127125\", year = \"2015\", month = may, day = \"20\", doi = \"10.1371/journal.pone.0127125\", language = \"English\", volume = \"10\", journal = \"PLoS ONE\", issn = \"1932-6203\", publisher = \"Public Library of Science\", number = \"5\", }\r\n\r\n\r\n","author_short":["Ji, J.","Pang, W.","Zheng, Y.","Wang, Z.","Ma, Z."],"key":"734d92e0a17a4d7982d53debb75c122b","id":"734d92e0a17a4d7982d53debb75c122b","bibbaseid":"ji-pang-zheng-wang-ma-anovelartificialbeecolonybasedclusteringalgorithmforcategoricaldata-2015","role":"author","urls":{},"downloads":0},"bibtype":"article","biburl":"https://raw.githubusercontent.com/pangweijlu/bibtex/master/Pure280920.bib","creationDate":"2020-09-28T22:52:17.308Z","downloads":0,"keywords":[],"search_terms":["novel","artificial","bee","colony","based","clustering","algorithm","categorical","data","ji","pang","zheng","wang","ma"],"title":"A novel artificial bee colony based clustering algorithm for categorical data","year":2015,"dataSources":["rosNtZThp6j9P6b2o"]}