Search

This article investigates artificial intelligence (AI) fairness in decision-making specifically examining the limitations of this process. The article discusses eight inherent limitations in AI fairness including lack of fairness in human decision-making used to train the AI model, lack of a universal fairness definition, and limited power over the complete decision-making process.

The regulatory uses are real: In 2021, more than 100 drug and biologic applications submitted to the FDA included AI/ML components. Keywords: Algorithms; Artificial Intelligence; Bioengineering; Biologics; Biotechnology; Cybersecurity; Cyborgs; Drug Development; Drug Manufacturing; Drugs and Therapies; Emerging Technologies; FDA; Genetic Engineering; Genetically-Engineered Proteins; Government Agencies Offices and Entities; Health and Medicine; Machine Learning; Office of the FDA Commissioner; Public Health; Technology; U.S. Food and Drug Administration EN Algorithms Artificial Intelligence Bioengineering Biologics Biotechnology Cybersecurity Cyborgs Drug Development Drug Manufacturing Drugs and Therapies Emerging Technologies FDA Genetic Engineering Genetically-Engineered Proteins Government Agencies Offices and Entities Health and Medicine Machine Learning Office of the FDA Commissioner Public Health Technology U.S. Food and Drug Administration 497 497 1 05/22/23 20230523 NES 230523 2023 MAY 22 (NewsRx) -- By a News Reporter-Staff News Editor at Clinical Trials Week -- By: Patrizia Cavazzoni, M.D., Director of the Center for Drug Evaluation and Research Artificial intelligence (AI) and machine learning (ML) are no longer futuristic concepts; they are now part of how we live and work. [Extracted from the article]

This paper presents an extensive study of linear and logistic regression algorithms implemented with 1T1R memristor crossbars arrays. Using a sophisticated simulation platform that wraps circuit-level simulations of 1T1R crossbars and physics-based models of RRAM (memristors), we elucidate the impact of device variability on algorithm accuracy, convergence rate and precision. Moreover, a smart pulsing strategy is proposed for practical implementation of synaptic weight updates that can accelerate training in real crossbar architectures. Stochastic multi-variable linear regression shows robustness to memristor variability in terms of prediction accuracy but reveals impact on convergence rate and precision. Similarly, the stochastic logistic regression crossbar implementation reveals immunity to memristor variability as determined by negligible effects on image classification accuracy but indicates an impact on training performance manifested as reduced convergence rate and degraded precision. [ABSTRACT FROM AUTHOR]

The article focuses on the search for algorithms that can reduce the time needed for multiplication problems within the fields of machine learning (ML), deep learning (DL), and artificial intelligence (AI). Topics discussed include the history of matrix multiplication and the data science group DeepMind and their ML approach AlphaTensor.

The article presents three principles concerning five challenges to the establishment of trustworthy artificial intelligence (AI), including the development computer languages and algorithms for data modeling, trustworthy-by-construction design, and complex machine learning (ML) representations.

Algorithms, Diagnostics and Screening, Emerging Technologies, Fibromyalgia, Health and Medicine, Linear Discriminant Analysis, Machine Learning, Muscular Diseases and Conditions, Musculoskeletal Diseases and Conditions, Neuromuscular Diseases and Conditions, Rheumatic Diseases and Conditions Keywords: Algorithms; Diagnostics and Screening; Emerging Technologies; Fibromyalgia; Health and Medicine; Linear Discriminant Analysis; Machine Learning; Muscular Diseases and Conditions; Musculoskeletal Diseases and Conditions; Neuromuscular Diseases and Conditions; Rheumatic Diseases and Conditions EN Algorithms Diagnostics and Screening Emerging Technologies Fibromyalgia Health and Medicine Linear Discriminant Analysis Machine Learning Muscular Diseases and Conditions Musculoskeletal Diseases and Conditions Neuromuscular Diseases and Conditions Rheumatic Diseases and Conditions 158 158 1 04/10/23 20230413 NES 230413 2023 APR 13 (NewsRx) -- By a News Reporter-Staff News Editor at Hematology Week -- Research findings on fibromyalgia are discussed in a new report. [Extracted from the article]

The article examines trust in artificially intelligent (AI) systems as well as their regulation by various governments including those of the European Union, U.S., and China. The author predicates trust in AI on its perceived safety and reliability and calls for the continued human oversight of AI systems ("human-in-the-loop" or "society-in-the-loop"). Applications of artificial intelligence are outlined including military strategy, law enforcement, and healthcare.

This paper presents a novel hardware architecture of the Tensorial Support Vector Machine (TSVM) based on Shallow Neural Networks (NN) for the Single Value Decomposition (SVD) computation. The proposed NN achieves a comparable Mean Squared Error and Cosine Similarity to the widely used one-sided Jacobi algorithm. When implemented on an FPGA, the NN offers $324\times $ faster computations than the one-sided Jacobi with reductions up to 58% and 67% in terms of hardware resources and power consumption respectively. When validated on a touch modality classification problem, the NN-based TSVM implementation has achieved a real-time operation while consuming about 88% less energy per classification than the Jacobi-based TSVM with an accuracy loss of at most 3%. Such results offer the ability to deploy intelligence on resource-limited platform for energy-constrained applications. [ABSTRACT FROM AUTHOR]

The authors present their thoughts concerning the research sphere of algorithms with predictions, particularly focusing upon a research trend in machine learning (ML) predictors in order to go beyond the concept of the worst-case analysis.

In this paper, we consider the composition optimization with two expected-value functions in the form of $({1}/{n})\sum _{i = 1}^{n} F_{i}\left({({1}/{m})\sum _{j = 1}^{m} G_{j}(x)}\right)+R(x)$ , which formulates many important problems in statistical learning and machine learning such as solving Bellman equations in reinforcement learning and nonlinear embedding. Full gradient- or classical stochastic gradient descent-based optimization algorithms are unsuitable or computationally expensive to solve this problem due to the inner expectation $({1}/{m})\sum _{j = 1}^{m} G_{j}(x)$. We propose a dualityfree-based stochastic composition method that combines the variance reduction methods to address the stochastic composition problem. We apply the stochastic variance reduction gradient- and stochastic average gradient algorithm-based methods to estimate the inner function and the dualityfree method to estimate the outer function. We prove the linear convergence rate not only for the convex composition problem but also for the case that the individual outer functions are nonconvex, while the objective function is strongly convex. We also provide the results of experiments that show the effectiveness of our proposed methods. [ABSTRACT FROM AUTHOR]

The limited memory version of the Broyden–Fletcher–Goldfarb–Shanno (L-BFGS) algorithm is the most popular quasi-Newton algorithm in machine learning and optimization. Recently, it was shown that the stochastic L-BFGS (sL-BFGS) algorithm with the variance-reduced stochastic gradient converges linearly. In this paper, we propose a new sL-BFGS algorithm by importing a proper momentum. We prove an accelerated linear convergence rate under mild conditions. The experimental results on different data sets also verify this acceleration advantage. [ABSTRACT FROM AUTHOR]

In every corner of machine learning and statistics, there is a need for estimators that work not just in an idealized model, but even when their assumptions are violated. Unfortunately, in high dimensions, being provably robust and being efficiently computable are often at odds with each other. We give the first efficient algorithm for estimating the parameters of a high-dimensional Gaussian that is able to tolerate a constant fraction of corruptions that is independent of the dimension. Prior to our work, all known estimators either needed time exponential in the dimension to compute or could tolerate only an inverse-polynomial fraction of corruptions. Not only does our algorithm bridge the gap between robustness and algorithms, but also it turns out to be highly practical in a variety of settings. [ABSTRACT FROM AUTHOR]

The article discusses the concept of fairness in the design of automated machine learning-based decision-making systems, and presents a framework for comprehending terms such as individual fairness and group fairness as they pertain to U.S. and British civil rights laws. The article discusses the decision making process of college admissions with the use of an algorithm, the goal of non-discrimination, and the significance of worldviews.

An introduction is presented in which the author discusses an article published in the journal about load balancing, matrix-vector multiplication, and their significance to machine algorithms.

Products and services that rely on machine learning—computer programs that constantly absorb new data and adapt their decisions in response—don’t always make ethical or accurate choices. Sometimes they cause investment losses, for instance, or biased hiring or car accidents. And as such offerings proliferate across markets, the companies creating them face major new risks. Executives need to understand and mitigate the technology’s potential downside. Machine learning can go wrong in a number of ways. Because the systems make decisions based on probabilities, some errors are always possible. Their environments may evolve in unanticipated ways, creating disconnects between the data they were trained with and the data they’re currently fed. And their complexity can make it hard to determine whether or why they made a mistake. A key question executives must answer is whether it’s better to allow smart offerings to continuously evolve or to “lock” their algorithms and periodically update them. In addition, every offering will need to be appropriately tested before and after rollout and regularly monitored to make sure it’s performing as intended. [ABSTRACT FROM AUTHOR]

Growth transformations constitute a class of fixed-point multiplicative update algorithms that were originally proposed for optimizing polynomial and rational functions over a domain of probability measures. In this paper, we extend this framework to the domain of bounded real variables which can be applied towards optimizing the dual cost function of a generic support vector machine (SVM). The approach can, therefore, not only be used to train traditional soft-margin binary SVMs, one-class SVMs, and probabilistic SVMs but can also be used to design novel variants of SVMs with different types of convex and quasi-convex loss functions. In this paper, we propose an efficient training algorithm based on polynomial growth transforms, and compare and contrast the properties of different SVM variants using several synthetic and benchmark data sets. The preliminary experiments show that the proposed multiplicative update algorithm is more scalable and yields better convergence compared to standard quadratic and nonlinear programming solvers. While the formulation and the underlying algorithms have been validated in this paper only for SVM-based learning, the proposed approach is general and can be applied to a wide variety of optimization problems and statistical learning models. [ABSTRACT FROM AUTHOR]

The article discusses the construction and maintenance of Big-Data analytics systems as of March 2013, focusing on machine-learning methods and statistical methods while describing the Hazy project for algorithm management. Topics include trained systems, interfaces between algorithms and systems, the GeoDeepDive application for the statistical analysis of geological research papers, and the Bismarck project for infrastructure abstractions. Data sets, probabilistic logic programming, debugging, convex programming, and scalability are mentioned.

Learning from imbalanced data is among the most popular topics in the contemporary machine learning. However, the vast majority of attention in this field is given to binary problems, while their much more difficult multiclass counterparts are relatively unexplored. Handling data sets with multiple skewed classes poses various challenges and calls for a better understanding of the relationship among classes. In this paper, we propose multiclass radial-based oversampling (MC-RBO), a novel data-sampling algorithm dedicated to multiclass problems. The main novelty of our method lies in using potential functions for generating artificial instances. We take into account information coming from all of the classes, contrary to existing multiclass oversampling approaches that use only minority class characteristics. The process of artificial instance generation is guided by exploring areas where the value of the mutual class distribution is very small. This way, we ensure a smart oversampling procedure that can cope with difficult data distributions and alleviate the shortcomings of existing methods. The usefulness of the MC-RBO algorithm is evaluated on the basis of extensive experimental study and backed-up with a thorough statistical analysis. Obtained results show that by taking into account information coming from all of the classes and conducting a smart oversampling, we can significantly improve the process of learning from multiclass imbalanced data. [ABSTRACT FROM AUTHOR]

This paper proposes an iterative learning control (ILC) algorithm with gain adaptation for discrete-time stochastic systems. The algorithm is based on Kesten's accelerated stochastic approximation (SA) algorithm. The gain adaptation uses only tracking error information, and, hence, is a data-driven adaptation approach. If stochastic noises account for a small proportion of the tracking error, the learning gain matrix remains constant with a high probability. If stochastic noises dominate the tracking error, the learning gain matrix is decreasing. Therefore, the new ILC algorithm converges more quickly than existing SA-based algorithms. In addition, the classic P-type ILC law for noise-free systems is a special case of the new ILC algorithm. The behaviors of the proposed ILC algorithm are demonstrated through examples. [ABSTRACT FROM AUTHOR]

In this paper, a metacognitive octonion-valued neural network (Mc-OVNN) learning algorithm and its application to diverse time series prediction are presented. The Mc-OVNN is comprised of two components: the octonion-valued neural network that represents the cognitive component and the metacognitive component that serves to self-regulate the learning algorithm. At each epoch, the metacognitive component decides if, how, and when learning occurs. The algorithm deletes unneeded samples and only stores those that will be used. This decision is determined by the octonion magnitude and the seven phases. To evaluate the Mc-OVNN algorithm’s performance, it is applied to five real-world forecasting problems: the power consumption of a home in Honolulu, HI, USA, Box and Jenkins J series, Euro to Algerian Dinar (DZ) real-time conversion rates, the Mackey–Glass equation, and Europe Brent oil price prediction in a time series. When comparing the Mc-OVNN to other relevant techniques, Mc-OVNN displays its capability for efficient time series prediction. The real-time evaluation of the proposed algorithm is presented using the power consumption of a home in Boumerdès, Algeria, as a case study. [ABSTRACT FROM AUTHOR]

A report from Kerman University of Medical Sciences discusses the use of natural language processing (NLP) to extract cancer concepts from clinical notes automatically. The study systematically reviewed papers that used NLP methods to identify cancer concepts from clinical notes. The researchers found that rule-based algorithms were the most commonly used for concept extraction, and the Systematized Nomenclature of Medicine-Clinical Terms (SNOMED-CT) and Unified Medical Language System (UMLS) were the most commonly used terminologies. The study concluded that the use of NLP for extracting cancer concepts has increased in recent years, and suggested that future studies use rule-based algorithms for extracting concepts of other diseases as well. [Extracted from the article]

Jammu Kashmir, India, Asia, Algorithms, Cancer, Cervical Cancer, Diagnostics and Screening, Health and Medicine, Oncology, Women's Health Keywords: Jammu Kashmir; India; Asia; Algorithms; Cancer; Cervical Cancer; Diagnostics and Screening; Health and Medicine; Oncology; Women's Health EN Jammu Kashmir India Asia Algorithms Cancer Cervical Cancer Diagnostics and Screening Health and Medicine Oncology Women's Health 1014 1014 1 10/03/23 20231006 NES 231006 2023 OCT 3 (NewsRx) -- By a News Reporter-Staff News Editor at Women's Health Weekly -- A new study on Oncology - Cervical Cancer is now available. [Extracted from the article]

The best algorithm for a computational problem generally depends on the "relevant inputs," a concept that depends on the application domain and often defies formal articulation. Although there is a large literature on empirical approaches to selecting the best algorithm for a given application domain, there has been surprisingly little theoretical analysis of the problem. We model the problem of identifying a good algorithm from data as a statistical learning problem. Our framework captures several state-of-the-art empirical and theoretical approaches to the problem, and our results identify conditions under which these approaches are guaranteed to perform well. We interpret our results in the contexts of learning greedy heuristics, instance feature- based algorithm selection, and parameter tuning in machine learning. [ABSTRACT FROM AUTHOR]

The article presents research on human-machine collaboration to examine the relationship between machine learning and human judgment. Particular attention is given to the Correctional Offender Management Profiling for Alternative Sanctions (COMPAS) algorithm , a risk-prediction system, and its effect on human decisions on risk.

A new advanced artificial intelligence (AI) algorithm developed by researchers at Penn State College of Medicine may improve predictions and therapies for autoimmune diseases. The algorithm analyzes the genetic code underlying these conditions to accurately model gene expression and regulation, as well as identify additional genes of risk. The algorithm outperforms existing methodologies and identified 26% more novel gene and trait associations. The researchers also used the algorithm to identify potential therapeutics for autoimmune diseases, pointing to drug compounds that could reverse gene expression in specific cell types associated with these diseases. [Extracted from the article]

A report from Yangtze University in Jingzhou, China discusses the use of deep learning algorithms in food safety and authenticity detection. The researchers highlight the advantages of deep learning algorithms over traditional machine learning algorithms and chemometric algorithms. They specifically focus on convolutional neural networks (CNN), fully convolutional networks (FCN), and generative adversarial networks (GAN). The report also explores the potential for further development in this field, including the use of data augmentation and multimodal neural networks. The research concludes that deep learning algorithms have made significant progress in food safety and authenticity detection, but there is still room for improvement. [Extracted from the article]

A report from the China University of Petroleum (East China) discusses the need for modern technology, specifically artificial intelligence, to support the diagnosis of breast cancer. The existing computer-aided diagnostic systems for breast cancer are costly and limited in their capabilities. The report proposes the use of improved algorithms and a simple integrated system for pre-diagnosis of breast cancer based on CNN and Pyqt5. The system utilizes tensorflow and pytorch frameworks and includes a human-computer interaction GUI system interface. The research has been peer-reviewed and more information can be obtained from the China University of Petroleum (East China). [Extracted from the article]

A recent study conducted at Shiraz University aimed to improve the accuracy of breast cancer diagnosis by using a feature selection algorithm based on particle swarm optimization (PSO) combined with machine learning methods. The researchers tested their algorithm on three common breast cancer datasets and found that it significantly improved accuracy while reducing the number of features needed for diagnosis. The study suggests that the proposed algorithm has the potential to enhance breast cancer diagnosis and reduce cost and time. Further information on the study can be found in the International Journal of Computational Intelligence Systems. [Extracted from the article]

Conjugate gradient (CG) methods are a class of important methods for solving linear equations and nonlinear optimization problems. In this paper, we propose a new stochastic CG algorithm with variance reduction and we prove its linear convergence with the Fletcher and Reeves method for strongly convex and smooth functions. We experimentally demonstrate that the CG with variance reduction algorithm converges faster than its counterparts for four learning models, which may be convex, nonconvex or nonsmooth. In addition, its area under the curve performance on six large-scale data sets is comparable to that of the LIBLINEAR solver for the $L2$ -regularized $L2$ -loss but with a significant improvement in computational efficiency. 1 CGVR algorithm is available on github: https://github.com/xbjin/cgvr [ABSTRACT FROM AUTHOR]

Robotic control in a continuous action space has long been a challenging topic. This is especially true when controlling robots to solve compound tasks, as both basic skills and compound skills need to be learned. In this paper, we propose a hierarchical deep reinforcement learning algorithm to learn basic skills and compound skills simultaneously. In the proposed algorithm, compound skills and basic skills are learned by two levels of hierarchy. In the first level of hierarchy, each basic skill is handled by its own actor, overseen by a shared basic critic. Then, in the second level of hierarchy, compound skills are learned by a meta critic by reusing basic skills. The proposed algorithm was evaluated on a Pioneer 3AT robot in three different navigation scenarios with fully observable tasks. The simulations were built in Gazebo 2 in a robot operating system Indigo environment. The results show that the proposed algorithm can learn both high performance basic skills and compound skills through the same learning process. The compound skills learned outperform those learned by a discrete action space deep reinforcement learning algorithm. [ABSTRACT FROM AUTHOR]

Memory is one of the most important mechanisms in recurrent neural networks (RNNs) learning. It plays a crucial role in practical applications, such as sequence learning. With a good memory mechanism, long term history can be fused with current information, and can thus improve RNNs learning. Developing a suitable memory mechanism is always desirable in the field of RNNs. This paper proposes a novel memory mechanism for RNNs. The main contributions of this paper are: 1) an auxiliary memory unit (AMU) is proposed, which results in a new special RNN model (AMU-RNN), separating the memory and output explicitly and 2) an efficient learning algorithm is developed by employing the technique of error flow truncation. The proposed AMU-RNN model, together with the developed learning algorithm, can learn and maintain stable memory over a long time range. This method overcomes both the learning conflict problem and gradient vanishing problem. Unlike the traditional method, which mixes the memory and output with a single neuron in a recurrent unit, the AMU provides an auxiliary memory neuron to maintain memory in particular. By separating the memory and output in a recurrent unit, the problem of learning conflicts can be eliminated easily. Moreover, by using the technique of error flow truncation, each auxiliary memory neuron ensures constant error flow during the learning process. The experiments demonstrate good performance of the proposed AMU-RNNs and the developed learning algorithm. The method exhibits quite efficient learning performance with stable convergence in the AMU-RNN learning and outperforms the state-of-the-art RNN models in sequence generation and sequence classification tasks. [ABSTRACT FROM AUTHOR]

This paper presents the development of a motivated learning (ML) agent with symbolic I/O. Our earlier work on the ML agent was enhanced, giving it autonomy for interaction with other agents. Specifically, we equipped the agent with drives and pains that establish its motivations to learn how to respond to desired and undesired events and create related abstract goals. The purpose of this paper is to explore the autonomous development of motivations and memory in agents within a simulated environment. The ML agent has been implemented in a virtual environment created within the NeoAxis game engine. Additionally, to illustrate the benefits of an ML-based agent, we compared the performance of our algorithm against various reinforcement learning (RL) algorithms in a dynamic test scenario, and demonstrated that our ML agent learns better than any of the tested RL agents. [ABSTRACT FROM PUBLISHER]

This paper presents a new machine learning-based nowcasting model for hourly summer precipitation over the Eastern Alps. An artificial neural network (ANN) using the multi-layer perceptron algorithm was applied and evaluated against the Integrated Nowcasting through Comprehensive Analysis (INCA) nowcasting system and a multiple linear regression (MLR) model. Results show that the ANN model has a better nowcasting skill than the INCA model and the MLR model. The MLR model performs, too, also better than the INCA model. The improvement of precipitation intensity accuracy is substantial for both the morning to late evening period and for large rainfall thresholds. This study suggested that the machine learning approach is a promising methodology for precipitation forecasting. [ABSTRACT FROM AUTHOR]

The article discusses research in the age of machines. Topics include data mining and machine-learning as a great boon for political campaigns, scholarly communication librarians' interest for artificial intelligence, and University of California-San Francisco researchers training a machine learning algorithm to decode words and phrases from speech signals in the brain.

The article discusses the challenges associated with trusting the behavior of complex artificial intelligence (AI) algorithms used in mission-critical settings and specifying what makes a system intelligible. Topics include the ability to explain an AI system's decisions using techniques such as local approximation and vocabulary transformation, and the promotion of interactive explanation systems that can respond to a range of follow-up questions allowing explanation of a process.

Large-scale Machine Learning (ML) algorithms are often iterative, using repeated read-only data access and I/O-bound matrix-vector multiplications. Hence, it is crucial for performance to fit the data into single-node or distributed main memory to enable fast matrix-vector operations. General-purpose compression struggles to achieve both good compression ratios and fast decompression for block-wise uncompressed operations. Therefore, we introduce Compressed Linear Algebra (CLA) for lossless matrix compression. CLA encodes matrices with lightweight, value-based compression techniques and executes linear algebra operations directly on the compressed representations. We contribute effective column compression schemes, cache-conscious operations, and an efficient sampling-based compression algorithm. Our experiments show good compression ratios and operations performance close to the uncompressed case, which enables fitting larger datasets into available memory. We thereby obtain significant end-to-end performance improvements. [ABSTRACT FROM AUTHOR]

A recent study conducted at the Central University of Haryana in India has proposed a privacy-preserving collaborative model for the classification of brain tumors using magnetic resonance imaging (MRI) images. The study utilized deep learning and transfer learning algorithms to analyze an open-source dataset of MRI images, which included four types of tumors and no tumor. The researchers found that federated deep learning models, involving multiple clients, outperformed conventional pretrained models in terms of accuracy. The proposed framework offers a solution for early diagnosis of brain tumors while ensuring data privacy for edge devices with limited resources. [Extracted from the article]

This article develops a communication-efficient algorithm to solve the stochastic optimization problem defined over a distributed network, aiming at reducing the burdensome communication in applications, such as distributed machine learning. Different from the existing works based on quantization and sparsification, we introduce a communication-censoring technique to reduce the transmissions of variables, which leads to our communication-censored distributed stochastic gradient descent (CSGD) algorithm. Specifically, in CSGD, the latest minibatch stochastic gradient at a worker will be transmitted to the server if and only if it is sufficiently informative. When the latest gradient is not available, the stale one will be reused at the server. To implement this communication-censoring strategy, the batch size is increasing in order to alleviate the effect of stochastic gradient noise. Theoretically, CSGD enjoys the same order of convergence rate as that of SGD but effectively reduces communication. Numerical experiments demonstrate the sizable communication saving of CSGD. [ABSTRACT FROM AUTHOR]

In this article, distributed algorithms are proposed for training a group of neural networks with private data sets. Stochastic gradients are utilized in order to eliminate the requirement for true gradients. To obtain a universal model of the distributed neural networks trained using local data sets only, consensus tools are introduced to derive the model toward the optimum. Most of the existing works employ diminishing learning rates, which are often slow and impracticable for online learning, while constant learning rates are studied in some recent works, but the principle for choosing the rates is not well established. In this article, constant learning rates are adopted to empower the proposed algorithms with tracking ability. Under mild conditions, the convergence of the proposed algorithms is established by exploring the error dynamics of the connected agents, which provides an upper bound for selecting the constant learning rates. Performances of the proposed algorithms are analyzed with and without gradient noises, in the sense of mean square error (MSE). It is proved that the MSE converges with bounded errors determined by the gradient noises, and the MSE converges to zero if the gradient noises are absent. Simulation results are provided to validate the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]

A recent report from Universiti Malaya discusses research on cancer treatment using optimal control supported by swarm intelligence. The study aims to develop hybrid techniques that combine optimal control theory with evolutionary algorithms and multi-objective swarm algorithms to reduce cancerous cells while minimizing the use of chemotherapy medications and toxicity. Two hybrid techniques were proposed and evaluated, with MOEA/D emerging as the most effective algorithm in reducing tumor size and cancer drug concentration. The study highlights the importance of integrating optimal control theory and evolutionary algorithms for optimizing cancer chemotherapy treatment. [Extracted from the article]

The article presents a study conducted at APJ Abdul Kalam Technological University focusing on a new approach for liver tumor segmentation and classification. Topics discussed include the application of a deep learning model with a hybrid optimization technique, the use of advanced image processing methods, and the improvements in accuracy, specificity, sensitivity, and precision achieved with the proposed model.

A recent report from Lanzhou University in China discusses the use of a new algorithm called Hierarchical Learning-Enhanced Chaotic Crayfish Optimization Algorithm (HLCCOA) to improve the accuracy of extreme learning machine diagnostics in breast cancer. The HLCCOA algorithm addresses the limitations of traditional crayfish optimization algorithms by utilizing chaotic sequences for population position initialization and implementing a hierarchical learning mechanism. Rigorous testing shows that the HLCCOA-optimized extreme learning machine model outperforms other benchmark models in terms of accuracy, sensitivity, and specificity for breast cancer diagnosis. This research highlights the potential practicality and robustness of the HLCCOA algorithm in improving breast cancer diagnostics. [Extracted from the article]

A study conducted by researchers at the Universidad Autonoma de Zacatecas in Mexico focuses on the early detection of type 2 diabetes mellitus (T2DM) using machine learning algorithms. The study aims to identify potential biomarkers for T2DM and determine any differences between male and female patients. The researchers used clinical and anthropometric variables from patients with T2DM and control patients without T2DM. The results showed that biomarkers such as systolic blood pressure and triglycerides were significantly associated with T2DM. The most accurate machine learning model was selection with recursive feature elimination and random forest as the estimator, achieving an accuracy of 0.8820. The findings of this study have the potential to improve early detection and management of T2DM by considering the differences between male and female patients. Further research is needed to validate these biomarkers in other populations and clinical settings. [Extracted from the article]

A researcher from Shandong Youth University of Political Science has developed a breast ultrasound image classification algorithm based on a combination of convolutional neural network (CNN) and Transformer models. The algorithm aims to improve the interpretability and accuracy of computer-aided diagnosis (CAD) systems for breast cancer detection. By leveraging tumor boundaries and extracting both local and global features, the proposed model achieved state-of-the-art performance with an accuracy of 0.9870 and an F1 score of 0.9872. The research highlights the potential of deep learning models in enhancing the interpretation of medical images and reducing the workload of doctors. [Extracted from the article]

Researchers at the University of Mustapha Stambouli in Algeria have developed a new method for accurately classifying breast cancer using machine learning techniques. The method, called Correlation technique-Modified Grey Wolf Optimizer (CMGWO), involves two stages: feature selection and classification. The researchers used the Wisconsin Diagnostic Breast Cancer (WDBC) database to test the performance of their method and found that it significantly increased the accuracy rate of classification. The study concludes that CMGWO is a reliable approach for detecting breast cancer, with an accuracy rate of 99.12%. [Extracted from the article]

A recent study conducted at Kanazawa University in Japan explores the use of machine learning algorithms for the diagnosis of cervical cancer. The researchers propose a novel feature selection strategy called the Binary Harris Hawks Optimization (BHHO) algorithm, which aims to reduce the number of features used in diagnosis while improving accuracy. The BHHO algorithm demonstrates better stability and accuracy compared to other common wrapper-based feature selection methods, not only on cervical cancer datasets but also on other disease datasets. This research contributes to the ongoing efforts to improve early diagnosis and treatment of cervical cancer, which is one of the leading causes of cancer-related deaths among females worldwide. [Extracted from the article]

The lack of labeled data presents a common challenge in many computer vision and machine learning tasks. Semisupervised learning and transfer learning methods have been developed to tackle this challenge by utilizing auxiliary samples from the same domain or from a different domain, respectively. Self-taught learning, which is a special type of transfer learning, has fewer restrictions on the choice of auxiliary data. It has shown promising performance in visual learning. However, existing self-taught learning methods usually ignore the structure information in data. In this paper, we focus on building a self-taught coding framework, which can effectively utilize the rich low-level pattern information abstracted from the auxiliary domain, in order to characterize the high-level structural information in the target domain. By leveraging a high quality dictionary learned across auxiliary and target domains, the proposed approach learns expressive codings for the samples in the target domain. Since many types of visual data have been proven to contain subspace structures, a low-rank constraint is introduced into the coding objective to better characterize the structure of the given target set. The proposed representation learning framework is called self-taught low-rank (S-Low) coding, which can be formulated as a nonconvex rank-minimization and dictionary learning problem. We devise an efficient majorization–minimization augmented Lagrange multiplier algorithm to solve it. Based on the proposed S-Low coding mechanism, both unsupervised and supervised visual learning algorithms are derived. Extensive experiments on five benchmark data sets demonstrate the effectiveness of our approach. [ABSTRACT FROM PUBLISHER]

Distributed learning refers to the problem of inferring a function when the training data are distributed among different nodes. While significant work has been done in the contexts of supervised and unsupervised learning, the intermediate case of Semi-supervised learning in the distributed setting has received less attention. In this paper, we propose an algorithm for this class of problems, by extending the framework of manifold regularization. The main component of the proposed algorithm consists of a fully distributed computation of the adjacency matrix of the training patterns. To this end, we propose a novel algorithm for low-rank distributed matrix completion, based on the framework of diffusion adaptation. Overall, the distributed Semi-supervised algorithm is efficient and scalable, and it can preserve privacy by the inclusion of flexible privacy-preserving mechanisms for similarity computation. The experimental results and comparison on a wide range of standard Semi-supervised benchmarks validate our proposal. [ABSTRACT FROM PUBLISHER]

In this paper, we consider a modified error-correction learning rule for the multilayer neural network with multivalued neurons (MLMVN). This modification is based on the soft margins technique, which leads to the minimization of the distance between a cluster center and the learning samples belonging to this cluster. MLMVN has a derivative-free learning algorithm based on the error-correction learning rule and demonstrate a higher functionality and better generalization capability than a number of other machine learning techniques. The discrete $k$ -valued multivalued neuron activation function divides a complex plane into $k$ equal sectors. For more efficient and reliable solving of classification problems it is possible to modify the MLMVN learning algorithm in such a way that learning samples belonging to different classes (clusters) will be located as close as possible to the bisector of a desired sector (the cluster center) and as far as possible from each other, respectively. Such a modification based on the soft margins learning technique is considered in this paper. This modified learning algorithm improves the generalization capability of MLMVN when solving classification problems. [ABSTRACT FROM AUTHOR]

Most of the existing studies around breast cancer classification adopt a single algorithm to fit breast cancer data but ignore the applicability of different breast cancer data features to the model. Keywords: Algorithms; Breast Cancer; Cancer; Cyborgs; Diagnostics and Screening; Emerging Technologies; Health and Medicine; Machine Learning; Oncology; Women's Health EN Algorithms Breast Cancer Cancer Cyborgs Diagnostics and Screening Emerging Technologies Health and Medicine Machine Learning Oncology Women's Health 471 471 1 03/23/23 20230324 NES 230324 2023 MAR 21 (NewsRx) -- By a News Reporter-Staff News Editor at Women's Health Weekly -- Current study results on breast cancer have been published. [Extracted from the article]