The Mixed-Membership Stochastic Blockmodel~(MMSB) is proposed as one of the state-of-the-art Bayesian relational methods suitable for learning the complex hidden structure underlying the network data. However, the current formulation of MMSB suffers from the following two issues: (1), the prior information~(e.g. entities' community structural information) can not be well embedded in the modelling; (2), community evolution can not be well described in the literature. Therefore, we propose a non-parametric fragmentation coagulation based Mixed Membership Stochastic Blockmodel (fcMMSB). Our model performs entity-based clustering to capture the community information for entities and linkage-based clustering to derive the group information for links simultaneously. Besides, the proposed model infers the network structure and models community evolution, manifested by appearances and disappearances of communities, using the discrete fragmentation coagulation process (DFCP). By integrating the community structure with the group compatibility matrix we derive a generalized version of MMSB. An efficient Gibbs sampling scheme with Polya Gamma (PG) approach is implemented for posterior inference. We validate our model on synthetic and real world data.

Cybersecurity attacks are growing both in frequency and sophistication over the years. This increasing sophistication and complexity call for more advancement and continuous innovation in defensive strategies. Traditional methods of intrusion detection and deep packet inspection, while still largely used and recommended, are no longer sufficient to meet the demands of growing security threats. As computing power increases and cost drops, Machine Learning is seen as an alternative method or an additional mechanism to defend against malwares, botnets, and other attacks. This paper explores Machine Learning as a viable solution by examining its capabilities to classify malicious traffic in a network. First, a strong data analysis is performed resulting in 22 extracted features from the initial Netflow datasets. All these features are then compared with one another through a feature selection process. Then, our approach analyzes five different machine learning algorithms against NetFlow dataset containing common botnets. The Random Forest Classifier succeeds in detecting more than 95% of the botnets in 8 out of 13 scenarios and more than 55% in the most difficult datasets. Finally, insight is given to improve and generalize the results, especially through a bootstrapping technique.

As the field of Spoken Dialogue Systems and Conversational AI grows, so does the need for tools and environments that abstract away implementation details in order to expedite the development process, lower the barrier of entry to the field, and offer a common test-bed for new ideas. In this paper, we present Plato, a flexible Conversational AI platform written in Python that supports any kind of conversational agent architecture, from standard architectures to architectures with jointly-trained components, single- or multi-party interactions, and offline or online training of any conversational agent component. Plato has been designed to be easy to understand and debug and is agnostic to the underlying learning frameworks that train each component.

Most insurance companies depend on human expertise and business rules-based software to protect themselves from fraud. And the drive for digital transformation and process automation means data and scenarios change faster than you can update the rules. Machine learning has the potential to allow insurers to move from the current state of "detect and react" to "predict and prevent." It excels at automating the process of taking large volumes of data, analysing multiple fraud indicators in parallel – which taken individually may often be quite normal – and finding potential fraud. Generally, there are two ways to teach or train a machine learning algorithm, which depend on the available data: supervised and unsupervised learning.

The public's trust of governmental budgeting, fiscal management, and reporting is at an all-time low, especially in the aftermath of the 2008 financial crisis, where only four out of ten people in OECD countries expressed confidence in their government. Cases of fraud, bid-rigging, and pay-to-play are never far from the headlines, and have continued to undermine trust in the public servants and elected officials tasked to oversee the complex work of managing government finances. A large portion of this mistrust can be attributed to the struggle that government finance managers and auditors are facing in analyzing the increasing amount of financial data. Current financial control and audit techniques, including legislated audit requirements, are not able to scale to keep pace with the massive data explosion coming from their own accounting, payroll, and expense management systems. One government response to this issue, open data, enables a sense of fiscal transparency with the public but it doesn't replace the rigorous professional analysis required to identify fraud, errors, and omissions in large amounts of data.

Cows have their own language and talk to each other about food and the weather, according to a new study by scientists in Australia. They created a software programme dubbed'Google Translate for cows' to get a better idea of what the heifers were saying when they go'moo'. The study, by a PhD candidate from the University of Sydney, discovered that dairy cows also respond to positive and negative emotional situations. Cows each have their own individual voice and linked their moods to their'moos', said lead author Alexandra Green. Biologists made the discovery by listening to Holstein-Fresian heifer cattle, a European breed, mooing into a microphone and analysing the pitch.

Since data collection and analysis are difficult, time consuming and costly, we are always looking for a way to optimum use of data to achieve the correct decision that can be referred to diagnose and experiment of diseases in healthcare organizations [3]. In addition, common method such as angiography [5,6] in experimenting and diagnosing diseases is costly and have adverse effects for patients as healthcare resear chers are trying to utilize methods that avoid the high cost as well as the adverse effects of previous methods, which can be performed by using computer - aided disease diagnose methods means machine learning. Whereas, da ta mining process by utilizing machine learning science and database management knowledge [1] has become a robust tool for data analysis and management of health industry data which ultimately leads to knowledge extraction. It should be noted that, with the progress of technology in t he healthcare especially, healthcare industry 4.0, human lifetime has become progressive and more comfortable [ 7 ] . In this new generation, with the development of new medical devices, equipment and tools, new knowledge can be gained in the field of disease diagnosis.

Adam-type optimizers, as a class of adaptive moment estimation methods with the exponential moving average scheme, have been successfully used in many applications of deep learning. Such methods are appealing for capability on large-scale sparse datasets with high computational efficiency. In this paper, we present a new framework for adapting Adam-type methods, namely AdamT. Instead of applying a simple exponential weighted average, AdamT also includes the trend information when updating the parameters with the adaptive step size and gradients. The additional terms promise an efficient movement on the complex cost surface, and thus the loss would converge more rapidly. We show empirically the importance of adding the trend component, where AdamT outperforms the vanilla Adam method constantly with state-of-the-art models on several classical real-world datasets.

Algorithmic fairness involves expressing notions such as equity, or reasonable treatment, as quantifiable measures that a machine learning algorithm can optimise. Most work in the literature to date has focused on classification problems where the prediction is categorical, such as accepting or rejecting a loan application. This is in part because classification fairness measures are easily computed by comparing the rates of outcomes, leading to behaviours such as ensuring that the same fraction of eligible men are selected as eligible women. But such measures are computationally difficult to generalise to the continuous regression setting for problems such as pricing, or allocating payments. The difficulty arises from estimating conditional densities (such as the probability density that a system will over-charge by a certain amount). For the regression setting we introduce tractable approximations of the independence, separation and sufficiency criteria by observing that they factorise as ratios of different conditional probabilities of the protected attributes. We introduce and train machine learning classifiers, distinct from the predictor, as a mechanism to estimate these probabilities from the data. This naturally leads to model agnostic, tractable approximations of the criteria, which we explore experimentally.

Most machine learning methods require careful selection of hyper-parameters in order to train a high performing model with good generalization abilities. Hence, several automatic selection algorithms have been introduced to overcome tedious manual (try and error) tuning of these parameters. Due to its very high sample efficiency, Bayesian Optimization over a Gaussian Processes modeling of the parameter space has become the method of choice. Unfortunately, this approach suffers from a cubic compute complexity due to underlying Cholesky factorization, which makes it very hard to be scaled beyond a small number of sampling steps. In this paper, we present a novel, highly accurate approximation of the underlying Gaussian Process. Reducing its computational complexity from cubic to quadratic allows an efficient strong scaling of Bayesian Optimization while outperforming the previous approach regarding optimization accuracy. The first experiments show speedups of a factor of 162 in single node and further speed up by a factor of 5 in a parallel environment.