8 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 8 / 8
Yayın Incremental construction of classifier and discriminant ensembles(Elsevier Science Inc, 2009-04-15) Ulaş, Aydın; Semerci, Murat; Yıldız, Olcay Taner; Alpaydın, Ahmet İbrahim EthemWe discuss approaches to incrementally construct an ensemble. The first constructs an ensemble of classifiers choosing a subset from a larger set, and the second constructs an ensemble of discriminants, where a classifier is used for some classes only. We investigate criteria including accuracy, significant improvement, diversity, correlation, and the role of search direction. For discriminant ensembles, we test subset selection and trees. Fusion is by voting or by a linear model. Using 14 classifiers on 38 data sets. incremental search finds small, accurate ensembles in polynomial time. The discriminant ensemble uses a subset of discriminants and is simpler, interpretable, and accurate. We see that an incremental ensemble has higher accuracy than bagging and random subspace method; and it has a comparable accuracy to AdaBoost. but fewer classifiers.Yayın Tree Ensembles on the induced discrete space(Institute of Electrical and Electronics Engineers Inc., 2016-05) Yıldız, Olcay TanerDecision trees are widely used predictive models in machine learning. Recently, K-tree is proposed, where the original discrete feature space is expanded by generating all orderings of values of k discrete attributes and these orderings are used as the new attributes in decision tree induction. Although K-tree performs significantly better than the proper one, their exponential time complexity can prohibit their use. In this brief, we propose K-forest, an extension of random forest, where a subset of features is selected randomly from the induced discrete space. Simulation results on 17 data sets show that the novel ensemble classifier has significantly lower error rate compared with the random forest based on the original feature space.Yayın Cost-conscious comparison of supervised learning algorithms over multiple data sets(Elsevier Sci Ltd, 2012-04) Ulaş, Aydın; Yıldız, Olcay Taner; Alpaydın, Ahmet İbrahim EthemIn the literature, there exist statistical tests to compare supervised learning algorithms on multiple data sets in terms of accuracy but they do not always generate an ordering. We propose Multi(2)Test, a generalization of our previous work, for ordering multiple learning algorithms on multiple data sets from "best" to "worst" where our goodness measure is composed of a prior cost term additional to generalization error. Our simulations show that Multi2Test generates orderings using pairwise tests on error and different types of cost using time and space complexity of the learning algorithms.Yayın CNN-Based deep learning architecture for electromagnetic imaging of rough surface profiles(IEEE, 2022-10) Aydın, İzde; Budak, Güven; Sefer, Ahmet; Yapar, AliA convolutional neural network (CNN) based deep learning (DL) technique for electromagnetic imaging of rough surfaces separating two dielectric media is presented. The direct scattering problem is formulated through the conventional integral equations and the synthetic scattered field data is produced by a fast numerical solution technique which is based on Method of Moments (MoM). Two different special CNN architectures are designed and implemented for the solution of the inverse rough surface imaging problem wherein both random and deterministic rough surface profiles can be imaged. It is shown by a comprehensive numerical analysis that the proposed deep-learning (DL) inversion scheme is very effective and robust.Yayın Feature extraction in shape recognition using segmentation of the boundary curve(Elsevier Science BV, 1997-10) Özuğur, Timuçin; Denizhan, Yağmur; Panayırcı, ErdalWe present a new method for feature extraction of two-dimensional shape information based on segmentation of the boundary curve. This approach partitions closed shapes into segments and finds their angular spans. The number of segments and the angular spans form the first two feature parameters of a given shape. Fourier coefficients of all segments constitute the final feature parameters. The algorithm renders the shapes independent of scale, rotation and translation, The main advantage of this method is to speed up substantially the recognition process of the shapes, mainly because it is possible to design the classification rule in a hierarchical way. It is therefore suitable for objects to be sorted in a factory environment where the silhouette boundary supplies sufficient information for identification.Yayın Model selection in omnivariate decision trees using Structural Risk Minimization(Elsevier Science Inc, 2011-12-01) Yıldız, Olcay TanerAs opposed to trees that use a single type of decision node, an omnivariate decision tree contains nodes of different types. We propose to use Structural Risk Minimization (SRM) to choose between node types in omnivariate decision tree construction to match the complexity of a node to the complexity of the data reaching that node. In order to apply SRM for model selection, one needs the VC-dimension of the candidate models. In this paper, we first derive the VC-dimension of the univariate model, and estimate the VC-dimension of all three models (univariate, linear multivariate or quadratic multivariate) experimentally. Second, we compare SRM with other model selection techniques including Akaike's Information Criterion (AIC), Bayesian Information Criterion (BIC) and cross-validation (CV) on standard datasets from the UCI and Delve repositories. We see that SRM induces omnivariate trees that have a small percentage of multivariate nodes close to the root and they generalize more or at least as accurately as those constructed using other model selection techniques.Yayın Robust localization and identification of African clawed frogs in digital images(Elsevier Science BV, 2014-09) Tek, Faik Boray; Cannavo, Flavio; Nunnari, Giuseppe; Kale, İzzetWe study the automatic localization and identification of African clawed frogs (Xenopus laevis sp.) in digital images taken in a laboratory environment. We propose a novel and stable frog body localization and skin pattern window extraction algorithm. We show that it compensates scale and rotation changes very well. Moreover, it is able to localize and extract highly overlapping regions (pattern windows) even in the cases of intense affine transformations, blurring, Gaussian noise, and intensity transformations. The frog skin pattern (i.e. texture) provides a unique feature for the identification of individual frogs. We investigate the suitability of five different feature descriptors (Gabor filters, area granulometry, HoG,(1) dense SIFT,(2) and raw pixel values) to represent frog skin patterns. We compare the robustness of the features based on their identification performance using a nearest neighbor classifier. Our experiments show that among five features that we tested, the best performing feature against rotation, scale, and blurring modifications was the raw pixel feature, whereas the SIFT feature was the best performing one against affine and intensity modifications.Yayın Hierarchical quantization indexing for wavelet and wavelet packet image coding(Elsevier Science BV, 2010-02) Ateş, Hasan Fehmi; Tamer, EnginIn this paper, we introduce the quantization index hierarchy, which is used for efficient coding of quantized wavelet and wavelet packet coefficients. A hierarchical classification map is defined in each wavelet subband, which describes the quantized data through a series of index classes. Going from bottom to the top of the tree, neighboring coefficients are combined to form classes that represent some statistics of the quantization indices of these coefficients. Higher levels of the tree are constructed iteratively by repeating this class assignment to partition the coefficients into larger Subsets. The class assignments are optimized using a rate-distortion cost analysis. The optimized tree is coded hierarchically from top to bottom by coding the class membership information at each level of the tree. Context-adaptive arithmetic coding is used to improve coding efficiency. The developed algorithm produces PSNR results that are better than the state-of-art wavelet-based and wavelet packet-based coders in literature.
