Arama Sonuçları
Listeleniyor 1 - 10 / 146
Yayın Calculating the VC-dimension of decision trees(IEEE, 2009) Aslan, Özlem; Yıldız, Olcay Taner; Alpaydın, Ahmet İbrahim EthemWe propose an exhaustive search algorithm that calculates the VC-dimension of univariate decision trees with binary features. The VC-dimension of the univariate decision tree with binary features depends on (i) the VC-dimension values of the left and right subtrees, (ii) the number of inputs, and (iii) the number of nodes in the tree. From a training set of example trees whose VC-dimensions are calculated by exhaustive search, we fit a general regressor to estimate the VC-dimension of any binary tree. These VC-dimension estimates are then used to get VC-generalization bounds for complexity control using SRM in decision trees, i.e., pruning. Our simulation results shows that SRM-pruning using the estimated VC-dimensions finds trees that are as accurate as those pruned using cross-validation.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 Raylı sistemlerde yüksek gerilim aksamının otomatik denetimi(IEEE, 2014-04-23) Ağdoğan, Didem; Babacan, Veysel Karani; Eskil, Mustafa TanerRaylı sistemlerde yolculugun sorunsuz tamamla-nabilmesi için sistem bütünlüğü kritik öneme sahiptir. Sistem bütünlüğü, lokomotif ve vagonlar haricinde katener (yüksek gerilim) hattı, pantograf ve raylara bağlıdır. Katener hattı ve pantograf, lokomotife elektrik iletimini sağlarken rayların seviyesi pantografın elektrik hattına düzenli temasına etki eder. Raylarda oluşabilecek çöküntüler katener hattı ile pantograf arasında ark (kıvılcım) oluşumuna neden olur. Katener hattının pantograf sınırları dışına çıkması, pantografta oluşabilecek çentikler ve ark oluşumu lokomotif üzerinden anlık izlenebilir. Bu çalışmada amacımız, bu üç ögeden kaynaklanabilecek hataları kameralı bir sistemle, gerçek zamanlı ve otomatik izleyerek tren yolculuğunun güvenli ve kesintisiz yapılmasına katkıda bulunmaktır.Yayın Driver recognition using gaussian mixture models and decision fusion techniques(Springer-Verlag Berlin, 2008) Benli, Kristin Surpuhi; Düzağaç, Remzi; Eskil, Mustafa TanerIn this paper we present our research in driver recognition. The goal of this study is to investigate the performance of different classifier fusion techniques in a driver recognition scenario. We are using solely driving behavior signals such as break and accelerator pedal pressure, engine RPM, vehicle speed; steering wheel angle for identifying the driver identities. We modeled each driver using Gaussian Mixture Models, obtained posterior probabilities of identities and combined these scores using different fixed mid trainable (adaptive) fusion methods. We observed error rates is low as 0.35% in recognition of 100 drivers using trainable combiners. We conclude that the fusion of multi-modal classifier results is very successful in biometric recognition of a person in a car setting.Yayın Mobile applications discovery: a subscriber-centric approach(Wiley Periodicals, 2011-03) Erman, Bilgehan; İnan, Ali; Nagarajan, Ramesh; Uzunalioğlu, HüseyinRapid adoption of smartphones and the business success of the Apple App Store have resulted in the rampant growth of mobile applications. Seeking new revenue opportunities from application development has created a gold rush. However, free or very cheap applications constitute a great bulk of the application downloads putting great pricing pressure on the developers. Furthermore, usage statistics suggest that most of the applications have been either one-trick applications or are downright useless, meriting no attention from the user beyond the first day. This is not surprising since cheap prices will dissuade developers from investing large sums of money to continue to develop more sophisticated, high quality applications. Developers have been complaining about the lack of visibility of their applications in stores that are beginning to resemble a high volume warehouse. It is clear that enhancing application discovery and building better marketing tools will be essential for the continued success of the mobile application marketplace and application stores. This paper proposes and investigates techniques for effective discovery of applications by matching user interests with application characteristics, with a special focus on adapting classical data mining techniques to user ratings of the applications. The user ratings are leveraged to make recommendations on potential applications of interest.Yayın Comment on "Modified Baptista type chaotic cryptosystem via matrix secret key" [Phys. Lett. A 372 (2008) 5427](Elsevier Science BV, 2009-09-07) Rhouma, Rhouma; Solak, Ercan; Arroyo, David; Li, Shujun; Alvarez, Gonzalo; Belghith, Safya MdimeghIn this comment, we analyze a recently proposed Baptista-like cryptosystem and show that it is not invertible. Others weaknesses are also reported. A modified version of this cryptosystem is proposed to show how to overcome the non-invertibility.Yayın Incremental construction of rule ensembles using classifiers produced by different class orderings(IEEE, 2016) Yıldız, Olcay Taner; Ulaş, AydınIn this paper, we discuss a novel approach to incrementally construct a rule ensemble. The approach constructs an ensemble from a dynamically generated set of rule classifiers. Each classifier in this set is trained by using a different class ordering. We investigate criteria including accuracy, ensemble size, and the role of starting point in the search. Fusion is done by averaging. Using 22 data sets, floating search finds small, accurate ensembles in polynomial time.Yayın Visual modeling of Turkish morphology(European Language Resources Association (ELRA), 2020-05-16) Özenç, Berke; Solak, ErcanIn this paper, we describe the steps in a visual modeling of Turkish morphology using diagramming tools. We aimed to make modeling easier and more maintainable while automating much of the code generation. We released the resulting analyzer, MorTur, and the diagram conversion tool, DiaMor as free, open-source utilities. MorTur analyzer is also publicly available on its web page as a web service. MorTur and DiaMor are part of our ongoing efforts in building a set of natural language processing tools for Turkic languages under a consistent framework.Yayın Numerical integration methods for simulation of mass-spring-damper systems(Springer-Verlag, 2012) Özgüz, Mete; Eskil, Mustafa TanerThe dynamics of a face are often implemented as a system of connected particles with various forces acting upon them. Animation of such a system requires the approximation of velocity and position of each particle through numerical integration. There are many numerical integrators that are commonly used in the literature. We conducted experiments to determine the suitability of numerical integration methods in approximating the particular dynamics of mass-spring-damper systems. Among Euler, semi-implicit Euler, Runge-Kutta and Leapfrog, we found that simulation with Leapfrog numerical integration characterizes a mass-spring-damper system best in terms of the energy loss of the overall system.Yayın TRopBank: Turkish PropBank V2.0(European Language Resources Association (ELRA), 2020-05-16) Kara, Neslihan; Aslan, Deniz Baran; Marşan, Büşra; Bakay, Özge; Ak, Koray; Yıldız, Olcay TanerIn this paper, we present and explain TRopBank “Turkish PropBank v2.0”. PropBank is a hand-annotated corpus of propositions which is used to obtain the predicate-argument information of a language. Predicate-argument information of a language can help understand semantic roles of arguments. “Turkish PropBank v2.0”, unlike PropBank v1.0, has a much more extensive list of Turkish verbs, with 17.673 verbs in total.
