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

Theory and Algorithms Commons™

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

Machine learning

Discipline
Institution
Publication Year
Publication
Publication Type

Articles 91 - 97 of 97

Full-Text Articles in Theory and Algorithms

Singular Value Computation And Subspace Clustering, Qiao Liang Jan 2015

Singular Value Computation And Subspace Clustering, Qiao Liang

Theses and Dissertations--Mathematics

In this dissertation we discuss two problems. In the first part, we consider the problem of computing a few extreme eigenvalues of a symmetric definite generalized eigenvalue problem or a few extreme singular values of a large and sparse matrix. The standard method of choice of computing a few extreme eigenvalues of a large symmetric matrix is the Lanczos or the implicitly restarted Lanczos method. These methods usually employ a shift-and-invert transformation to accelerate the speed of convergence, which is not practical for truly large problems. With this in mind, Golub and Ye proposes an inverse-free preconditioned Krylov subspace method, …

Go to article

Machine Learning In Wireless Sensor Networks: Algorithms, Strategies, And Applications, Mohammad Abu Alsheikh, Shaowei Lin, Dusit Niyato, Hwee-Pink Tan Apr 2014

Machine Learning In Wireless Sensor Networks: Algorithms, Strategies, And Applications, Mohammad Abu Alsheikh, Shaowei Lin, Dusit Niyato, Hwee-Pink Tan

Research Collection School Of Computing and Information Systems

Wireless sensor networks (WSNs) monitor dynamic environments that change rapidly over time. This dynamic behavior is either caused by external factors or initiated by the system designers themselves. To adapt to such conditions, sensor networks often adopt machine learning techniques to eliminate the need for unnecessary redesign. Machine learning also inspires many practical solutions that maximize resource utilization and prolong the lifespan of the network. In this paper, we present an extensive literature review over the period 2002-2013 of machine learning methods that were used to address common issues in WSNs. The advantages and disadvantages of each proposed algorithm are …

Go to article

Artificial Immune Systems And Particle Swarm Optimization For Solutions To The General Adversarial Agents Problem, Jeremy Mange Apr 2013

Artificial Immune Systems And Particle Swarm Optimization For Solutions To The General Adversarial Agents Problem, Jeremy Mange

Dissertations

The general adversarial agents problem is an abstract problem description touching on the fields of Artificial Intelligence, machine learning, decision theory, and game theory. The goal of the problem is, given one or more mobile agents, each identified as either “friendly" or “enemy", along with a specified environment state, to choose an action or series of actions from all possible valid choices for the next “timestep" or series thereof, in order to lead toward a specified outcome or set of outcomes. This dissertation explores approaches to this problem utilizing Artificial Immune Systems, Particle Swarm Optimization, and hybrid approaches, along with …

Go to article

Hardware Acceleration Of Inference Computing: The Numenta Htm Algorithm, Dan Hammerstrom May 2011

Hardware Acceleration Of Inference Computing: The Numenta Htm Algorithm, Dan Hammerstrom

Systems Science Friday Noon Seminar Series

In this presentation I will describe the latest version of the Numenta HTM Cortical Learning Algorithm and why it is interesting for doing research into radical new computer architectures. Then I will discuss the hardware acceleration research we are doing, and briefly look at some preliminary applications development.

Go to article

Prediction Of Brain Tumor Progression Using Multiple Histogram Matched Mri Scans, Debrup Banerjee, Loc Tran, Jiang Li, Yuzhong Shen, Frederic Mckenzie, Jihong Wang, Ronald M. Summers (Ed.), Bram Van Ginneken (Ed.) Jan 2011

Prediction Of Brain Tumor Progression Using Multiple Histogram Matched Mri Scans, Debrup Banerjee, Loc Tran, Jiang Li, Yuzhong Shen, Frederic Mckenzie, Jihong Wang, Ronald M. Summers (Ed.), Bram Van Ginneken (Ed.)

Electrical & Computer Engineering Faculty Publications

In a recent study [1], we investigated the feasibility of predicting brain tumor progression based on multiple MRI series and we tested our methods on seven patients' MRI images scanned at three consecutive visits A, B and C. Experimental results showed that it is feasible to predict tumor progression from visit A to visit C using a model trained by the information from visit A to visit B. However, the trained model failed when we tried to predict tumor progression from visit B to visit C, though it is clinically more important. Upon a closer look at the MRI scans …

Go to article

A Boosting Framework For Visuality-Preserving Distance Metric Learning And Its Application To Medical Image Retrieval, Yang Liu, Rong Jin, Lily Mummert, Rahul Sukthankar, Adam Goode, Bin Zheng, Steven C. H. Hoi, Mahadev Satyanarayanan Jan 2010

A Boosting Framework For Visuality-Preserving Distance Metric Learning And Its Application To Medical Image Retrieval, Yang Liu, Rong Jin, Lily Mummert, Rahul Sukthankar, Adam Goode, Bin Zheng, Steven C. H. Hoi, Mahadev Satyanarayanan

Research Collection School Of Computing and Information Systems

Similarity measurement is a critical component in content-based image retrieval systems, and learning a good distance metric can significantly improve retrieval performance. However, despite extensive study, there are several major shortcomings with the existing approaches for distance metric learning that can significantly affect their application to medical image retrieval. In particular, "similarity" can mean very different things in image retrieval: resemblance in visual appearance (e.g., two images that look like one another) or similarity in semantic annotation (e.g., two images of tumors that look quite different yet are both malignant). Current approaches for distance metric learning typically address only one …

Go to article

Multiple Learner Systems Using Resampling Methods, Binyun Xie Aug 1992

Multiple Learner Systems Using Resampling Methods, Binyun Xie

Computer Science Theses & Dissertations

The N-Learners Problem deals with combining a number of learners such that the resultant system is "better", under some criterion, than the best of the individual learners. We consider a system of probably approximately correct concept learners. Depending on the available information, there are several methods to make the composite system better than the best of the individual learners. If a sample and an oracle that generates data points (but, not their classification) is available, then we show that we can achieve arbitrary levels of the normalized confidence of the composite system if (a) a robust learning algorithm is available, …

Go to article

First Prev