scientific article; zbMATH DE number 1149453

zbMATH Open0894.68119MaRDI QIDQ4386977FDOQ4386977

Authors:

Publication date: 13 May 1998

Title of this publication is not available (Why is that?)

Recommendations

• Accelerating EM for large databases
• Sufficiency Revisited: Rethinking Statistical Algorithms in the Big Data Era
• Statistical learning for big dependent data
• On Statistical Efficiency in Learning
• Revisiting the Nyström method for improved large-scale machine learning
• Large-scale machine learning with stochastic gradient descent
• Optimized fixed-size kernel models for large data sets
• A Bayesian perspective of statistical machine learning for big data
• Efficient noise-tolerant learning from statistical queries

zbMATH Keywords

rule learning algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)

Cited In (5)

• Fast learning of relational dependency networks
• Learning Bayesian networks from big data with greedy search: computational complexity and efficient implementation
• A feature matching method: sparse feature tree
• What makes you unique?
• The max-min hill-climbing Bayesian network structure learning algorithm

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4386977)