Latent Factor Analysis For High Dimensional And Sparse Matrices
Download Latent Factor Analysis For High Dimensional And Sparse Matrices full books in PDF, epub, and Kindle. Read online free Latent Factor Analysis For High Dimensional And Sparse Matrices ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
Author | : Ye Yuan |
Publisher | : Springer Nature |
Total Pages | : 99 |
Release | : 2022-11-15 |
Genre | : Computers |
ISBN | : 9811967032 |
Latent factor analysis models are an effective type of machine learning model for addressing high-dimensional and sparse matrices, which are encountered in many big-data-related industrial applications. The performance of a latent factor analysis model relies heavily on appropriate hyper-parameters. However, most hyper-parameters are data-dependent, and using grid-search to tune these hyper-parameters is truly laborious and expensive in computational terms. Hence, how to achieve efficient hyper-parameter adaptation for latent factor analysis models has become a significant question. This is the first book to focus on how particle swarm optimization can be incorporated into latent factor analysis for efficient hyper-parameter adaptation, an approach that offers high scalability in real-world industrial applications. The book will help students, researchers and engineers fully understand the basic methodologies of hyper-parameter adaptation via particle swarm optimization in latent factor analysis models. Further, it will enable them to conduct extensive research and experiments on the real-world applications of the content discussed.
Author | : Subarna Shakya |
Publisher | : Springer Nature |
Total Pages | : 792 |
Release | : 2023-05-26 |
Genre | : Technology & Engineering |
ISBN | : 9819908353 |
This book gathers selected high-quality research papers presented at International Conference on Mobile Computing and Sustainable Informatics (ICMCSI 2022) organized by Pulchowk Campus, Institute of Engineering, Tribhuvan University, Nepal, during January 11–12, 2023. The book discusses recent developments in mobile communication technologies ranging from mobile edge computing devices to personalized, embedded, and sustainable applications. The book covers vital topics like mobile networks, computing models, algorithms, sustainable models, and advanced informatics that support the symbiosis of mobile computing and sustainable informatics.
Author | : Fenrong Liu |
Publisher | : Springer Nature |
Total Pages | : 525 |
Release | : 2023-11-10 |
Genre | : Computers |
ISBN | : 9819970199 |
This three-volume set, LNCS 14325-14327 constitutes the thoroughly refereed proceedings of the 20th Pacific Rim Conference on Artificial Intelligence, PRICAI 2023, held in Jakarta, Indonesia, in November 2023. The 95 full papers and 36 short papers presented in these volumes were carefully reviewed and selected from 422 submissions. PRICAI covers a wide range of topics in the areas of social and economic importance for countries in the Pacific Rim: artificial intelligence, machine learning, natural language processing, knowledge representation and reasoning, planning and scheduling, computer vision, distributed artificial intelligence, search methodologies, etc.
Author | : Di Wu |
Publisher | : Springer Nature |
Total Pages | : 119 |
Release | : 2022-12-06 |
Genre | : Computers |
ISBN | : 981198140X |
Incomplete big data are frequently encountered in many industrial applications, such as recommender systems, the Internet of Things, intelligent transportation, cloud computing, and so on. It is of great significance to analyze them for mining rich and valuable knowledge and patterns. Latent feature analysis (LFA) is one of the most popular representation learning methods tailored for incomplete big data due to its high accuracy, computational efficiency, and ease of scalability. The crux of analyzing incomplete big data lies in addressing the uncertainty problem caused by their incomplete characteristics. However, existing LFA methods do not fully consider such uncertainty. In this book, the author introduces several robust latent feature learning methods to address such uncertainty for effectively and efficiently analyzing incomplete big data, including robust latent feature learning based on smooth L1-norm, improving robustness of latent feature learning using L1-norm, improving robustness of latent feature learning using double-space, data-characteristic-aware latent feature learning, posterior-neighborhood-regularized latent feature learning, and generalized deep latent feature learning. Readers can obtain an overview of the challenges of analyzing incomplete big data and how to employ latent feature learning to build a robust model to analyze incomplete big data. In addition, this book provides several algorithms and real application cases, which can help students, researchers, and professionals easily build their models to analyze incomplete big data.
Author | : Xin Luo |
Publisher | : Springer Nature |
Total Pages | : 132 |
Release | : 2023-09-25 |
Genre | : Technology & Engineering |
ISBN | : 9819957664 |
This book mainly shows readers how to calibrate and control robots. In this regard, it proposes three control schemes: an error-summation enhanced Newton algorithm for model predictive control; RNN for solving perturbed time-varying underdetermined linear systems; and a new joint-drift-free scheme aided with projected ZNN, which can effectively improve robot control accuracy. Moreover, the book develops four advanced algorithms for robot calibration – Levenberg-Marquarelt with diversified regularizations; improved covariance matrix adaptive evolution strategy; quadratic interpolated beetle antennae search algorithm; and a novel variable step-size Levenberg-Marquardt algorithm – which can effectively enhance robot positioning accuracy. In addition, it is exceedingly difficult for experts in other fields to conduct robot arm calibration studies without calibration data. Thus, this book provides a publicly available dataset to assist researchers from other fields in conducting calibration experiments and validating their ideas. The book also discusses six regularization schemes based on its robot error models, i.e., L1, L2, dropout, elastic, log, and swish. Robots’ positioning accuracy is significantly improved after calibration. Using the control and calibration methods developed here, readers will be ready to conduct their own research and experiments.
Author | : Hao Wu |
Publisher | : Springer Nature |
Total Pages | : 89 |
Release | : 2023-03-07 |
Genre | : Computers |
ISBN | : 9811989346 |
A dynamic network is frequently encountered in various real industrial applications, such as the Internet of Things. It is composed of numerous nodes and large-scale dynamic real-time interactions among them, where each node indicates a specified entity, each directed link indicates a real-time interaction, and the strength of an interaction can be quantified as the weight of a link. As the involved nodes increase drastically, it becomes impossible to observe their full interactions at each time slot, making a resultant dynamic network High Dimensional and Incomplete (HDI). An HDI dynamic network with directed and weighted links, despite its HDI nature, contains rich knowledge regarding involved nodes’ various behavior patterns. Therefore, it is essential to study how to build efficient and effective representation learning models for acquiring useful knowledge. In this book, we first model a dynamic network into an HDI tensor and present the basic latent factorization of tensors (LFT) model. Then, we propose four representative LFT-based network representation methods. The first method integrates the short-time bias, long-time bias and preprocessing bias to precisely represent the volatility of network data. The second method utilizes a proportion-al-integral-derivative controller to construct an adjusted instance error to achieve a higher convergence rate. The third method considers the non-negativity of fluctuating network data by constraining latent features to be non-negative and incorporating the extended linear bias. The fourth method adopts an alternating direction method of multipliers framework to build a learning model for implementing representation to dynamic networks with high preciseness and efficiency.
Author | : Danai Koutra |
Publisher | : Springer Nature |
Total Pages | : 506 |
Release | : 2023-09-17 |
Genre | : Computers |
ISBN | : 3031434242 |
The multi-volume set LNAI 14169 until 14175 constitutes the refereed proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases, ECML PKDD 2023, which took place in Turin, Italy, in September 2023. The 196 papers were selected from the 829 submissions for the Research Track, and 58 papers were selected from the 239 submissions for the Applied Data Science Track. The volumes are organized in topical sections as follows: Part I: Active Learning; Adversarial Machine Learning; Anomaly Detection; Applications; Bayesian Methods; Causality; Clustering. Part II: Computer Vision; Deep Learning; Fairness; Federated Learning; Few-shot learning; Generative Models; Graph Contrastive Learning. Part III: Graph Neural Networks; Graphs; Interpretability; Knowledge Graphs; Large-scale Learning. Part IV: Natural Language Processing; Neuro/Symbolic Learning; Optimization; Recommender Systems; Reinforcement Learning; Representation Learning. Part V: Robustness; Time Series; Transfer and Multitask Learning. Part VI: Applied Machine Learning; Computational Social Sciences; Finance; Hardware and Systems; Healthcare & Bioinformatics; Human-Computer Interaction; Recommendation and Information Retrieval. Part VII: Sustainability, Climate, and Environment.- Transportation & Urban Planning.- Demo.
Author | : Yinyan Zhang |
Publisher | : Springer Nature |
Total Pages | : 193 |
Release | : 2020-03-13 |
Genre | : Technology & Engineering |
ISBN | : 9811532311 |
In this book, we present our systematic investigations into consensus in multi-agent systems. We show the design and analysis of various types of consensus protocols from a multi-agent perspective with a focus on min-consensus and its variants. We also discuss second-order and high-order min-consensus. A very interesting topic regarding the link between consensus and path planning is also included. We show that a biased min-consensus protocol can lead to the path planning phenomenon, which means that the complexity of shortest path planning can emerge from a perturbed version of min-consensus protocol, which as a case study may encourage researchers in the field of distributed control to rethink the nature of complexity and the distance between control and intelligence. We also illustrate the design and analysis of consensus protocols for nonlinear multi-agent systems derived from an optimal control formulation, which do not require solving a Hamilton-Jacobi-Bellman (HJB) equation. The book was written in a self-contained format. For each consensus protocol, the performance is verified through simulative examples and analyzed via mathematical derivations, using tools like graph theory and modern control theory. The book’s goal is to provide not only theoretical contributions but also explore underlying intuitions from a methodological perspective.
Author | : Arnoldo Frigessi |
Publisher | : Springer |
Total Pages | : 313 |
Release | : 2016-02-16 |
Genre | : Mathematics |
ISBN | : 3319270990 |
This book features research contributions from The Abel Symposium on Statistical Analysis for High Dimensional Data, held in Nyvågar, Lofoten, Norway, in May 2014. The focus of the symposium was on statistical and machine learning methodologies specifically developed for inference in “big data” situations, with particular reference to genomic applications. The contributors, who are among the most prominent researchers on the theory of statistics for high dimensional inference, present new theories and methods, as well as challenging applications and computational solutions. Specific themes include, among others, variable selection and screening, penalised regression, sparsity, thresholding, low dimensional structures, computational challenges, non-convex situations, learning graphical models, sparse covariance and precision matrices, semi- and non-parametric formulations, multiple testing, classification, factor models, clustering, and preselection. Highlighting cutting-edge research and casting light on future research directions, the contributions will benefit graduate students and researchers in computational biology, statistics and the machine learning community.
Author | : JunQi Zhang |
Publisher | : John Wiley & Sons |
Total Pages | : 276 |
Release | : 2023-11-10 |
Genre | : Technology & Engineering |
ISBN | : 1394188528 |
Comprehensive guide on learning automata, introducing two variants to accelerate convergence and computational update speed Learning Automata and Their Applications to Intelligent Systems provides a comprehensive guide on learning automata from the perspective of principles, algorithms, improvement directions, and applications. The text introduces two variants to accelerate the convergence speed and computational update speed, respectively; these two examples demonstrate how to design new learning automata for a specific field from the aspect of algorithm design to give full play to the advantage of learning automata. As noisy optimization problems exist widely in various intelligent systems, this book elaborates on how to employ learning automata to solve noisy optimization problems from the perspective of algorithm design and application. The existing and most representative applications of learning automata include classification, clustering, game, knapsack, network, optimization, ranking, and scheduling. They are well-discussed. Future research directions to promote an intelligent system are suggested. Written by two highly qualified academics with significant experience in the field, Learning Automata and Their Applications to Intelligent Systems covers such topics as: Mathematical analysis of the behavior of learning automata, along with suitable learning algorithms Two application-oriented learning automata: one to discover and track spatiotemporal event patterns, and the other to solve stochastic searching on a line Demonstrations of two pioneering variants of Optimal Computing Budge Allocation (OCBA) methods and how to combine learning automata with ordinal optimization How to achieve significantly faster convergence and higher accuracy than classical pursuit schemes via lower computational complexity of updating the state probability A timely text in a rapidly developing field, Learning Automata and Their Applications to Intelligent Systems is an essential resource for researchers in machine learning, engineering, operation, and management. The book is also highly suitable for graduate level courses on machine learning, soft computing, reinforcement learning and stochastic optimization.