Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 9 of 9

Full-Text Articles in Physical Sciences and Mathematics

Comparative Study Of Supervised Classification Techniques With A Modified Knn Algorithm, Noah Owusu Aug 2023

Comparative Study Of Supervised Classification Techniques With A Modified Knn Algorithm, Noah Owusu

Open Access Theses & Dissertations

The goal of classification is to develop a model that can be used to accurately assign new observations to labeled classes based on the patterns learned from the training data. K-nearest Neighbors algorithm (KNN) is a popular and widely used algorithm for classification, however, its performance can be adversely affected by the presence of outliers in a dataset. In this study we have modified this existing KNN algorithm that can alleviate the effect of outliers in a dataset, thereby improving the performance of the KNN algorithm. We compared the performances of the Modified KNN method and the Existing KNN algorithm …


Why Softmax? Because It Is The Only Consistent Approach To Probability-Based Classification, Anatole Lokshin, Vladik Kreinovich Jun 2023

Why Softmax? Because It Is The Only Consistent Approach To Probability-Based Classification, Anatole Lokshin, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical problems, the most effective classification techniques are based on deep learning. In this approach, once the neural network generates values corresponding to different classes, these values are transformed into probabilities by using the softmax formula. Researchers tried other transformation, but they did not work as well as softmax. A natural question is: why is softmax so effective? In this paper, we provide a possible explanation for this effectiveness: namely, we prove that softmax is the only consistent approach to probability-based classification. In precise terms, it is the only approach for which two reasonable probability-based ideas -- Least …


How Does Land Cover Classification In Google Earth Engine Compare With Traditional Methods Of Land Cover Classification? What Are The Tradeoffs?, Carlos Sebastian Reyes May 2021

How Does Land Cover Classification In Google Earth Engine Compare With Traditional Methods Of Land Cover Classification? What Are The Tradeoffs?, Carlos Sebastian Reyes

Open Access Theses & Dissertations

The project focuses on comparing land cover classification of traditional methods such as ArcGIS with newer ones such as Google Earth Engine (GEE) as well as discussing any potential tradeoffs. Two studies were performed in both platforms, the first involved analyzing land cover change in the Middle Rio Grande (MRG) region of southern New Mexico, far west Texas, and northern Chihuahua, Mexico. The MRG study focused on urban and agricultural change in the region using two different classification methods. The second study focused on creating a post-hurricane damage assessment (PDA) with the goal of developing an automated method of estimating …


Computer-Aided Classification Of Impulse Oscillometric Measures Of Respiratory Small Airways Function In Children, Nancy Selene Avila Jan 2019

Computer-Aided Classification Of Impulse Oscillometric Measures Of Respiratory Small Airways Function In Children, Nancy Selene Avila

Open Access Theses & Dissertations

Computer-aided classification of respiratory small airways dysfunction is not an easy task. There is a need to develop more robust classifiers, specifically for children as the classification studies performed to date have the following limitations: 1) they include features derived from tests that are not suitable for children and 2) they cannot distinguish between mild and severe small airway dysfunction.

This Dissertation describes the classification algorithms with high discriminative capacity to distinguish different levels of respiratory small airways function in children (Asthma, Small Airways Impairment, Possible Small Airways Impairment, and Normal lung function). This ability came from innovative feature selection, …


The New Issues In Classification Problems, Md Mahmudul Hasan Jan 2016

The New Issues In Classification Problems, Md Mahmudul Hasan

Open Access Theses & Dissertations

The data involved with science and engineering getting bigger everyday. To study and organize a big amount of data is difficult without classification. In machine learning, classification is the problem of identifying a given data from a set of categories. There are several classification technique people using to classify a given data. In our work we present a sparse representation technique to perform classification. The popularity of this technique motivates us to use on our collected samples. To find a sparse representation, we used an $l_1$-minimization algorithm which is a convex relaxation algorithm proven very efficient by researchers. The purpose …


Novel Classification Of Slow Movement Objects In Urban Traffic Environments Using Wideband Pulse Doppler Radar, Berta Rodriguez Hervas Jan 2015

Novel Classification Of Slow Movement Objects In Urban Traffic Environments Using Wideband Pulse Doppler Radar, Berta Rodriguez Hervas

Open Access Theses & Dissertations

Every year thousands of people are involved in traffic accidents, some of which are fatal. An important percentage of these fatalities are caused by human error, which could be prevented by increasing the awareness of drivers and the autonomy of vehicles. Since driver assistance systems have the potential to positively impact tens of millions of people, the purpose of this research is to study the micro-Doppler characteristics of vulnerable urban traffic components, i.e. pedestrians and bicyclists, based on information obtained from radar backscatter, and to develop a classification technique that allows automatic target recognition with a vehicle integrated system. For …


A Convex Optimization Algorithm For Sparse Representation And Applications In Classification Problems, Reinaldo Sanchez Arias Jan 2013

A Convex Optimization Algorithm For Sparse Representation And Applications In Classification Problems, Reinaldo Sanchez Arias

Open Access Theses & Dissertations

In pattern recognition and machine learning, a classification problem refers to finding an algorithm for assigning a given input data into one of several categories. Many natural signals are sparse or compressible in the sense that they have short representations when expressed in a suitable basis. Motivated by the recent successful development of algorithms for sparse signal recovery, we apply the selective nature of sparse representation to perform classification. Any test sample is represented in an overcomplete dictionary with the training sample as base elements. A given test sample can be expressed as a linear combination of only those training …


A Sparse Representation Technique For Classification Problems, Reinaldo Sanchez Arias Jan 2011

A Sparse Representation Technique For Classification Problems, Reinaldo Sanchez Arias

Open Access Theses & Dissertations

In pattern recognition and machine learning, a classification problem refers to finding an algorithm for assigning a given input data into one of several categories. Many natural signals are sparse or compressible in the sense that they have short representations when expressed in a suitable basis. Motivated by the recent successful development of algorithms for sparse signal recovery, we apply the selective nature of sparse representation to perform classification. In order to find such sparse linear representation, we implement an l1-minimization algorithm. This methodology overcomes the lack of robustness with respect to outliers. In contrast to other classification …


Algorithms For Training Large-Scale Linear Programming Support Vector Regression And Classification, Pablo Rivas Perea Jan 2011

Algorithms For Training Large-Scale Linear Programming Support Vector Regression And Classification, Pablo Rivas Perea

Open Access Theses & Dissertations

The main contribution of this dissertation is the development of a method to train a Support Vector Regression (SVR) model for the large-scale case where the number of training samples supersedes the computational resources. The proposed scheme consists of posing the SVR problem entirely as a Linear Programming (LP) problem and on the development of a sequential optimization method based on variables decomposition, constraints decomposition, and the use of primal-dual interior point methods. Experimental results demonstrate that the proposed approach has comparable performance with other SV-based classifiers. Particularly, experiments demonstrate that as the problem size increases, the sparser the solution …