Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
Computational Modeling Of Trust Factors Using Reinforcement Learning, C. M. Kuzio, A. Dinh, C. Stone, L. Vidyaratne, K. M. Iftekharuddin
Computational Modeling Of Trust Factors Using Reinforcement Learning, C. M. Kuzio, A. Dinh, C. Stone, L. Vidyaratne, K. M. Iftekharuddin
Electrical & Computer Engineering Faculty Publications
As machine-learning algorithms continue to expand their scope and approach more ambiguous goals, they may be required to make decisions based on data that is often incomplete, imprecise, and uncertain. The capabilities of these models must, in turn, evolve to meet the increasingly complex challenges associated with the deployment and integration of intelligent systems into modern society. Historical variability in the performance of traditional machine-learning models in dynamic environments leads to ambiguity of trust in decisions made by such algorithms. Consequently, the objective of this work is to develop a novel computational model that effectively quantifies the reliability of autonomous …
Adaptive Graph Construction For Isomap Manifold Learning, Loc Tran, Zezhong Zheng, Guoquing Zhou, Jiang Li, Karen O. Egiazarian (Ed.), Sos S. Agaian (Ed.), Atanas P. Gotchev (Ed.)
Adaptive Graph Construction For Isomap Manifold Learning, Loc Tran, Zezhong Zheng, Guoquing Zhou, Jiang Li, Karen O. Egiazarian (Ed.), Sos S. Agaian (Ed.), Atanas P. Gotchev (Ed.)
Electrical & Computer Engineering Faculty Publications
Isomap is a classical manifold learning approach that preserves geodesic distance of nonlinear data sets. One of the main drawbacks of this method is that it is susceptible to leaking, where a shortcut appears between normally separated portions of a manifold. We propose an adaptive graph construction approach that is based upon the sparsity property of the ℓ1 norm. The ℓ1 enhanced graph construction method replaces k-nearest neighbors in the classical approach. The proposed algorithm is first tested on the data sets from the UCI data base repository which showed that the proposed approach performs better than …