An implicit enumeration algorithm for mining high dimensional data

MaRDI QIDQ2505319zbMATH OpenFDO

Authors Xinli Bao, Hamparsum Bozdogan, Vuttichai Chatpattanan, Kenneth Gilbert

Publication date 4 October 2006

Published in International Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

AICAkaike's Information Criterionbounding strategiesBozdogan's Information Measure of Complexitydata mininghigh dimensional dataICOMP criterionimplicit enumeration algorithmlarge databasesmodel selectionnonlinear objective functionparameter estimation

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Subset selection algorithm based on mutual information
• Minimizing variable selection criteria by Markov chain Monte Carlo
• Model-Free Variable Selection
• Variable selection in regression models using nonstandard optimisation of information criteria
• scientific article; zbMATH DE number 5006009

Cited in

(6)

• A new inductive approach for counting dimension in large scale
• Subset selection algorithm based on mutual information
• scientific article; zbMATH DE number 3862495 (Why is no real title available?)
• Model selection using information criteria under a new estimation method: least squares ratio
• Time series modeling and forecasting by mathematical programming
• An efficient branch-and-bound strategy for subset vector autoregressive model selection

This page was built for publication: An implicit enumeration algorithm for mining high dimensional data

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