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ă Paperback – 23 aug 2016

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

	Preț	Express
Paperback (1)	638^.25 lei 6-8 săpt.
Springer – 23 aug 2016	638^.25 lei 6-8 săpt.
Hardback (1)	644^.51 lei 6-8 săpt.
Springer – 12 iun 2014	644^.51 lei 6-8 săpt.

Din seria Springer Optimization and Its Applications

15%

Preț: 629^.02 lei
15%

Preț: 651^.17 lei
14%

Preț: 988^.03 lei
17%

Preț: 360^.79 lei
17%

Preț: 468^.29 lei
Preț: 361^.01 lei
18%

Preț: 771^.96 lei
17%

Preț: 397^.79 lei
18%

Preț: 1110^.33 lei
15%

Preț: 633^.36 lei
15%

Preț: 634^.32 lei
Preț: 392^.43 lei
Preț: 372^.24 lei
Preț: 383^.90 lei
Preț: 388^.48 lei
Preț: 535^.24 lei
15%

Preț: 634^.32 lei
Preț: 382^.41 lei
15%

Preț: 636^.73 lei
24%

Preț: 611^.55 lei
18%

Preț: 952^.91 lei
20%

Preț: 585^.91 lei
15%

Preț: 695^.73 lei
18%

Preț: 727^.59 lei
15%

Preț: 644^.92 lei
15%

Preț: 645^.70 lei
18%

Preț: 730^.08 lei
15%

Preț: 691^.06 lei
20%

Preț: 581^.07 lei

Preț: 638^.25 lei

Preț vechi: 797^.81 lei
-20% Nou

Puncte Express: 957

:
122^.16€ • 128^.16$ • 101^.34£

Carte tipărită la comandă

Livrare economică 29 ianuarie-12 februarie 25

Adaugă în coș

Wish list
Gift list
Am citit!

Adaugă în listă

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781493947997
ISBN-10: 1493947990
Pagini: 416
Ilustrații: XI, 404 p. 80 illus., 28 illus. in color.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.58 kg
Ediția:Softcover reprint of the original 1st ed. 2014
Editura: Springer
Colecția Springer
Seria Springer Optimization and Its Applications

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

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

Papetărie, jocuri, reviste