Data Privacy Protection in News Crowdfunding in the Era of Artificial Intelligence

This paper aims to study the protection of data privacy in news crowdfunding in the era of artificial intelligence. This paper respectively quotes the encryption algorithm of artificial intelligence data protection and the BP neural network prediction model to analyze the data privacy protection in news crowdfunding in the artificial intelligence era. Finally, this paper also combines the questionnaire survey method to understand the public’s awareness of privacy. The results of this paper show that artificial intelligence can promote personal data awareness and privacy, improve personal data and privacy measures and methods, and improve the effectiveness and level of privacy and privacy. In the analysis, the survey found that male college students only have 81.1% of the cognition of personal trait information, only 78.5% of network trace information, and only 78.3% of female college students’ cognition of personal credit.

Artificial Intelligence-Based Semisupervised Self-Training Algorithm in Pathological Tissue Image Segmentation

In the field of medical image processing, due to the differences in tissues, organs, and imaging methods, obtained medical images have significant differences. With the development of intelligence in medicine, an increasing number of computing optimization algorithms based on AI technology have also been applied to the field of medicine. Because the image segmentation algorithm based on the semisupervised self-training algorithm solves initialization class center large randomness problem in the traditional cluster-based image segmentation algorithm, this article aims to integrate the artificial intelligence semisupervised self-training algorithm into the pathological tissue image segmentation problem. An experimental group is designed to collect sample images and the algorithm proposed in this article is used to perform image segmentation to achieve a better visual experience and images. Although there is no general image segmentation theory, many scholars have been committed to applying new concepts and new methods to image segmentation in recent years and combining specific theoretical image segmentation methods has achieved good application results in image segmentation. For example, wavelet analysis, wavelet transform, neural networks, and genetic algorithms can effectively improve the segmentation effect. The results of the Seg cutting method designed in this article show that, in retinal blood vessel segmentation results on a database of healthy people, the sensitivity value is 0.941633, the false-positive rate is 0.952933, the specificity is 0.956787, and the accuracy rate is 0.96182, which are all higher than those in other methods. Image cutting methods such as FNN, CNN, and AWN have addressed the case tissue image cutting problem. Using the Seg cutting method designed in this article to segment the retinal blood vessels on a diabetes patient database, the sensitivity value is 0.8106, the false-positive rate is 0.0511, the specificity is 0.9712, the accuracy is 0.9421, and the false-positive rate is omitted. The false-positive rate is lower than AWN, and other indicators are higher than FNN, CNN, AWN, and other image cutting methods. The application of artificial intelligence-based semisupervised self-training algorithms in pathological tissue image segmentation is realized.

Intention Recognition With ProbLog

In many scenarios where robots or autonomous systems may be deployed, the capacity to infer and reason about the intentions of other agents can improve the performance or utility of the system. For example, a smart home or assisted living facility is better able to select assistive services to deploy if it understands the goals of the occupants in advance. In this article, we present a framework for reasoning about intentions using probabilistic logic programming. We employ ProbLog, a probabilistic extension to Prolog, to infer the most probable intention given observations of the actions of the agent and sensor readings of important aspects of the environment. We evaluated our model on a domain modeling a smart home. The model achieved 0.75 accuracy at full observability. The model was robust to reduced observability.

Detection of Diseases Using Machine Learning Image Recognition Technology in Artificial Intelligence

With the continuous development and improvement of artificial intelligence technology, machine learning technology has also been extensively developed, which has promoted the development of computer vision, image processing, natural language processing, and other fields. Purpose. This article aims to apply the image processing technology based on machine learning in the detection of childhood diseases and propose the application of image processing technology to the detection of childhood diseases. This article introduces machine learning, image recognition technology, and related algorithms in detail and experiments on image recognition technology based on machine learning. The experimental results show that image recognition technology based on machine learning can well identify white blood cells that are difficult to distinguish with the naked eye, with a recognition rate of up to 90%. Applying image recognition technology based on machine learning in disease diagnosis has greatly improved the level of medical diagnosis.

Bridging symbolic and subsymbolic reasoning with minimax entropy models

In this paper, we investigate MiniMax Entropy models, a class of neural symbolic models where symbolic and subsymbolic features are seamlessly integrated. We show how these models recover classical algorithms from both the deep learning and statistical relational learning scenarios. Novel hybrid settings are defined and experimentally explored, showing state-of-the-art performance in collective classification, knowledge base completion and graph (molecular) data generation.

Digital Design of Smart Museum Based on Artificial Intelligence

Today, as the soft power of culture is becoming more and more important, it is very important to pay attention to the learning and dissemination of culture. As the carrier of this process, the use of advanced technology to improve the museum is of great significance. This paper studies the digital design of smart museum based on artificial intelligence in order to explore the application of smart museum in artificial intelligence, analyze the spatial design of smart museum by using digital technology, explore a feasible method to give full play to the function of smart museum, and put forward some suggestions on the spatial design of smart museum. The design of the smart museum is no longer restricted by time and space and uses digital technology to double use virtual things and dynamic space. Through the detailed analysis of the application of artificial intelligence and digitization in the spatial design of the smart museum, combined with the information decision tree algorithm and data heterogeneous network algorithm, this study constructs the model of the information processing architecture of smart museum and the requirements of digital museum and makes a decision-making analysis of the comparison results of existing data. It includes the digital design of smart museum display technology, display effect, and other display-related contents. Analyzing the impact of smart museum on the object can provide data support for the feasibility of digital space design of smart museum based on artificial intelligence. The results of regression data processing show that the spatial visual sense of digital design wisdom museum is very strong, reaching the level of 5.0, and the picture aesthetic effect is up to 4.8.

Obstructive Sleep Apnea Syndrome Treated Using a Positive Pressure Ventilator Based on Artificial Intelligence Processor

With the acceleration of people's life rhythm, obstructive sleep apnea syndrome appears more and more frequently. This research mainly discusses the treatment of obstructive sleep apnea syndrome with a positive pressure ventilator based on artificial intelligence processor. The information storage function of the smart positive pressure ventilator is included in the local medical terminal, presented after logging in with the user authority. It is mainly composed of data collection, data processing, and medical interface design, which embeds data request, data transmission, data analysis, and detailed tasks such as data compression and storage, and functions such as data display, image drawing, and alarm notification are realized by the medical interface. When the CPAP ventilator transmits respiratory data to the local medical terminal, it sends real-time respiratory information data packets. The data packet is collected and sent in real time in a fixed period and then received and analyzed by the local medical terminal. In the CPAP ventilator telemedicine system, the function of alarm message processing is mainly used to detect the patient's breathing status in real time, extract the alarm-related information, and generate an alarm. This function specifically includes several tasks such as alarm detection, alarm prompt, alarm storage, and remote transmission of alarm messages. The confirmed OSAS patients were pressure-titrated with a smart CPAP ventilator and then treated for 5 hours a day, followed by echocardiography after 5 months of continuous treatment. During the study, the average BMI was (28.9 ± 7.2) kg/m2 and the average AHI index was (53.1 ± 37.8) times/h. This study may help improve the quality of life of patients with obstructive sleep apnea syndrome.

Learning on Hypergraphs With Sparsity

Hypergraph is a general way of representing high-order relations on a set of objects. It is a generalization of graph, in which only pairwise relations can be represented. It finds applications in various domains where relationships of more than two objects are observed. On a hypergraph, as a generalization of graph, one wishes to learn a smooth function with respect to its topology. A fundamental issue is to find suitable smoothness measures of functions on the nodes of a graph/hypergraph. We show a general framework that generalizes previously proposed smoothness measures and also generates new ones. To address the problem of irrelevant or noisy data, we wish to incorporate sparse learning framework into learning on hypergraphs. We propose sparsely smooth formulations that learn smooth functions and induce sparsity on hypergraphs at both hyperedge and node levels. We show their properties and sparse support recovery results. We conduct experiments to show that our sparsely smooth models are beneficial to learning irrelevant and noisy data, and usually give similar or improved performances compared to dense models.

Construction engineering cost estimation based on artificial intelligence technology

The determination of construction project cost is one of the important contents of construction project management, but the estimation of construction project cost generally has the disadvantages of large errors and long preparation time. With the continuous development of computer science, artificial intelligence theory is one of the hot research topics. The purpose of this article is to study the construction cost estimation based on artificial intelligence technology. Based on the theoretical basis of artificial neural network, genetic algorithm, and engineering cost, this paper proposes an optimized radial basic function (RBF) model based on genetic algorithm (GA). The search feature combines the width, center, and hidden layer weights of the RBF network with genetic algorithms to self-correct, thereby greatly improving the accuracy of the model calculation results. In this paper, according to the model’s error (actual output-expected output), the four test samples were tested separately, and the error values obtained were 0.0125, 0.1009, –0.0791, and 0.0514. This shows the accuracy of the experimental results of the model [R] higher.

Application and evaluation of knowledge graph embeddings in biomedical data

Linked data and bio-ontologies enabling knowledge representation, standardization, and dissemination are an integral part of developing biological and biomedical databases. That is, linked data and bio-ontologies are employed in databases to maintain data integrity, data organization, and to empower search capabilities. However, linked data and bio-ontologies are more recently being used to represent information as multi-relational heterogeneous graphs, "knowledge graphs". The reason being, entities and relations in the knowledge graph can be represented as embedding vectors in semantic space, and these embedding vectors have been used to predict relationships between entities. Such knowledge graph embedding methods provide a practical approach to data analytics and increase chances of building machine learning models with high prediction accuracy that can enhance decision support systems. Here, we present a comparative assessment and a standard benchmark for knowledge graph-based representation learning methods focused on the link prediction task for biological relations. We systematically investigated and compared state-of-the-art embedding methods based on the design settings used for training and evaluation. We further tested various strategies aimed at controlling the amount of information related to each relation in the knowledge graph and its effects on the final performance. We also assessed the quality of the knowledge graph features through clustering and visualization and employed several evaluation metrics to examine their uses and differences. Based on this systematic comparison and assessments, we identify and discuss the limitations of knowledge graph-based representation learning methods and suggest some guidelines for the development of more improved methods.

Determination of latent dimensionality in international trade flow

Currently, high-dimensional data is ubiquitous in data science, which necessitates the development of techniques to decompose and interpret such multidimensional (aka tensor) datasets. Finding a low dimensional representation of the data, that is, its inherent structure, is one of the approaches that can serve to understand the dynamics of low dimensional latent features hidden in the data. Moreover, decomposition methods with non-negative constraints are shown to extract more insightful factors. Nonnegative RESCAL is one such technique, particularly well suited to analyze self-relational data, such as dynamic networks found in international trade flows. Particularly, non-negative RESCAL computes a low dimensional tensor representation by finding the latent space containing multiple modalities. Furthermore, estimating the dimensionality of this latent space is crucial for extracting meaningful latent features. Here, to determine the dimensionality of the latent space with non-negative RESCAL, we propose a latent dimension determination method which is based on clustering of the solutions of multiple realizations of non-negative RESCAL decompositions. We demonstrate the performance of our model selection method on synthetic data. We then apply our method to decompose a network of international trade flows data from International Monetary Fund and shows that with a correct latent dimension determination, the resulting features are able to capture relevant empirical facts from economic literature.

Symbolic Learning and Reasoning With Noisy Data for Probabilistic Anchoring

Robotic agents should be able to learn from sub-symbolic sensor data and, at the same time, be able to reason about objects and communicate with humans on a symbolic level. This raises the question of how to overcome the gap between symbolic and sub-symbolic artificial intelligence. We propose a semantic world modeling approach based on bottom-up object anchoring using an object-centered representation of the world. Perceptual anchoring processes continuous perceptual sensor data and maintains a correspondence to a symbolic representation. We extend the definitions of anchoring to handle multi-modal probability distributions and we couple the resulting symbol anchoring system to a probabilistic logic reasoner for performing inference. Furthermore, we use statistical relational learning to enable the anchoring framework to learn symbolic knowledge in the form of a set of probabilistic logic rules of the world from noisy and sub-symbolic sensor input. The resulting framework, which combines perceptual anchoring and statistical relational learning, is able to maintain a semantic world model of all the objects that have been perceived over time, while still exploiting the expressiveness of logical rules to reason about the state of objects which are not directly observed through sensory input data. To validate our approach we demonstrate, on the one hand, the ability of our system to perform probabilistic reasoning over multi-modal probability distributions, and on the other hand, the learning of probabilistic logical rules from anchored objects produced by perceptual observations. The learned logical rules are, subsequently, used to assess our proposed probabilistic anchoring procedure. We demonstrate our system in a setting involving object interactions where object occlusions arise and where probabilistic inference is needed to correctly anchor objects.

Design patterns for modeling first-order expressive Bayesian networks

First-order expressive capabilities allow Bayesian networks (BNs) to model problem domains where the number of entities, their attributes, and their relationships can vary significantly between model instantiations. First-order BNs are well-suited for capturing knowledge representation dependencies, but literature on design patterns specific to first-order BNs is few and scattered. To identify useful patterns, we investigated the range of dependency models between combinations of random variables (RVs) that represent unary attributes, functional relationships, and binary predicate relationships. We found eight major patterns, grouped into three categories, that cover a significant number of first-order BN situations. Selection behavior occurs in six patterns, where a relationship/attribute identifies which entities in a second relationship/attribute are applicable. In other cases, certain kinds of embedded dependencies based on semantic meaning are exploited. A significant contribution of our patterns is that they describe various behaviors used to establish the RV’s local probability distribution. Taken together, the patterns form a modeling framework that provides significant insight into first-order expressive BNs and can reduce efforts in developing such models. To the best of our knowledge, there are no comprehensive published accounts of such patterns.

Situation awareness modeling for emergency management on offshore platforms

Situation awareness is the first and most important step in emergency management. It is a dynamic step involving evolving conditions and environments. It is an area of active research. This study presents a Markov Logic Network to model SA focusing on fire accidents and emergency evacuation. The model has been trained using empirical data obtained from case studies. The case studies involved human participants who were trained for responding to emergencies involving fire and smoke using a virtual environment. The simulated (queried) and empirical findings are reasonably consistent. The proposed model enables implementing an agent that exploits environmental cues and cognitive states to determine the type of emergency currently being faced. Considering each emergency type as a situation, the model can be used to develop a repertoire of situations for agents so that the repertoire can act as an agent’s experience for later decision-making.

On the realization of the recognition-primed decision model for artificial agents

This work proposes a methodology to program an artificial agent that can make decisions based on a naturalistic decision-making approach called recognition-primed decision model (RPDM). The proposed methodology represents the main constructs of RPDM in the language of Belief-Desire-Intention logic. RPDM considers decision-making as a synthesis of three phenomenal abilities of the human mind. The first is one’s use of experience to recognize a situation and suggest appropriate responses. The main concern here is on situation awareness because the decision-maker needs to establish that a current situation is the same or similar to one previously experienced, and the same solution is likely to work this time too. To this end, the proposed modeling approach uses a Markov logic network to develop an Experiential-Learning and Decision-Support module. The second component of RPDM deals with the cases when a decision-maker’s experience becomes secondary because the situation has not been recognized as typical. In this case, RPDM suggests a diagnostic mechanism that involves feature-matching, and, therefore, an ontology (of the domain of interest) based reasoning approach is proposed here to deal with all such cases. The third component of RPDM is the proposal that human beings use intuition and imagination (mental stimulation) to make sure whether a course of action should work in a given situation or not. Mental simulation is modeled here as a Bayesian network that computes the probability of occurrence of an effect when a cause is more likely. The agent-based model of RPDM has been validated with real (empirical) data to compare the simulated and empirical results and develop a correspondence in terms of the value of the result, as well as the reasoning.

Bridging Weighted Rules and Graph Random Walks for Statistical Relational Models

The aim of statistical relational learning is to learn statistical models from relational or graph-structured data. Three main statistical relational learning paradigms include weighted rule learning, random walks on graphs, and tensor factorization. These paradigms have been mostly developed and studied in isolation for many years, with few works attempting at understanding the relationship among them or combining them. In this article, we study the relationship between the path ranking algorithm (PRA), one of the most well-known relational learning methods in the graph random walk paradigm, and relational logistic regression (RLR), one of the recent developments in weighted rule learning. We provide a simple way to normalize relations and prove that relational logistic regression using normalized relations generalizes the path ranking algorithm. This result provides a better understanding of relational learning, especially for the weighted rule learning and graph random walk paradigms. It opens up the possibility of using the more flexible RLR rules within PRA models and even generalizing both by including normalized and unnormalized relations in the same model.