Arama Sonuçları
Listeleniyor 1 - 10 / 13
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 Biometric identification using fingertip electrocardiogram signals(Springer London Ltd, 2018-07) Güven, Gökhan; Gürkan, Hakan; Güz, ÜmitIn this research work, we present a newly fingertip electrocardiogram (ECG) data acquisition device capable of recording the lead-1 ECG signal through the right- and left-hand thumb fingers. The proposed device is high-sensitive, dry-contact, portable, user-friendly, inexpensive, and does not require using conventional components which are cumbersome and irritating such as wet adhesive Ag/AgCl electrodes. One of the other advantages of this device is to make it possible to record and use the lead-1 ECG signal easily in any condition and anywhere incorporating with any platform to use for advanced applications such as biometric recognition and clinical diagnostics. Furthermore, we proposed a biometric identification method based on combining autocorrelation and discrete cosine transform-based features, cepstral features, and QRS beat information. The proposed method was evaluated on three fingertip ECG signal databases recorded by utilizing the proposed device. The experimental results demonstrate that the proposed biometric identification method achieves person recognition rate values of 100% (30 out of 30), 100% (45 out of 45), and 98.33% (59 out of 60) for 30, 45, and 60 subjects, respectively.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 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.
