{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T21:37:57Z","timestamp":1740173877161,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,9,22]],"date-time":"2017-09-22T00:00:00Z","timestamp":1506038400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1186\/s40537-017-0090-7","type":"journal-article","created":{"date-parts":[[2017,9,22]],"date-time":"2017-09-22T08:16:30Z","timestamp":1506068190000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Clustering categorical data based on the relational analysis approach and MapReduce"],"prefix":"10.1186","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7726-896X","authenticated-orcid":false,"given":"Yasmine","family":"Lamari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Said Chah","family":"Slaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,22]]},"reference":[{"key":"90_CR1","unstructured":"Dean J, Ghemawat S. Mapreduce: simplified data processing on large clusters. In: Proceedings of the 6th conference on symposium on operating systems design and implementation: 06\u201308 December 2004; San Francisco. Berkeley: USENIX Association. 2004. p. 137\u201350."},{"key":"90_CR2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-28349-8_2","volume-title":"Grouping multidimensional data","author":"P Berkhin","year":"2006","unstructured":"Berkhin P. A survey of clustering data mining techniques. In: Kogan J, Nicholas C, Teboulle M, editors. Grouping multidimensional data. Heidelberg: Springer; 2006. p. 25\u201371."},{"key":"90_CR3","doi-asserted-by":"crossref","unstructured":"Slaoui SC, Lamari Y. Clustering of large data based on the relational analysis. In: Proceedings of the international conference on intelligent systems and computer vision. 25\u201326 March 2015; Fez. Washington: IEEE Computer Society. 2015. p. 1\u20137.","DOI":"10.1109\/ISACV.2015.7105550"},{"key":"90_CR4","first-page":"7","volume":"67","author":"P Michaud","year":"1979","unstructured":"Michaud P, Marcotorchino JF. Mod\u00e8les d\u2019optimisation en analyse des donn\u00e9es relationnelles. Math Sci Hum. 1979;67:7\u201338.","journal-title":"Math Sci Hum"},{"key":"90_CR5","doi-asserted-by":"crossref","unstructured":"Zhao W, Ma H, He Q. Parallel k-means clustering based on mapreduce. In: Proceedings of the first international conference on Cloud Computing. 1\u20134 December 2009; Beijing. Heidelberg: Springer-Verlag. 2009. p. 674\u201379.","DOI":"10.1007\/978-3-642-10665-1_71"},{"key":"90_CR6","doi-asserted-by":"crossref","unstructured":"He Y, Tan H, Luo W, Mao H, Ma D, Feng S, Fan J. Mr-dbscan: an efficient parallel density-based clustering algorithm using mapreduce. In: Proceedings of the 17th international conference on parallel and distributed systems: 7\u20139 December 2011; Tainan. Washington: IEEE Computer Society. 2011. p. 473\u201380.","DOI":"10.1109\/ICPADS.2011.83"},{"key":"90_CR7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.is.2013.11.002","volume":"42","author":"Y Kim","year":"2014","unstructured":"Kim Y, Shim K, Kim M-S, Lee JS. Dbcure-MR: an efficient density-based clustering algorithm for large data using mapreduce. Inf Syst. 2014;42:15\u201335.","journal-title":"Inf Syst"},{"issue":"3","key":"90_CR8","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/j.datak.2007.05.005","volume":"63","author":"D Parmar","year":"2007","unstructured":"Parmar D, Wu T, Blackhurst J. MMR: an algorithm for clustering categorical data using rough set theory. Data Knowl Eng. 2007;63(3):879\u201393.","journal-title":"Data Knowl Eng"},{"key":"90_CR9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.neucom.2013.11.024","volume":"133","author":"L Bai","year":"2014","unstructured":"Bai L, Liang J. The k-modes type clustering plus between-cluster information for categorical data. Neurocomputing. 2014;133:111\u201321.","journal-title":"Neurocomputing"},{"key":"90_CR10","first-page":"325","volume-title":"Web intelligence and intelligent agents","author":"J Ah-Pine","year":"2010","unstructured":"Ah-Pine J, Marcotorchino JF. Overview of the relational analysis approach in data-mining and multi-criteria decision making. In: Usmani ZUH, editor. Web intelligence and intelligent agents. Rijeka: InTech; 2010. p. 325\u201346."},{"issue":"3","key":"90_CR11","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/asm.3150030305","volume":"3","author":"P Michaud","year":"1987","unstructured":"Michaud P. Condorcet\u2014a man of the avant-garde. Appl Stoch Models Data Anal. 1987;3(3):173\u201389.","journal-title":"Appl Stoch Models Data Anal"},{"key":"90_CR12","doi-asserted-by":"crossref","unstructured":"Manning CD, Raghavan P, Sch\u00fctze H. Evaluation in information retrieval. In: Introduction to information retrieval. New York: Cambridge University Press. 2008. p. 151\u201375.","DOI":"10.1017\/CBO9780511809071"},{"issue":"1","key":"90_CR13","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert L, Arabie P. Comparing partitions. J Classif. 1985;2(1):193\u2013218.","journal-title":"J Classif"},{"key":"90_CR14","unstructured":"UCI Machine Learning Repository: data sets. https:\/\/archive.ics.uci.edu\/ml\/datasets.html ."},{"issue":"5","key":"90_CR15","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/S0306-4379(00)00022-3","volume":"25","author":"S Guha","year":"2000","unstructured":"Guha S, Rastogi R, Shim K. Rock: a robust clustering algorithm for categorical attributes. Inf Syst. 2000;25(5):345\u201366.","journal-title":"Inf Syst"},{"issue":"5","key":"90_CR16","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1007\/BF02948829","volume":"17","author":"Z He","year":"2002","unstructured":"He Z, Xu X, Deng S. Squeezer: an efficient algorithm for clustering categorical data. J Comput Sci Technol. 2002;17(5):611\u201324.","journal-title":"J Comput Sci Technol"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-017-0090-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s40537-017-0090-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-017-0090-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T17:22:24Z","timestamp":1570123344000},"score":1,"resource":{"primary":{"URL":"http:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-017-0090-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,22]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["90"],"URL":"https:\/\/doi.org\/10.1186\/s40537-017-0090-7","relation":{},"ISSN":["2196-1115"],"issn-type":[{"type":"electronic","value":"2196-1115"}],"subject":[],"published":{"date-parts":[[2017,9,22]]},"article-number":"28"}}