8 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 8 / 8
Yayın Pseudo-spherical submanifolds with 1-type pseudo-spherical gauss map(Birkhauser Verlag AG, 2016-05-28) Bektaş, Burcu; Canfes, Elif Özkara; Dursun, UğurIn this work, we study pseudo-Riemannian submanifolds of a pseudo-sphere with 1-type pseudo-spherical Gauss map. First, we classify Lorentzian surfaces in a 4-dimensional pseudo-sphere (Formula presented.) with index s, (Formula presented.), and having harmonic pseudo-spherical Gauss map. Then we give a characterization theorem for pseudo-Riemannian submanifolds of a pseudo-sphere (Formula presented.) with 1-type pseudo-spherical Gauss map, and we classify spacelike surfaces and Lorentzian surfaces in the de Sitter space (Formula presented.) with 1-type pseudo-spherical Gauss map. Finally, according to the causal character of the mean curvature vector we obtain the classification of submanifolds of a pseudo-sphere having 1-type pseudo-spherical Gauss map with nonzero constant component in its spectral decomposition.Yayın Design and analysis of classifier learning experiments in bioinformatics: survey and case studies(IEEE Computer Soc, 2012-12) İrsoy, Ozan; Yıldız, Olcay Taner; Alpaydın, Ahmet İbrahim EthemIn many bioinformatics applications, it is important to assess and compare the performances of algorithms trained from data, to be able to draw conclusions unaffected by chance and are therefore significant. Both the design of such experiments and the analysis of the resulting data using statistical tests should be done carefully for the results to carry significance. In this paper, we first review the performance measures used in classification, the basics of experiment design and statistical tests. We then give the results of our survey over 1,500 papers published in the last two years in three bioinformatics journals (including this one). Although the basics of experiment design are well understood, such as resampling instead of using a single training set and the use of different performance metrics instead of error, only 21 percent of the papers use any statistical test for comparison. In the third part, we analyze four different scenarios which we encounter frequently in the bioinformatics literature, discussing the proper statistical methodology as well as showing an example case study for each. With the supplementary software, we hope that the guidelines we discuss will play an important role in future studies.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 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 Theta and Beta1 frequency band values predict dyslexia classification(John Wiley and Sons Ltd, 2025-12-29) Eroğlu, Günet; Harb, Mhd Raja AbouDyslexia, impacting children's reading skills, prompts families to seek cost-effective neurofeedback therapy solutions. Utilising machine learning, we identified predictive factors for dyslexia classification. Employing advanced techniques, we gathered 14-channel Quantitative Electroencephalography (QEEG) data from 200 participants, achieving 99.6% dyslexic classification accuracy through cross-validation. During validation, 48% of dyslexic children's sessions were consistently classified as normal, with a 95% confidence interval of 47.31 to 48.68. Focusing on individuals consistently diagnosed with dyslexia during therapy, we found that dyslexic individuals exhibited higher theta values and lower beta1 values compared to typically developing children. This study pioneers machine learning in predicting dyslexia classification factors, offering valuable insights for families considering neurofeedback therapy investment.
