EFFICIENT UNSUPERVISED MINING FROM NOISY CO-OCCURRENCE DATA

DOI10.1142/S1793005705000093zbMATH Open1103.68707MaRDI QIDQ4679775FDOQ4679775

Authors: Hiroshi Mamitsuka 

Publication date: 21 June 2005

Published in: New Mathematics and Natural Computation (Search for Journal in Brave)

Recommendations

• Approximate frequent itemset mining in the presence of random noise
• scientific article; zbMATH DE number 5964741
• scientific article; zbMATH DE number 1041844
• Interactive Mining of Probabilistic Frequent Patterns in Uncertain Databases
• An unsupervised outlier detection algorithm for categorical matrix-object data

zbMATH Keywords

unsupervised learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• A decision-theoretic generalization of on-line learning and an application to boosting
• Title not available (Why is that?)
• Title not available (Why is that?)
• Unsupervised learning by probabilistic latent semantic analysis

Cited In (1)

• Ensemble-based noise detection: noise ranking and visual performance evaluation

This page was built for publication: EFFICIENT UNSUPERVISED MINING FROM NOISY CO-OCCURRENCE DATA

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