AREM: A Novel Associative Regression Model Based on EM Algorithm
2012-10-16
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
AREM: A Novel Associative Regression Model Based on EM Algorithm
Authors
Published Date
2012-10-16
Publisher
Type
Report
Abstract
In recent years, there have been increasing efforts in applying association rule mining to build Associative Classification (AC) models. However, the similar area that applies association rule mining to build Associative Regression (AR) models has not been well explored. In this work, we fill this gap by presenting a novel regression model based on association rules called AREM. AREM starts with finding a set of regression rules by applying the instance based pruning strategy, in which the best rules for each instance are discovered and combined. Then a probabilistic model is trained by applying the EM algorithm, in which the right hand side of the rules and their importance weights are updated. The extensive experimental evaluation shows that our model can perform better than both the previously proposed AR model and some of the state of the art regression models, including Boosted Regression Trees, SVR, CART and Cubist, with the Mean Squared Error (MSE) being used as the performance metric.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Technical Report; 12-022
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
Suggested citation
Jiang, Zhonghua; Karypis, George. (2012). AREM: A Novel Associative Regression Model Based on EM Algorithm. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215900.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.