The "Innovations in Cancer Diagnosis and Treatment, Micro-LEDs, Renewable Energy Generation and Storage, and Fault Detection" report has been added to ResearchAndMarkets.com's offering. The edition also provides insights on the role of macropinocytosis in pancreatic cancer. The TOE covers use of ceramic electrodes for doubling energy density and a biosensor for earlier diagnosis of tumors.

This is most apparent when auto-encoders are trained, where a network is trained to map the input data upon itself but is forced to project them into a lower-dimensional embedding space on the way (Vincent et al., 2010). In addition to the conventional fully connected layers, there are various special types of network connections. For example, in computer vision, convolu-tional layers are commonly used, which train multiple sliding windows that move over the image data and process just a part of the image at a time, thereby learning to recognize local features. These layers are subsequently abstracted into more and more complex visual patterns (Krizhevsky et al., 2017). For temporal data, one can use recurrent neural networks, which do not make predictions for individual input vectors, but for a sequence of input vectors. To do so, they allow feeding abstracted information from previous data points forward to the next layers.

Normative expert systems have not become commonplace because they have been difficult to build and use. Over the past decade, however, researchers have developed the influence diagram, a graphical representation of a decision maker's beliefs, alternatives, and preferences that serves as the knowledge base of a normative expert system. Most people who have seen the representation find it intuitive and easy to use. Consequently, the influence diagram has overcome significantly the barriers to constructing normative expert systems. Nevertheless, building influence diagrams is not practical for extremely large and complex domains. In this book, I address the difficulties associated with the construction of the probabilistic portion of an influence diagram, called a knowledge map, belief network, or Bayesian network. I introduce two representations that facilitate the generation of large knowledge maps. In particular, I introduce the similarity network, a tool for building the network structure of a knowledge map, and the partition, a tool for assessing the probabilities associated with a knowledge map. I then use these representations to build Pathfinder, a large normative expert system for the diagnosis of lymph-node diseases (the domain contains over 60 diseases and over 100 disease findings). In an early version of the system, I encoded the knowledge of the expert using an erroneous assumption that all disease findings were independent, given each disease. When the expert and I attempted to build a more accurate knowledge map for the domain that would capture the dependencies among the disease findings, we failed. Using a similarity network, however, we built the knowledge-map structure for the entire domain in approximately 40 hours. Furthermore, the partition representation reduced the number of probability assessments required by the expert from 75,000 to 14,000.

There is no shortage of training content for employees. However, quick access to the right information is the challenge. Traditionally, the L&D departments spend significant time on instructor-led training and aggregating and buying third-party training content. Other learning avenues, like on-the-job training, personalized training, micro-learning, and data or event-driven training programs are equally important. Employees today learn from content spread across internal and external systems including intranets, MooC platforms, LMS, social media platforms, external training content providers, document management systems, collaboration platforms, and even forums, Q&A portals, email and messenger/ chat platforms.

Artificial intelligence (AI) has permeated enterprise operations to the point that it now determines an organization's success, including in the area of project management. In a report, Project Management Institute (PMI) examines how six AI technologies are affecting today's project managers and will affect project management operations in the future. PMI's AI Innovators: Cracking the Code on Project Performance (2019) found that in the next three years, project professionals expect overall AI usage to jump from 23% to 37% and the majority of respondents (81%) said their organizations are currently being affected by AI technologies. SEE: The ethical challenges of AI: A leader's guide (free PDF) (TechRepublic) "Project leaders are in the earliest stages of adopting AI to streamline--and improve--project work. AI technologies are already contributing to higher productivity and better quality," said Mark Broome, chief data officer at PMI. "For example, technology is decreasing the amount of time project managers need to spend on activities like monitoring progress and managing documentation--they can rely on AI for these more administrative tasks. The time saved can then be repurposed to more strategic and creative tasks and planning."

This is crucial for the use of large Knowledge bases in many downstream applications. However explaining the predictions given by a KBC algorithm is quite important for several real world use cases. For example in rec-ommender systems, a knowledge graph of users, items and their interactions are used to recommend an item to a user based on the users interactions on several items. The ability to explain and reason on the decision is of critical importance to add knowledge to recommender systems. Similarly in a knowledge graph consisting human biological data such as genes, drugs, symptoms and diseases, it is crucial to know which gene and symptoms were involved in predicting a drug for a disease. This requires automatic extraction and ranking of multi-hop paths between a given source and a target entity from a knowledge graph. Previous work has focused on using path information in knowledge graphs for KBC known as path-based inference (Lao et al., 2011; Gardner et al., 2014; Neelakantan et al., 2015; Das et al., 2017b), in which a model is trained to predict missing links between a given pair of entities taking as input several paths that existed between them. Paths are ranked according to a scoring method and used as features to train the model. Embedding-based inference models (Bordes et al., 2013; Lin et al., 2015; Nickel et al., 2011; Socher et al., 2013; Trouillon et al., 2016) for KBC learn entity and relation embeddings by solving an optimization problem that maximises the plausibility of known facts in the knowledge graph.

Root cause analysis in a large-scale production environment is challenging due to the complexity of services running across global data centers. Due to the distributed nature of a large-scale system, the various hardware, software, and tooling logs are often maintained separately, making it difficult to review the logs jointly for detecting issues. Another challenge in reviewing the logs for identifying issues is the scale - there could easily be millions of entities, each with hundreds of features. In this paper we present a fast dimensional analysis framework that automates the root cause analysis on structured logs with improved scalability. We first explore item-sets, i.e. a group of feature values, that could identify groups of samples with sufficient support for the target failures using the Apriori algorithm and a subsequent improvement, FP-Growth. These algorithms were designed for frequent item-set mining and association rule learning over transactional databases. After applying them on structured logs, we select the item-sets that are most unique to the target failures based on lift. With the use of a large-scale real-time database, we propose pre- and post-processing techniques and parallelism to further speed up the analysis. We have successfully rolled out this approach for root cause investigation purposes in a large-scale infrastructure. We also present the setup and results from multiple production use-cases in this paper.

In this paper, we study the problem of learning probabilistic logical rules for inductive and interpretable link prediction. Despite the importance of inductive link prediction, most previous works focused on transductive link prediction and cannot manage previously unseen entities. Moreover, they are black-box models that are not easily explainable for humans. We propose DRUM, a scalable and differentiable approach for mining first-order logical rules from knowledge graphs which resolves these problems. We motivate our method by making a connection between learning confidence scores for each rule and low-rank tensor approximation. DRUM uses bidirectional RNNs to share useful information across the tasks of learning rules for different relations. We also empirically demonstrate the efficiency of DRUM over existing rule mining methods for inductive link prediction on a variety of benchmark datasets.

The recent rapid development of pretrained language models has produced significant performance improvements on downstream NLP tasks. These pretrained language models compile and store relational knowledge they encounter in training data, which prompted Facebook AI Research and University College London to introduce their LAMA (LAnguage Model Analysis) probe to explore the feasibility of using language models as knowledge bases. The term "knowledge base" was introduced in the 1970s. Unlike databases which store figures, tables, and other straightforward data in computer memory, a knowledge base is able to store more complex structured and unstructured information. A knowledge base system can be likened to a library that stores facts in a specific field.

-- Mammography is often used as the most common laboratory method for the detection of breast cancer, yet associated with the high cost and many side effects. M achine learning prediction as an alternative method has shown promising results. This paper present s a method based on a mul tilayer fuzzy expert system for the detection of breast cancer using an e xtreme learning machine (ELM) classification model integrated with radial basis function (RBF) kernel called ELM - RBF, considering the Wisconsin dataset . The performance of the propose d model is further compared with a l inear - SVM model. Furthermore, both models are studied in terms of criteria of accuracy, precision, sensitivity, specificity, validation, true positive rate (TPR), and false - negative rate (FNR). The ELM - RBF model for these criteria presents better performance compared to the SVM model . Breast cancer is among the most common disease of young women over the world [1 - 3]. Approximately 29.9% of mortality from can cer in women is due to breast cancer. The incidence of this disease is lower in developing countries than in developed countries, about 10% of women with breast cancer in Western countries.