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
关键词
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
相关论文
共 50 条
  • [21] Relational concept analysis: mining concept lattices from multi-relational data
    Mohamed Rouane-Hacene
    Marianne Huchard
    Amedeo Napoli
    Petko Valtchev
    Annals of Mathematics and Artificial Intelligence, 2013, 67 : 81 - 108
  • [22] Adaptive support vector clustering for multi-relational data mining
    Ling, Ping
    Zhou, Chun-Guang
    ADVANCES IN NEURAL NETWORKS - ISNN 2006, PT 1, 2006, 3971 : 1222 - 1230
  • [23] Many sorted observational calculi for multi-relational data mining
    Rauch, Jan
    ICDM 2006: SIXTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, WORKSHOPS, 2006, : 417 - 422
  • [24] Distributed Mining of Closed Patterns from Multi-Relational Data
    Kamiya, Yohei
    Seki, Hirohisa
    JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS, 2015, 19 (06) : 804 - 809
  • [25] MR-Radix: a multi-relational data mining algorithm
    Valencio, Carlos Roberto
    Oyama, Fernando Takeshi
    Neto, Paulo Scarpelini
    Colombini, Angelo Cesar
    Cansian, Adriano Mauro
    Gratao de Souza, Rogeria Cristiane
    Pizzigatti Correa, Pedro Luiz
    HUMAN-CENTRIC COMPUTING AND INFORMATION SCIENCES, 2012, 2 : 1 - 17
  • [26] Distributed Multi-Relational Data Mining Based on Genetic Algorithm
    Dou, Wenxiang
    Hu, Jinglu
    Hirasawa, Kotaro
    Wu, Gengfeng
    2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 744 - +
  • [27] Introduction to the special issue on multi-relational data mining and statistical relational learning
    Hendrik Blockeel
    David Jensen
    Stefan Kramer
    Machine Learning, 2006, 62 : 3 - 5
  • [28] Generalized stochastic tree automata for multi-relational data mining
    Habrard, A
    Bernard, M
    Jacquenet, F
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, 2002, 2484 : 120 - 133
  • [29] Scalable multi-relational association mining
    Clare, A
    Williams, HE
    Lester, N
    FOURTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2004, : 355 - 358
  • [30] Mining approximate multi-relational patterns
    Spyropoulou, Eirini
    De Bie, Tijl
    2014 INTERNATIONAL CONFERENCE ON DATA SCIENCE AND ADVANCED ANALYTICS (DSAA), 2014, : 477 - 483