With online criminals getting highly skilled at attacking enterprises every day, it's getting difficult for businesses to tell the difference between legitimate and fraudulent activity. Fraud detection has always been a cat and mouse game. With improvements in techniques to detect and prevent frauds, fraudsters keep changing their attack patterns to unearth new holes and vulnerabilities – which the detection solutions then shore up. However, the nature of this game is changing. The days where enterprises were able to keep fraudsters at bay by using static detection rules are long gone.

You've probably been to a supermarket that printed coupons for you at checkout. Or listened to a playlist that your streaming service generated for you. Or gone shopping online and seen a list of products labeled "you might be interested in…." that did indeed contain some stuff that you were interested in. Recommendation engines take data about you, similar consumers, and available products, and use that to figure out what you might be interested in and therefore deliver those coupons, playlists, and suggestions. Recommendation engines can be extremely complex.

The concept of machine learning, which is a subset of artificial intelligence, has been around for some time. Ali Ghodsi, an adjunct professor at UC Berkeley, describes it as "an advanced statistical technique to make predictions on a massive amount of data." Ghodsi has been influential in areas of Big Data, distributed systems, and in machine learning projects including Apache Spark, Apache Hadoop, and Apache Mesos. Here, he shares insight on these projects, various use-cases, and the future of machine learning. There are some commonalities among these three projects that have been influenced by Ghodsi's research.

The effective use and adoption of machine learning requires algorithms that are not only accurate but also understandable. To address this need, BigML now includes functionality that allows for prediction explanation, model-independent explanations of classification, and regression predictions. In this post, we will summarize what it means for a prediction to be explainable, why this is important, and share a use case in which prediction explanation plays a key role. Rather than being hard-programmed with an exhaustive set of "if-then" rules, machine learning algorithms "learn" rules based on large datasets of examples. Understanding what these rules are and how they are applied to new data is generally referred to as the interpretability or explanation of the model.

Technology's tentacles have encroached every aspect of our lives. Sitting in the comfort of your home you can tune in to live discussions and gain new understanding about technologies that are reshaping our world view. NDTV Tech Conclave 2018 saw a congregation of leading minds in the technology, mobile, and digital industries. The conclave aimed to showcase and create opportunities by bringing together many of the top entrepreneurs, investors, enterprise leaders, academics, and policymakers from around the world. The moderator of this session outlined two diametrically opposite views of AI and threw it open to the panelists.

When it comes to digital business, Andrew McAfee knows a thing or two. A principal research scientist at MIT, prolific writer and management expert, McAfee is a leader in understanding and explaining how digital technologies are changing business, the economy, and society. At the recent SAP Leonardo Live event in Chicago that focused on digital transformation, McAfee urged his audience to throw out the business playbook they've been using for the past 30 years. "The right way to run a factory in the steam era became a really, really bad way to run it in the era of electrical power," he said. "Similarly, during a technology transition -- and afterwards -- the advice you used to follow becomes bad advice."

Declarative modeling uses symbolic expressions to represent models. With such expressions one can formalize high-level mathematical computations on models that would be difficult or impossible to perform directly on a lower-level simulation program, in a general-purpose programming language. Examples of such computations on models include model analysis, relatively general-purpose model-reduction maps, and the initial phases of model implementation, all of which should preserve or approximate the mathematical semantics of a complex biological model. Multiscale modeling benefits from both the expressive power of declarative modeling languages and the application of model reduction methods to link models across scale. Based on previous work, here we define declarative modeling of complex biological systems by defining the semantics of an increasingly powerful series of declarative modeling languages including reaction-like dynamics of parameterized and extended objects, we define semantics-preserving implementation and semantics-approximating model reduction transformations, and we outline a "meta-hierarchy" for organizing declarative models and the mathematical methods that can fruitfully manipulate them.

The terms "artificial intelligence" and "machine learning" immediately bring up thoughts from movies like "The Matrix" where machines become self-aware and want to end the world. While this may make for an exciting plot in Hollywood, it is not reality outside of the theater. In real life, however, machine learning--which gives computers the ability to see hidden patterns in existing data and progressively improve performance ("learn") without being explicitly programmed--serves as a practical tool to data analysts. The job is not to turn robots into people, but instead efficiently find recurring themes that would otherwise remain obscured inside of large amounts of data to provide end-users with actionable information. These technologies have played a pivotal role in reducing fraud, waste and abuse in organizations of all types and sizes, including departments of revenue that collect taxes.

We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of $n$ conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional random quantities. We define the notion of negation, by verifying De Morgan's Laws. We also show that conjunction and disjunction satisfy the associative and commutative properties, and a monotonicity property. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals; in particular we examine the Fr\'echet-Hoeffding bounds. Moreover, we study the reverse probabilistic inference from the conjunction $\mathcal{C}_{n+1}$ of $n+1$ conditional events to the family $\{\mathcal{C}_{n},E_{n+1}|H_{n+1}\}$. We consider the relation with the notion of quasi-conjunction and we examine in detail the coherence of the prevision assessments related with the conjunction of three conditional events. Based on conjunction, we also give a characterization of p-consistency and of p-entailment, with applications to several inference rules in probabilistic nonmonotonic reasoning. Finally, we examine some non p-valid inference rules; then, we illustrate by an example two methods which allow to suitably modify non p-valid inference rules in order to get inferences which are p-valid.

Rehabilitation robotics combined with video game technology provides a means of assisting in the rehabilitation of patients with neuromuscular disorders by performing various facilitation movements. The current work presents ReHabGame, a serious game using a fusion of implemented technologies that can be easily used by patients and therapists to assess and enhance sensorimotor performance and also increase the activities in the daily lives of patients. The game allows a player to control avatar movements through a Kinect Xbox, Myo armband and rudder foot pedal, and involves a series of reach-grasp-collect tasks whose difficulty levels are learnt by a fuzzy interface. The orientation, angular velocity, head and spine tilts and other data generated by the player are monitored and saved, whilst the task completion is calculated by solving an inverse kinematics algorithm which orientates the upper limb joints of the avatar. The different values in upper body quantities of movement provide fuzzy input from which crisp output is determined and used to generate an appropriate subsequent rehabilitation game level. The system can thus provide personalised, autonomously-learnt rehabilitation programmes for patients with neuromuscular disorders with superior predictions to guide the development of improved clinical protocols compared to traditional theraputic activities.