Facebook is using a combination of pattern recognition, live chat support from crisis support organizations and other tools to prevent suicide, with a focus on its Live service. There is one death by suicide every 40 seconds and over 800,000 people kill themselves every year, according to the World Health Organization. "Facebook is in a unique position -- through friendships on the site -- to help connect a person in distress with people who can support them," the company said Wednesday. The move by Facebook appears to aim to prevent the live-streaming of of suicides on the Live platform, which was launched in April last year, and allows people, public figures and pages to share live videos with friends and followers. The company said that its suicide prevention tools for Facebook posts will now be integrated into Live, giving people watching a live video the option to reach out to the person directly and to report the video to the company.

Pattern sampling has been proposed as a potential solution to the infamous pattern explosion. Instead of enumerating all patterns that satisfy the constraints, individual patterns are sampled proportional to a given quality measure. Several sampling algorithms have been proposed, but each of them has its limitations when it comes to 1) flexibility in terms of quality measures and constraints that can be used, and/or 2) guarantees with respect to sampling accuracy. We therefore present Flexics, the first flexible pattern sampler that supports a broad class of quality measures and constraints, while providing strong guarantees regarding sampling accuracy. To achieve this, we leverage the perspective on pattern mining as a constraint satisfaction problem and build upon the latest advances in sampling solutions in SAT as well as existing pattern mining algorithms. Furthermore, the proposed algorithm is applicable to a variety of pattern languages, which allows us to introduce and tackle the novel task of sampling sets of patterns. We introduce and empirically evaluate two variants of Flexics: 1) a generic variant that addresses the well-known itemset sampling task and the novel pattern set sampling task as well as a wide range of expressive constraints within these tasks, and 2) a specialized variant that exploits existing frequent itemset techniques to achieve substantial speed-ups. Experiments show that Flexics is both accurate and efficient, making it a useful tool for pattern-based data exploration.

For making a success in stock photography it is desirable on the part of the photographer to be skilled not only in taking quality images, but also to scan out all the relevant descriptive keywords which can serve beneficial in listing his image on a stock photograpy agency. Today the task of keywording has emerged out as an act of creativity which can either lead to a great sale or deprive you of buyers. As the task of manually finding the keywords can be time consuming, keywordsready.com which is a keyword suggestion tool is well versed to relieve you of this problem and retrieves within seconds a set of keywords through Artificial Intelligence and pattern recognition technology. This saves your precious time for a multitude of other tasks concerning stock photography.

Being an unsupervised machine learning and data mining technique, biclustering and its multimodal extensions are becoming popular tools for analysing object-attribute data in different domains. Apart from conventional clustering techniques, biclustering is searching for homogeneous groups of objects while keeping their common description, e.g., in binary setting, their shared attributes. In bioinformatics, biclustering is used to find genes, which are active in a subset of situations, thus being candidates for biomarkers. However, the authors of those biclustering techniques that are popular in gene expression analysis, may overlook the existing methods. For instance, BiMax algorithm is aimed at finding biclusters, which are well-known for decades as formal concepts. Moreover, even if bioinformatics classify the biclustering methods according to reasonable domain-driven criteria, their classification taxonomies may be different from survey to survey and not full as well. So, in this paper we propose to use concept lattices as a tool for taxonomy building (in the biclustering domain) and attribute exploration as means for cross-domain taxonomy completion.

It's a process of reference and pattern-matching to loose assembly, vetting and editing.

In 2016, an estimated 400 million people interacted with IBM's Watson: The artificial intelligence platform now processes data to assist in everything from oncology treatments to NBA draft picks. In the past year, dozens of companies, including GM, Japan Airlines, Hilton, and Pfizer, have launched initiatives using IBM's intelligence. Watson owes its ubiquity to the dozens of new AI tools, including emotional analysis and image recognition, that it offers developers. "Our mission is to let people own their own AI," says David Kenny, general manager of IBM Watson. Retail outlets such as Macy's and the Mall of America are employing Watson's language-processing tools to help shoppers navigate their stores.

Predictive models deployed in the real world may assign incorrect labels to instances with high confidence. Such errors or unknown unknowns are rooted in model incompleteness, and typically arise because of the mismatch between training data and the cases encountered at test time. As the models are blind to such errors, input from an oracle is needed to identify these failures. In this paper, we formulate and address the problem of informed discovery of unknown unknowns of any given predictive model where unknown unknowns occur due to systematic biases in the training data.We propose a model-agnostic methodology which uses feedback from an oracle to both identify unknown unknowns and to intelligently guide the discovery. We employ a two-phase approach which first organizes the data into multiple partitions based on the feature similarity of instances and the confidence scores assigned by the predictive model, and then utilizes an explore-exploit strategy for discovering unknown unknowns across these partitions. We demonstrate the efficacy of our framework by varying the underlying causes of unknown unknowns across various applications. To the best of our knowledge, this paper presents the first algorithmic approach to the problem of discovering unknown unknowns of predictive models.

3-D image registration, which involves aligning two or more images, is a critical step in a variety of medical applications from diagnosis to therapy. Image registration is commonly performed by optimizing an image matching metric as a cost function. However this task is challenging due to the non-convex nature of the matching metric over the plausible registration parameter space and insufficient approches for a robust optimization. As a result, current approaches are often customized to a specific problem and sensitive to image quality and artifacts. In this paper, we propose a completely different approach to image registration, inspired by how experts perform the task. We first cast the image registration problem as a "strategic learning" process, where the goal is to find the best sequence of motion actions (e.g. up, down, etc) that yields image alignment. Within this approach, an artificial agent is learned, modeled using deep convolutional neural networks, with 3D raw image data as the input, and the next optimal action as the output. To copy with the dimensionality of the problem, we propose a greedy supervised approach for an end-to-end training, coupled with attention-driven hierarchical strategy. The resulting registration approach inherently encodes both a data-driven matching metric and an optimal registration strategy (policy). We demonstrate on two 3-D/3-D medical image registration examples with drastically different nature of challenges, that the artificial agent outperforms several state-of-the-art registration methods by a large margin in terms of both accuracy and robustness.

Existing studies show that extracting a complete keyphrase candidate set is the first and crucial step to extract high quality keyphrases from documents. Based on a common sense that words do not repeatedly appear in an effective keyphrase, we propose a novel algorithm named KCSP for document-specific keyphrase candidate search using sequential pattern mining with gap constraints, which only needs to scan a document once and automatically specifies appropriate gap constraints for words without users’ participation. The experimental results confirm that it helps improve the quality of keyphrase extraction.

This demonstration showcases the different use cases of Artificial Intelligence (AI) in education by introducing students to applications of the Scribbler robot with the Fluke board in order to cultivate an interest in programming, robotics, and AI. The targeted audience for this is students aged eight through twelve. This demonstration uses three Scribbler robots to introduce students to common tools in AI (OpenCV and Tesseract), and teach them the basics of coding in an interactive, unintimidating way; by physically describing the goals of simple shape-building algorithms and implementing them using cards with both visual and written representations of the instructions.