Classification, Data Analysis, and Data Highways Proccedings of the 21th Annual Conference of the Gesellschaft für Klassifikation, University of Potsdam, March 12-14, 1997
-
- Englisch ausgewählt
95,99 €
UVP
109,99 €
inkl. gesetzl. MwSt.,
Beschreibung
Produktdetails
Einband
Taschenbuch
Erscheinungsdatum
19.02.1998
Herausgeber
Ingo Balderjahn + weitereVerlag
Springer BerlinSeitenzahl
414
Maße (L/B/H)
24,2/17/2,2 cm
Gewicht
688 g
Auflage
1. Auflage
Sprache
Englisch
ISBN
978-3-540-63909-1
1: Classification and Data Analysis.- Entropy Optimizing Methods for the Estimation of Tables.- Automatic Spectral Classification.- An Approach to Modelling Directional and Betweenness Data.- The Application of Random Coincidence Graphs for Testing the Homogeneity of Data.- City-Block Scaling: Smoothing Strategies for Avoiding Local Minima.- Probability Models and Limit Theorems for Random Interval Graphs with Applications to Cluster Analysis.- Labor Supply Decisions in Germany A Semiparametric Regression Analysis.- A Multiplicative Approach to Partitioning the Risk of Disease.- Multiple Media Stream Data Analysis: Theory and Applications.- Multimedia Data Analysis using ImageTcl.- Robust Bivariate Boxplots and Visualization of Multivariate Data.- Unsupervised Fuzzy Classification of Multispectral Imagery Using Spatial-Spectral Features.- 2: Mathematical and Statistical Methods.- Some News about C.A.MAN Computer Assisted Analysis of Mixtures.- Mathematical Aspects of the Feature Pattern Analysis.- A Note on the Off-Block-Diagonal Approximation of the Burt Matrix as Applied in Joint Correspondence Analysis.- A New Look at the Visual Performance of Nonparametric Hazard Rate Estimators.- Multilevel Modeling: When and Why.- Upper Bounds for the P-Values of a Scan Statistic with a Variable Window.- A Branch-and-bound Algorithm for Boolean Regression.- Mathematical Classification and Clustering: From How to What and Why.- Heteroskedastic Linear Regression Models - A Bayesian Analysis.- A Heuristic Partial-Least-Squares Approach to Estimating Dynamic Path Models.- 3: World Wide Web and the Internet.- Using Logic for the Specification of Hypermedia Documents.- Project TeleTeaching Mannheim - Heidelberg.- WWW-Access to Relational Databases.- Technology, Data, Relevancy: ACulture-Theoretical Look at the Internet.- Self-Organizing Maps of Very Large Document Collections: Justification for the WEBSOM Method.- Segment-Specific Aspects of Designing Online Services in the Internet.- Design of World Wide Web Information Systems.- Large WWW Systems: New Phenomena, Problems and Solutions.- Structured Visualization of Search Result List.- 4: Speech and Pattern Recognition.- Application of Discriminative Methods for Isolated Word Recognition.- Statistical Classifiers in Computer Vision.- Speech Signal Classification with Hybrid Systems.- Stochastic Modelling of Knowledge Sources in Automatic Speech Recognition.- Classification of Speech Pattern Using Locally Recurrent Neural Networks.- 5: Knowledge and Databases.- Information Gathering for Vague Queries Using Case Retrieval Nets.- Characterizing Bibliographic Databases by Content an Experimental Approach.- Medoc Searching Heterogeneous Bibliographic and Text Databases.- Supervised Learning with Qualitative and Mixed Attributes.- 6: Marketing.- A Comparison of Traditional Segmentation Methods with Segmentation Based upon Artificial Neural Networks by Means of Conjoint Data from a Monte-Carlo-Simulation.- Classification of Pricing Strategies in a Competitive Environment.- Predicting the Amount of Purchase by a Procedure Using Multidimensional Scaling: An Application to Scanner Data on Beer.- Author and Subject Index.
Noch keine Bewertungen vorhanden
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.
Kurze Frage zu unserer Seite
Vielen Dank für Ihr Feedback
Wir nutzen Ihr Feedback, um unsere Produktseiten zu verbessern. Bitte haben Sie Verständnis, dass wir Ihnen keine Rückmeldung geben können. Falls Sie Kontakt mit uns aufnehmen möchten, können Sie sich aber gerne an unseren Kund*innenservice wenden.
zum Kundenservice