Algorithmic foundations of robotics XIV : proceedings of the Fourteenth Workshop on the Algorithmic Foundations of Robotics / / editors, Steven M. LaValle [et al.] |
Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
Descrizione fisica | 1 online resource (581 pages) |
Disciplina | 629.892 |
Collana | Springer Proceedings in Advanced Robotics |
Soggetto topico |
Robotics
Robotics - Mathematics Machine learning Algorithms Robòtica Algorismes computacionals Aprenentatge automàtic |
Soggetto genere / forma |
Congressos
Llibres electrònics |
ISBN | 3-030-66723-5 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910483482303321 |
Cham, Switzerland : , : Springer, , [2021] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Application of machine learning models in agricultural and meteorological sciences / / Mohammad Ehteram, Akram Seifi, and Fatemeh Barzegari Banadkooki |
Autore | Ehteram Mohammad |
Edizione | [1st ed. 2023.] |
Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore Pte Ltd., , [2022] |
Descrizione fisica | 1 online resource (201 pages) |
Disciplina | 006.3 |
Soggetto topico |
Artificial intelligence - Agricultural applications
Machine learning Meteorology Aprenentatge automàtic Intel·ligència artificial Agricultura Meteorologia |
Soggetto genere / forma | Llibres electrònics |
ISBN | 981-19-9733-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | The importance of agricultural and meteorological predictions -- Structure of Particle swarm optimization -- Structure of Shark optimization algorithm -- structure of sunflower optimization algorithm -- Structure of Henry gas solubility optimizer. |
Record Nr. | UNINA-9910682564603321 |
Ehteram Mohammad | ||
Singapore : , : Springer Nature Singapore Pte Ltd., , [2022] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Applications of advanced computing in systems : proceedings of International Conference on Advances in Systems, Control and Computing / / Rajesh Kumar, [and three others], editors |
Pubbl/distr/stampa | Singapore : , : Springer, , [2021] |
Descrizione fisica | 1 online resource (334 pages) |
Disciplina | 006.3 |
Collana | Algorithms for intelligent systems |
Soggetto topico |
Computer algorithms
Machine learning Artificial intelligence Algorismes computacionals Aprenentatge automàtic Intel·ligència artificial |
Soggetto genere / forma |
Llibres electrònics
Congressos |
ISBN | 981-334-862-3 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Altri titoli varianti | AISCC 2020 |
Record Nr. | UNINA-9910736018503321 |
Singapore : , : Springer, , [2021] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Applications of bioinformatics in rice research / / edited by Manoj Kumar Gupta, Lambodar Behera |
Pubbl/distr/stampa | Singapore : , : Springer, , [2021] |
Descrizione fisica | 1 online resource (363 pages) |
Disciplina | 371 |
Soggetto topico |
Life sciences
Arròs Bioinformàtica Aprenentatge automàtic |
Soggetto genere / forma | Llibres electrònics |
ISBN | 981-16-3997-3 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910502642403321 |
Singapore : , : Springer, , [2021] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Artificial intelligence and machine learning in healthcare / / Ankur Saxena, Shivani Chandra |
Autore | Saxena Ankur |
Edizione | [1st ed. 2021.] |
Pubbl/distr/stampa | Gateway East, Singapore : , : Springer, , [2021] |
Descrizione fisica | 1 online resource (XIX, 228 p. 119 illus., 88 illus. in color.) |
Disciplina | 610.285 |
Soggetto topico |
Artificial intelligence - Medical applications
Intel·ligència artificial en medicina Aprenentatge automàtic |
Soggetto genere / forma | Llibres electrònics |
ISBN | 981-16-0811-3 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Chapter 1_Big Data Analytics and AI for Healthcare -- Chapter 2_Genetics with Big Data and AI -- Chapter 3_AI and Big Data for next-generation sequencing -- Chapter 4_Artificial Intelligence for Computational Biology -- Chapter 5_Artificial intelligence and machine learning in clinical development -- Chapter 6_Big data analytics for personalized medicine -- Chapter 7_Generating and Managing Healthcare data with AI -- Chapter 8_Big Data and Artificial Intelligence for diseases -- Chapter 9_Artificial Intelligence and Big Data for Public Health -- Chapter 10_Biasness in Healthcare Big Data and Computational Algorithms -- Chapter 11_AI and ML in Healthcare: An Ethical perspective. |
Record Nr. | UNINA-9910484050503321 |
Saxena Ankur | ||
Gateway East, Singapore : , : Springer, , [2021] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Black box optimization, machine learning, and no-free lunch theorems / / Panos M. Pardalos, Varvara Rasskazova, Michael N. Vrahatis, editors |
Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
Descrizione fisica | 1 online resource (393 pages) |
Disciplina | 006.31 |
Collana | Springer Optimization and Its Applications |
Soggetto topico |
Machine learning - Mathematics
Aprenentatge automàtic Optimització matemàtica Algorismes computacionals |
Soggetto genere / forma | Llibres electrònics |
ISBN | 3-030-66515-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Intro -- Preface -- Contents -- Learning Enabled Constrained Black-Box Optimization -- 1 Introduction -- 2 Constrained Black-Box Optimization -- 3 The Basic Probabilistic Framework -- 3.1 Gaussian Processes -- 3.2 GP-Based Optimization -- 4 Constrained Bayesian Optimization -- 5 Constrained Bayesian Optimization for Partially Defined Objective Functions -- 6 Software for the Generation of Constrained Test Problems -- 6.1 Emmental-Type GKLS Generator -- 7 Conclusions -- References -- Black-Box Optimization: Methods and Applications -- 1 Introduction -- 2 Overview of BBO Methods -- 2.1 Direct Search Methods -- 2.1.1 Simplex Search -- 2.1.2 Coordinate Search -- 2.1.3 Generalized Pattern Search -- 2.1.4 Mesh Adaptive Direct Search -- 2.2 Model-Based Methods -- 2.2.1 Model-Based Trust Region -- 2.2.2 Projection-Based Methods -- 2.3 Heuristic Methods -- 2.3.1 DIRECT -- 2.3.2 Multilevel Coordinate Search -- 2.3.3 Hit-and-Run algorithms -- 2.3.4 Simulated Annealing -- 2.3.5 Genetic Algorithm -- 2.3.6 Particle Swarm Optimization -- 2.3.7 Surrogate Management Framework -- 2.3.8 Branch and Fit -- 2.4 Hybrid Methods -- 2.5 Extension to Constrained Problems -- 2.5.1 Penalty Method -- 2.5.2 Augmented Lagrangian -- 2.5.3 Filter Method -- 2.5.4 Surrogate Modeling -- 3 BBO Solvers -- 4 Recent Applications -- 4.1 Automatic Machine Learning -- 4.2 Optimization Solvers -- 4.3 Fluid Mechanics -- 4.4 Oilfield Development and Operations -- 4.5 Chemical and Biochemical Engineering -- 5 Open Problems and Future Research Directions -- References -- Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives -- 1 Introduction -- 2 Tuning: Strategies -- 2.1 Key Topics -- 2.2 Stochastic Optimization Algorithms -- 2.3 Algorithm Tuning -- 2.4 Example: Grefenstette's Study of Control Parameters for Genetic Algorithms.
2.5 No Free Lunch Theorems -- 2.6 Tuning for Deterministic Algorithms -- 3 Test Sets -- 3.1 Test Functions -- 3.2 Application Domains -- 3.2.1 Tuning in Industry -- 3.2.2 Energy -- 3.2.3 Water Industry -- 3.2.4 Steel Industry -- 3.2.5 Automotive -- 3.2.6 Information Technology -- 4 Statistical Considerations -- 4.1 Experimental Setup -- 4.2 Design of Experiments -- 4.3 Measuring Performance -- 4.4 Reporting Results -- 5 Parallelization -- 5.1 Overview -- 5.2 Simplistic Approaches -- 5.3 Parallelization in Surrogate Model-Based Optimization -- 5.3.1 Uncertainty-Based Methods -- 5.3.2 Surrogate-Assisted Algorithms -- 6 Tuning Approaches -- 6.1 Overview -- 6.2 Manual Tuning -- 6.3 Automatic Tuning -- 6.4 Interactive Tuning -- 6.5 Internal Tuning -- 7 Tuning Software -- 7.1 Overview -- 7.2 IRACE -- 7.3 SPOT -- 7.4 SMAC -- 7.5 ParamILS -- 7.6 GGA -- 7.7 Usability and Availability of Tuning Software -- 7.8 Example: SPOT -- 8 Research Directions and Open Problems -- 9 Summary and Outlook -- References -- Quality-Diversity Optimization: A Novel Branch of Stochastic Optimization -- 1 Introduction -- 2 Problem Formulation -- 2.1 Collections of Solutions -- 2.2 How Do We Measure the Performance of a QD Algorithm? -- 3 Optimizing a Collection of Solutions -- 3.1 MAP-Elites -- 3.2 A Unified Framework -- 3.2.1 Containers -- 3.2.2 Selection Operators -- 3.2.3 Population Scores -- 3.3 Considerations of Quality-Diversity Optimization -- 4 Origins and Related Work -- 4.1 Searching for Diverse Behaviors -- 4.2 Connections to Multimodal Optimization -- 4.3 Connections to Multitask Optimization -- 5 Current Topics -- 5.1 Expensive Objective Functions -- 5.2 High-Dimensional Feature Space -- 5.3 Learning the Behavior Descriptor -- 5.4 Improving Variation Operators -- 5.5 Noisy Functions -- 6 Conclusion -- References. Multi-Objective Evolutionary Algorithms: Past, Present, and Future -- 1 Introduction -- 2 Basic Concepts -- 3 The Past -- 3.1 Non-Elitist Non-Pareto Approaches -- 3.1.1 Linear Aggregating Functions -- 3.1.2 Vector Evaluated Genetic Algorithm (VEGA) -- 3.1.3 Lexicographic Ordering -- 3.1.4 Target-Vector Approaches -- 3.2 Non-Elitist Pareto-Based Approaches -- 3.2.1 Multi-Objective Genetic Algorithm (MOGA) -- 3.2.2 Nondominated Sorting Genetic Algorithm (NSGA) -- 3.2.3 Niched-Pareto Genetic Algorithm (NPGA) -- 3.3 Elitist Pareto-Based Approaches -- 3.3.1 The Strength Pareto Evolutionary Algorithm (SPEA) -- 3.3.2 The Pareto Archived Evolution Strategy (PAES) -- 3.3.3 The Nondominated Sorting Genetic Algorithm-II (NSGA-II) -- 4 The Present -- 4.1 Some Applications -- 5 The Future -- 6 Conclusions -- References -- Black-Box and Data-Driven Computation -- 1 Introduction -- 2 Black Box and Oracle -- 3 Reduction -- 4 Data-Driven Computation -- References -- Mathematically Rigorous Global Optimization and FuzzyOptimization -- 1 Introduction -- 2 Interval Analysis: Fundamentals and Philosophy -- 2.1 Overview -- 2.2 Interval Logic -- 2.3 Extensions -- 2.4 History and References -- 3 Fuzzy Sets: Fundamentals and Philosophy -- 3.1 Fuzzy Logic -- 3.2 A Brief History -- 4 The Branch and Bound Framework: Some Definitions and Details -- 5 Interval Technology: Some Details -- 5.1 Interval Newton Methods -- 5.2 Constraint Propagation -- 5.3 Relaxations -- 5.4 Interval Arithmetic Software -- 6 Fuzzy Technology: A Few Details -- 7 Conclusions -- References -- Optimization Under Uncertainty Explains Empirical Success of Deep Learning Heuristics -- 1 Formulation of the Problem -- 2 Why Rectified Linear Neurons Are Efficient: A Theoretical Explanation -- 3 Why Sigmoid Activation Functions -- 4 Selection of Poolings -- 5 Why Softmax -- 6 Which Averaging Should We Choose. 7 Proofs -- References -- Variable Neighborhood Programming as a Tool of Machine Learning -- 1 Introduction -- 2 Variable Neighborhood Search -- 3 Variable Neighborhood Programming -- 3.1 Solution Presentation -- 3.2 Neighborhood Structures -- 3.3 Elementary Tree Transformation in Automatic Programming -- 3.3.1 ETT in the Tree of an Undirected Graph -- 3.3.2 ETT in AP Tree -- 3.3.3 Bound on Cardinality of AP-ETT(T) -- 4 VNP for Symbolic Regression -- 4.1 Test Instances and Parameter Values -- 4.2 Comparison of BVNP with Other Methods -- 5 Life Expectancy Estimation as a Symbolic Regression Problem Solved by VNP: Case Study on Russian Districts -- 5.1 Life Expectancy Estimation as a Machine Learning Problem -- 5.2 VNP for Estimating Life Expectancy Problem -- 5.3 Case Study at Russian Districts -- 5.3.1 One-Attribute Analysis -- 5.3.2 Results and Discussion on 3-Attribute Data -- 5.4 Conclusions -- 6 Preventive Maintenance in Railway Planning as a Machine Learning Problem -- 6.1 Literature Review and Motivation -- 6.2 Reduced VNP for Solving the Preventive Maintenance Planning of Railway Infrastructure -- 6.2.1 Learning for Stage 1: Prediction -- 6.2.2 Learning for Stage 2: Classification -- 6.3 Computation Results -- 6.3.1 Prediction -- 6.3.2 Classification -- 6.4 Conclusions and Future Work -- 7 Conclusions -- References -- Non-lattice Covering and Quantization of High Dimensional Sets -- 1 Introduction -- 2 Weak Covering -- 2.1 Comparison of Designs from the View Point of Weak Covering -- 2.2 Reduction to the Probability of Covering a Point by One Ball -- 2.3 Designs of Theoretical Interest -- 3 Approximation of Cd(Zn,r) for Design 1 -- 3.1 Normal Approximation for PU,δ,α,r -- 3.2 Refined Approximation for PU,δ,α,r -- 3.3 Approximation for Cd(Zn,r) for Design 1 -- 4 Approximating Cd(Zn,r) for Design 2a -- 4.1 Normal Approximation for PU,δ,0,r. 4.2 Refined Approximation for PU,δ,0,r -- 4.3 Approximation for Cd(Zn,r) -- 5 Approximating Cd(Zn,r) for Design 2b -- 5.1 Establishing a Connection Between Sampling with and Without Replacement: General Case -- 5.2 Approximation of Cd(Zn,r) for Design 2b. -- 6 Numerical Study -- 6.1 Assessing Accuracy of Approximations of Cd(Zn,r) and Studying Their Dependence on δ -- 6.2 Comparison Across α -- 7 Quantization in a Cube -- 7.1 Quantization Error and Its Relation to Weak Covering -- 7.2 Quantization Error for Design 1 -- 7.3 Quantization Error for Design 2a -- 7.4 Quantization Error for Design 2b -- 7.5 Accuracy of Approximations for Quantization Error and the δ-Effect -- 8 Comparative Numerical Studies of Covering Properties for Several Designs -- 8.1 Covering Comparisons -- 8.2 Quantization Comparisons -- 9 Covering and Quantization in the d-Simplex -- 9.1 Characteristics of Interest -- 9.2 Numerical Investigation of the δ-Effect for d-Simplex -- 10 Appendix: An Auxiliary Lemma -- References -- Finding Effective SAT Partitionings Via Black-Box Optimization -- 1 Introduction -- 2 Preliminaries -- 2.1 Boolean Satisfiability Problem (SAT) -- 2.2 SAT-Based Cryptanalysis -- 3 Decomposition Sets and Backdoors in SAT with Application to Inversion of Discrete Functions -- 3.1 On Interconnection Between Plain Partitionings and Cryptographic Attacks -- 3.2 Using Monte Carlo Method to Estimate Runtime of SAT-Based Guess-and-Determine Attacks -- 4 Practical Aspects of Evaluating Effectiveness of SAT Partitionings -- 4.1 Narrowing Search Space to SUPBS -- 4.2 Applications of Incremental SAT Solving -- 4.3 Finding Partitionings via Incremental SAT -- 5 Employed Optimization Algorithms -- 6 Experimental Results -- 6.1 Considered Problems -- 6.2 Implementations of Objective Functions -- 6.3 Finding Effective SAT Partitionings. 6.4 Solving Hard SAT Instances via Found Partitionings. |
Record Nr. | UNISA-996466410203316 |
Cham, Switzerland : , : Springer, , [2021] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Black box optimization, machine learning, and no-free lunch theorems / / Panos M. Pardalos, Varvara Rasskazova, Michael N. Vrahatis, editors |
Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
Descrizione fisica | 1 online resource (393 pages) |
Disciplina | 006.31 |
Collana | Springer Optimization and Its Applications |
Soggetto topico |
Machine learning - Mathematics
Aprenentatge automàtic Optimització matemàtica Algorismes computacionals |
Soggetto genere / forma | Llibres electrònics |
ISBN | 3-030-66515-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Intro -- Preface -- Contents -- Learning Enabled Constrained Black-Box Optimization -- 1 Introduction -- 2 Constrained Black-Box Optimization -- 3 The Basic Probabilistic Framework -- 3.1 Gaussian Processes -- 3.2 GP-Based Optimization -- 4 Constrained Bayesian Optimization -- 5 Constrained Bayesian Optimization for Partially Defined Objective Functions -- 6 Software for the Generation of Constrained Test Problems -- 6.1 Emmental-Type GKLS Generator -- 7 Conclusions -- References -- Black-Box Optimization: Methods and Applications -- 1 Introduction -- 2 Overview of BBO Methods -- 2.1 Direct Search Methods -- 2.1.1 Simplex Search -- 2.1.2 Coordinate Search -- 2.1.3 Generalized Pattern Search -- 2.1.4 Mesh Adaptive Direct Search -- 2.2 Model-Based Methods -- 2.2.1 Model-Based Trust Region -- 2.2.2 Projection-Based Methods -- 2.3 Heuristic Methods -- 2.3.1 DIRECT -- 2.3.2 Multilevel Coordinate Search -- 2.3.3 Hit-and-Run algorithms -- 2.3.4 Simulated Annealing -- 2.3.5 Genetic Algorithm -- 2.3.6 Particle Swarm Optimization -- 2.3.7 Surrogate Management Framework -- 2.3.8 Branch and Fit -- 2.4 Hybrid Methods -- 2.5 Extension to Constrained Problems -- 2.5.1 Penalty Method -- 2.5.2 Augmented Lagrangian -- 2.5.3 Filter Method -- 2.5.4 Surrogate Modeling -- 3 BBO Solvers -- 4 Recent Applications -- 4.1 Automatic Machine Learning -- 4.2 Optimization Solvers -- 4.3 Fluid Mechanics -- 4.4 Oilfield Development and Operations -- 4.5 Chemical and Biochemical Engineering -- 5 Open Problems and Future Research Directions -- References -- Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives -- 1 Introduction -- 2 Tuning: Strategies -- 2.1 Key Topics -- 2.2 Stochastic Optimization Algorithms -- 2.3 Algorithm Tuning -- 2.4 Example: Grefenstette's Study of Control Parameters for Genetic Algorithms.
2.5 No Free Lunch Theorems -- 2.6 Tuning for Deterministic Algorithms -- 3 Test Sets -- 3.1 Test Functions -- 3.2 Application Domains -- 3.2.1 Tuning in Industry -- 3.2.2 Energy -- 3.2.3 Water Industry -- 3.2.4 Steel Industry -- 3.2.5 Automotive -- 3.2.6 Information Technology -- 4 Statistical Considerations -- 4.1 Experimental Setup -- 4.2 Design of Experiments -- 4.3 Measuring Performance -- 4.4 Reporting Results -- 5 Parallelization -- 5.1 Overview -- 5.2 Simplistic Approaches -- 5.3 Parallelization in Surrogate Model-Based Optimization -- 5.3.1 Uncertainty-Based Methods -- 5.3.2 Surrogate-Assisted Algorithms -- 6 Tuning Approaches -- 6.1 Overview -- 6.2 Manual Tuning -- 6.3 Automatic Tuning -- 6.4 Interactive Tuning -- 6.5 Internal Tuning -- 7 Tuning Software -- 7.1 Overview -- 7.2 IRACE -- 7.3 SPOT -- 7.4 SMAC -- 7.5 ParamILS -- 7.6 GGA -- 7.7 Usability and Availability of Tuning Software -- 7.8 Example: SPOT -- 8 Research Directions and Open Problems -- 9 Summary and Outlook -- References -- Quality-Diversity Optimization: A Novel Branch of Stochastic Optimization -- 1 Introduction -- 2 Problem Formulation -- 2.1 Collections of Solutions -- 2.2 How Do We Measure the Performance of a QD Algorithm? -- 3 Optimizing a Collection of Solutions -- 3.1 MAP-Elites -- 3.2 A Unified Framework -- 3.2.1 Containers -- 3.2.2 Selection Operators -- 3.2.3 Population Scores -- 3.3 Considerations of Quality-Diversity Optimization -- 4 Origins and Related Work -- 4.1 Searching for Diverse Behaviors -- 4.2 Connections to Multimodal Optimization -- 4.3 Connections to Multitask Optimization -- 5 Current Topics -- 5.1 Expensive Objective Functions -- 5.2 High-Dimensional Feature Space -- 5.3 Learning the Behavior Descriptor -- 5.4 Improving Variation Operators -- 5.5 Noisy Functions -- 6 Conclusion -- References. Multi-Objective Evolutionary Algorithms: Past, Present, and Future -- 1 Introduction -- 2 Basic Concepts -- 3 The Past -- 3.1 Non-Elitist Non-Pareto Approaches -- 3.1.1 Linear Aggregating Functions -- 3.1.2 Vector Evaluated Genetic Algorithm (VEGA) -- 3.1.3 Lexicographic Ordering -- 3.1.4 Target-Vector Approaches -- 3.2 Non-Elitist Pareto-Based Approaches -- 3.2.1 Multi-Objective Genetic Algorithm (MOGA) -- 3.2.2 Nondominated Sorting Genetic Algorithm (NSGA) -- 3.2.3 Niched-Pareto Genetic Algorithm (NPGA) -- 3.3 Elitist Pareto-Based Approaches -- 3.3.1 The Strength Pareto Evolutionary Algorithm (SPEA) -- 3.3.2 The Pareto Archived Evolution Strategy (PAES) -- 3.3.3 The Nondominated Sorting Genetic Algorithm-II (NSGA-II) -- 4 The Present -- 4.1 Some Applications -- 5 The Future -- 6 Conclusions -- References -- Black-Box and Data-Driven Computation -- 1 Introduction -- 2 Black Box and Oracle -- 3 Reduction -- 4 Data-Driven Computation -- References -- Mathematically Rigorous Global Optimization and FuzzyOptimization -- 1 Introduction -- 2 Interval Analysis: Fundamentals and Philosophy -- 2.1 Overview -- 2.2 Interval Logic -- 2.3 Extensions -- 2.4 History and References -- 3 Fuzzy Sets: Fundamentals and Philosophy -- 3.1 Fuzzy Logic -- 3.2 A Brief History -- 4 The Branch and Bound Framework: Some Definitions and Details -- 5 Interval Technology: Some Details -- 5.1 Interval Newton Methods -- 5.2 Constraint Propagation -- 5.3 Relaxations -- 5.4 Interval Arithmetic Software -- 6 Fuzzy Technology: A Few Details -- 7 Conclusions -- References -- Optimization Under Uncertainty Explains Empirical Success of Deep Learning Heuristics -- 1 Formulation of the Problem -- 2 Why Rectified Linear Neurons Are Efficient: A Theoretical Explanation -- 3 Why Sigmoid Activation Functions -- 4 Selection of Poolings -- 5 Why Softmax -- 6 Which Averaging Should We Choose. 7 Proofs -- References -- Variable Neighborhood Programming as a Tool of Machine Learning -- 1 Introduction -- 2 Variable Neighborhood Search -- 3 Variable Neighborhood Programming -- 3.1 Solution Presentation -- 3.2 Neighborhood Structures -- 3.3 Elementary Tree Transformation in Automatic Programming -- 3.3.1 ETT in the Tree of an Undirected Graph -- 3.3.2 ETT in AP Tree -- 3.3.3 Bound on Cardinality of AP-ETT(T) -- 4 VNP for Symbolic Regression -- 4.1 Test Instances and Parameter Values -- 4.2 Comparison of BVNP with Other Methods -- 5 Life Expectancy Estimation as a Symbolic Regression Problem Solved by VNP: Case Study on Russian Districts -- 5.1 Life Expectancy Estimation as a Machine Learning Problem -- 5.2 VNP for Estimating Life Expectancy Problem -- 5.3 Case Study at Russian Districts -- 5.3.1 One-Attribute Analysis -- 5.3.2 Results and Discussion on 3-Attribute Data -- 5.4 Conclusions -- 6 Preventive Maintenance in Railway Planning as a Machine Learning Problem -- 6.1 Literature Review and Motivation -- 6.2 Reduced VNP for Solving the Preventive Maintenance Planning of Railway Infrastructure -- 6.2.1 Learning for Stage 1: Prediction -- 6.2.2 Learning for Stage 2: Classification -- 6.3 Computation Results -- 6.3.1 Prediction -- 6.3.2 Classification -- 6.4 Conclusions and Future Work -- 7 Conclusions -- References -- Non-lattice Covering and Quantization of High Dimensional Sets -- 1 Introduction -- 2 Weak Covering -- 2.1 Comparison of Designs from the View Point of Weak Covering -- 2.2 Reduction to the Probability of Covering a Point by One Ball -- 2.3 Designs of Theoretical Interest -- 3 Approximation of Cd(Zn,r) for Design 1 -- 3.1 Normal Approximation for PU,δ,α,r -- 3.2 Refined Approximation for PU,δ,α,r -- 3.3 Approximation for Cd(Zn,r) for Design 1 -- 4 Approximating Cd(Zn,r) for Design 2a -- 4.1 Normal Approximation for PU,δ,0,r. 4.2 Refined Approximation for PU,δ,0,r -- 4.3 Approximation for Cd(Zn,r) -- 5 Approximating Cd(Zn,r) for Design 2b -- 5.1 Establishing a Connection Between Sampling with and Without Replacement: General Case -- 5.2 Approximation of Cd(Zn,r) for Design 2b. -- 6 Numerical Study -- 6.1 Assessing Accuracy of Approximations of Cd(Zn,r) and Studying Their Dependence on δ -- 6.2 Comparison Across α -- 7 Quantization in a Cube -- 7.1 Quantization Error and Its Relation to Weak Covering -- 7.2 Quantization Error for Design 1 -- 7.3 Quantization Error for Design 2a -- 7.4 Quantization Error for Design 2b -- 7.5 Accuracy of Approximations for Quantization Error and the δ-Effect -- 8 Comparative Numerical Studies of Covering Properties for Several Designs -- 8.1 Covering Comparisons -- 8.2 Quantization Comparisons -- 9 Covering and Quantization in the d-Simplex -- 9.1 Characteristics of Interest -- 9.2 Numerical Investigation of the δ-Effect for d-Simplex -- 10 Appendix: An Auxiliary Lemma -- References -- Finding Effective SAT Partitionings Via Black-Box Optimization -- 1 Introduction -- 2 Preliminaries -- 2.1 Boolean Satisfiability Problem (SAT) -- 2.2 SAT-Based Cryptanalysis -- 3 Decomposition Sets and Backdoors in SAT with Application to Inversion of Discrete Functions -- 3.1 On Interconnection Between Plain Partitionings and Cryptographic Attacks -- 3.2 Using Monte Carlo Method to Estimate Runtime of SAT-Based Guess-and-Determine Attacks -- 4 Practical Aspects of Evaluating Effectiveness of SAT Partitionings -- 4.1 Narrowing Search Space to SUPBS -- 4.2 Applications of Incremental SAT Solving -- 4.3 Finding Partitionings via Incremental SAT -- 5 Employed Optimization Algorithms -- 6 Experimental Results -- 6.1 Considered Problems -- 6.2 Implementations of Objective Functions -- 6.3 Finding Effective SAT Partitionings. 6.4 Solving Hard SAT Instances via Found Partitionings. |
Record Nr. | UNINA-9910483695503321 |
Cham, Switzerland : , : Springer, , [2021] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Classification and Data Science in the Digital Age / / edited by Paula Brito, José G. Dias, Berthold Lausen, Angela Montanari, Rebecca Nugent |
Autore | Brito Paula |
Edizione | [1st ed. 2023.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 |
Descrizione fisica | 1 online resource (393 pages) |
Disciplina | 005.7 |
Altri autori (Persone) |
DiasJosé G
LausenBerthold MontanariAngela NugentRebecca |
Collana | Studies in Classification, Data Analysis, and Knowledge Organization |
Soggetto topico |
Artificial intelligence - Data processing
Machine learning Data mining Multivariate analysis Statistics - Computer programs Data Science Statistical Learning Machine Learning Data Mining and Knowledge Discovery Multivariate Analysis Statistical Software Intel·ligència artificial Aprenentatge automàtic Mineria de dades Anàlisi multivariable |
Soggetto genere / forma | Llibres electrònics |
ISBN | 3-031-09034-9 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Preface -- R. Abdesselam: A Topological Clustering of Individuals -- C. Anton and I. Smith: Model Based Clustering of Functional Data with Mild Outliers -- F. Antonazzo and S. Ingrassia: A Trivariate Geometric Classification of Decision Boundaries for Mixtures of Regressions -- E. Arnone, E. Cunial, and L. M. Sangalli: Generalized Spatio-temporal Regression with PDE Penalization -- R. Ascari and S. Migliorati: A New Regression Model for the Analysis of Microbiome Data -- R. Aschenbruck, G. Szepannek, and A. F. X. Wilhelm: Stability of Mixed-type Cluster Partitions for Determination of the Number of Clusters -- A. Ashofteh and P. Campos: A Review on Official Survey Item Classification for Mixed-Mode Effects Adjustment -- V. Batagelj: Clustering and Blockmodeling Temporal Networks – Two Indirect Approaches -- R. Boutalbi, L. Labiod, and M. Nadif: Latent Block Regression Model -- N. Chabane, M. Achraf Bouaoune, R. Amir Sofiane Tighilt, B. Mazoure, N. Tahiri, and V. Makarenkov: Using Clustering and Machine Learning Methods to Provide Intelligent Grocery Shopping Recommendations -- T. Chadjipadelis and S. Magopoulou: COVID-19 Pandemic: a Methodological Model for the Analysis of Government’s Preventing Measures and Health Data Records -- J. Champagne Gareau, É. Beaudry, and V. Makarenkov: pcTVI: Parallel MDP Solver Using a Decomposition into Independent Chains -- C. Di Nuzzo and S. Ingrassia: Three-way Spectral Clustering -- J. Dobša and H. A. L. Kiers: Improving Classification of Documents by Semi-supervised Clustering in a Semantic Space -- J. Gama: Trends in Data Stream Mining -- L. A. García-Escudero, A. Mayo-Iscar, G. Morelli, and M. Riani: Old and New Constraints in Model Based Clustering -- V. G Genova, G. Giordano, G . Ragozini, and M. Prosperina Vitale: Clustering Student Mobility Data in 3-way Networks -- R. Giubilei: Clustering Brain Connectomes Through a Density-peak Approach -- T. Górecki, M. Šuczak, and P. Piasecki: Similarity Forest for Time Series Classification -- K. Hayashi, E. Hoshino, M. Suzuki, E. Nakanishi, K. Sakai, and M. Obatake: Detection of the Biliary Atresia Using Deep Convolutional Neural Networks Based on Statistical Learning Weights via Optimal Similarity and Resampling Methods -- Ch. Hennig: Some Issues in Robust Clustering -- J. Kalina and P. Janá£ek: Robustness Aspects of Optimized Centroids -- L. Labiod and M. Nadif: Data Clustering and Representation Learning Based on Networked Data -- Lazhar Labiod and Mohamed Nadif: Towards a Bi-stochastic Matrix Approximation of k-means and Some Variants -- A. LaLonde, T. Love, D. R. Young, and T. Wu: Clustering Adolescent Female Physical Activity Levels with an Infinite Mixture Model on Random Effects -- Á. López-Oriona, J. A. Vilar, and P. D’Urso: Unsupervised Classification of Categorical Time Series Through Innovative Distances -- D. Masís, E. Segura, J. Trejos, and A. Xavier: Fuzzy Clustering by Hyperbolic Smoothing -- R. Meng, H. K. H. Lee, and K. Bouchard: Stochastic Collapsed Variational Inference for Structured Gaussian Process Regression Networks -- H. Duy Nguyen, F. Forbes, G. Fort, and O. Cappé: An Online Minorization-Maximization Algorithm -- L. Palazzo and R. Ievoli: Detecting Differences in Italian Regional Health Services During Two Covid-19 Waves -- G. Panagiotidou and T. Chadjipadelis: Political and Religion Attitudes in Greece: Behavioral Discourses -- K. Pawlasová, I. Karafiátová, and J. Dvořák: Supervised Classification via Neural Networks for Replicated Point Patterns -- G. Perrone and G. Soffritti: Parsimonious Mixtures of Seemingly Unrelated Contaminated Normal Regression Models -- N. Pronello, R. Ignaccolo, L. Ippoliti, and S. Fontanella: Penalized Model-based Functional Clustering: a Regularization Approach via Shrinkage Methods -- D. Rodrigues, L. P. Reis, and B. M. Faria: Emotion Classification Based on Single Electrode Brain Data: Applications for Assistive Technology -- R. Scimone, A. Menafoglio, L. M. Sangalli, and P. Secchi: The Death Process in Italy Before and During the Covid-19 Pandemic: a Functional Compositional Approach -- O. Silva, Á. Sousa, and H. Bacelar-Nicolau: Clustering Validation in the Context of Hierarchical Cluster Analysis: an Empirical Study -- C. Silvestre, M. G. M. S. Cardoso, and M. Figueiredo: An MML Embedded Approach for Estimating the Number of Clusters -- Á. Sousa, O. Silva, M. Graça Batista, S. Cabral, and H. Bacelar-Nicolau: Typology of Motivation Factors for Employees in the Banking Sector: An Empirical Study Using Multivariate Data Analysis Methods -- J. Michael Spoor, J. Weber, and J. Ovtcharova: A Proposal for Formalization and Definition of Anomalies in Dynamical Systems -- N. Tahiri and A. Koshkarov: New Metrics for Classifying Phylogenetic Trees Using -means and the Symmetric Difference Metric -- S. D. Tomarchio: On Parsimonious Modelling via Matrix-variate t Mixtures -- G. Zammarchi, M. Romano, and C. Conversano: Evolution of Media Coverage on Climate Change and Environmental Awareness: an Analysis of Tweets from UK and US Newspapers. |
Record Nr. | UNINA-9910768481303321 |
Brito Paula | ||
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Coherence [[electronic resource] ] : In Signal Processing and Machine Learning / / by David Ramírez, Ignacio Santamaría, Louis Scharf |
Autore | Ramirez David |
Edizione | [1st ed. 2022.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
Descrizione fisica | 1 online resource (495 pages) |
Disciplina | 006.31 |
Soggetto topico |
Signal processing
Computer science - Mathematics Mathematical statistics Machine learning Signal, Speech and Image Processing Probability and Statistics in Computer Science Machine Learning Processament de senyals Aprenentatge automàtic |
Soggetto genere / forma | Llibres electrònics |
ISBN | 3-031-13331-5 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Introduction -- Historical perspective, motivating problems, and preview of what is to come -- Least Squares and related -- Classical correlations and coherence -- Coherence in the multivariate normal (MVN) model -- Classical tests for correlation -- One-channel matched subspace detectors -- Adaptive subspace detectors -- Two channel matched subspace detectors -- Detection of spatially-correlated time series -- Coherence and the detection of cyclostationarity -- Partial coherence for testing causality -- Subspace averaging -- Coherence and performance bounds -- Variations on coherence -- Conclusion. |
Record Nr. | UNISA-996503549103316 |
Ramirez David | ||
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Coherence : In Signal Processing and Machine Learning / / by David Ramírez, Ignacio Santamaría, Louis Scharf |
Autore | Ramirez David |
Edizione | [1st ed. 2022.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
Descrizione fisica | 1 online resource (495 pages) |
Disciplina |
006.31
621.3822 |
Soggetto topico |
Signal processing
Computer science - Mathematics Mathematical statistics Machine learning Signal, Speech and Image Processing Probability and Statistics in Computer Science Machine Learning Processament de senyals Aprenentatge automàtic |
Soggetto genere / forma | Llibres electrònics |
ISBN | 3-031-13331-5 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Introduction -- Historical perspective, motivating problems, and preview of what is to come -- Least Squares and related -- Classical correlations and coherence -- Coherence in the multivariate normal (MVN) model -- Classical tests for correlation -- One-channel matched subspace detectors -- Adaptive subspace detectors -- Two channel matched subspace detectors -- Detection of spatially-correlated time series -- Coherence and the detection of cyclostationarity -- Partial coherence for testing causality -- Subspace averaging -- Coherence and performance bounds -- Variations on coherence -- Conclusion. |
Record Nr. | UNINA-9910637713703321 |
Ramirez David | ||
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|