Harmonic Aggregation Operator with Trapezoidal Picture Fuzzy Numbers and Its Application in a Multiple-Attribute Decision-Making Problem

Picture fuzzy sets (PFSs) can be used to handle real-life problems with uncertainty and vagueness more effectively than intuitionistic fuzzy sets (IFSs). In the process of information aggregation, many aggregation operators under PFSs are used by different authors in different fields. In this article, a multi-attribute decision-making (MADM) problem is introduced utilizing harmonic mean aggregation operators with trapezoidal fuzzy number (TrFN) under picture fuzzy information. Three harmonic mean operators are developed namely trapezoidal picture fuzzy weighted harmonic mean (TrPFWHM) operator, trapezoidal picture fuzzy order weighted harmonic mean (TrPFOWHM) operator and trapezoidal picture fuzzy hybrid harmonic mean (TrPFHHM) operator. The related properties about these operators are also studied. At last, an MADM problem is considered to interrelate among these operators. Furthermore, a numerical instance is considered to explain the productivity of the proposed operators.

To select suitable supplier for complex equipment military-civilian collaborative design based on fuzzy preference information that from matching perspective

Combine complex equipment collaborative development in military-civilian integration context not only fulfils actual development requirement, but also beneficial to the national economy. Design procedure as first stage of complex equipment military-civilian collaborative development process, select suitable design supplier is significant to whole development process of complex equipment. In order to select suitable design supplier for complex equipment, two aspects done in this paper. One is comprehensive analysis of evaluated influencing factors that affect complex equipment military-civilian collaborative design process, corresponding evaluation indicator constructed and a combination of grey correlation, entropy, DEMATEL (Decision-making Trial and Evaluation Laboratory) and VIKOR analysis theory to obtain grey entropy-DEMATEL-VIKOR, then the combined method is utilized to acquire matching attributes for followed research content. Meanwhile, satisfaction degree for matching side obtained with the help of information aggregation based on power generalized Heronian mean which on the basis of fuzzy preference information. Then, through constructed matching model, suitable design supplier obtained. Finally, a corresponding illustrative example given.

Vague multi-attribute group decision-making method based on evidence theory with a new aspect to solve weights

In order to solve the problems of weight solving and information aggregation in the Vague multi-attribute group decision-making, this paper first solves the weight of Vague evaluation value, and then fuses the information of Vague sets through evidence theory, and obtains an information aggregation algorithm for Vague multi-attribute group decision-making. Firstly, The algorithm draws on the idea of solving the weight of evidence in the improved evidence theory algorithm, and calculates the weight of Vague evaluation value, and revises the original evaluation information after obtaining the weight of each Vague evaluation value. Secondly, this algorithm analyzes the mathematical relationship between the Vague sets and the evidence theory, and uses the evidence theory to fuse the evaluation information to obtain the final Vague evaluation value of each alternative. Finally, this algorithm uses a score function to calculate the score of each alternative to determine the best alternative. The algorithm given in the paper enables decision-makers to make rational decisions in uncertain environments, and then select the best alternative.

Towards a COVID-19 symptom triad: The importance of symptom constellations in the SARS-CoV-2 pandemic

Pandemic scenarios like SARS-Cov-2 require rapid information aggregation. In the age of eHealth and data-driven medicine, publicly available symptom tracking tools offer efficient and scalable means of collecting and analyzing large amounts of data. As a result, information gains can be communicated to front-line providers. We have developed such an application in less than a month and reached more than 500 thousand users within 48 hours. The dataset contains information on basic epidemiological parameters, symptoms, risk factors and details on previous exposure to a COVID-19 patient. Exploratory Data Analysis revealed different symptoms reported by users with confirmed contacts vs. no confirmed contacts. The symptom combination of anosmia, cough and fatigue was the most important feature to differentiate the groups, while single symptoms such as anosmia, cough or fatigue alone were not sufficient. A linear regression model from the literature using the same symptom combination as features was applied on all data. Predictions matched the regional distribution of confirmed cases closely across Germany, while also indicating that the number of cases in northern federal states might be higher than officially reported. In conclusion, we report that symptom combinations anosmia, fatigue and cough are most likely to indicate an acute SARS-CoV-2 infection.

A variational-autoencoder approach to solve the hidden profile task in hybrid human-machine teams

Algorithmic agents, popularly known as bots, have been accused of spreading misinformation online and supporting fringe views. Collectives are vulnerable to hidden-profile environments, where task-relevant information is unevenly distributed across individuals. To do well in this task, information aggregation must equally weigh minority and majority views against simple but inefficient majority-based decisions. In an experimental design, human volunteers working in teams of 10 were asked to solve a hidden-profile prediction task. We trained a variational auto-encoder (VAE) to learn people's hidden information distribution by observing how people's judgements correlated over time. A bot was designed to sample responses from the VAE latent embedding to selectively support opinions proportionally to their under-representation in the team. We show that the presence of a single bot (representing 10\% of team members) can significantly increase the polarization between minority and majority opinions by making minority opinions less prone to social influence. Although the effects on hybrid team performance were small, the bot presence significantly influenced opinion dynamics and individual accuracy. These findings show that self-supervised machine learning techniques can be used to design algorithms that can sway opinion dynamics and group outcomes.

EOESGC: predicting miRNA-disease associations based on embedding of embedding and simplified graph convolutional network

Background A large number of biological studies have shown that miRNAs are inextricably linked to many complex diseases. Studying the miRNA-disease associations could provide us a root cause understanding of the underlying pathogenesis in which promotes the progress of drug development. However, traditional biological experiments are very time-consuming and costly. Therefore, we come up with an efficient models to solve this challenge. Results In this work, we propose a deep learning model called EOESGC to predict potential miRNA-disease associations based on embedding of embedding and simplified convolutional network. Firstly, integrated disease similarity, integrated miRNA similarity, and miRNA-disease association network are used to construct a coupled heterogeneous graph, and the edges with low similarity are removed to simplify the graph structure and ensure the effectiveness of edges. Secondly, the Embedding of embedding model (EOE) is used to learn edge information in the coupled heterogeneous graph. The training rule of the model is that the associated nodes are close to each other and the unassociated nodes are far away from each other. Based on this rule, edge information learned is added into node embedding as supplementary information to enrich node information. Then, node embedding of EOE model training as a new feature of miRNA and disease, and information aggregation is performed by simplified graph convolution model, in which each level of convolution can aggregate multi-hop neighbor information. In this step, we only use the miRNA-disease association network to further simplify the graph structure, thus reducing the computational complexity. Finally, feature embeddings of both miRNA and disease are spliced into the MLP for prediction. On the EOESGC evaluation part, the AUC, AUPR, and F1-score of our model are 0.9658, 0.8543 and 0.8644 by 5-fold cross-validation respectively. Compared with the latest published models, our model shows better results. In addition, we predict the top 20 potential miRNAs for breast cancer and lung cancer, most of which are validated in the dbDEMC and HMDD3.2 databases. Conclusion The comprehensive experimental results show that EOESGC can effectively identify the potential miRNA-disease associations.

Naïve Learning with Uninformed Agents

The DeGroot model has emerged as a credible alternative to the standard Bayesian model for studying learning on networks, offering a natural way to model naïve learning in a complex setting. One unattractive aspect of this model is the assumption that the process starts with every node in the network having a signal. We study a natural extension of the DeGroot model that can deal with sparse initial signals. We show that an agent’s social influence in this generalized DeGroot model is essentially proportional to the degree-weighted share of uninformed nodes who will hear about an event for the first time via this agent. This characterization result then allows us to relate network geometry to information aggregation. We show information aggregation preserves “wisdom” in the sense that initial signals are weighed approximately equally in a model of network formation that captures the sparsity, clustering, and small-world properties of real-world networks. We also identify an example of a network structure where essentially only the signal of a single agent is aggregated, which helps us pinpoint a condition on the network structure necessary for almost full aggregation. Simulating the modeled learning process on a set of real-world networks, we find that there is on average 22.4 percent information loss in these networks. We also explore how correlation in the location of seeds can exacerbate aggregation failure. Simulations with real-world network data show that with clustered seeding, information loss climbs to 34.4 percent. (JEL D83, D85, Z13)