{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T01:47:54Z","timestamp":1649123274411},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,4,13]],"date-time":"2016-04-13T00:00:00Z","timestamp":1460505600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100013781","name":"Prince Mohammad Bin Fahd University","doi-asserted-by":"crossref","award":["Internal Research Grant"],"award-info":[{"award-number":["Internal Research Grant"]}],"id":[{"id":"10.13039\/501100013781","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s41060-016-0007-0","type":"journal-article","created":{"date-parts":[[2016,4,14]],"date-time":"2016-04-14T10:52:32Z","timestamp":1460631152000},"page":"89-98","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A mining-based approach for efficient enumeration of algebraic structures"],"prefix":"10.1007","volume":"1","author":[{"given":"Majid Ali","family":"Khan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nazeeruddin","family":"Mohammad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahabuddin","family":"Muhammad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asif","family":"Ali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,13]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Khan, M.A., Mohammad, N., Muhammad, S., Ali, A.: A mining based approach for efficient enumeration of algebraic structures. In: IEEE International Conference on Data Science and Advanced Analytics (DSAA) (2015)","DOI":"10.1109\/DSAA.2015.7344827"},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1002\/jcd.20105","volume":"15","author":"BD McKay","year":"2007","unstructured":"McKay, B.D., Meynert, A., Myrvold, W.: Small latin squares, quasigroups, and loops. J. Comb. Des. 15, 98\u2013119 (2007)","journal-title":"J. Comb. Des."},{"issue":"1","key":"7_CR3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s11277-012-0959-x","volume":"73","author":"M Battey","year":"2013","unstructured":"Battey, M., Parakh, A.: An efficient quasigroup block cipher. Wirel. Pers. Commun. 73(1), 63\u201376 (2013)","journal-title":"Wirel. Pers. Commun."},{"key":"7_CR4","first-page":"47","volume":"8","author":"A Krapez","year":"2010","unstructured":"Krapez, A.: An application of quasigroups in cryptology. Math. Maced 8, 47\u201352 (2010)","journal-title":"Math. Maced"},{"key":"7_CR5","volume-title":"Symmetry Breaking During Search in Constraint Programming","author":"IP Gent","year":"1999","unstructured":"Gent, I.P., Barbara, S.: Symmetry Breaking During Search in Constraint Programming. University of Leeds, School of Computer Studies, Leeds (1999)"},{"key":"7_CR6","volume-title":"Groups and Constraints: Symmetry Breaking During Search. Principles and Practice of Constraint Programming-CP 2002","author":"IP Gent","year":"2002","unstructured":"Gent, I.P., Harvey, W., Kelsey, T.: Groups and Constraints: Symmetry Breaking During Search. Principles and Practice of Constraint Programming-CP 2002. Springer, Berlin (2002)"},{"key":"7_CR7","first-page":"13","volume":"16","author":"A Ali","year":"2008","unstructured":"Ali, A., Slayney, J.: Counting loops with the inverse property. Quasigroups Relat. Syst. 16, 13 (2008)","journal-title":"Quasigroups Relat. Syst."},{"key":"7_CR8","first-page":"3587","volume":"30","author":"BD McKay","year":"1981","unstructured":"McKay, B.D.: Practical graph isomorphism. Congr. Numer. 30, 3587 (1981)","journal-title":"Congr. Numer."},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1090\/S0002-9947-1944-0010597-1","volume":"55","author":"AA Albert","year":"1944","unstructured":"Albert, A.A.: Quasigroups. II. Trans. Am. Math. Soc. 55, 401\u2013409 (1944)","journal-title":"Trans. Am. Math. Soc."},{"key":"7_CR10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0012-365X(75)90108-9","volume":"11","author":"SE Bammel","year":"1975","unstructured":"Bammel, S.E., Rothstein, J.: The number of 9 $$\\times $$ \u00d7 9 latin squares. Discret. Math. 11, 83\u201395 (1975)","journal-title":"Discret. Math."},{"key":"7_CR11","first-page":"261","volume":"27","author":"LJ Brant","year":"1985","unstructured":"Brant, L.J., Mullen, G.L.: A note on isomorphism classes of reduced latin squares of order 7. Util. Math. 27, 261\u2013263 (1985)","journal-title":"Util. Math."},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0021-9800(68)80053-5","volume":"5","author":"JW Brown","year":"1972","unstructured":"Brown, J.W.: Enumeration of latin squares with application to order 8. J. Comb. Theory 5, 177\u2013184 (1972)","journal-title":"J. Comb. Theory"},{"key":"7_CR13","first-page":"85","volume":"19","author":"A Cayley","year":"1890","unstructured":"Cayley, A.: On latin squares. Oxf. Camb. Dublin Messenger Math. 19, 85\u2013239 (1890)","journal-title":"Oxf. Camb. Dublin Messenger Math."},{"key":"7_CR14","unstructured":"Euler, L.: Recherches sur une nouvelle esp\u00e9ce de quarr\u00e9s magiques combinatorial aspects of relations. Verhandelingen\/uitgegeven door het zeeuwsch Genootschap der Wetenschappen te Vlissingen, 9, 85\u2013239, (1782)"},{"key":"7_CR15","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1017\/S0305004100012731","volume":"30","author":"RA Fisher","year":"1934","unstructured":"Fisher, R.A., Yates, F.: The 6 $$\\times $$ \u00d7 6 latin squares. Proc. Camb. Philos. Soc. 30, 492\u2013507 (1934)","journal-title":"Proc. Camb. Philos. Soc."},{"key":"7_CR16","first-page":"8","volume":"IV","author":"M Frolov","year":"1890","unstructured":"Frolov, M.: Sur les permutations carr\u00e9es. J. Math. Sp\u00e9c IV, 8\u201311 (1890)","journal-title":"J. Math. Sp\u00e9c"},{"key":"7_CR17","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1112\/plms\/s2-31.1.329","volume":"31","author":"SM Jacob","year":"1930","unstructured":"Jacob, S.M.: The enumeration of the latin rectangle of depth three by means of a formula of reduction, with other theorems relating to non-clashing substitutions and latin squares. Proc. Lond. Math. Soc. 31, 329\u2013354 (1930)","journal-title":"Proc. Lond. Math. Soc."},{"key":"7_CR18","volume-title":"Combinatory Analysis","author":"PA MacMahon","year":"1915","unstructured":"MacMahon, P.A.: Combinatory Analysis, vol. 1. Cambridge University Press, Cambridge (1915)"},{"key":"7_CR19","doi-asserted-by":"crossref","first-page":"N3","DOI":"10.37236\/1222","volume":"2","author":"BD McKay","year":"1995","unstructured":"McKay, B.D., Rogoyski, E.: Latin squares of order 10. Electron. J. Combin. 2, N3 (1995)","journal-title":"Electron. J. Combin."},{"key":"7_CR20","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s00026-005-0261-7","volume":"9","author":"BD McKay","year":"2005","unstructured":"McKay, B.D., Wanless, I.M.: On the number of latin squares. Ann. Combin. 9, 335\u2013344 (2005)","journal-title":"Ann. Combin."},{"key":"7_CR21","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1111\/j.1469-1809.1939.tb02214.x","volume":"9","author":"HW Norton","year":"1939","unstructured":"Norton, H.W.: The 7 $$\\times $$ \u00d7 7 squares. Ann. Eugenics 9, 269\u2013307 (1939)","journal-title":"Ann. Eugenics"},{"key":"7_CR22","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1214\/aoms\/1177729654","volume":"22","author":"A Sade","year":"1951","unstructured":"Sade, A.: An omission in norton\u2019s list of 7 $$\\times $$ \u00d7 7 squares. Ann. Math. Stat. 22, 306\u2013307 (1951)","journal-title":"Ann. Math. Stat."},{"key":"7_CR23","unstructured":"Sade, A.: Morphismes de quasigroupes: Tables. Revista da Faculdade de Ci\u00eancias de Lisboa, 2: A \u2013 Ci\u00eancias Matem\u00e1ticas, 13 149\u2013172, (1970\/71)"},{"key":"7_CR24","unstructured":"Saxena, P.N.: A simplified method of enumerating latin squares by macmahon\u2019s differential operators; II. The 7 $$\\times $$ \u00d7 7 latin squares. J. Indian Soc. Agric. Stat. 3, 24\u201379 (1951)"},{"key":"7_CR25","unstructured":"Sch\u00f6nhardt, E.: \u00dcber lateinische quadrate und unionen. J. Reine Angew. Math. 163, 183\u2013230 (1930)"},{"key":"7_CR26","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/S0021-9800(67)80021-8","volume":"3","author":"MB Wells","year":"1967","unstructured":"Wells, M.B.: The number of latin squares of order eight. J. Comb. Theory 3, 98\u201399 (1967)","journal-title":"J. Comb. Theory"},{"key":"7_CR27","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of 20th International Conference on very Large Data Bases, VLDB 1215, 487\u2013499 (1994)"},{"issue":"3","key":"7_CR28","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng. 12(3), 372\u2013390 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"7_CR29","unstructured":"R: A Language and Environment for Statistical Computing. http:\/\/www.R-project.org"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-016-0007-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41060-016-0007-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-016-0007-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T17:20:49Z","timestamp":1600449649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41060-016-0007-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,13]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["7"],"URL":"https:\/\/doi.org\/10.1007\/s41060-016-0007-0","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"value":"2364-415X","type":"print"},{"value":"2364-4168","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,13]]}}}