Author: Panos M. Pardalos
Publisher: Springer
ISBN: 3319991426
Category : Mathematics
Languages : en
Pages : 341
Get Book Here
Book Description
Computational and theoretical open problems in optimization, computational geometry, data science, logistics, statistics, supply chain modeling, and data analysis are examined in this book. Each contribution provides the fundamentals needed to fully comprehend the impact of individual problems. Current theoretical, algorithmic, and practical methods used to circumvent each problem are provided to stimulate a new effort towards innovative and efficient solutions. Aimed towards graduate students and researchers in mathematics, optimization, operations research, quantitative logistics, data analysis, and statistics, this book provides a broad comprehensive approach to understanding the significance of specific challenging or open problems within each discipline. The contributions contained in this book are based on lectures focused on “Challenges and Open Problems in Optimization and Data Science” presented at the Deucalion Summer Institute for Advanced Studies in Optimization, Mathematics, and Data Science in August 2016.
Author: Stephen J. Wright
Publisher: Cambridge University Press
ISBN: 1316518981
Category : Computers
Languages : en
Pages : 239
Get Book Here
Book Description
A concise text that presents and analyzes the fundamental techniques and methods in optimization that are useful in data science.
Author: Boris Goldengorin
Publisher: Springer
ISBN: 3319420569
Category : Mathematics
Languages : en
Pages : 516
Get Book Here
Book Description
This book focuses on recent research in modern optimization and its implications in control and data analysis. This book is a collection of papers from the conference “Optimization and Its Applications in Control and Data Science” dedicated to Professor Boris T. Polyak, which was held in Moscow, Russia on May 13-15, 2015. This book reflects developments in theory and applications rooted by Professor Polyak’s fundamental contributions to constrained and unconstrained optimization, differentiable and nonsmooth functions, control theory and approximation. Each paper focuses on techniques for solving complex optimization problems in different application areas and recent developments in optimization theory and methods. Open problems in optimization, game theory and control theory are included in this collection which will interest engineers and researchers working with efficient algorithms and software for solving optimization problems in market and data analysis. Theoreticians in operations research, applied mathematics, algorithm design, artificial intelligence, machine learning, and software engineering will find this book useful and graduate students will find the state-of-the-art research valuable.
Author: Li M. Chen
Publisher: Springer
ISBN: 3319251279
Category : Computers
Languages : en
Pages : 219
Get Book Here
Book Description
This book describes current problems in data science and Big Data. Key topics are data classification, Graph Cut, the Laplacian Matrix, Google Page Rank, efficient algorithms, hardness of problems, different types of big data, geometric data structures, topological data processing, and various learning methods. For unsolved problems such as incomplete data relation and reconstruction, the book includes possible solutions and both statistical and computational methods for data analysis. Initial chapters focus on exploring the properties of incomplete data sets and partial-connectedness among data points or data sets. Discussions also cover the completion problem of Netflix matrix; machine learning method on massive data sets; image segmentation and video search. This book introduces software tools for data science and Big Data such MapReduce, Hadoop, and Spark. This book contains three parts. The first part explores the fundamental tools of data science. It includes basic graph theoretical methods, statistical and AI methods for massive data sets. In second part, chapters focus on the procedural treatment of data science problems including machine learning methods, mathematical image and video processing, topological data analysis, and statistical methods. The final section provides case studies on special topics in variational learning, manifold learning, business and financial data rec overy, geometric search, and computing models. Mathematical Problems in Data Science is a valuable resource for researchers and professionals working in data science, information systems and networks. Advanced-level students studying computer science, electrical engineering and mathematics will also find the content helpful.
Author: Boris Goldengorin
Publisher: Springer
ISBN: 331994830X
Category : Mathematics
Languages : en
Pages : 341
Get Book Here
Book Description
This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutin’s fundamental contributions to advanced methods and techniques in combinatorial optimization. Researchers, students, and engineers in computer science, big data, applied mathematics, operations research, algorithm design, artificial intelligence, software engineering, data analysis, industrial and systems engineering will benefit from the state-of-the-art results presented in modern graph theory and its applications to the design of efficient algorithms for optimization problems. Topics covered in this work include: · Algorithmic aspects of problems with disjoint cycles in graphs · Graphs where maximal cliques and stable sets intersect · The maximum independent set problem with special classes · A general technique for heuristic algorithms for optimization problems · The network design problem with cut constraints · Algorithms for computing the frustration index of a signed graph · A heuristic approach for studying the patrol problem on a graph · Minimum possible sum and product of the proper connection number · Structural and algorithmic results on branchings in digraphs · Improved upper bounds for Korkel--Ghosh benchmark SPLP instances
Author: National Research Council
Publisher: National Academies Press
ISBN: 0309287812
Category : Mathematics
Languages : en
Pages : 191
Get Book Here
Book Description
Data mining of massive data sets is transforming the way we think about crisis response, marketing, entertainment, cybersecurity and national intelligence. Collections of documents, images, videos, and networks are being thought of not merely as bit strings to be stored, indexed, and retrieved, but as potential sources of discovery and knowledge, requiring sophisticated analysis techniques that go far beyond classical indexing and keyword counting, aiming to find relational and semantic interpretations of the phenomena underlying the data. Frontiers in Massive Data Analysis examines the frontier of analyzing massive amounts of data, whether in a static database or streaming through a system. Data at that scale-terabytes and petabytes-is increasingly common in science (e.g., particle physics, remote sensing, genomics), Internet commerce, business analytics, national security, communications, and elsewhere. The tools that work to infer knowledge from data at smaller scales do not necessarily work, or work well, at such massive scale. New tools, skills, and approaches are necessary, and this report identifies many of them, plus promising research directions to explore. Frontiers in Massive Data Analysis discusses pitfalls in trying to infer knowledge from massive data, and it characterizes seven major classes of computation that are common in the analysis of massive data. Overall, this report illustrates the cross-disciplinary knowledge-from computer science, statistics, machine learning, and application disciplines-that must be brought to bear to make useful inferences from massive data.
Author: Anton Eremeev
Publisher: Springer
ISBN: 3319938002
Category : Computers
Languages : en
Pages : 351
Get Book Here
Book Description
This book constitutes extended, revised and selected papers from the 7th International Conference on Optimization Problems and Their Applications, OPTA 2018, held in Omsk, Russia in July 2018. The 27 papers presented in this volume were carefully reviewed and selected from a total of 73 submissions. The papers are listed in thematic sections, namely location problems, scheduling and routing problems, optimization problems in data analysis, mathematical programming, game theory and economical applications, applied optimization problems and metaheuristics.
Author: Ilya Bychkov
Publisher: Springer Nature
ISBN: 3030371573
Category : Mathematics
Languages : en
Pages : 251
Get Book Here
Book Description
This proceedings presents the result of the 8th International Conference in Network Analysis, held at the Higher School of Economics, Moscow, in May 2018. The conference brought together scientists, engineers, and researchers from academia, industry, and government. Contributions in this book focus on the development of network algorithms for data mining and its applications. Researchers and students in mathematics, economics, statistics, computer science, and engineering find this collection a valuable resource filled with the latest research in network analysis. Computational aspects and applications of large-scale networks in market models, neural networks, social networks, power transmission grids, maximum clique problem, telecommunication networks, and complexity graphs are included with new tools for efficient network analysis of large-scale networks. Machine learning techniques in network settings including community detection, clustering, and biclustering algorithms are presented with applications to social network analysis.
Author: Dimitris Souravlias
Publisher: Springer Nature
ISBN: 3030685144
Category : Business & Economics
Languages : en
Pages : 98
Get Book Here
Book Description
This book covers algorithm portfolios, multi-method schemes that harness optimization algorithms into a joint framework to solve optimization problems. It is expected to be a primary reference point for researchers and doctoral students in relevant domains that seek a quick exposure to the field. The presentation focuses primarily on the applicability of the methods and the non-expert reader will find this book useful for starting designing and implementing algorithm portfolios. The book familiarizes the reader with algorithm portfolios through current advances, applications, and open problems. Fundamental issues in building effective and efficient algorithm portfolios such as selection of constituent algorithms, allocation of computational resources, interaction between algorithms and parallelism vs. sequential implementations are discussed. Several new applications are analyzed and insights on the underlying algorithmic designs are provided. Future directions, new challenges, and open problems in the design of algorithm portfolios and applications are explored to further motivate research in this field.
Author: Stephen P. Boyd
Publisher: Cambridge University Press
ISBN: 9780521833783
Category : Business & Economics
Languages : en
Pages : 744
Get Book Here
Book Description
Convex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how such problems can be solved numerically with great efficiency. The book begins with the basic elements of convex sets and functions, and then describes various classes of convex optimization problems. Duality and approximation techniques are then covered, as are statistical estimation techniques. Various geometrical problems are then presented, and there is detailed discussion of unconstrained and constrained minimization problems, and interior-point methods. The focus of the book is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance and economics.
