Bipartite Graph Representation of Multiple Decision Table Classifiers

DOI10.1007/978-3-642-04944-6_5zbMath1260.68331OpenAlexW2130793452MaRDI QIDQ3646117

Kazuya Haraguchi, Hiroshi Nagamochi, Seok-Hee Hong

Publication date: 19 November 2009

Published in: Stochastic Algorithms: Foundations and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04944-6_5

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Bipartite Graph Representation of Multiple Decision Table Classifiers

Uses Software

• UCI-ml
• LIBSVM
• WEKA
• C4.5

Cites Work

• Recent advances in predictive (machine) learning
• Edge crossings in drawings of bipartite graphs
• An improved bound on the one-sided minimum crossing number in two-layered drawings
• Crossing Number is NP-Complete
• Bipartite Graph Representation of Multiple Decision Table Classifiers
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• Graph Drawing
• Graph Drawing
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bipartite Graph Representation of Multiple Decision Table Classifiers