4 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 4 / 4
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 Unsupervised textile defect detection using convolutional neural networks(Elsevier Ltd, 2021-12) Koulali, Imane; Eskil, Mustafa TanerIn this study, we propose a novel motif-based approach for unsupervised textile anomaly detection that combines the benefits of traditional convolutional neural networks with those of an unsupervised learning paradigm. It consists of five main steps: preprocessing, automatic pattern period extraction, patch extraction, features selection and anomaly detection. This proposed approach uses a new dynamic and heuristic method for feature selection which avoids the drawbacks of initialization of the number of filters (neurons) and their weights, and those of the backpropagation mechanism such as the vanishing gradients, which are common practice in the state-of-the-art methods. The design and training of the network are performed in a dynamic and input domain-based manner and, thus, no ad-hoc configurations are required. Before building the model, only the number of layers and the stride are defined. We do not initialize the weights randomly nor do we define the filter size or number of filters as conventionally done in CNN-based approaches. This reduces effort and time spent on hyper-parameter initialization and fine-tuning. Only one defect-free sample is required for training and no further labeled data is needed. The trained network is then used to detect anomalies on defective fabric samples. We demonstrate the effectiveness of our approach on the Patterned Fabrics benchmark dataset. Our algorithm yields reliable and competitive results (on recall, precision, accuracy and f1-measure) compared to state-of-the-art unsupervised approaches, in less time, with efficient training in a single epoch and a lower computational cost.Yayın Optimizing indoor localization accuracy with neural network performance metrics and software-defined IEEE 802.11az Wi-Fi set-up(IEEE, 2023-10-28) Kouhalvandi, Lida; Aygün, Sercan; Matekovits, Ladislau; Miramirkhani, FarshadAccurately classifying regions based on Wi-Fi signals can be a difficult task, especially when considering different frequency values. In this study, we aimed to improve the accuracy of indoor localization by developing a novel approach that does not rely on pre-trained models. To achieve this, fingerprints from the IEEE 802.11az standard were randomly selected, and the data samples were trained using parameterized station characteristics and neural network hyperparameters. The impact of each parameter on the localization accuracy was measured, and performance monitoring metrics such as F1-Measure and confusion matrix-based metrics were evaluated. Furthermore, the Thompson sampling (TS) algorithm was employed to determine the optimal parameters, which helped to achieve the best possible accuracy. The proposed approach demonstrated improved accuracy in region localization compared to conventional heuristic approaches which typically yield an accuracy range of 65% to 77%. The proposed approach achieved up to 80% accuracy in region localization and could be a promising solution for indoor localization in various settings.Yayın Crossing minimization in weighted bipartite graphs(Elsevier B.V., 2009-12) Çakıroğlu, Olca Arda; Erten, Cesim; Karataş, Ömer; Sözdinler, MelihGiven a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has received much attention in literature. The problem is NP-complete in general and several practically efficient heuristics and polynomial-time algorithms with a constant approximation ratio have been suggested. We generalize the problem and consider the version where the edges have nonnegative weights. Although this problem is more general and finds specific applications in automatic graph layout problems similar to those of the unweighted case, it has not received as much attention. We provide a new technique that efficiently approximates a solution to this more general problem within a constant approximation ratio of 3. In addition we provide appropriate generalizations of some common heuristics usually employed for the unweighted case and compare their performances.
