On the computational complexity of optimal multisplitting

MaRDI QIDQ2775876zbMATH OpenFDO

Authors Tapio Elomaa, Juho Rousu

Publication date 28 February 2002

Published in Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

data mining algorithmsmachine learning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1696745
• General and efficient multisplitting of numerical attributes
• scientific article; zbMATH DE number 25401
• Optimal classification trees
• scientific article; zbMATH DE number 1303636

Cited in

(8)

• On generalized greedy splitting algorithms for multiway partition problems
• General and efficient multisplitting of numerical attributes
• Frequency-based views to pattern collections
• scientific article; zbMATH DE number 1696745 (Why is no real title available?)
• scientific article; zbMATH DE number 4218375 (Why is no real title available?)
• scientific article; zbMATH DE number 954657 (Why is no real title available?)
• Parameterized and Exact Computation
• Homogeneous string segmentation using trees and weighted independent sets

This page was built for publication: On the computational complexity of optimal multisplitting

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