20 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 10 / 20
Yayın Sınıflandırma için diferansiyel mahremiyete dayalı öznitelik seçimi(Gazi Univ, Fac Engineering Architecture, 2018) Var, Esra; İnan, AliVeri madenciliği ve makine öğrenmesi çözümlerinin en önemli ön aşamalarından biri yapılacak analizde kullanılacak verinin özniteliklerinin uygun bir alt kümesini belirlemektir. Sınıflandırma yöntemleri için bu işlem, bir özniteliğin sınıf niteliği ile ne oranda ilişkili olduğuna bakılarak yapılır. Kişisel gizliliği koruyan pek çok sınıflandırma çözümü bulunmaktadır. Ancak bu yöntemler için öznitelik seçimi yapan çözümler geliştirilmemiştir. Bu çalışmada, istatistiksel veritabanı güvenliğinde bilinen en kapsamlı ve güvenli çözüm olan diferansiyel mahremiyete dayalı özgün öznitelik seçimi yöntemleri sunulmaktadır. Önerilen bu yöntemler, yaygın olarak kullanılan bir veri madenciliği kütüphanesi olan WEKA ile entegre edilmiş ve deney sonuçları ile önerilen çözümlerin sınıflandırma başarımına olumlu etkileri gösterilmiştir.Yayın Construction of a Turkish proposition bank(Tubitak Scientific & Technical Research Council Turkey, 2018) Ak, Koray; Toprak, Cansu; Esgel, Volkan; Yıldız, Olcay TanerThis paper describes our approach to developing the Turkish PropBank by adopting the semantic role-labeling guidelines of the original PropBank and using the translation of the English Penn-TreeBank as a resource. We discuss the semantic annotation process of the PropBank and language-specific cases for Turkish, the tools we have developed for annotation, and quality control for multiuser annotation. In the current phase of the project, more than 9500 sentences are semantically analyzed and predicate-argument information is extracted for 1330 verbs and 1914 verb senses. Our plan is to annotate 17,000 sentences by the end of 2017.Yayın Comment on "Encryption and decryption of images with chaotic map lattices" [Chaos 16, 033118 (2006)](American Institute of Physics Inc., 2008-09) Solak, Ercan; Çokal, CahitIn this paper, we comment on the chaotic encryption algorithm proposed by A. N. Pisarchik et al. [Chaos 16, 033118 (2006)]. We demonstrate that the algorithm is not invertible. We suggest simple modifications that can remedy some of the problems we identified.Yayın Fully decentralized and collaborative multilateration primitives for uniquely localizing WSNs(Springer International Publishing AG, 2010) Çakıroğlu, Olca Arda; Erten, CesimWe provide primitives for uniquely localizing WSN nodes. The goal is to maximize the number of uniquely localized nodes assuming a fully decentralized model of computation. Each node constructs a cluster of its own and applies unique localization primitives on it. These primitives are based on constructing a special order for multilaterating the nodes within the cluster. The proposed primitives are fully collaborative and thus the number of iterations required to compute the localization is fewer than that of the conventional iterative multilateration approaches. This further limits the messaging requirements. With relatively small clusters and iteration counts, we can localize almost all the uniquely localizable nodes.Yayın Battle Royale Optimizer for solving binary optimization problems(Elsevier B.V., 2022-05) Akan, Taymaz; Agahian, Saeid; Dehkharghani, RahimBattle Royale Optimizer (BRO) is a recently proposed metaheuristic optimization algorithm used only in continuous problem spaces. The BinBRO is a binary version of BRO. The BinBRO algorithm employs a differential expression, which utilizes a dissimilarity measure between binary vectors instead of a vector subtraction operator, used in the original BRO algorithm to find the nearest neighbor. To evaluate BinBRO, we applied it to two popular benchmark datasets: the uncapacitated facility location problem (UFLP) and the maximum-cut (Max-Cut) graph problems from OR-Library. An open-source MATLAB implementation of BinBRO is available on CodeOcean and GitHub websites.Yayın On the online coalition structure generation problem(AI Access Foundationusc Information Sciences Inst, 2021) Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, ShmuelWe consider the online version of the coalition structure generation problem, in which agents, corresponding to the vertices of a graph, appear in an online fashion and have to be partitioned into coalitions by an authority (i.e., an online algorithm). When an agent appears, the algorithm has to decide whether to put the agent into an existing coalition or to create a new one containing, at this moment, only her. The decision is irrevocable. The objective is partitioning agents into coalitions so as to maximize the resulting social welfare that is the sum of all coalition values. We consider two cases for the value of a coalition: (1) the sum of the weights of its edges, and (2) the sum of the weights of its edges divided by its size. Coalition structures appear in a variety of application in AI, multi-agent systems, networks, as well as in social networks, data analysis, computational biology, game theory, and scheduling. For each of the coalition value functions we consider the bounded and unbounded cases depending on whether or not the size of a coalition can exceed a given value alpha. Furthermore, we consider the case of a limited number of coalitions and various weight functions for the edges, i.e., unrestricted, positive and constant weights. We show tight or nearly tight bounds for the competitive ratio in each case.Yayın Crossing minimization in weighted bipartite graphs(Elsevier B.V., 2009-12) Çakıroğlu, Olca Arda; Erten, Cesim; Karataş, Ömer; Sözdinler, MelihGiven a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has received much attention in literature. The problem is NP-complete in general and several practically efficient heuristics and polynomial-time algorithms with a constant approximation ratio have been suggested. We generalize the problem and consider the version where the edges have nonnegative weights. Although this problem is more general and finds specific applications in automatic graph layout problems similar to those of the unweighted case, it has not received as much attention. We provide a new technique that efficiently approximates a solution to this more general problem within a constant approximation ratio of 3. In addition we provide appropriate generalizations of some common heuristics usually employed for the unweighted case and compare their performances.Yayın A tree-based approach for English-to-Turkish translation(Tubitak Scientific & Technical Research Council Turkey, 2019) Bakay, Özge; Avar, Begüm; Yıldız, Olcay TanerIn this paper, we present our English-to-Turkish translation methodology, which adopts a tree-based approach. Our approach relies on tree analysis and the application of structural modification rules to get the target side (Turkish) trees from source side (English) ones. We also use morphological analysis to get candidate root words and apply tree-based rules to obtain the agglutinated target words. Compared to earlier work on English-to-Turkish translation using phrase-based models, we have been able to obtain higher BLEU scores in our current study. Our syntactic subtree permutation strategy, combined with a word replacement algorithm, provides a 67% relative improvement from a baseline 12.8 to 21.4 BLEU, all averaged over 10-fold cross-validation. As future work, improvements in choosing the correct senses and structural rules are needed.Yayın Programlamaya giriş dersini alan öğrencilerin programlama öz yeterlilik algılarının ve programlamaya bakış açılarının incelenmesi(Düzce Üniversitesi, 2021-05-29) Benli, Kristin Surpuhi; Tek, Faik BorayBu çalışmada üniversite öğrencilerinin Java programlama öz yeterlilik algıları, programlama öğrenme istekleri ve çalışma alışkanlıkları çeşitli değişkenlere göre (cinsiyet, bölüm, eğitim dili, harf notu, ders tekrarları vb.) istatistiksel yöntemler kullanılarak (T-testi, Mann Whitney U-testi, Kruskal Wallis H testi, tek yönlü varyans analizi, Ki-Kare testi) incelenmiştir. Çalışma grubu, farklı bölümlerde zorunlu olarak programlamaya giriş dersini alan 191 lisans öğrencisinden oluşmaktadır. Elde edilen sonuçlara göre öğrencilerin Java programlama öz yeterlilik algıları bölümlerine ve programlama öğrenme isteklerine göre farklılaşmaktadır. Çalışmada ayrıca Apriori algoritması kullanılarak birliktelik kuralları çıkartılmıştır. En yüksek güven değeri elde edilen kurala göre, programlama öğrenmeyi çok fazla isteyen, programlama öğrenmenin iş hayatında kendisine fayda sağlayacağını düşünen ve programlama dersinden başarı ile geçen öğrencilerin programlama öz yeterlilikleri yüksektir.
