Kooperativer Bibliotheksverbund

UID:

Format: ca. 350 S.

ISBN: 978-1-4419-0047-0

Language: English

UID:

Format: XV, 225 S. ; , graph. Darst.

ISBN: 978-981-4271-06-6 , 981-4271-06-3

Series Statement: Series in machine perception and artificial intelligence 75

Language: English

Subjects: Computer Science

Keywords: Mustererkennung

URL: http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018997956&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA

UID:

Format: xv, 225 p. : , ill.

Edition: Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.

Series Statement: Series in machine perception and artificial intelligence ; v. 75

Language: English

Keywords: Electronic books.

URL: Click to View

UID:

Format: VII, 985 p. 214 illus., 156 illus. in color. , online resource.

Edition: 3rd ed. 2023.

ISBN: 9783031246289

Content: This book is a major update to the very successful first and second editions (2005 and 2010) of Data Mining and Knowledge Discovery Handbook. Since the last edition, this field has continued to evolve and to gain popularity. Existing methods are constantly being improved and new methods, applications and aspects are introduced. The new title of this handbook and its content reflect these changes thoroughly. Some existing chapters have been brought up to date. In addition to major revision of the existing chapters, the new edition includes totally new topics, such as: deep learning, explainable AI, human factors and social issues and advanced methods for big-data. The significant enhancement to the content reflects the growth in importance of data science. The third edition is also a timely opportunity to incorporate many other changes based on peers and students' feedback. This comprehensive handbook also presents a coherent and unified repository of data science major concepts, theories, methods, trends, challenges and applications. It covers all the crucial important machine learning methods used in data science. Today's accessibility and abundance of data make data science matters of considerable importance and necessity. Given the field's recent growth, it's not surprising that researchers and practitioners now have a wide range of methods and tools at their disposal. While statistics is fundamental for data science, methods originated from artificial intelligence, particularly machine learning, are also playing a significant role. This handbook aims to serve as the main reference for researchers in the fields of information technology, e-Commerce, information retrieval, data science, machine learning, data mining, databases and statistics as well as advanced level students studying computer science or electrical engineering. Practitioners working within these related fields and data scientists will also want to purchase this handbook as a reference.

Note: Introduction to Knowledge Discovery and Data Mining -- Preprocessing Methods -- Data Cleansing: A Prelude to Knowledge Discovery -- Handling Missing Attribute Values -- Geometric Methods for Feature Extraction and Dimensional Reduction - A Guided Tour -- Dimension Reduction and Feature Selection -- Discretization Methods -- Outlier Detection -- Supervised Methods -- Supervised Learning -- Classification Trees -- Bayesian Networks -- Data Mining within a Regression Framework -- Support Vector Machines -- Rule Induction -- Unsupervised Methods -- A survey of Clustering Algorithms -- Association Rules -- Frequent Set Mining -- Constraint-based Data Mining -- Link Analysis -- Soft Computing Methods -- A Review of Evolutionary Algorithms for Data Mining -- A Review of Reinforcement Learning Methods -- Neural Networks For Data Mining -- Granular Computing and Rough Sets - An Incremental Development -- Pattern Clustering Using a Swarm Intelligence Approach -- Using Fuzzy Logic in Data Mining -- Supporting Methods -- Statistical Methods for Data Mining -- Logics for Data Mining -- Wavelet Methods in Data Mining -- Fractal Mining - Self Similarity-based Clustering and its Applications -- Visual Analysis of Sequences Using Fractal Geometry -- Interestingness Measures - On Determining What Is Interesting -- Quality Assessment Approaches in Data Mining -- Data Mining Model Comparison -- Data Mining Query Languages -- Advanced Methods -- Mining Multi-label Data -- Privacy in Data Mining -- Meta-Learning - Concepts and Techniques -- Bias vs Variance Decomposition for Regression and Classification -- Mining with Rare Cases -- Data Stream Mining -- Mining Concept-Drifting Data Streams -- Mining High-Dimensional Data -- Text Mining and Information Extraction -- Spatial Data Mining -- Spatio-temporal clustering -- Data Mining for Imbalanced Datasets: An Overview -- Relational Data Mining -- Web Mining -- A Review of Web Document Clustering Approaches -- Causal Discovery -- Ensemble Methods in Supervised Learning -- Data Mining using Decomposition Methods -- Information Fusion - Methods and Aggregation Operators -- Parallel and Grid-Based Data Mining - Algorithms, Models and Systems for High-Performance KDD -- Collaborative Data Mining -- Organizational Data Mining -- Mining Time Series Data -- Applications -- Multimedia Data Mining -- Data Mining in Medicine -- Learning Information Patterns in Biological Databases - Stochastic Data Mining -- Data Mining for Financial Applications -- Data Mining for Intrusion Detection -- Data Mining for CRM -- Data Mining for Target Marketing -- NHECD - Nano Health and Environmental Commented Database -- Software -- Commercial Data Mining Software -- Weka-A Machine Learning Workbench for Data Mining.

In: Springer Nature eBook

Additional Edition: Printed edition: ISBN 9783031246272

Additional Edition: Printed edition: ISBN 9783031246296

Additional Edition: Printed edition: ISBN 9783031246302

Language: English

DOI: 10.1007/978-3-031-24628-9

URL: https://doi.org/10.1007/978-3-031-24628-9

UID:

Format: XXIX, 842 S. : , Ill., graph. Darst. ; , 235 mm x 155 mm

ISBN: 978-0-387-85819-7 , 978-0-387-85819-7

Note: c 2011

Language: English

URL: lizenzfrei

UID:

Format: 1 Online-Ressource (VII, 985 p. 214 illus., 156 illus. in color).

Edition: 3rd ed. 2023

ISBN: 978-3-031-24628-9

Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-24627-2

Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-24629-6

Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-24630-2

Language: English

DOI: 10.1007/978-3-031-24628-9

URL: Volltext  (URL des Erstveröffentlichers)

URL: lizenzpflichtig

UID:

Format: 1 online resource (1053 pages)

Edition: Third edition

ISBN: 9781071621974

Content: Preface -- Introduction -- Part 1: General Recommendation Techniques -- Trust Your Neighbors: A Comprehensive Survey of Neighborhood-based Methods for Recommender Systems (Desrosiers) -- Advances in Collaborative Filtering (Koren) -- Item Recommendation from Implicit Feedback (Rendle) -- Deep Learning for Recommender Systems (Zhang) -- Context Aware Re commender Sytems : From Foundatiom to Recent Developments (Bauman) -- Semantics and Content-based Recommendations (Musto) -- Part 2: Special Recommendation Techniques -- Session-based Recommender Systems (lannoch). -- Adversarial Recommender Systems: Attack, Defense, and Advances (Di Nola) -- Group Recommender Systems: Beyond Preferance Aggregation (Masthoff) -- People-to-People Reciprocal Recommenders (Koprinska) -- Natural Language Processing for Recommender Systems (Sar-Shalom) -- Design and Evaluation of Cross-domain Recommender Systems (Cremonesi) -- Part 3: Value and Impact of Recommender Systems -- Value and Impact of Recommender Systems (Zanker) -- Evaluating Recommender Systems (Shani) -- Novelty and Diversity in Recommender Systems (Castells) -- Multistakeholder Recommender Systems (Burke) -- Fairness in Recommender Systems (Ekstrand) -- Part 4: Human Computer Interaction -- Beyond Explaining Single Item Recommendations (Tintarev) -- Personality and Recommender Systems (Tkalčič) -- Individual and Group Decision Making and Recommender Systems (Jameson) -- Part 5: Recommender Systems Applications -- Social Recommender Systems (Guy) -- Food Recommender Systems (Trattner) -- Music Recommendation Systems: Techniques, Use Cases, and Challenges (Schedl) -- Multimedia Recommender Systems: Algorithms and Challenges (Deldjoo) -- Fashion Recommender Systems (Dokoohaki).

Content: This third edition handbook describes in detail the classical methods as well as extensions and novel approaches that were more recently introduced. It consists of five parts: general recommendation techniques, special recommendation techniques, value and impact of recommender systems, human computer interaction, and applications. The first part presents the most popular and fundamental techniques currently used for building recommender systems, such as collaborative filtering, semantic-based methods, recommender systems based on implicit feedback, neural networks and context-aware methods. The second part of this handbook introduces more advanced recommendation techniques, such as session-based recommender systems, adversarial machine learning for recommender systems, group recommendation techniques, reciprocal recommenders systems, natural language techniques for recommender systems and cross-domain approaches to recommender systems. The third part covers a wide perspective to the evaluation of recommender systems with papers on methods for evaluating recommender systems, their value and impact, the multi-stakeholder perspective of recommender systems, the analysis of the fairness, novelty and diversity in recommender systems. The fourth part contains a few chapters on the human computer dimension of recommender systems, with research on the role of explanation, the user personality and how to effectively support individual and group decision with recommender systems. The last part focusses on application in several important areas, such as, food, music, fashion and multimedia recommendation. This informative third edition handbook provides a comprehensive, yet concise and convenient reference source to recommender systems for researchers and advanced-level students focused on computer science and data science. Professionals working in data analytics that are using recommendation and personalization techniques will also find this handbook a useful tool

Note: Description based on publisher supplied metadata and other sources

Additional Edition: ISBN 9781071621967

Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9781071621967

Language: English

Keywords: Aufsatzsammlung

URL: lizenzpflichtig

UID:

Format: 1 online resource (242 p.)

Edition: 1st ed.

ISBN: 1-282-75785-7 , 9786612757853 , 981-4271-07-1

Series Statement: Series in machine perception and artificial intelligence ; v. 75

Content: Researchers from various disciplines such as pattern recognition, statistics, and machine learning have explored the use of ensemble methodology since the late seventies. Thus, they are faced with a wide variety of methods, given the growing interest in the field. This book aims to impose a degree of order upon this diversity by presenting a coherent and unified repository of ensemble methods, theories, trends, challenges and applications. The book describes in detail the classical methods, as well as the extensions and novel approaches developed recently. Along with algorithmic descriptions

Note: Description based upon print version of record. , Contents; Preface; 1. Introduction to Pattern Classification; 1.1 Pattern Classification; 1.2 Induction Algorithms; 1.3 Rule Induction; 1.4 Decision Trees; 1.5 Bayesian Methods; 1.5.1 Overview.; 1.5.2 Naıve Bayes; 1.5.2.1 The Basic Naıve Bayes Classifier; 1.5.2.2 Naıve Bayes Induction for Numeric Attributes; 1.5.2.3 Correction to the Probability Estimation; 1.5.2.4 Laplace Correction; 1.5.2.5 No Match; 1.5.3 Other Bayesian Methods; 1.6 Other Induction Methods; 1.6.1 Neural Networks; 1.6.2 Genetic Algorithms; 1.6.3 Instance-based Learning; 1.6.4 Support Vector Machines , 2. Introduction to Ensemble Learning 2.1 Back to the Roots; 2.2 The Wisdom of Crowds; 2.3 The Bagging Algorithm; 2.4 The Boosting Algorithm; 2.5 The Ada Boost Algorithm; 2.6 No Free Lunch Theorem and Ensemble Learning; 2.7 Bias-Variance Decomposition and Ensemble Learning; 2.8 Occam's Razor and Ensemble Learning; 2.9 Classifier Dependency; 2.9.1 Dependent Methods; 2.9.1.1 Model-guided Instance Selection; 2.9.1.2 Basic Boosting Algorithms; 2.9.1.3 Advanced Boosting Algorithms; 2.9.1.4 Incremental Batch Learning; 2.9.2 Independent Methods; 2.9.2.1 Bagging; 2.9.2.2 Wagging , 2.9.2.3 Random Forest and Random Subspace Projection 2.9.2.4 Non-Linear Boosting Projection (NLBP); 2.9.2.5 Cross-validated Committees; 2.9.2.6 Robust Boosting; 2.10 Ensemble Methods for Advanced Classification Tasks; 2.10.1 Cost-Sensitive Classification; 2.10.2 Ensemble for Learning Concept Drift; 2.10.3 Reject Driven Classification; 3. Ensemble Classification; 3.1 Fusions Methods; 3.1.1 Weighting Methods; 3.1.2 Majority Voting; 3.1.3 Performance Weighting; 3.1.4 Distribution Summation; 3.1.5 Bayesian Combination; 3.1.6 Dempster-Shafer; 3.1.7 Vogging; 3.1.8 Naıve Bayes , 3.1.9 Entropy Weighting 3.1.10 Density-based Weighting; 3.1.11 DEA Weighting Method; 3.1.12 Logarithmic Opinion Pool; 3.1.13 Order Statistics; 3.2 Selecting Classification; 3.2.1 Partitioning the Instance Space; 3.2.1.1 The K-Means Algorithm as a Decomposition Tool; 3.2.1.2 Determining the Number of Subsets; 3.2.1.3 The Basic K-Classifier Algorithm; 3.2.1.4 The Heterogeneity Detecting K-Classifier (HDK-Classifier); 3.2.1.5 Running-Time Complexity; 3.3 Mixture of Experts and Meta Learning; 3.3.1 Stacking; 3.3.2 Arbiter Trees; 3.3.3 Combiner Trees; 3.3.4 Grading; 3.3.5 Gating Network , 4. Ensemble Diversity 4.1 Overview; 4.2 Manipulating the Inducer; 4.2.1 Manipulation of the Inducer's Parameters; 4.2.2 Starting Point in Hypothesis Space; 4.2.3 Hypothesis Space Traversal; 4.3 Manipulating the Training Samples; 4.3.1 Resampling; 4.3.2 Creation; 4.3.3 Partitioning; 4.4 Manipulating the Target Attribute Representation; 4.4.1 Label Switching; 4.5 Partitioning the Search Space; 4.5.1 Divide and Conquer; 4.5.2 Feature Subset-based Ensemble Methods; 4.5.2.1 Random-based Strategy; 4.5.2.2 Reduct-based Strategy; 4.5.2.3 Collective-Performance-based Strategy , 4.5.2.4 Feature Set Partitioning , English

Additional Edition: ISBN 981-4271-06-3

Language: English

UID:

Format: 1 online resource (263 p.)

Edition: 1st ed.

ISBN: 1-281-91179-8 , 9786611911799 , 981-277-172-7

Series Statement: Series in machine perception and artificial intelligence ; v. 69

Content: This is the first comprehensive book dedicated entirely to the field of decision trees in data mining and covers all aspects of this important technique. Decision trees have become one of the most powerful and popular approaches in knowledge discovery and data mining, the science and technology of exploring large and complex bodies of data in order to discover useful patterns. The area is of great importance because it enables modeling and knowledge extraction from the abundance of data available. Both theoreticians and practitioners are continually seeking techniques to make the process more

Note: Description based upon print version of record. , Preface; Contents; 1. Introduction to Decision Trees; 1.1 Data Mining and Knowledge Discovery; 1.2 Taxonomy of Data Mining Methods; 1.3 Supervised Methods; 1.3.1 Overview; 1.4 Classification Trees; 1.5 Characteristics of Classification Trees; 1.5.1 Tree Size; 1.5.2 The hierarchical nature of decision trees; 1.6 Relation to Rule Induction; 2. Growing Decision Trees; 2.0.1 Training Set; 2.0.2 Definition of the Classification Problem; 2.0.3 Induction Algorithms; 2.0.4 Probability Estimation in Decision Trees; 2.0.4.1 Laplace Correction; 2.0.4.2 No Match , 2.1 Algorithmic Framework for Decision Trees2.2 Stopping Criteria; 3. Evaluation of Classification Trees; 3.1 Overview; 3.2 Generalization Error; 3.2.1 Theoretical Estimation of Generalization Error; 3.2.2 Empirical Estimation of Generalization Error; 3.2.3 Alternatives to the Accuracy Measure; 3.2.4 The F-Measure; 3.2.5 Confusion Matrix; 3.2.6 Classifier Evaluation under Limited Resources; 3.2.6.1 ROC Curves; 3.2.6.2 Hit Rate Curve; 3.2.6.3 Qrecall (Quota Recall); 3.2.6.4 Lift Curve; 3.2.6.5 Pearson Correlation Coegfficient; 3.2.6.6 Area Under Curve (AUC); 3.2.6.7 Average Hit Rate , 3.2.6.8 Average Qrecall3.2.6.9 Potential Extract Measure (PEM); 3.2.7 Which Decision Tree Classifier is Better?; 3.2.7.1 McNemar's Test; 3.2.7.2 A Test for the Difference of Two Proportions; 3.2.7.3 The Resampled Paired t Test; 3.2.7.4 The k-fold Cross-validated Paired t Test; 3.3 Computational Complexity; 3.4 Comprehensibility; 3.5 Scalability to Large Datasets; 3.6 Robustness; 3.7 Stability; 3.8 Interestingness Measures; 3.9 Overfitting and Underfitting; 3.10 "No Free Lunch" Theorem; 4. Splitting Criteria; 4.1 Univariate Splitting Criteria; 4.1.1 Overview; 4.1.2 Impurity based Criteria , 4.1.3 Information Gain4.1.4 Gini Index; 4.1.5 Likelihood Ratio Chi-squared Statistics; 4.1.6 DKM Criterion; 4.1.7 Normalized Impurity-based Criteria; 4.1.8 Gain Ratio; 4.1.9 Distance Measure; 4.1.10 Binary Criteria; 4.1.11 Twoing Criterion; 4.1.12 Orthogonal Criterion; 4.1.13 Kolmogorov-Smirnov Criterion; 4.1.14 AUC Splitting Criteria; 4.1.15 Other Univariate Splitting Criteria; 4.1.16 Comparison of Univariate Splitting Criteria; 4.2 Handling Missing Values; 5. Pruning Trees; 5.1 Stopping Criteria; 5.2 Heuristic Pruning; 5.2.1 Overview; 5.2.2 Cost Complexity Pruning , 5.2.3 Reduced Error Pruning5.2.4 Minimum Error Pruning (MEP); 5.2.5 Pessimistic Pruning; 5.2.6 Error-Based Pruning (EBP); 5.2.7 Minimum Description Length (MDL) Pruning; 5.2.8 Other Pruning Methods; 5.2.9 Comparison of Pruning Methods; 5.3 Optimal Pruning; 6. Advanced Decision Trees; 6.1 Survey of Common Algorithms for Decision Tree Induction; 6.1.1 ID3; 6.1.2 C4.5; 6.1.3 CART; 6.1.4 CHAID; 6.1.5 QUEST.; 6.1.6 Reference to Other Algorithms; 6.1.7 Advantages and Disadvantages of Decision Trees; 6.1.8 Oblivious Decision Trees; 6.1.9 Decision Trees Inducers for Large Datasets , 6.1.10 Online Adaptive Decision Trees , English

Additional Edition: ISBN 981-277-171-9

Language: English