Less than two weeks away from WrestleMania 33, the number of matches officially on the card is up to 12. The latest added to the biggest WWE pay-per-view of 2017 is the Intercontinental Championship Match between Dean Ambrose and Baron Corbin. The match joined the list Tuesday night when Ambrose accepted Corbin's challenge on "SmackDown Live." Ambrose distracted Corbin during the Lone Wolf's match with Randy Orton, causing him to get hit with an RKO and suffer the loss. Ambrose ran down to the ring and delivered a Dirty Deeds for good measure.

Big Data is one of the major challenges of statistical science and has numerous consequences from algorithmic and theoretical viewpoints. Big Data always involve massive data but they also often include online data and data heterogeneity. Recently some statistical methods have been adapted to process Big Data, like linear regression models, clustering methods and bootstrapping schemes. Based on decision trees combined with aggregation and bootstrap ideas, random forests were introduced by Breiman in 2001. They are a powerful nonparametric statistical method allowing to consider in a single and versatile framework regression problems, as well as two-class and multi-class classification problems. Focusing on classification problems, this paper proposes a selective review of available proposals that deal with scaling random forests to Big Data problems. These proposals rely on parallel environments or on online adaptations of random forests. We also describe how related quantities -- such as out-of-bag error and variable importance -- are addressed in these methods. Then, we formulate various remarks for random forests in the Big Data context. Finally, we experiment five variants on two massive datasets (15 and 120 millions of observations), a simulated one as well as real world data. One variant relies on subsampling while three others are related to parallel implementations of random forests and involve either various adaptations of bootstrap to Big Data or to "divide-and-conquer" approaches. The fifth variant relates on online learning of random forests. These numerical experiments lead to highlight the relative performance of the different variants, as well as some of their limitations.

Machine learning techniques are being increasingly used as flexible non-linear fitting and prediction tools in the physical sciences. Fitting functions that exhibit multiple solutions as local minima can be analysed in terms of the corresponding machine learning landscape. Methods to explore and visualise molecular potential energy landscapes can be applied to these machine learning landscapes to gain new insight into the solution space involved in training and the nature of the corresponding predictions. In particular, we can define quantities analogous to molecular structure, thermodynamics, and kinetics, and relate these emergent properties to the structure of the underlying landscape. This Perspective aims to describe these analogies with examples from recent applications, and suggest avenues for new interdisciplinary research.

While modern day web applications aim to create impact at the civilization level, they have become vulnerable to adversarial activity, where the next cyber-attack can take any shape and can originate from anywhere. The increasing scale and sophistication of attacks, has prompted the need for a data driven solution, with machine learning forming the core of many cybersecurity systems. Machine learning was not designed with security in mind, and the essential assumption of stationarity, requiring that the training and testing data follow similar distributions, is violated in an adversarial domain. In this paper, an adversary's view point of a classification based system, is presented. Based on a formal adversarial model, the Seed-Explore-Exploit framework is presented, for simulating the generation of data driven and reverse engineering attacks on classifiers. Experimental evaluation, on 10 real world datasets and using the Google Cloud Prediction Platform, demonstrates the innate vulnerability of classifiers and the ease with which evasion can be carried out, without any explicit information about the classifier type, the training data or the application domain. The proposed framework, algorithms and empirical evaluation, serve as a white hat analysis of the vulnerabilities, and aim to foster the development of secure machine learning frameworks.

A fall is an abnormal activity that occurs rarely, so it is hard to collect real data for falls. It is, therefore, difficult to use supervised learning methods to automatically detect falls. Another challenge in using machine learning methods to automatically detect falls is the choice of engineered features. In this paper, we propose to use an ensemble of autoencoders to extract features from different channels of wearable sensor data trained only on normal activities. We show that the traditional approach of choosing a threshold as the maximum of the reconstruction error on the training normal data is not the right way to identify unseen falls. We propose two methods for automatic tightening of reconstruction error from only the normal activities for better identification of unseen falls. We present our results on two activity recognition datasets and show the efficacy of our proposed method against traditional autoencoder models and two standard one-class classification methods. Keywords: detection 1. Introduction fall detection, one-class classification, autoencoders, anomaly Falls are a major cause of both fatal and nonfatal injury and a hindrance in living independently. Each year an estimated 424, 000 individuals die from falls globally and 37.3 million falls require medical attention [23]. Experiencing a fall may lead to a fear of falling [6], which in turn can result in lack of mobility, less productivity and reduced quality of life. There exist several commercial wearable devices to detect falls [24]; most of them use accelerometers to capture motion information. They normally come with an alarm button to manually contact a caregiver if the fall is not detected by the device.

Roman Reigns got his payback on The Undertaker on the most recent edition of "Monday Night Raw." The three-time WWE Champion ended the show by delivering a Spear to the Deadman, and he's now expected to win their WrestleMania 33 match. The Undertaker made a surprise return to WWE, appearing in the middle of the ring during Reigns' match with Braun Strowman. The Deadman delivered a Chokeslam to Strowman, allowing Reigns to attack The Undertaker when his back was turned. Two weeks earlier, The Undertaker hit Reigns with a ChokeSlam and the WrestleMania match was made.

Preview: Gennady "GGG" Golovkin (36-0, 33 KOs) faces challenger Daniel Jacobs (32-1, 29 KOs) in a middleweight unification bout Saturday night at Madison Square Garden in New York. Coverage of the fight will be on HBO pay-per-view. On the line are the WBA (Super), WBC, and IBO middleweight titles with two boxers entering the fight on knockout streaks. Golovkin, a native of Kazakhstan, has knocked out 23 opponents in a row. Jacobs, a native of Brooklyn, has 12 knockout victories in a row.

HEN shown photographic images under a free-viewing (i.e task-free) paradigm, human eyes preferentially fixate on image locations which are visually salient. Multiple studies [1]-[5] have demonstrated that this fixation mechanism is bottom-up, predominantly driven by image content and richness of detail (color, texture etc.). This explanation, while satisfactory for photographic images, seems inadequate for certain categories of images such as line drawings. In particular, one class of line drawings - hand-drawn sketches - are sparse and largely devoid of detailed content. In addition, they are typically binary images containing virtually no color-based information (see Figure 1). Even so, multiple studies have demonstrated a "fixations-intonothing" phenomenon [6]-[9], wherein the eye fixations on the same stimulus by multiple subjects fall on empty regions, yet exhibit enough regularity to make gaze-based inferences. One possible explanation is that the first eye fixation conveys all there is to know ('Gestalt') about the underlying scene semantics [10] and the regularity in rest of the fixations is a statistical anomaly. However, a more intriguing explanation is that these empty region fixations aim to implicitly verify the overall consistency of the scene content depicted in the sketch [11], [12]. Which of these explanations is correct?

And, it was first published on Dataconomy on Dec 21, 2016; I'm reposting here for ease of access.] In recent years, AI (artificial intelligence) researchers have finally cracked problems that they've worked on for decades, from Go to human-level speech recognition. A key piece was the ability to gather and learn on mountains of data, which pulled error rates past the success line. In short, big data has transformed AI, to an almost unreasonable level. Blockchain technology could transform AI too, in its own particular ways. Some applications of blockchains to AI are mundane, like audit trails on AI models. Some appear almost unreasonable, like AI that can own itself -- AI DAOs. All of them are opportunities. This article will explore these applications. Before we discuss applications, let's first review what's different about blockchains compared to traditional big-data distributed databases like MongoDB. We can think of blockchains as "blue ocean" databases: they escape the "bloody red ocean" of sharks competing in an existing market, opting instead to be in a blue ocean of uncontested market space.

In this study, we introduce a new approach to combine multi-classifiers in an ensemble system. Instead of using numeric membership values encountered in fixed combining rules, we construct interval membership values associated with each class prediction at the level of meta-data of observation by using concepts of information granules. In the proposed method, uncertainty (diversity) of findings produced by the base classifiers is quantified by interval-based information granules. The discriminative decision model is generated by considering both the bounds and the length of the obtained intervals. We select ten and then fifteen learning algorithms to build a heterogeneous ensemble system and then conducted the experiment on a number of UCI datasets. The experimental results demonstrate that the proposed approach performs better than the benchmark algorithms including six fixed combining methods, one trainable combining method, AdaBoost, Bagging, and Random Subspace.