Genre
A novel approach to multiclass psoriasis disease risk stratification: Machine learning paradigm
The stage and grade of psoriasis severity is clinically relevant and important for dermatologists as it aids them lead to a reliable and an accurate decision making process for better therapy. This paper proposes a novel psoriasis risk assessment system (pRAS) for stratification of psoriasis severity from colored psoriasis skin images having Asian Indian ethnicity. Machine learning paradigm is adapted for risk stratification of psoriasis disease grades utilizing offline training and online testing images. It uses two kinds of classifiers (support vector machines (SVM) and decision tree (DT)) during training and testing phases and two kinds of feature selection criteria (Principal Component Analysis (PCA) and Fisher Discriminant Ratio (FDR)), thus, leading to an exhaustive comparison between these four systems. Our database consisted of 848 psoriasis images with five severity grades: healthy, mild, moderate, severe and very severe, consisting of 383, 47, 245, 145, and 28 images respectively.
This top scientist offers a solution for the havoc driverless cars may wreak on workers
Proponents of autonomous vehicles are in a sticky situation. Self-driving technology is expected to have a tremendous impact on public health and reduce the 1.25 million deaths every year on global roads. At the same time, this emerging technology is a threat to the employment of the millions who are paid to sit behind the wheel -- from truck drivers to cab drivers and delivery workers. Baidu chief scientist Andrew Ng, an expert in the world of artificial intelligence, acknowledges the unemployment concerns, but he sees a way forward that offers society the benefits of autonomous vehicles and blunts the negative impact of job losses. "I feel a strong moral responsibility or obligation to try to make self-driving cars a reality as quickly as possible," Ng said in a visit to The Washington Post.
8 Ways Machine Learning Will Improve Education
They are becoming more capable at a faster pace than people and therefore will effectively outsmart us in a short amount of time," Mr Thrun now believes that education is the best way to tackle the big upheavals that are likely to spring from the widespread adoption of artificial intelligence and robotics. But not education as you might know it. "We are still living with an educational system that was developed in the 1800s and 1900s," he says. "Needs have shifted in the modern age and what's also shifted is our ability to use digital media. We can now deliver a top-notch education at home in a way that was never possible before."
VirtusaPolaris and WorkFusion to Deliver Robotic Automation and AI-powered Cognitive Automation to the Financial Services Sector
WIRE)--VirtusaPolaris, the market-facing brand of Virtusa Corporation and Polaris Consulting & Services, Ltd. and a leading worldwide provider of information technology (IT) consulting and outsourcing services, and WorkFusion, the leading smart process automation (SPA) provider, today announced a partnership to deliver new smart automation solutions for the banking and financial services (BFS) market. The combination of VirtusaPolaris' deep BFS industry and process expertise and WorkFusion's cutting edge platform will help clients reduce operational costs, while improving quality, productivity and agility. "Most financial services organizations continue to struggle with inefficient legacy systems that have not kept pace with the change in business and regulations, introducing gaps in process automation that negatively impact efficiency of business operations. Many of these gaps are low complexity high volume routine process steps and most organizations have deployed large operational workforces, frequently offshore, to handle these processes," said Bob Graham, global solutions head, Banking and Financial Services at VirtusaPolaris. "WorkFusion's combination of robotic and cognitive automation supported by VirtusaPolaris' expert consulting and implementation services allow customers to improve quality through greater accuracy and the removal of human error, reduce costs through rapid automation of manual tasks, and accelerate time to market with our proven delivery approach."
Dream: Difference between revisions - Wikipedia, the free encyclopedia
Dreams are successions of images, ideas, emotions, and sensations that occur usually involuntarily in the mind during certain stages of sleep.[1] The content and purpose of dreams are not definitively understood, though they have been a topic of scientific speculation, as well as a subject of philosophical and religious interest, throughout recorded history. The scientific study of dreams is called oneirology.[2] Dreams mainly occur in the rapid-eye movement (REM) stage of sleep--when brain activity is high and resembles that of being awake. REM sleep is revealed by continuous movements of the eyes during sleep. At times, dreams may occur during other stages of sleep. However, these dreams tend to be much less vivid or memorable.[3] The length of a dream can vary; they may last for a few seconds, or approximately 20โ30 minutes.[3] People are more likely to remember the dream if they are awakened during the REM phase. The average person has three to five dreams per night, and some may have up to seven;[4] however, most dreams are immediately or quickly forgotten.[5] Dreams tend to last longer as the night progresses. During a full eight-hour night sleep, most dreams occur in the typical two hours of REM.[6] In modern times, dreams have been seen as a connection to the unconscious mind. They range from normal and ordinary to overly surreal and bizarre. Dreams can have varying natures, such as being frightening, exciting, magical, melancholic, adventurous, or sexual. The events in dreams are generally outside the control of the dreamer, with the exception of lucid dreaming, where the dreamer is self-aware.[7]
Directional Statistics in Machine Learning: a Brief Review
The modern data analyst must cope with data encoded in various forms, vectors, matrices, strings, graphs, or more. Consequently, statistical and machine learning models tailored to different data encodings are important. We focus on data encoded as normalized vectors, so that their "direction" is more important than their magnitude. Specifically, we consider high-dimensional vectors that lie either on the surface of the unit hypersphere or on the real projective plane. For such data, we briefly review common mathematical models prevalent in machine learning, while also outlining some technical aspects, software, applications, and open mathematical challenges.
Robust Elastic Net Regression
Liu, Weiyang, Lin, Rongmei, Yang, Meng
We propose a robust elastic net (REN) model for high-dimensional sparse regression and give its performance guarantees (both the statistical error bound and the optimization bound). A simple idea of trimming the inner product is applied to the elastic net model. Specifically, we robustify the covariance matrix by trimming the inner product based on the intuition that the trimmed inner product can not be significantly affected by a bounded number of arbitrarily corrupted points (outliers). The REN model can also derive two interesting special cases: robust Lasso and robust soft thresholding. Comprehensive experimental results show that the robustness of the proposed model consistently outperforms the original elastic net and matches the performance guarantees nicely.
Clustering Markov Decision Processes For Continual Transfer
Mahmud, M. M. Hassan, Hawasly, Majd, Rosman, Benjamin, Ramamoorthy, Subramanian
We present algorithms to effectively represent a set of Markov decision processes (MDPs), whose optimal policies have already been learned, by a smaller source subset for lifelong, policy-reuse-based transfer learning in reinforcement learning. This is necessary when the number of previous tasks is large and the cost of measuring similarity counteracts the benefit of transfer. The source subset forms an `$\epsilon$-net' over the original set of MDPs, in the sense that for each previous MDP $M_p$, there is a source $M^s$ whose optimal policy has $<\epsilon$ regret in $M_p$. Our contributions are as follows. We present EXP-3-Transfer, a principled policy-reuse algorithm that optimally reuses a given source policy set when learning for a new MDP. We present a framework to cluster the previous MDPs to extract a source subset. The framework consists of (i) a distance $d_V$ over MDPs to measure policy-based similarity between MDPs; (ii) a cost function $g(\cdot)$ that uses $d_V$ to measure how good a particular clustering is for generating useful source tasks for EXP-3-Transfer and (iii) a provably convergent algorithm, MHAV, for finding the optimal clustering. We validate our algorithms through experiments in a surveillance domain.
Text-mining the NeuroSynth corpus using Deep Boltzmann Machines
Monti, Ricardo Pio, Lorenz, Romy, Leech, Robert, Anagnostopoulos, Christoforos, Montana, Giovanni
Large-scale automated meta-analysis of neuroimaging data has recently established itself as an important tool in advancing our understanding of human brain function. This research has been pioneered by NeuroSynth, a database collecting both brain activation coordinates and associated text across a large cohort of neuroimaging research papers. One of the fundamental aspects of such meta-analysis is text-mining. To date, word counts and more sophisticated methods such as Latent Dirichlet Allocation have been proposed. In this work we present an unsupervised study of the NeuroSynth text corpus using Deep Boltzmann Machines (DBMs). The use of DBMs yields several advantages over the aforementioned methods, principal among which is the fact that it yields both word and document embeddings in a high-dimensional vector space. Such embeddings serve to facilitate the use of traditional machine learning techniques on the text corpus. The proposed DBM model is shown to learn embeddings with a clear semantic structure.
A vector-contraction inequality for Rademacher complexities
The contraction inequality for Rademacher averages is extended to Lipschitz functions with vector-valued domains, and it is also shown that in the bounding expression the Rademacher variables can be replaced by arbitrary iid symmetric and sub-gaussian variables. Example applications are given for multi-category learning, K-means clustering and learning-to-learn.