An implicit enumeration algorithm for mining high dimensional data
From MaRDI portal
Publication:2505319
zbMath1100.68017MaRDI QIDQ2505319
Xinli Bao, Kenneth Gilbert, Vuttichai Chatpattanan, Hamparsum Bozdogan
Publication date: 4 October 2006
Published in: International Journal of Operational Research (Search for Journal in Brave)
parameter estimationmodel selectionlarge databasesdata miningAIChigh dimensional datanonlinear objective functionimplicit enumeration algorithmAkaike's Information Criterionbounding strategiesBozdogan's Information Measure of ComplexityICOMP criterion
Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Information storage and retrieval of data (68P20)
Related Items
An efficient branch-and-bound strategy for subset vector autoregressive model selection ⋮ Time series modeling and forecasting by mathematical programming ⋮ Model selection using information criteria under a new estimation method: least squares ratio