Branding is a magic weapon for enterprises to participate in international competition, and empowering enterprises through branding has become a national strategy in the new era. Economic and social development has won wide acclaim from the international community, but enterprises generally have the problem of being “big but not strong”, which is not matching with long history and great power influence. The brand bottleneck of Chinese enterprises has been highlighted. Recent brand theory research has been fruitful on the whole, but (...) there are also some weak links, among which “the mechanism of enterprise brand value formation” is a research theme to be strengthened. This paper presents a number of suggestions for the formation of corporate brand value. The empirical analysis was conducted using valid data. The results found that: customer involvement behavior has a significant positive influence on customer citizenship behavior and customer experience value. Customer experience value has a significant positive influence on customer satisfaction and customer commitment. It plays a mediating effect in the relationship between the influence of customer involvement behavior on customer satisfaction and customer commitment, respectively. Customer satisfaction has a significant positive influence on customer commitment, and plays a mediating customer commitment has a significant positive effect on customer citizenship behavior and mediates the effect of customer experience value on customer citizenship behavior. The experimental results show that: the accuracy of crop color recognition by this method is high, and it has the advantages of faster computational efficiency and higher computational accuracy compared with other algorithms, thus verifying the reliability of the algorithm. Based on the fuzzy sentiment of online reviews, this paper improves the continuous use model ECM-ISC and formulates the inference rules of fuzzy affiliation function, and verifies the brand conversion intention and brand conversion type of cell phones by example calculation, which has good accuracy and generality and has important practical significance for brand marketing and early warning management. In addition, the use of brand economics in the study of corporate brand positioning is a development and innovation of brand economics. (shrink)

Link prediction is a key tool for studying the structure and evolution mechanism of complex networks. Recommending new friend relationships through accurate link prediction is one of the important factors in the evolution, development, and popularization of social networks. At present, scholars have proposed many link prediction algorithms based on the similarity of local information and random walks. These algorithms help identify actual missing and false links in various networks. However, the prediction results significantly differ in networks with (...) various structures, and the prediction accuracy is low. This study proposes a method for improving the accuracy of link prediction. Before link prediction, k-shell decomposition method is used to layer the network, and the nodes that are in 1-shell and the nodes that are not linked to the high-shell in the 2-shell are deleted. The experiments on four real network datasets verify the effectiveness of the proposed method. (shrink)

Big Data are increasingly used in machine learning in order to create predictive models. How are predictive practices that use such models to be situated? In the field of surveillance studies many of its practitioners assert that “governance by discipline” has given way to “governance by risk”. The individual is dissolved into his/her constituent data and no longer addressed. I argue that, on the contrary, in most of the contexts where predictive modelling is used, it constitutes Foucauldian (...) discipline. Compliance to a norm occupies centre stage; suspected deviants are subjected to close attention—as the precursor of possible sanctions. The predictive modelling involved uses personal data from both the focal institution and elsewhere. As a result, the individual re-emerges as the focus of scrutiny. Subsequently, small excursions into Foucauldian texts discuss his discourses on the creation of the “delinquent”, and on the governmental approach to smallpox epidemics. It is shown that his insights only mildly resemble prediction as based on machine learning; several conceptual steps had to be taken for modern machine learning to evolve. Finally, the options available to those subjected to predictive disciplining are discussed: to what extent can they comply, question, or resist? Through a discussion of the concepts of transparency and “gaming the system” I conclude that our predicament is gloomy, in a Kafkaesque fashion. (shrink)

In light of the recent emergence of predictive techniques in law enforcement to forecast crimes before they occur, this paper examines the temporal operation of power exercised by predictive policing algorithms. I argue that predictive policing exercises power through a paranoid style that constitutes a form of temporal governmentality. Temporality is especially pertinent to understanding what is ethically at stake in predictive policing as it is continuous with a historical racialized practice of organizing, managing, controlling, (...) and stealing time. After first clarifying the concept of temporal governmentality, I apply this lens to Chicago Police Department’s Strategic Subject List. This predictive algorithm operates, I argue, through a paranoid logic that aims to preempt future possibilities of crime on the basis of a criminal past codified in historical crime data. (shrink)

The value-ladenness of computer algorithms is typically framed around issues of epistemic risk. In this article, I examine a deeper sense of value-ladenness: algorithmic methods are not only themselves value-laden but also introduce value into how we reason about their domain of application. I call this domain distortion. In particular, using insights from jurisprudence, I show that the use of recidivism risk assessment algorithms presupposes legal formalism and blurs the distinction between liability assessment and sentencing, which distorts how (...) the domain of criminal punishment is conceived and provides a distinctive avenue for values to enter the legal process. (shrink)

This article focuses on the multidimensional construction of the multimedia network public opinion supervision mechanism, puts the research on the background of the era of big data, and based on the analysis and definition of the difference between network public opinion and network public opinion, deeply summarizes the network public opinion in the era of big data. New features analyze the opportunities and challenges faced by online public opinion in the era of big data. Based on the rational construction of (...) the index system, this paper studies the multimedia network public opinion evaluation and prediction algorithm. Existing network public opinion assessment and prediction algorithms have shortcomings in capturing the characteristics of data sequences and the long-term dependence of data sequences, and the problems of overfitting and gradient disappearance may occur during training. Because of the above problems, based on the long-term and short-term memory network model, a regularized method is used to construct a multimedia network public opinion prediction model algorithm. This paper builds a multimedia network public opinion threat rating evaluation model based on the public opinion supervision prediction model and conducts analysis. The model constructed this time can not only improve the accuracy of public opinion assessment and prediction but also better avoid the problem of gradient disappearance and overfitting. (shrink)

Purpose Existing algorithms for predicting suicide risk rely solely on data from electronic health records, but such models could be improved through the incorporation of publicly available socioeconomic data – such as financial, legal, life event and sociodemographic data. The purpose of this study is to understand the complex ethical and privacy implications of incorporating sociodemographic data within the health context. This paper presents results from a survey exploring what the general public’s knowledge and concerns are about such publicly (...) available data and the appropriateness of using it in suicide risk prediction algorithms. Design/methodology/approach A survey was developed to measure public opinion about privacy concerns with using socioeconomic data across different contexts. This paper presented respondents with multiple vignettes that described scenarios situated in medical, private business and social media contexts, and asked participants to rate their level of concern over the context and what factor contributed most to their level of concern. Specific to suicide prediction, this paper presented respondents with various data attributes that could potentially be used in the context of a suicide risk algorithm and asked participants to rate how concerned they would be if each attribute was used for this purpose. Findings The authors found considerable concern across the various contexts represented in their vignettes, with greatest concern in vignettes that focused on the use of personal information within the medical context. Specific to the question of incorporating socioeconomic data within suicide risk prediction models, the results of this study show a clear concern from all participants in data attributes related to income, crime and court records, and assets. Data about one’s household were also particularly concerns for the respondents, suggesting that even if one might be comfortable with their own being used for risk modeling, data about other household members is more problematic. Originality/value Previous studies on the privacy concerns that arise when integrating data pertaining to various contexts of people’s lives into algorithmic and related computational models have approached these questions from individual contexts. This study differs in that it captured the variation in privacy concerns across multiple contexts. Also, this study specifically assessed the ethical concerns related to a suicide prediction model and determining people’s awareness of the publicness of select data attributes, as well as which of these data attributes generated the most concern in such a context. To the best of the authors’ knowledge, this is the first study to pursue this question. (shrink)

A basic principle in sentencing offenders is proportionality. However, proportionality judgments are often left to the discretion of the judge, raising familiar concerns of arbitrariness and bias. This paper considers the case for systematizing judgments of proportionality in sentencing by means of an algorithm. The aim of such an algorithm would be to predict what a judge in that jurisdiction would regard as a proportionate sentence in a particular case. A predictive algorithm of this kind would not necessarily undermine (...) justice in individual cases, is consistent with a particularistic account of moral judgment, and is attractive even in the face of uncertainty as to the legitimate purposes of punishment. (shrink)

The irreversibility in time, the multicausality on lines, and the uncertainty of feedbacks make economic systems and the predictions of economic chaotic time series possess the characteristics of high dimensionalities, multiconstraints, and complex nonlinearities. Based on genetic algorithm and fuzzy rules, the chaotic genetics combined with fuzzy decision-making can use simple, fast, and flexible means to complete the goals of automation and intelligence that are difficult to traditional predicting algorithms. Moreover, the new combined method’s ergodicity can perform nonrepetitive searches (...) in a global scope, hence improving the algorithm’s accuracy and efficiency. On the basis of summarizing and analyzing previous research works, this paper expounded the research status and significance of the prediction of economic chaotic time series, elaborated the development background, current status, and future challenges of the combined algorithm of chaotic genetics with fuzzy decision, introduced the basic principles of chaotic genetic algorithm and fuzzy decision algorithm, constructed a prediction model for economic chaotic time series, performed parameter synchronization optimization and moderate function construction, analyzed the prediction processes of economic chaotic time series, conducted phase space reconstruction and correlation dimension calculation, and finally carried out a simulation experiment with its result analysis. The study results show that the algorithm of chaotic genetics combined with fuzzy decision-making can dynamically adjust chaotic mutation operators and summarize fussy expert experiences. The phase space of its reconstructed chaotic attractor has high-precision predictability and can find orderly processes from changeable economic results, which in turn can be used to analyze and predict the complex economic chaotic time series. The study results of this paper provide a reference for further research on predictive analysis of economic chaotic time series based on chaotic genetics combined with fuzzy decision algorithm. (shrink)

This paper examines racial discrimination and algorithmic bias in predictive policing algorithms (PPAs), an emerging technology designed to predict threats and suggest solutions in law enforcement. We first describe what discrimination is in a case study of Chicago’s PPA. We then explain their causes with Broadbent’s contrastive model of causation and causal diagrams. Based on the cognitive science literature, we also explain why fairness is not an objective truth discoverable in laboratories but has context-sensitive social meanings that need (...) to be negotiated through democratic processes. With the above analysis, we next predict why some recommendations given in the bias reduction literature are not as effective as expected. Unlike the cliché highlighting equal participation for all stakeholders in predictive policing, we emphasize power structures to avoid hermeneutical lacunae. Finally, we aim to control PPA discrimination by proposing a governance solution—a framework of a social safety net. (shrink)

We report and compare the performance of different learning algorithms based on data from cortical recordings. The task is to predict the orientation of visual stimuli from the activity of a population of simultaneously recorded neurons. We compare several ways of improving the coding of the input (i.e., the spike data) as well as of the output (i.e., the orientation), and report the results obtained using different kernel algorithms.

This article analyzes local algorithmic practices resulting from the increased use of time-lapse (TL) imaging in fertility treatment. The data produced by TL technologies are expected to help professionals pick the best embryo for implantation. The emergence of TL has been characterized by promissory discourses of deeper embryo knowledge and expanded selection standardization, despite professionals having no conclusive evidence that TL improves pregnancy rates. Our research explores the use of TL tools in embryology labs. We pay special attention to standardization (...) efforts and knowledge-creation facilitated through TL and its incorporated algorithms. Using ethnographic data from five UK clinical sites, we argue that knowledge generated through TL is contingent upon complex human–machine interactions that produce local uncertainties. Thus, algorithms do not simply add medical knowledge. Rather, they rearrange professional practice and expertise. Firstly, we show how TL changes lab routines and training needs. Secondly, we show that the human input TL requires renders the algorithm itself an uncertain and situated practice. This, in turn, raises professional questions about the algorithm’s authority in embryo selection. The article demonstrates the embedded nature of algorithmic knowledge production, thus pointing to the need for STS scholarship to further explore the locality of algorithms and AI. (shrink)

Algorithmic probability and friends: Proceedings of the Ray Solomonoff 85th memorial conference is a collection of original work and surveys. The Solomonoff 85th memorial conference was held at Monash University's Clayton campus in Melbourne, Australia as a tribute to pioneer, Ray Solomonoff, honouring his various pioneering works - most particularly, his revolutionary insight in the early 1960s that the universality of Universal Turing Machines could be used for universal Bayesian prediction and artificial intelligence. This work continues to increasingly influence and (...) under-pin statistics, econometrics, machine learning, data mining, inductive inference, search algorithms, data compression, theories of intelligence and philosophy of science - and applications of these areas. Ray not only envisioned this as the path to genuine artificial intelligence, but also, still in the 1960s, anticipated stages of progress in machine intelligence which would ultimately lead to machines surpassing human intelligence. Ray warned of the need to anticipate and discuss the potential consequences - and dangers - sooner rather than later. Possibly foremostly, Ray Solomonoff was a fine, happy, frugal and adventurous human being of gentle resolve who managed to fund himself while electing to conduct so much of his paradigm-changing research outside of the university system. The volume contains 35 papers pertaining to the abovementioned topics in tribute to Ray Solomonoff and his legacy. (shrink)

Since the opening of the economy, China’s regional economy has developed rapidly, the overall national strength has been increasing, and the people’s living standards have been continuously improved. The issue of coordinated regional development has become an important issue in today’s society. Genetic algorithm is a kind of prediction algorithm that has developed rapidly in recent years and is widely used. However, when solving engineering prediction problems, there are often problems such as premature convergence and easiness to fall into local (...) optimal solutions. Therefore, on the basis of studying the related theories of genetic algorithm and artificial immune algorithm, this paper uses the advantages of the two algorithms, combines the two algorithms, and proposes an improved algorithm for genetic algorithm-adaptive immune genetic algorithm. Taking genetic algorithm as the basic framework, the operators and selection methods of artificial immune algorithm are integrated. Using the adaptive concept, the formulas of adaptive crossover probability and mutation probability are innovatively designed. Compared with the fixed value of the immune genetic algorithm, the introduction of the adaptive concept can intelligently adjust the optimization process and increase the optimization speed. Considering the double uncertain factors of product market demand and waste product recycling in the remanufacturing supply chain system, the maximization of logistics network operating profit, the minimization of environmental impact, and the maximization of customer satisfaction are the forecast goals. The market demand of uncertain products is effectively controlled through the option contract mechanism, and a multiobjective forecasting model based on the option contract mechanism is established. According to the characteristics of the model, an improved immune genetic algorithm is designed to solve the problem, and the effectiveness of the immune genetic algorithm is verified through an example. (shrink)

In this study, the focus was on the development of green energy and future prediction for the consumption of current energy sources and green energy development using an improved deep learning algorithm. In addition to the analysis of the current energy consumption used for the natural gas and oil as fuel, deep neural network algorithm is used to train the system as well as to process the data obtained previously, ranging from literature from the year 2003 until the year 2019, (...) for consumption of fuel. Also, using the proposed algorithm to predict the development of green energy consumption till 2030 is presented in terms of solar and wind generators. The resulting study also focuses on depletion of energy currently used or pollution caused because of it. The green energy controlling issue can take effect by using multiple layers of handling different features extracted from different sources and then learning the system to control it.This study aims to take advantage of carbon emissions to reduce their impact and dependence in the future on environmentally friendly renewable energies. Predicting the correct and precise amount of energy consumption and increasing the amount of environmentally friendly energy lead to a healthy ecosystem. The expected green energy consumption in the future is almost 78.25 EJ in 2030 and will be, in total energy average, 56% in 2045. The aim is to reduce dependency on costly and environmentally harmful fuels. (shrink)

The accurate annotation of an unknown protein sequence depends on extant data of template sequences. This could be empirical or sets of reference sequences, and provides an exhaustive pool of probable functions. Individual methods of predicting dominant function possess shortcomings such as varying degrees of inter-sequence redundancy, arbitrary domain inclusion thresholds, heterogeneous parameterization protocols, and ill-conditioned input channels. Here, I present a rigorous theoretical derivation of various steps of a generic algorithm that integrates and utilizes several statistical methods to predict (...) the dominant function in unknown protein sequences. The accompanying mathematical proofs, interval definitions, analysis, and numerical computations presented are meant to offer insights not only into the specificity and accuracy of predictions, but also provide details of the operatic mechanisms involved in the integration and its ensuing rigor. The algorithm uses numerically modified raw hidden markov model scores of well defined sets of training sequences and clusters them on the basis of known function. The results are then fed into an artificial neural network, the predictions of which can be refined using the available data. This pipeline is trained recursively and can be used to discern the dominant principal function, and thereby, annotate an unknown protein sequence. Whilst, the approach is complex, the specificity of the final predictions can benefit laboratory workers design their experiments with greater confidence. -/- . (shrink)

I discuss the epistemic status of algorithmic predictions in the legal realm. My main claim is that algorithmic predictions do not give us knowledge, not even probabilistic knowledge. The situation, however, is relevantly different from the one in which we find ourselves at the time of assessing statistical evidence in general, and it is rather related to the fact that algorithmic fairness in legal contexts is essentially undetermined. In the light of this, we have to settle for justified beliefs and (...) justified credences. I end by drawing some morals for the Knowledge Norm of action. (shrink)

Recent studies have shown that recidivism scoring algorithms like COMPAS have significant racial bias: Black defendants are roughly twice as likely as white defendants to be mistakenly classified as medium- or high-risk. This has led some to call for abolishing COMPAS. But many others have argued that algorithms should instead be given access to a defendant's race, which, perhaps counterintuitively, is likely to improve outcomes. This approach can involve either establishing race-sensitive risk thresholds, or distinct racial ‘tracks’. Is (...) there a moral difference between these two approaches? We first consider Deborah Hellman's view that the use of distinct racial tracks (but not distinct thresholds) does not constitute disparate treatment since the effects on individuals are indirect and does not rely on a racial generalization. We argue that this is mistaken: the use of different racial tracks seems both to have direct effects on and to rely on a racial generalization. We then offer an alternative understanding of the distinction between these two approaches—namely, that the use of different cut points is to the counterfactual comparative disadvantage, ex ante, of all white defendants, while the use of different racial tracks can in principle be to the advantage of all groups, though some defendants in both groups will fare worse. Does this mean that the use of cut points is impermissible? Ultimately, we argue, while there are reasons to be skeptical of the use of distinct cut points, it is an open question whether these reasons suffice to make a difference to their moral permissibility. (shrink)

Predictive algorithms are playing an increasingly prominent role in society, being used to predict recidivism, loan repayment, job performance, and so on. With this increasing influence has come an increasing concern with the ways in which they might be unfair or biased against individuals in virtue of their race, gender, or, more generally, their group membership. Many purported criteria of algorithmic fairness concern statistical relationships between the algorithm’s predictions and the actual outcomes, for instance requiring that the rate (...) of false positives be equal across the relevant groups. We might seek to ensure that algorithms satisfy all of these purported fairness criteria. But a series of impossibility results shows that this is impossible, unless base rates are equal across the relevant groups. What are we to make of these pessimistic results? I argue that none of the purported criteria, except for a calibration criterion, are necessary conditions for fairness, on the grounds that they can all be simultaneously violated by a manifestly fair and uniquely optimal predictive algorithm, even when base rates are equal. I conclude with some general reflections on algorithmic fairness. (shrink)

The use of algorithmic prediction in insurance is regarded as the beginning of a new era, because it promises to personalise insurance policies and premiums on the basis of individual behaviour and level of risk. The core idea is that the price of the policy would no longer refer to the calculated uncertainty of a pool of policyholders, with the consequence that everyone would have to pay only for her real exposure to risk. For insurance, however, uncertainty is not only (...) a problem – shared uncertainty is a resource. The availability of individual risk information could undermine the principle of risk-pooling and risk-spreading on which insurance is based. The article examines this disruptive change first by exploring the possible consequences of the use of predictive algorithms to set insurance premiums. Will it endanger the principle of mutualisation of risks, producing new forms of discrimination and exclusion from coverage? In a second step, we analyse how the relationship between the insurer and the policyholder changes when the customer knows that the company has voluminous, and continuously updated, data about her real behaviour. (shrink)

Artificial intelligence (AI) systems are quickly gaining ground in healthcare and clinical decision-making. However, it is still unclear in what way AI can or should support decision-making that is based on incapacitated patients’ values and goals of care, which often requires input from clinicians and loved ones. Although the use of algorithms to predict patients’ most likely preferred treatment has been discussed in the medical ethics literature, no example has been realised in clinical practice. This is due, arguably, to (...) the lack of a structured approach to the epistemological, ethical and pragmatic challenges arising from the design and use of such algorithms. The present paper offers a new perspective on the problem by suggesting that preference predicting AIs be viewed as sociotechnical systems with distinctive life-cycles. We explore how both known and novel challenges map onto the different stages of development, highlighting interdisciplinary strategies for their resolution. (shrink)

GPS position data prediction can effectively alleviate urban traffic, population flow, route planning, etc. It has very important research significance. Using swarm intelligence optimization algorithm to predict geographic location has important research strategies. Flower pollination algorithm is a new swarm intelligence optimization algorithm and easy to implement and has other characteristics; more and more scholars have continuously improved it and applied it to more fields. Aiming at the fact that FPA leads to the local optimal value in cross-pollination, the chaotic (...) mapping strategy is proposed to optimize related issues that the population is not rich enough in the self-pollination process. The improved flower pollination algorithm has better advantages in testing function convergence and geographic location prediction effect. (shrink)

We report and compare the performance of different learning algorithms based on data from cortical recordings. The task is to predict the orientation of visual stimuli from the activity of a population of simultaneously recorded neurons. We compare several ways of improving the coding of the input (i.e., the spike data) as well as of the output (i.e., the orientation), and report the results obtained using different kernel algorithms.

Floods are one of the most common natural disasters in the world that affect all aspects of life, including human beings, agriculture, industry, and education. Research for developing models of flood predictions has been ongoing for the past few years. These models are proposed and built-in proportion for risk reduction, policy proposition, loss of human lives, and property damages associated with floods. However, flood status prediction is a complex process and demands extensive analyses on the factors leading to the occurrence (...) of flooding. Consequently, this research proposes an Internet of Things-based flood status prediction (IoT-FSP) model that is used to facilitate the prediction of the rivers flood situation. The IoT-FSP model applies the Internet of Things architecture to facilitate the flood data acquisition process and three machine learning (ML) algorithms, which are Decision Tree (DT), Decision Jungle, and Random Forest, for the flood prediction process. The IoT-FSP model is implemented in MATLAB and Simulink as development platforms. The results show that the IoT-FSP model successfully performs the data acquisition and prediction tasks and achieves an average accuracy of 85.72% for the three-fold cross-validation results. The research finding shows that the DT scores the highest accuracy of 93.22%, precision of 92.85, and recall of 92.81 among the three ML algorithms. The ability of the ML algorithm to handle multivariate outputs of 13 different flood textual statuses provides the means of manifesting explainable artificial intelligence and enables the IoT-FSP model to act as an early warning and flood monitoring system. (shrink)

It is of great significance to predict the results accurately based on the statistics of sports competition for participants research, commercial cooperation, advertising, and gambling profit. Aiming at the phenomenon that the PageRank page sorting algorithm is prone to subject deviation, the category similarity between pages is introduced into the PageRank algorithm. In the PR value calculation formula of the PageRank algorithm, the factor W between pages is added to replace the original Nu. In this way, the content category between (...) pages is considered, and the shortcoming of theme deviation will be improved. The time feedback factor in the PageRank-time algorithm is used for reference, and the time feedback factor is added to the first improved PR value calculation formula. Based on statistics from 1230 games during the NBA 2018-2019 regular season, this paper ranks the team strength with improved PageRank algorithm and compares the results with the ranking of regular-season points and the result of playoffs. The results show that it is consistent with the regular-season points ranking in the eastern division by the use of improved PageRank algorithm, but there is a difference in the second ranking in the western division. In the prediction of top four in playoffs, it predicts three of the four teams. (shrink)

As more objections have been raised against grant peer-review for being costly and time-consuming, the legitimate question arises whether machine learning algorithms could help assess the epistemic efficiency of the proposed projects. As a case study, we investigated whether project efficiency in high energy physics can be algorithmically predicted based on the data from the proposal. To analyze the potential of algorithmic prediction in HEP, we conducted a study on data about the structure and outcomes of HEP experiments with (...) the goal of predicting their efficiency. In the first step, we assessed the project efficiency using Data Envelopment Analysis of 67 experiments conducted in the HEP laboratory Fermilab. In the second step, we employed predictive algorithms to detect which team structures maximize the epistemic performance of an expert group. For this purpose, we used the efficiency scores obtained by DEA and applied predictive algorithms – lasso and ridge linear regression, neural network, and gradient boosted trees – on them. The results of the predictive analyses show moderately high accuracy, indicating that they can be beneficial as one of the steps in grant review. Still, their applicability in practice should be approached with caution. Some of the limitations of the algorithmic approach are the unreliability of citation patterns, unobservable variables that influence scientific success, and the potential predictability of the model. (shrink)

Whereas using artificial intelligence (AI) to predict natural hazards is promising, applying a predictive policing algorithm (PPA) to predict human threats to others continues to be debated. Whereas PPAs were reported to be initially successful in Germany and Japan, the killing of Black Americans by police in the US has sparked a call to dismantle AI in law enforcement. However, although PPAs may statistically associate suspects with economically disadvantaged classes and ethnic minorities, the targeted groups they aim to protect (...) are often vulnerable populations as well (e.g., victims of human trafficking, kidnapping, domestic violence, or drug abuse). Thus, determining how to enhance the benefits of PPA while reducing bias through better management is important. In this paper, we propose a policy schema to address this issue. First, after clarifying relevant concepts, we examine major criticisms of PPAs and argue that some of them should be addressed. If banning AI or making it taboo is an unrealistic solution, we must learn from our errors to improve AI. We next identify additional challenges of PPAs and offer recommendations from a policy viewpoint. We conclude that the employment of PPAs should be merged into broader governance of the social safety net and audited publicly by parliament and civic society so that the unjust social structure that breeds bias can be revised. (shrink)

The interference of the complex background and less information of the small targets are two major problems in vehicle attribute recognition. In this paper, two cascaded networks of vehicle attribute recognition are established to solve the two problems. For vehicle targets with normal size, the multitask cascaded convolution neural network MC-CNN-NT uses the improved Faster R-CNN as the location subnetwork. The vehicle targets in the complex background are extracted by the location subnetwork to the classification subnetwork CNN for the classification. (...) The implementation of this task decomposition strategy effectively eliminates the interference of the complex background in target detection. For vehicle targets with small size, the multitask cascaded convolution neural network MC-CNN-ST applies the network compression strategy and the multilayer feature fusion strategy to extract the feature maps. These strategies enrich the location information and semantic information of the feature maps. In order to optimize the nonlinear mapping ability and the hard-to-detect samples mining ability of the networks, the activation function and the loss function in the two cascaded networks are improved. The experimental results show that MC-CNN-NT for the normal targets and MC-CNN-ST for the small targets achieve the state-of-the-art performance compared with other attribute recognition networks. (shrink)

This study aims to predict the shear strength of reinforced concrete deep beams based on artificial neural network using four training algorithms, namely, Levenberg–Marquardt, quasi-Newton method, conjugate gradient, and gradient descent. A database containing 106 results of RC deep beam shear strength tests is collected and used to investigate the performance of the four proposed algorithms. The ANN training phase uses 70% of data, randomly taken from the collected dataset, whereas the remaining 30% of data are used for (...) the algorithms’ evaluation process. The ANN structure consists of an input layer with 9 neurons corresponding to 9 input parameters, a hidden layer of 10 neurons, and an output layer with 1 neuron representing the shear strength of RC deep beams. The performance evaluation of the models is performed using statistical criteria, including the correlation coefficient, root mean square error, mean absolute error, and mean absolute percentage error. The results show that the ANN-CG model has the best prediction performance with R = 0.992, RMSE = 14.02, MAE = 14.24, and MAPE = 6.84. The results of this study show that the ANN-CG model can accurately predict the shear strength of RC deep beams, representing a promising and useful alternative design solution for structural engineers. (shrink)

Student performance and its evaluation remain a serious challenge for education systems. Frequently, the recording and processing of students’ scores in a specific curriculum have several flaws for various reasons. In this context, the absence of data from some of the student scores undermines the efficiency of any future analysis carried out in order to reach conclusions. When this is the case, missing data imputation algorithms are needed. These algorithms are capable of substituting, with a high level of (...) accuracy, the missing data for predicted values. This research presents the hybridization of an algorithm previously proposed by the authors called adaptive assignation algorithm, with a well-known technique called multivariate imputation by chained equations. The results show how the suggested methodology outperforms both algorithms. (shrink)

Short-term traffic flow prediction is an effective means for intelligent transportation system to mitigate traffic congestion. However, traffic flow data with temporal features and periodic characteristics are vulnerable to weather effects, making short-term traffic flow prediction a challenging issue. However, the existing models do not consider the influence of weather changes on traffic flow, leading to poor performance under some extreme conditions. In view of the rich features of traffic data and the characteristic of being vulnerable to external weather conditions, (...) the prediction model based on traffic data has certain limitations, so it is necessary to conduct research studies on traffic flow prediction driven by both the traffic data and weather data. This paper proposes a combined framework of stacked autoencoder and radial basis function neural network to predict traffic flow, which can effectively capture the temporal correlation and periodicity of traffic flow data and disturbance of weather factors. Firstly, SAE is used to process the traffic flow data in multiple time slices to acquire a preliminary prediction. Then, RBF is used to capture the relation between weather disturbance and periodicity of traffic flow so as to gain another prediction. Finally, another RBF is used for the fusion of the above two predictions on decision level, obtaining a reconstructed prediction with higher accuracy. The effectiveness and robustness of the proposed model are verified by experiments. (shrink)

La contribution part du constat qu’il existe actuellement peu d’exigences de transparence en ce qui concerne les algorithmes de justice prédictive qui seraient mis à la disposition des juges judiciaires et administratifs pour adopter des décisions de justice, en dépit des propositions formulées en ce sens. Elle recherche pourquoi de telles exigences devraient être imposées et comment elles pourraient être concrétisées. Elle expose dans un premier temps les raisons pour lesquelles de telles exigences seraient souhaitables, en rappelant les nombreux risques (...) inhérents aux algorithmes ( a fortiori dans l’optique de les mettre à disposition des juges dans un but de justice prédictive) et en démontrant que ces risques pourraient être contrebalancés par l’application d’exigences de transparence. Elle esquisse dans un second temps une proposition de concrétisation de ces exigences, en commençant par approfondir leurs fondements juridiques potentiels. Elle s’inspire des exigences de transparence administrative applicables aux administrations qui fondent des décisions individuelles sur des algorithmes pour proposer une modélisation d’exigences de transparence applicables aux magistrats pour ce qui concerne le degré d’utilisation d’algorithmes dans l’adoption de décisions de justice, dans le respect des prérogatives des magistrats et des garanties dont ils bénéficient. (shrink)

This paper focuses on the conception and use of machine-learning algorithms for marketing. In the last years, specialized service providers as well as in-house data scientists have been increasingly using machine learning to predict consumer behavior for large companies. Predictive marketing thus revives the old dream of one-to-one, perfectly adjusted selling techniques, now at an unprecedented scale. How do predictive marketing devices change the way corporations know and model their customers? Drawing from STS and the sociology of (...) quantification, I propose to study the original ambivalence that characterizes the promise of a mass personalization, i.e. algorithmic processes in which the precise adjustment of prediction to unique individuals involves the computation of massive datasets. By studying algorithms in practice, I show how the active embedding of local preexisting consumer knowledge and punctual de-personalization mechanisms are keys to the epistemic and organizational success of predictive marketing. This paper argues for the study of algorithms in their contexts and suggests new perspectives on algorithmic objectivity. (shrink)

Machine stability and energy efficiency have become major issues in the manufacturing industry, primarily during the COVID-19 pandemic where fluctuations in supply and demand were common. As a result, Predictive Maintenance (PdM) has become more desirable, since predicting failures ahead of time allows to avoid downtime and improves stability and energy efficiency in machines. One type of machine failure stands out due to its impact, machine overstrain, which can occur when machines are used beyond their tolerable limit. From the (...) current literature, there are little to no relevant works that focus on machine overstrain failure detection or prediction. Accordingly, the purpose of this paper is to implement and compare four Machine Learning (ML) algorithms for PdM applied to machine overstrain failures: Artificial Neural Network (ANN), Gradient Boosting, Random Forest and Support Vector Machine (SVM). Moreover, it proposes a training methodology for imbalanced data and the automatic optimization of hyperparameters, which aims to improve performance in the ML models. To evaluate the performance of the ML models, a synthetic dataset that simulates industrial machine data is used. The obtained results show the robustness of the proposed methodology, with the ANN and SVM models achieving a perfect recall score, with 98.95% and 98.85% in accuracy, respectively. (shrink)

In this paper, a new FEPA portfolio forecasting model is based on the EMD decomposition method. The model is based on the special empirical modal decomposition of financial time series, principal component analysis, and artificial neural network to model and forecast for nonlinear, nonstationary, multiscale complex financial time series to predict stock market indices and foreign exchange rates and empirically investigate this hot area in financial market research. The combined forecasting model proposed in this paper is based on the idea (...) of decomposition-reconstruction synthesis, which effectively improves the model’s prediction of internal financial time series. In this paper, we select the CSI 300 Index and foreign exchange rate as the empirical market and data and establish seven forecasting models to make predictions about the short-term running trend of the closing price. The interval EMD decomposition algorithm is introduced in this paper, considering both high and low prices to be contained in the input and output. By analyzing the closing price, high and low prices of the stock index at the same time, the volatility of this interval time series of the index and its trend can be better captured. (shrink)

The application of recycled aggregate as a sustainable material in construction projects is considered a promising approach to decrease the carbon footprint of concrete structures. Prediction of compressive strength of environmentally friendly concrete containing recycled aggregate is important for understanding sustainable structures’ concrete behaviour. In this research, the capability of the deep learning neural network approach is examined on the simulation of CS of EF concrete. The developed approach is compared to the well-known artificial intelligence approaches named multivariate adaptive regression (...) spline, extreme learning machines, and random forests. The dataset was divided into three scenarios 70%-30%, 80%-20%, and 90%-10% for training/testing to explore the impact of data division percentage on the capacity of the developed AI model. Extreme gradient boosting was integrated with the developed AI models to select the influencing variables on the CS prediction. Several statistical measures and graphical methods were generated to evaluate the efficiency of the presented models. In this regard, the results confirmed that the DLNN model attained the highest value of prediction performance with minimal root mean squared error. The study revealed that the highest prediction performance could be attained by increasing the number of variables in the prediction problem and using 90%-10% data division. The results demonstrated the robustness of the DLNN model over the other AI models in handling the complex behaviour of concrete. Due to the high accuracy of the DLNN model, the developed method can be used as a practical approach for future use of CS prediction of EF concrete. (shrink)

For the safe and economical construction of embankment dams, the mechanical behaviour of the rockfill materials used in the dam’s shell must be analyzed. The characterization of rockfill materials with specified shear strength is difficult and expensive due to the presence of particles greater than 500 mm in diameter. This work investigates the feasibility of using an extreme gradient boosting computing paradigm to estimate the shear strength of rockfill materials. To train and validate the proposed XGBoost model, a total of (...) 165 databases obtained from the literature are chosen. The XGBoost model was compared against support vector machine, adaptive boosting, random forest, and K-nearest neighbor models described in the literature. XGBoost beats SVM, RF, AdaBoost, and KNN models in terms of performance evaluation metrics such as coefficient of determination, Nash–Sutcliffe coefficient, and error in the root mean square ratio to the standard deviation of the measured data. The results demonstrated that the XGBoost model has the highest prediction performance with, followed by the SVM model with, RF, the AdaBoost model with and the KNN model with. A sensitivity analysis has been conducted to ascertain the impact of each investigated input parameter. This study demonstrates that the established XGBoost model for estimating the shear strength of rockfill materials is reliable. (shrink)

In this paper, we study the estimation of motion direction prediction for fast motion and propose a threshold-based human target detection algorithm using motion vectors and other data as human target feature information. The motion vectors are partitioned into regions by normalization to form a motion vector field, which is then preprocessed, and then the human body target is detected through its motion vector region block-temporal correlation to detect the human body motion target. The experimental results show that the algorithm (...) is effective in detecting human motion targets in videos with the camera relatively stationary. The algorithm predicts the human body position in the reference frame of the current frame in the video by forward mapping the motion vector of the current frame, then uses the motion vector direction angle histogram as a matching feature, and combines it with a region matching strategy to track the human body target in the predicted region, thus realizing the human body target tracking effect. The algorithm is experimentally proven to effectively track human motion targets in videos with relatively static backgrounds. To address the problem of sample diversity and lack of quantity in a multitarget tracking environment, a generative model based on the conditional variational self-encoder conditional generation of adversarial networks is proposed, and the performance of the generative model is verified using pedestrian reidentification and other datasets, and the experimental results show that the method can take advantage of the advantages of both models to improve the quality of the generated results. (shrink)

This paper presents the concept and algorithm of data mining and focuses on the linear regression algorithm. Based on the multiple linear regression algorithm, many factors affecting CET4 are analyzed. Ideas based on data mining, collecting history data and appropriate to transform, using statistical analysis techniques to the many factors influencing the CET-4 test were analyzed, and we have obtained the CET-4 test result and its influencing factors. It was found that the linear regression relationship between the degrees of fit (...) was relatively high. We further improve the algorithm and establish a partition-weighted K-nearest neighbor algorithm. The K-weighted K nearest neighbor algorithm and the partition algorithm are used in the CET-4 test score classification prediction, and the statistical method is used to study the relevant factors that affect the CET-4 test score, and screen classification is performed to predict when the comparison verification will pass. The weight K of the input feature and the adjacent feature are weighted, although the allocation algorithm of the adjacent classification effect has not been significantly improved, but the stability classification is better than K-nearest neighbor algorithm, its classification efficiency is greatly improved, classification time is greatly reduced, and classification efficiency is increased by 119%. In order to detect potential risk graduating students earlier, this paper proposes an appropriate and timely early warning and preschool K-nearest neighbor algorithm classification model. Taking test scores or make-up exams and re-learning as input features, the classification model can effectively predict ordinary students who have not graduated. (shrink)

Algorithms can now identify patterns and correlations in the (big) datasets, and predict outcomes based on those identified patterns and correlations with the use of machine learning techniques and big data, decisions can then be made by algorithms themselves in accordance with the predicted outcomes. Yet, algorithms can inherit questionable values from the datasets and acquire biases in the course of (machine) learning, and automated algorithmic decision-making makes it more difficult for people to see algorithms as (...) biased. While researchers have taken the problem of algorithmic bias seriously, but the current discussion on algorithmic fairness tends to conceptualize ‘fairness’ in algorithmic fairness primarily as a technical issue and attempts to implement pre-existing ideas of ‘fairness’ into algorithms. In this paper, I show that such a view of algorithmic fairness as technical issue is unsatisfactory for the type of problem algorithmic fairness presents. Since decisions on fairness measure and the related techniques for algorithms essentially involve choices between competing values, ‘fairness’ in algorithmic fairness should be conceptualized first and foremost as a political issue, and it should be (re)solved by democratic communication. The aim of this paper, therefore, is to explicitly reconceptualize algorithmic fairness as a political question and suggest the current discussion of algorithmic fairness can be strengthened by adopting the accountability for reasonableness framework. (shrink)

The problem of algorithmic fairness is typically framed as the problem of finding a unique formal criterion that guarantees that a given algorithmic decision-making procedure is morally permissible. In this paper, I argue that this is conceptually misguided and that we should replace the problem with two sub-problems. If we examine how most state-of-the-art machine learning systems work, we notice that there are two distinct stages in the decision-making process. First, a prediction of a relevant property is made. Secondly, a (...) decision is taken based (at least partly) on this prediction. These two stages have different aims: the prediction is aimed at accuracy, while the decision is aimed at allocating a given good in a way that maximizes some context-relative utility measure. Correspondingly, two different fairness issues can arise. First, predictions could be biased in discriminatory ways. This means that the predictions contain systematic errors for a specific group of individuals. Secondly, the system’s decisions could result in an allocation of goods that is in tension with the principles of distributive justice. These two fairness issues are distinct problems that require different types of solutions. I here provide a formal framework to address both issues and argue that this way of conceptualizing them resolves some of the paradoxes present in the discussion of algorithmic fairness. (shrink)