This paper is a tutorial on Formal Concept Analysis (FCA) and its applications. FCA is an applied branch of Lattice Theory, a mathematical discipline which enables formalisation of concepts as basic units of human thinking and analysing data in the object-attribute form. Originated in early 80s, during the last three decades, it became a popular human-centred tool for knowledge representation and data analysis with numerous applications. Since the tutorial was specially prepared for RuS-SIR 2014, the covered FCA topics include Information Retrieval with a focus on visualisation aspects, Machine Learning, Data Mining and Knowledge Discovery, Text Mining and several others.

The growth of data, the need for scalability and the complexity of models used in modern machine learning calls for distributed implementations. Yet, as of today, distributed machine learning frameworks have largely ignored the possibility of arbitrary (i.e., Byzantine) failures. In this paper, we study the robustness to Byzantine failures at the fundamental level of stochastic gradient descent (SGD), the heart of most machine learning algorithms. Assuming a set of $n$ workers, up to $f$ of them being Byzantine, we ask how robust can SGD be, without limiting the dimension, nor the size of the parameter space. We first show that no gradient descent update rule based on a linear combination of the vectors proposed by the workers (i.e, current approaches) tolerates a single Byzantine failure. We then formulate a resilience property of the update rule capturing the basic requirements to guarantee convergence despite $f$ Byzantine workers. We finally propose Krum, an update rule that satisfies the resilience property aforementioned. For a $d$-dimensional learning problem, the time complexity of Krum is $O(n^2 \cdot (d + \log n))$.

We propose stochastic rank-$1$ bandits, a class of online learning problems where at each step a learning agent chooses a pair of row and column arms, and receives the product of their values as a reward. The main challenge of the problem is that the individual values of the row and column are unobserved. We assume that these values are stochastic and drawn independently. We propose a computationally-efficient algorithm for solving our problem, which we call Rank1Elim. We derive a $O((K + L) (1 / \Delta) \log n)$ upper bound on its $n$-step regret, where $K$ is the number of rows, $L$ is the number of columns, and $\Delta$ is the minimum of the row and column gaps; under the assumption that the mean row and column rewards are bounded away from zero. To the best of our knowledge, we present the first bandit algorithm that finds the maximum entry of a rank-$1$ matrix whose regret is linear in $K + L$, $1 / \Delta$, and $\log n$. We also derive a nearly matching lower bound. Finally, we evaluate Rank1Elim empirically on multiple problems. We observe that it leverages the structure of our problems and can learn near-optimal solutions even if our modeling assumptions are mildly violated.

The mother of a special education student who drowned at his Chicago school's swimming pool earlier this year has filed a lawsuit claiming in part that her son was left unsupervised by a lifeguard who was using a computer in a nearby office. Rosario Gomez, an autistic 14-year-old student at Kennedy High School, was at the pool on Jan. 25 with a group of special education students, The Chicago Tribune reported. His mother, Yolanda Juarez, said that the district should have known that her son could not swim, and that his cognitive disabilities made it difficult for him to understand the dangers of the pool. The lawsuit alleges that Gomez was not paired with a buddy before entering the pool, and that the lifeguard supervising the group was in an office on the computer, The Chicago Tribune reported. The lawsuit claims Gomez "was allowed to struggle and drown while in the swimming pool without any intervention," and that he "was allowed to remain unnoticed at the bottom of the swimming pool" for a long enough period so that paramedics were unable to revive him, according to the report.

Artificial intelligence is shaping up as the next industrial revolution, poised to rapidly reinvent business, the global economy and how people work and interact with each other. Andrew Ng, chief scientist at Chinese internet giant Baidu Inc. and co-founder of education startup Coursera, and Neil Jacobstein, chair of the artificial intelligence and robotics department at Silicon Valley think tank Singularity University, sat down with The Wall Street Journal's Scott Austin to discuss AI's opportunities and challenges. What is Baidu focused on? NG: For large enterprises like Baidu, AI creates two big pockets of opportunities. One is our core business.

For those of you who have an interest, and or involvement in "Deep Learning" or want to learn more I've created this matrix. It's by no means all inclusive. It will provide you with a landscape of some Deep Learning resources to get you started or complement resources you might already have. The original version is available here as a 5-page PDF document. You can click on the 5 images below to zoom in.

Standardized testing is also expensive and time-consuming. On the other hand, we should expect some sort of accountability in education, right? Schools are expensive, and, as new industries demand more educated workers, the stakes are higher than ever when it comes to the global economy and class mobility. Developed economies no longer have the safety net of middle-class manufacturing jobs. Whatever Trump says, that's permanent.

While participating in Jeremy Howard's excellent deep learning course I realized I was a little rusty on the prerequisites and my fuzziness was impacting my ability to understand concepts like backpropagation. I decided to put together a few wiki pages on these topics to improve my understanding. Here is a prettier version of my linear algebra page. In the context of deep learning, linear algebra is a mathematical toolbox that offers helpful techniques for manipulating groups of numbers simultaneously. It provides structures like vectors and matrices (spreadsheets) to hold these numbers and new rules for how to add, subtract, multiply, or divide them.

This paper presents a novel method for structural data recognition using a large number of graph models. In general, prevalent methods for structural data recognition have two shortcomings: 1) Only a single model is used to capture structural variation. 2) Naive recognition methods are used, such as the nearest neighbor method. In this paper, we propose strengthening the recognition performance of these models as well as their ability to capture structural variation. The proposed method constructs a large number of graph models and trains decision trees using the models. This paper makes two main contributions. The first is a novel graph model that can quickly perform calculations, which allows us to construct several models in a feasible amount of time. The second contribution is a novel approach to structural data recognition: graph model boosting. Comprehensive structural variations can be captured with a large number of graph models constructed in a boosting framework, and a sophisticated classifier can be formed by aggregating the decision trees. Consequently, we can carry out structural data recognition with powerful recognition capability in the face of comprehensive structural variation. The experiments shows that the proposed method achieves impressive results and outperforms existing methods on datasets of IAM graph database repository.

Each year, roughly 30% of first-year students at US baccalaureate institutions do not return for their second year and over $9 billion is spent educating these students. Yet, little quantitative research has analyzed the causes and possible remedies for student attrition. Here, we describe initial efforts to model student dropout using the largest known dataset on higher education attrition, which tracks over 32,500 students' demographics and transcript records at one of the nation's largest public universities. Our results highlight several early indicators of student attrition and show that dropout can be accurately predicted even when predictions are based on a single term of academic transcript data. These results highlight the potential for machine learning to have an impact on student retention and success while pointing to several promising directions for future work.