Arama Sonuçları
Listeleniyor 1 - 10 / 21
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 Mixture of Gaussian models and bayes error under differential privacy(2011) Xi, Bowei; Kantarcıoğlu, Murat; İnan, AliGaussian mixture models are an important tool in Bayesian decision theory. In this study, we focus on building such models over statistical database protected under differential privacy. Our approach involves querying necessary statistics from a database and building a Bayesian classifier over the noise added responses generated according to differential privacy. We formally analyze the sensitivity of our query set. Since there are multiple methods to query a statistic, either directly or indirectly, we analyze the sensitivities for different querying methods. Furthermore we establish theoretical bounds for the Bayes error for the univariate (one dimensional) case. We study the Bayes error for the multivariate (high dimensional) case in experiments with both simulated data and real life data. We discover that adding Laplace noise to a statistic under certain constraint is problematic. For example variance-covariance matrix is no longer positive definite after noise addition. We propose a heuristic method to fix the noise added variance-covariance matrix.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 MIMO sinyalleri için uzay-zaman blok kodu klasifikasyonu(IEEE, 2014-04-26) Turan, Merve; Öner, Mustafa Mengüç; Çırpan, Hakan AliBilinmeyen haberleşme sinyallerinin gözü kapalı ve işbirliksiz tanınması için geliştirilen teknikler, hem askeri hem de sivil uygulamalarda kullanım bulmuştur. Çok Girdili Çok Çıktılı (MIMO) haberleşme sistemleri, sinyal tanıma sistemleri için üstesinden gelinmesi gereken yeni problemler ortaya koymaktadır. MIMO haberleşmesinde kullanılan uzay zaman kodlarının gözükapalı tanınması bu problemlerin en önemlilerinden biri olarak görülebilir. Bu çalışmada uzay zaman blok kodlanmış sinyal vektörlerinin döngüsel-durağan (cyclostationary) karakteristiklerinin farklı uzay zaman blok kodlarını birbirinden ayırdetmek amacıyla kullanıldığı yenilikçi uzay-zaman kodu tanıma algoritmaları öneriyoruz.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 VİSKON-RS : Uzaktan algılama ile hızlı afet hasar analiz yazılımı(IEEE, 2015-06-19) Kahraman, Fatih; İmamoğlu, Mümin; Özcan, Büşra Yüksel; Huruoğlu, Cengiz; Alasağ, Tolga; Gemici, Ömer Faruk; Hocaoğlu, Muhammet A.; Ateş, Hasan FehmiAfet sonrası, acil müdahale ekiplerinin yönlendirilmesi ve iyileştirme çalışmalarının planlanması amacıyla hızlı hasar değerlendirmesine ihtiyaç duyulmaktadır. Bu çalışmada, AFAD ihtiyaçları doğrultusunda uzaktan (uzay/hava) algılama teknolojileri ile elde edilen görüntülerin afet hasar analizinde kullanılmasına yönelik VİSKON-RS yazılımı geliştirilmiştir. Geliştirilen yazılım; deprem, sel ve orman yangını gibi afet türlerinin hasar analizlerine özelleşmiş uygulamalar içermektedir. Ayrıca genel görüntü analizinde kullanılabilecek değişiklik analizi, eğitimli/eğitimsiz sınıflandırma, nesne tabanlı görüntü analizi ve doku analizi gibi uygulamalar yazılıma entegre edilmiştir. VİSKON-RS yazılımın temel amacı, afet sonrası uzaktan algılama verilerinin, açılması, işlenmesi, analiz edilmesi, sonuçların sergilenmesi ve karar destek sistemlerine aktarılması adımlarını içeren bütünleşik bir yazılım çözümü sunmaktır.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.
- «
- 1 (current)
- 2
- 3
- »
