Knowledge Discovery in Databases: PKDD 2003: 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, Cavtat-Dubrovnik, Croatia, September 22-26, 2003, Proceedings: Lecture Notes in Computer Science, cartea 2838
Editat de Nada Lavrač, Dragan Gamberger, Hendrik Blockeel, Ljupco Todorovskien Limba Engleză Paperback – 11 sep 2003
Din seria Lecture Notes in Computer Science
- 20% Preț: 1021.30 lei
- 20% Preț: 337.03 lei
- 20% Preț: 340.22 lei
- 20% Preț: 256.27 lei
- 20% Preț: 324.32 lei
- 20% Preț: 438.69 lei
- 20% Preț: 315.78 lei
- 20% Preț: 327.52 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 557.41 lei
- 20% Preț: 561.37 lei
- 15% Preț: 558.56 lei
- 20% Preț: 238.01 lei
- 20% Preț: 504.57 lei
- 20% Preț: 329.09 lei
- 20% Preț: 563.75 lei
- 20% Preț: 630.24 lei
- 20% Preț: 321.96 lei
- 20% Preț: 1361.10 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.39 lei
- Preț: 366.90 lei
- 20% Preț: 172.69 lei
- 20% Preț: 315.19 lei
- 20% Preț: 985.59 lei
- 20% Preț: 620.87 lei
- 20% Preț: 436.22 lei
- 20% Preț: 734.34 lei
- 20% Preț: 1034.49 lei
- 17% Preț: 360.19 lei
- 20% Preț: 309.90 lei
- 20% Preț: 573.92 lei
- 20% Preț: 301.95 lei
- 20% Preț: 307.71 lei
- 20% Preț: 369.12 lei
- 20% Preț: 327.52 lei
- 20% Preț: 794.65 lei
- 20% Preț: 569.16 lei
- Preț: 395.43 lei
- 20% Preț: 1138.26 lei
- 20% Preț: 734.34 lei
- 20% Preț: 315.78 lei
- 20% Preț: 330.70 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.98 lei
Preț: 649.13 lei
Preț vechi: 811.42 lei
-20% Nou
Puncte Express: 974
Preț estimativ în valută:
124.23€ • 131.05$ • 103.83£
124.23€ • 131.05$ • 103.83£
Carte tipărită la comandă
Livrare economică 01-15 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540200857
ISBN-10: 3540200851
Pagini: 528
Ilustrații: XVI, 512 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 1.22 kg
Ediția:2003
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540200851
Pagini: 528
Ilustrații: XVI, 512 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 1.22 kg
Ediția:2003
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Papers.- From Knowledge-Based to Skill-Based Systems: Sailing as a Machine Learning Challenge.- Two-Eyed Algorithms and Problems.- Next Generation Data Mining Tools: Power Laws and Self-similarity for Graphs, Streams and Traditional Data.- Taking Causality Seriously: Propensity Score Methodology Applied to Estimate the Effects of Marketing Interventions.- Contributed Papers.- Efficient Statistical Pruning of Association Rules.- Majority Classification by Means of Association Rules.- Adaptive Constraint Pushing in Frequent Pattern Mining.- ExAnte: Anticipated Data Reduction in Constrained Pattern Mining.- Minimal k-Free Representations of Frequent Sets.- Discovering Unbounded Episodes in Sequential Data.- Mr-SBC: A Multi-relational Naïve Bayes Classifier.- SMOTEBoost: Improving Prediction of the Minority Class in Boosting.- Using Belief Networks and Fisher Kernels for Structured Document Classification.- A Skeleton-Based Approach to Learning Bayesian Networks from Data.- On Decision Boundaries of Naïve Bayes in Continuous Domains.- Application of Inductive Logic Programming to Structure-Based Drug Design.- Visualizing Class Probability Estimators.- Automated Detection of Epidemics from the Usage Logs of a Physicians’ Reference Database.- An Indiscernibility-Based Clustering Method with Iterative Refinement of Equivalence Relations.- Preference Mining: A Novel Approach on Mining User Preferences for Personalized Applications.- Explaining Text Clustering Results Using Semantic Structures.- Analyzing Attribute Dependencies.- Ranking Interesting Subspaces for Clustering High Dimensional Data.- Efficiently Finding Arbitrarily Scaled Patterns in Massive Time Series Databases.- Using Transduction and Multi-view Learning to Answer Emails.- Exploring Fringe Settings of SVMs for Classification.- Rule Discovery and Probabilistic Modeling for Onomastic Data.- Constraint-Based Mining of Sequential Patterns over Datasets with Consecutive Repetitions.- Symbolic Distance Measurements Based on Characteristic Subspaces.- The Pattern Ordering Problem.- Collaborative Filtering Using Restoration Operators.- Efficient Frequent Query Discovery in Farmer.- Towards Behaviometric Security Systems: Learning to Identify a Typist.- Efficient Density Clustering Method for Spatial Data.- Statistical ?-Partition Clustering over Data Streams.- Enriching Relational Learning with Fuzzy Predicates.- Text Categorisation Using Document Profiling.- A Simple Algorithm for Topic Identification in 0–1 Data.- Bottom-Up Learning of Logic Programs for Information Extraction from Hypertext Documents.- Predicting Outliers.- Mining Rules of Multi-level Diagnostic Procedure from Databases.- Learning Characteristic Rules Relying on Quantified Paths.- Topic Learning from Few Examples.- Arbogodaï, a New Approach for Decision Trees.
Notă biografică
This book constitutes the refereed proceedings of the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD 2003, held in Cavtat-Dubrovnik, Croatia in September 2003 in conjunction with ECML 2003.
The 40 revised full papers presented together with 4 invited contributions were carefully reviewed and, together with another 40 ones for ECML 2003, selected from a total of 332 submissions. The papers address all current issues in data mining and knowledge discovery in databases including data mining tools, association rule mining, classification, clustering, pattern mining, multi-relational classifiers, boosting, kernel methods, learning Bayesian networks, inductive logic programming, user preferences mining, time series analysis, multi-view learning, support vector machine, pattern mining, relational learning, categorization, information extraction, decision making, prediction, and decision trees.
Caracteristici
Includes supplementary material: sn.pub/extras