We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

Random graphs

As one of the most comprehensive machine learning texts around, this book does justice to the field's incredible richness, but without losing sight of the unifying principles. Peter Flach's clear, example-based approach begins by discussing how a spam filter works, which gives an immediate introduction to machine learning in action, with a minimum of technical fuss. Flach provides case studies of increasing complexity and variety with well-chosen examples and illustrations throughout. He covers a wide range of logical, geometric and statistical models and state-of-the-art topics such as matrix factorisation and ROC analysis. Particular attention is paid to the central role played by features. The use of established terminology is balanced with the introduction of new and useful concepts, and summaries of relevant background material are provided with pointers for revision if necessary. These features ensure Machine Learning will set a new standard as an introductory textbook.

Machine Learning: The Art and Science of Algorithms that Make Sense of Data

Millions of people worldwide suffer from diseases that lead to paralysis through disruption of signal pathways between the brain and the muscles. Neuroprosthetic devices are designed to restore lost function and could be used to form an electronic 'neural bypass' to circumvent disconnected pathways in the nervous system. It has previously been shown that intracortically recorded signals can be decoded to extract information related to motion, allowing non-human primates and paralysed humans to control computers and robotic arms through imagined movements. In non-human primates, these types of signal have also been used to drive activation of chemically paralysed arm muscles. Here we show that intracortically recorded signals can be linked in real-time to muscle activation to restore movement in a paralysed human. We used a chronically implanted intracortical microelectrode array to record multiunit activity from the motor cortex in a study participant with quadriplegia from cervical spinal cord injury. We applied machine-learning algorithms to decode the neuronal activity and control activation of the participant's forearm muscles through a custom-built high-resolution neuromuscular electrical stimulation system. The system provided isolated finger movements and the participant achieved continuous cortical control of six different wrist and hand motions. Furthermore, he was able to use the system to complete functional tasks relevant to daily living. Clinical assessment showed that, when using the system, his motor impairment improved from the fifth to the sixth cervical (C5-C6) to the seventh cervical to first thoracic (C7-T1) level unilaterally, conferring on him the critical abilities to grasp, manipulate, and release objects. This is the first demonstration to our knowledge of successful control of muscle activation using intracortically recorded signals in a paralysed human. These results have significant implications in advancing neuroprosthetic technology for people worldwide living with the effects of paralysis.

Restoring cortical control of functional movement in a human with quadriplegia

Recent resting-state functional connectivity magnetic resonance imaging studies have shown significant group differences in several regions and networks between patients with major depressive disorder and healthy controls. The objective of the present study was to investigate the whole-brain resting-state functional connectivity patterns of depressed patients, which can be used to test the feasibility of identifying major depressive individuals from healthy controls. Multivariate pattern analysis was employed to classify 24 depressed patients from 29 demographically matched healthy volunteers. Permutation tests were used to assess classifier performance. The experimental results demonstrate that 94.3% ( P  < 0.0001) of subjects were correctly classified by leave-one-out cross-validation, including 100% identification of all patients. The majority of the most discriminating functional connections were located within or across the default mode network, affective network, visual cortical areas and cerebellum, thereby indicating that the disease-related resting-state network alterations may give rise to a portion of the complex of emotional and cognitive disturbances in major depression. Moreover, the amygdala, anterior cingulate cortex, parahippocampal gyrus and hippocampus, which exhibit high discriminative power in classification, may play important roles in the pathophysiology of this disorder. The current study may shed new light on the pathological mechanism of major depression and suggests that whole-brain resting-state functional connectivity magnetic resonance imaging may provide potential effective biomarkers for its clinical diagnosis.

Identifying major depression using whole-brain functional connectivity: a multivariate pattern analysis

Machine learning has become a pivotal tool for many projects in computational biology, bioinformatics, and health informatics. Nevertheless, beginners and biomedical researchers often do not have enough experience to run a data mining project effectively, and therefore can follow incorrect practices, that may lead to common mistakes or over-optimistic results. With this review, we present ten quick tips to take advantage of machine learning in any computational biology context, by avoiding some common errors that we observed hundreds of times in multiple bioinformatics projects. We believe our ten suggestions can strongly help any machine learning practitioner to carry on a successful project in computational biology and related sciences.

/pdf/ten-quick-tips-for-machine-learning-in-computational-biology-2rhs66116q.pdf

Ten quick tips for machine learning in computational biology

We explore the framework of permutation-based p-values for assessing the performance of classifiers. In this paper we study two simple permutation tests. The first test assess whether the classifier has found a real class structure in the data; the corresponding null distribution is estimated by permuting the labels in the data. This test has been used extensively in classification problems in computational biology. The second test studies whether the classifier is exploiting the dependency between the features in classification; the corresponding null distribution is estimated by permuting the features within classes, inspired by restricted randomization techniques traditionally used in statistics. This new test can serve to identify descriptive features which can be valuable information in improving the classifier performance. We study the properties of these tests and present an extensive empirical evaluation on real and synthetic data. Our analysis shows that studying the classifier performance via permutation tests is effective. In particular, the restricted permutation test clearly reveals whether the classifier exploits the interdependency between the features in the data.

/pdf/permutation-tests-for-studying-classifier-performance-2orxn1u610.pdf

Permutation Tests for Studying Classifier Performance

We explore the framework of permutation-based p-values for assessing the behavior of the classification error. In this paper we study two simple permutation tests. The first test estimates the null distribution by permuting the labels in the data; this has been used extensively in classification problems in computational biology. The second test produces permutations of the features within classes, inspired by restricted randomization techniques traditionally used in statistics. We study the properties of these tests and present an extensive empirical evaluation on real and synthetic data. Our analysis shows that studying the classification error via permutation tests is effective; in particular, the restricted permutation test clearly reveals whether the classifier exploits the interdependency between the features in the data.

/pdf/permutation-tests-for-studying-classifier-performance-4hxz61nw2w.pdf

Mining graph data is an active research area Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those results is lacking Within the framework of statistical hypothesis testing, we focus in this paper on randomization techniques for unweighted undirected graphs Randomization is an important approach to assess the statistical significance of data mining results Given an input graph, our randomization method will sample data from the class of graphs that share certain structural properties with the input graph Here we describe three alternative algorithms based on local edge swapping and Metropolis sampling We test our framework with various graph data sets and mining algorithms for two applications, namely graph clustering and frequent subgraph mining

/pdf/randomization-techniques-for-graphs-2n9jg4oq9m.pdf

Randomization Techniques for Graphs

Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with unlabeled data. This paper shows that when considering labeled data, closed sets can be adapted for classification and discrimination purposes by conveniently contrasting covering properties on positive and negative examples. We formally prove that these sets characterize the space of relevant combinations of features for discriminating the target class. In practice, identifying relevant/irrelevant combinations of features through closed sets is useful in many applications: to compact emerging patterns of typical descriptive mining applications, to reduce the number of essential rules in classification, and to efficiently learn subgroup descriptions, as demonstrated in real-life subgroup discovery experiments on a high dimensional microarray data set.

/pdf/closed-sets-for-labeled-data-czsb5oq53f.pdf

Closed Sets for Labeled Data

A binary matrix has a banded structure if both rows and columns can be permuted so that the non-zero entries exhibit a staircase pattern of overlapping rows. The concept of banded matrices has its origins in numerical analysis, where entries can be viewed as descriptions between the problem variables; the bandedness corresponds to variables that are coupled over short distances. Banded data occurs also in other applications, for example in the physical mapping problem of the human genome, in paleontological data, in network data and in the discovery of overlapping communities without cycles. We study the banded structure of binary matrices, give a formal definition of the concept and discuss its theoretical properties. We consider the algorithmic problems of computing how far a matrix is from being banded, and of finding a good submatrix of the original data that exhibits approximate bandedness. Finally, we show by experiments on real data from ecology and other applications the usefulness of the concept. Our results reveal that bands exist in real datasets and that the final obtained orderings of rows and columns have natural interpretations.

/pdf/banded-structure-in-binary-matrices-1vrbjzd23e.pdf

Gemma C. Garriga

Papers

Permutation Tests for Studying Classifier Performance

Permutation Tests for Studying Classifier Performance

Randomization Techniques for Graphs

Closed Sets for Labeled Data

Banded structure in binary matrices