Cantitate/Preț
Produs
Total produse
Vezi coșul
Clusters, Orders, and Trees: Methods and Applications: In Honor of Boris Mirkin's 70th Birthday de Fuad Aleskerov

Clusters, Orders, and Trees: Methods and Applications: In Honor of Boris Mirkin's 70th Birthday: Springer Optimization and Its Applications, cartea 92

Editat de Fuad Aleskerov, Boris Goldengorin, Panos M. Pardalos
en Limba Engleză Hardback – 12 iun 2014
The volume is dedicated to Boris Mirkin on the occasion of his 70th birthday. In addition to his startling PhD results in abstract automata theory, Mirkin’s ground breaking contributions in various fields of decision making and data analysis have marked the fourth quarter of the 20th century and beyond. Mirkin has done pioneering work in group choice, clustering, data mining and knowledge discovery aimed at finding and describing non-trivial or hidden structures—first of all, clusters, orderings and hierarchies—in multivariate and/or network data.
This volume contains a collection of papers reflecting recent developments rooted in Mirkin’s fundamental contribution to the state-of-the-art in group choice, ordering, clustering, data mining and knowledge discovery. Researchers, students and software engineers will benefit from new knowledge discovery techniques and application directions.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 63825 lei  43-57 zile
  Springer – 23 aug 2016 63825 lei  43-57 zile
Hardback (1) 64451 lei  43-57 zile
  Springer – 12 iun 2014 64451 lei  43-57 zile

Din seria Springer Optimization and Its Applications

  • 15% Numerical Optimization with Computational Errors
    Preț: 62902 lei
  • 15% Optimization Methods and Applications: In Honor of Ivan V. Sergienko's 80th Birthday
    Preț: 65117 lei
  • 18% Computational Mathematics and Variational Analysis
    Preț: 94207 lei
  • 17% Introduction to Geometric Control
    Preț: 36079 lei
  • 17% Graph and Network Theory: An Applied Approach using Mathematica®
    Preț: 46829 lei
  • Introduction to Combinatorial Optimization
    Preț: 36101 lei
  • 18% Polynomial Optimization, Moments, and Applications
    Preț: 77196 lei
  • 17% Introduction to Applied Optimization
    Preț: 39779 lei
  • 18% Optimization Theory and Methods: Nonlinear Programming
    Preț: 111033 lei
  • 15% Nonsmooth Vector Functions and Continuous Optimization
    Preț: 63336 lei
  • 15% Network Models in Economics and Finance
    Preț: 63432 lei
  • Optimization Models in a Transition Economy
    Preț: 39243 lei
  • Selected Applications of Convex Optimization
    Preț: 37259 lei
  • Turnpike Theory of Continuous-Time Linear Optimal Control Problems
    Preț: 38390 lei
  • Optimized Packings with Applications
    Preț: 38848 lei
  • An Introduction to Optimal Satellite Range Scheduling
    Preț: 53524 lei
  • 15% Advances in Stochastic and Deterministic Global Optimization
    Preț: 63495 lei
  • Advances in Mathematical Modeling, Optimization and Optimal Control
    Preț: 38241 lei
  • 15% Optimization and Control of Bilinear Systems: Theory, Algorithms, and Applications
    Preț: 63673 lei
  • 24% Convex Analysis and Global Optimization
    Preț: 61155 lei
  • 18% Mathematical Analysis, Approximation Theory and Their Applications
    Preț: 95291 lei
  • 20% Approximate Solutions of Common Fixed-Point Problems
    Preț: 58591 lei
  • 15% Operations Research, Engineering, and Cyber Security: Trends in Applied Mathematics and Technology
    Preț: 69573 lei
  • 18% Space Engineering: Modeling and Optimization with Case Studies
    Preț: 72759 lei
  • 15% Optimization and Its Applications in Control and Data Sciences: In Honor of Boris T. Polyak’s 80th Birthday
    Preț: 64492 lei
  • 15% Variational Analysis and Aerospace Engineering: Mathematical Challenges for the Aerospace of the Future
    Preț: 64570 lei
  • 18% Progress in Approximation Theory and Applicable Complex Analysis: In Memory of Q.I. Rahman
    Preț: 73008 lei
  • 15% Spatial Interaction Models: Facility Location Using Game Theory
    Preț: 69106 lei
  • 20% Discrete-Time Optimal Control and Games on Large Intervals
    Preț: 58107 lei

Preț: 64451 lei

Preț vechi: 80563 lei
-20% Nou

Puncte Express: 967
Preț estimativ în valută:
12335€ • 12812$ • 10246£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781493907410
ISBN-10: 1493907417
Pagini: 416
Ilustrații: XI, 404 p. 80 illus., 28 illus. in color.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.76 kg
Ediția:2014
Editura: Springer
Colecția Springer
Seria Springer Optimization and Its Applications

Locul publicării:New York, NY, United States

Public țintă

Research

Cuprins

Three and One Questions to Dr. B. Mirkin about Complexity Statistics (I. Mandel).- Section 1.- A Polynomial Algorithm for a Class of 0-1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (P. Hansen, C. Meyer).- Experiments with a Non-Convex Variance-Based Clustering Criterion (R.F. Toso, E.V. Bauman, C.A. Kulikowski, I.B. Muchnik).- Strategy-Proof Location Functions on Finite Graphs (F.R. McMorris, H.M. Mulder, F.S. Roberts).- A Pseudo-Boolean Approach to the Market Graph Analysis by Means of the p-Median Model (B. Goldengorin, A. Kocheturov, P.M. Pardalos).- Clustering as an Approach to 3D Reconstruction Problems (S. Archangelski, I. Muchnik).- Selecting the Minkowski Exponent for Intelligent K-Means with Feature Weighting (R. Cordeiro de Amorim, B. Mirkin).- High Dimensional Data Classification (V. Pappu, P.M. Pardalos).- Algorithm FRiS-TDR for Generalized Classification of the Labeled, Semi-Labeled and Unlabeled Datasets (I.A. Borisova, N.G. Zagoruiko).- From Separating to Proximal Plane Classifiers: A Review (M.B. Ferraro, M.R. Guarracino).- A Note on the Effectiveness of the Least Squares Consensus Clustering (B. Mirkin, A. Shestakov).- Section 2.- Single or Multiple Consensus for Linear Orders (A. Guenoche).- Choice Functions on Tree Quasi-Orders (R.C. Powers, F. McMorris).- Weak Hierarchies: a Central Clustering Structure (P. Bertrand, J. Diatta).- Some Observations on Oligarchies, Internal Direct Sums and Lattice Congruences (M.F. Janowitz).- Thinking Ultrametrically, Thinking p-Adically (F. Murtagh).- A New Algorithm for Inferring Hybridization Events Based on the Detection of Horizontal Gene Transfers (V. Makarenkov, A. Box, P. Legendre).- Section 3.- Meaningless Statements in Landscape Ecology and Sustainable Environments (F. Roberts).- Nearest Neighbour in Least Squares Data Imputation Algorithms for Marketing Data (I. Wasito). An AST Method for Scoring String-to-Text Similarity in Semantic Text Analysis (K. Chernyak, B. Mirkin).- Improving Web Search Relevance with Learning Structure of Domain Concepts (B. Galitsky, B. Kovalerchuk).- Linear Regression via Elastic Net: Non-Enumerative Leave-One-Out Verification of Feature Selection (E. Chernousova, N. Razin, O. Krasotkina, V. Mottl, D. Windridge).- The Manipulability Index in the IANC Model (Y. Veselova).

Textul de pe ultima copertă

The volume is dedicated to Boris Mirkin on the occasion of his 70th birthday. In addition to his startling PhD results in abstract automata theory, Mirkin’s ground breaking contributions in various fields of decision making and data analysis have marked the fourth quarter of the 20th century and beyond. Mirkin has done pioneering work in group choice, clustering, data mining and knowledge discovery aimed at finding and describing non-trivial or hidden structures—first of all, clusters, orderings, and hierarchies—in multivariate and/or network data.

This volume contains a collection of papers reflecting recent developments rooted in Mirkin's fundamental contribution to the state-of-the-art in group choice, ordering, clustering, data mining, and knowledge discovery. Researchers, students, and software engineers will benefit from new knowledge discovery techniques and application directions.

Caracteristici

Contains new models and algorithms for knowledge discoveries Features new tools for developing practical algorithms for solving problems in data analysis Opens a new direction in addressing difficult questions in data analysis for either well-known tools (like K-means) or recently developed advanced tools Includes supplementary material: sn.pub/extras