<\/p>\n
R’deki iki vekt\u00f6r\u00fcn \u00f6\u011felerinin t\u00fcm benzersiz kombinasyonlar\u0131n\u0131 bulmak i\u00e7in a\u015fa\u011f\u0131daki y\u00f6ntemlerden herhangi birini kullanabilirsiniz:<\/span><\/p>\n Y\u00f6ntem 1: Tidyr’i kullan\u0131n<\/strong><\/span><\/p>\n Y\u00f6ntem 2: data.table’\u0131 kullanma<\/strong><\/span><\/p>\n A\u015fa\u011f\u0131daki \u00f6rnekler bu y\u00f6ntemlerin her birinin pratikte nas\u0131l kullan\u0131laca\u011f\u0131n\u0131 g\u00f6stermektedir.<\/span><\/p>\n A\u015fa\u011f\u0131daki kod, Tidyr<\/strong> paketindeki cross()<\/strong> i\u015flevini kullanarak R’deki iki vekt\u00f6r aras\u0131ndaki t\u00fcm benzersiz \u00f6\u011fe kombinasyonlar\u0131n\u0131n nas\u0131l bulunaca\u011f\u0131n\u0131 g\u00f6sterir:<\/span><\/p>\n Sonu\u00e7, iki vekt\u00f6r aras\u0131ndaki t\u00fcm benzersiz \u00f6\u011fe kombinasyonlar\u0131n\u0131 g\u00f6r\u00fcnt\u00fcleyen bir veri \u00e7er\u00e7evesidir.<\/span><\/p>\n 12 benzersiz kombinasyonun oldu\u011funu g\u00f6rebiliriz.<\/span><\/p>\n Yaln\u0131zca benzersiz kombinasyonlar\u0131n say\u0131s\u0131n\u0131 bilmek istiyorsan\u0131z, bu i\u015flevinrow()<\/strong> i\u015fleviyle sarabilirsiniz:<\/span><\/p>\n Crossing()<\/strong> fonksiyonunun ikiden fazla vekt\u00f6rle de kullan\u0131labilece\u011fini unutmay\u0131n.<\/span><\/p>\n Benzersiz kombinasyonlar\u0131n toplam say\u0131s\u0131n\u0131 bulmak i\u00e7in cross()<\/strong> i\u015flevine istedi\u011finiz say\u0131da vekt\u00f6r\u00fcn ad\u0131n\u0131 girmeniz yeterlidir.<\/span><\/p>\n A\u015fa\u011f\u0131daki kod, data.table<\/b> paketindeki CJ()<\/strong> i\u015flevini kullanarak R’deki iki vekt\u00f6r aras\u0131ndaki t\u00fcm benzersiz \u00f6\u011fe kombinasyonlar\u0131n\u0131n nas\u0131l bulunaca\u011f\u0131n\u0131 g\u00f6sterir:<\/span><\/p>\n Sonu\u00e7, iki vekt\u00f6r aras\u0131ndaki t\u00fcm benzersiz \u00f6\u011fe kombinasyonlar\u0131n\u0131 g\u00f6r\u00fcnt\u00fcleyen bir veri \u00e7er\u00e7evesidir.<\/span><\/p>\n CJ()<\/strong> fonksiyonunun sonu\u00e7lar\u0131n\u0131n cross()<\/strong> fonksiyonunun sonu\u00e7lar\u0131na kar\u015f\u0131l\u0131k geldi\u011fini unutmay\u0131n.<\/span><\/p>\n CJ()<\/strong> i\u015flevi ikiden fazla vekt\u00f6rle de kullan\u0131labilir.<\/span><\/p>\n Benzersiz kombinasyonlar\u0131n toplam say\u0131s\u0131n\u0131 bulmak i\u00e7in CJ()<\/strong> i\u015flevine istedi\u011finiz kadar vekt\u00f6r\u00fcn ad\u0131n\u0131 vermeniz yeterlidir.<\/span><\/p>\n A\u015fa\u011f\u0131daki e\u011fitimlerde R’de di\u011fer ortak g\u00f6revlerin nas\u0131l ger\u00e7ekle\u015ftirilece\u011fi a\u00e7\u0131klanmaktad\u0131r:<\/span><\/p>\n R’de gruba g\u00f6re benzersiz de\u011ferler nas\u0131l say\u0131l\u0131r?<\/a> R’deki iki vekt\u00f6r\u00fcn \u00f6\u011felerinin t\u00fcm benzersiz kombinasyonlar\u0131n\u0131 bulmak i\u00e7in a\u015fa\u011f\u0131daki y\u00f6ntemlerden herhangi birini kullanabilirsiniz: Y\u00f6ntem 1: Tidyr’i kullan\u0131n library (tidyr) #find unique combinations of elements from vector1 and vector2 crossing(vector1, vector2) Y\u00f6ntem 2: data.table’\u0131 kullanma library (data.table) #find unique combinations of elements from vector1 and vector2 CJ(vector1, vector2, unique= TRUE ) A\u015fa\u011f\u0131daki \u00f6rnekler bu y\u00f6ntemlerin […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[11],"tags":[],"class_list":["post-3798","post","type-post","status-publish","format-standard","hentry","category-rehber"],"yoast_head":"\n library<\/span> (tidyr)\n\n#find unique combinations of elements from vector1 and vector2<\/span>\ncrossing(vector1, vector2)\n<\/strong><\/pre>\n library<\/span> (data.table)\n\n#find unique combinations of elements from vector1 and vector2<\/span>\nCJ(vector1, vector2, unique= TRUE<\/span> ) \n<\/strong><\/pre>\n \u00d6rnek 1: Tidyr’i kullanarak benzersiz kombinasyonlar bulma<\/strong><\/span><\/h2>\n
library<\/span> (tidyr)\n\n#definevectors\n<\/span>region=c(' North<\/span> ', ' South<\/span> ', ' East<\/span> ', ' West<\/span> ')\ndots=c(0, 5, 10)\n\n#display all unique combinations of region and points\n<\/span>crossing(region, points)\n\n# A tibble: 12 x 2\n region points\n \n 1 East 0\n 2 East 5\n 3 East 10\n 4 North 0\n 5 North 5\n 6 North 10\n 7 South 0\n 8 South 5\n 9South 10\n10 West 0\n11 West 5\n12 West 10<\/strong><\/span><\/pre>\n library<\/span> (tidyr)\n\n#definevectors\n<\/span>region=c(' North<\/span> ', ' South<\/span> ', ' East<\/span> ', ' West<\/span> ')\ndots=c(0, 5, 10)\n\n#display number of unique combinations of region and points\n<\/span>nrow(crossing(region, points))\n\n[1] 12\n<\/strong><\/span><\/pre>\n \u00d6rnek 2: data.table’\u0131 kullanarak benzersiz kombinasyonlar bulun<\/strong><\/span><\/h2>\n
library<\/span> (data.table)\n\n#definevectors\n<\/span>region=c(' North<\/span> ', ' South<\/span> ', ' East<\/span> ', ' West<\/span> ')\ndots=c(0, 5, 10)\n\n#display all unique combinations of region and points\n<\/span>CJ(region, points, unique= TRUE<\/span> )\n\n region points\n 1: East 0\n 2: East 5\n 3: East 10\n 4: North 0\n 5: North 5\n 6: North 10\n 7: South 0\n 8: South 5\n 9: South 10\n10: West 0\n11: West 5\n12: West 10<\/strong><\/span><\/pre>\n Ek kaynaklar<\/strong><\/span><\/h2>\n
R’de bir veri \u00e7er\u00e7evesindeki tek sat\u0131rlar nas\u0131l se\u00e7ilir<\/a>
Dplyr kullanarak farkl\u0131 de\u011ferler nas\u0131l say\u0131l\u0131r?<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"