13 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 10 / 13
Yayın Univariate margin tree(Springer, 2010) Yıldız, Olcay TanerIn many pattern recognition applications, first decision trees are used due to their simplicity and easily interpretable nature. In this paper, we propose a new decision tree learning algorithm called univariate margin tree, where for each continuous attribute, the best split is found using convex optimization. Our simulation results on 47 datasets show that the novel margin tree classifier performs at least as good as C4.5 and LDT with a similar time complexity. For two class datasets it generates smaller trees than C4.5 and LDT without sacrificing from accuracy, and generates significantly more accurate trees than C4.5 and LDT for multiclass datasets with one-vs-rest methodology.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 Soft decision trees(IEEE, 2012) İrsoy, Ozan; Yıldız, Olcay Taner; Alpaydın, Ahmet İbrahim EthemWe discuss a novel decision tree architecture with soft decisions at the internal nodes where we choose both children with probabilities given by a sigmoid gating function. Our algorithm is incremental where new nodes are added when needed and parameters are learned using gradient-descent. We visualize the soft tree fit on a toy data set and then compare it with the canonical, hard decision tree over ten regression and classification data sets. Our proposed model has significantly higher accuracy using fewer nodes.Yayın VC-dimension of rule sets(IEEE Computer Soc, 2014-12-04) Yıldız, Olcay TanerIn this paper, we give and prove lower bounds of the VC-dimension of the rule set hypothesis class where the input features are binary or continuous. The VC-dimension of the rule set depends on the VC-dimension values of its rules and the number of inputs.Yayın Algoritmik kaynaşım yöntemiyle plaka tanıma sistemlerinin performansının artırılması(2011) Tamer, Engin; Çizmeci, BurakBu bildiride, bilgisayarlı görü ve örüntü tanıma alanlarında çok önemli bir yeri olan plaka tanıma sistemlerinin performansını artırmak amacıyla algoritmik kaynaşım yöntemini önermekteyiz. Plaka tanıma sistemleri genellikle plakanın yerinin saptanması, karakter bölütleme ve karakter tanıma şeklinde uç kısımdan oluşur. Karakter bölütleme ve tanıma, görüntü işleme ve örüntü tanıma alanlarında yoğun bir şekilde çalışılmış ve bu problemlerin çözümünde gürbüz sistemler tasarlanmıştır. Ancak plaka tanıma sistemlerinin en temel problemi plaka yerinin tam piksel hassasiyetle saptanmasıdır. Plaka yerinin saptanması için bir önceki çalışmamızda yatay tarama yöntemini önermiştik. Bu bildiride çift satırlı plakaları da okuyabilen dörtgen saptamaya dayalı farklı bir algoritma geliştirdik. Plaka yerinin saptanmasını gürbüz hale getirebilmek için iki farklı algoritmanın başarımlarını algoritmik kaynaşım çatısı ile birleştiren yeni bir yaklaşım sunmaktayız. Gerçekleştirilen benzetimlerde önerilen algoritmik kaynaşım yöntemi ile plaka tanıma sisteminin performansında önemli artışlar gözlemlenmiştir.Yayın Bilingual software requirements tracing using vector space model(SciTePress, 2014) Yıldız, Olcay Taner; Okutan, Ahmet; Solak, ErcanIn the software engineering world, creating and maintaining relationships between byproducts generated during the software lifecycle is crucial. A typical relation is the one that exists between an item in the requirements document and a block in the subsequent system design, i.e. class in the source code. In many software engineering projects, the requirement documentation is prepared in the language of the developers, whereas developers prefer to use the English language in the software development process. In this paper, we use the vector space model to extract traceability links between the requirements written in one language (Turkish) and the implementations of classes in another language (English). The experiments show that, by using a generic translator such as Google translate, we can obtain promising results, which can also be improved by using comment info in the source code.Yayın Plaka tanıma sistemi için farklı bir yaklaşım(IEEE, 2009-06-26) Tamer, Engin; Çizmeci, BurakBu bildiride, bilgisayarlı görü ve örüntü tanıma alanlarında çok popüler olan plaka tanıma sistemi için farklı bir yakla¸sım sunuyoruz. Plaka tanıma sistemi genellikle üç ana bölüme ayrılır: plakanın yerinin saptanması, karakter bölütleme ve karakter tanıma. Plaka tanıma sisteminin en önemli bölümü olan plaka yerinin saptanmasında, yatay tarama ile arama alanını daralttıktan sonra, Türk plakalarında yer alan TR işaretini kullanan yeni ve özgün bir algoritma öneriyoruz. Yeri saptanan plakanın karakterlerinin bölütlenmesi için ikili imge üzerinde morfolojik işlemler uyguluyoruz. Son olarak, karakter tanıma işleminde ise, harf ve sayı yapay sinir ağlarını ayırarak hata oranını en küçültmeyi hedefliyoruz.Yayın Feature extraction from discrete attributes(IEEE, 2010) Yıldız, Olcay TanerIn many pattern recognition applications, first decision trees are used due to their simplicity and easily interpretable nature. In this paper, we extract new features by combining k discrete attributes, where for each subset of size k of the attributes, we generate all orderings of values of those attributes exhaustively. We then apply the usual univariate decision tree classifier using these orderings as the new attributes. Our simulation results on 16 datasets from UCI repository [2] show that the novel decision tree classifier performs better than the proper in terms of error rate and tree complexity. The same idea can also be applied to other univariate rule learning algorithms such as C4.5Rules [7] and Ripper [3].Yayın On the VC-dimension of univariate decision trees(2012) Yıldız, Olcay TanerIn this paper, we give and prove lower bounds of the VC-dimension of the univariate decision tree hypothesis class. The VC-dimension of the univariate decision tree depends on the VC-dimension values of its subtrees and the number of inputs. In our previous work (Aslan et al., 2009), we proposed a search algorithm that calculates the VC-dimension of univariate decision trees exhaustively. Using the experimental results of that work, we show that our VC-dimension bounds are tight. To verify that the VC-dimension bounds are useful, we also use them 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 VC-dimension bounds finds trees that are more accurate as those pruned using cross-validation.Yayın A novel biometric authentication approach using electrocardiogram signals(IEEE, 2013) Gürkan, Hakan; Güz, Ümit; Yarman, Bekir Sıddık BinboğaIn this work, we present a novel biometric authentication approach based on combination of AC/DCT features, MFCC features, and QRS beat information of the ECG signals. The proposed approach is tested on a subset of 30 subjects selected from the PTB database. This subset consists of 13 healthy and 17 non-healthy subjects who have two ECG records. The proposed biometric authentication approach achieves average frame recognition rate of %97.31 on the selected subset. Our experimental results imply that the frame recognition rate of the proposed authentication approach is better than that of ACDCT and MFCC based biometric authentication systems, individually.
