DocumentCode
2207383
Title
Hierarchical maximum entropy modeling for regression
Author
Zhang, Yanxin ; Miller, David J. ; Kesidis, George
Author_Institution
Pennsylvania State Univ., University Park, PA, USA
fYear
2009
fDate
1-4 Sept. 2009
Firstpage
1
Lastpage
6
Abstract
Maximum entropy/iterative scaling (ME/IS)models have been well developed for classification on categorical (discrete-field) feature spaces. In this paper, we propose a hierarchical maximum entropy regression (HMEreg) model in building a posterior model for continuous target, which encodes constraints in the hierarchical tree structures from both input features and target output variable. In ME models, the tradeoff between model bias and variance is found in the constraints encoded into the model - complex constraints give the model more representation capacity but may over-fit, whereas simple constraints may produce less over-fitting but may have much more model bias. We developed a greedy order-growing constraint search method to sequentially build constraints with flexible order based on likelihood gain on a validation set. Experiments showed the HMEreg model performed comparably to or better than other regression models, including generalized linear regression, multi-layer perceptron, support vector regression, and regression tree.
Keywords
encoding; feature extraction; iterative methods; maximum entropy methods; pattern classification; regression analysis; trees (mathematics); categorical feature space; constraint encoding; greedy order-growing constraint search method; hierarchical maximum entropy regression modeling; hierarchical tree structure; iterative scaling model; posterior model; Buildings; Entropy; Linear regression; Multilayer perceptrons; Regression tree analysis; Search methods; Statistical learning; Training data; Tree data structures; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning for Signal Processing, 2009. MLSP 2009. IEEE International Workshop on
Conference_Location
Grenoble
Print_ISBN
978-1-4244-4947-7
Electronic_ISBN
978-1-4244-4948-4
Type
conf
DOI
10.1109/MLSP.2009.5306225
Filename
5306225
Link To Document