A model for multi-relational data mining on demand forecasting

被引:0
作者
Ding, Q [1 ]
Parikh, B [1 ]
机构
[1] Penn State Univ, Middletown, PA 17057 USA
来源
INTELLIGENT AND ADAPTIVE SYSTEMS AND SOFTWARE ENGINEERING | 2004年
关键词
data mining; classification; clustering; demand forecasting;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Accurate demand forecasting remains difficult and challenging in today's competitive and dynamic business environment, but even a little improvement in demand prediction may result in significant saving for retailers and manufactures. This paper aims to improve the accuracy of demand forecasting by implementing multirelational data mining process on the large data sets of stores, products, and shoppers. Most existing data mining approaches look for patterns in a single relation of a database. Multi-relational data mining can analyze data from multiple relations directly without the need to transfer the data into a single relation first. Two data mining models are proposed in this paper, which are Pure Classification (PC) model and Hybrid Clustering Classification (HCC) model. Pure Classification model uses k-Nearest Neighbor Classification technique, and Hybrid Clustering Classification first uses k-Mean Mode Clustering to define clusters and then uses k-Nearest Neighbor classification to find k most similar objects. Hybrid Clustering Classification model introduces a concept of combining existing data mining techniques on the multi-relational data sets. Experimental results show that Hybrid Clustering Classification is particularly promising for demand forecasting.
引用
收藏
页码:1 / 5
页数:5
相关论文
共 6 条
[1]  
Han J., 2012, Data Mining, P393, DOI [DOI 10.1016/B978-0-12-381479-1.00009-5, 10.1016/B978-0-12-381479-1.00001-0]
[2]  
HAND D, 2001, PRINCIPLE DATA MININ
[3]  
Laaksonen J., 1996, INT C NEUR NETW
[4]  
MCKENDRICK J, 2003, TERADATA MAGAZINE AP, V3
[5]  
SALZBERG S, 1995, IEEE T PATTERN ANAL, V17
[6]  
Witten I. H., 1999, DATA MINING PRACTICA