Polynomials for classification trees and applications

DOI10.1007/S10260-009-0123-2zbMATH Open1332.62202OpenAlexW2038056590MaRDI QIDQ257540FDOQ257540

I. H. Dinwoodie

Publication date: 17 March 2016

Published in: Statistical Methods and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10260-009-0123-2

zbMATH Keywords

binary datahypercubedynamical systemGroebner basisregulatory networksequential importance samplingsyllabification

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Trees (05C05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Cites Work

• SINGULAR
• Testing Statistical Hypotheses
• Graph-Based Algorithms for Boolean Function Manipulation
• Sequential importance sampling for multiway tables
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• A POLYNOMIAL KERNEL FOR MULTICUT IN TREES
• Computational methods for asynchronous basins
• Syzygies for Metropolis base chains
• Estimating the number of zero-one multi-way tables via sequential importance sampling

Uses Software

• CoCoA
• R
• SINGULAR
• tree

This page was built for publication: Polynomials for classification trees and applications

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