Association rules mining between service demands and remanufacturing services

被引:4
|
作者
Zhou, Wenbin [1 ]
Xia, Xuhui [1 ]
Zhang, Zelin [1 ]
Wang, Lei [1 ]
机构
[1] Wuhan Univ Sci & Technol, Key Lab Met Equipment & Control Technol, Minist Educ, Wuhan 430081, Peoples R China
来源
AI EDAM-ARTIFICIAL INTELLIGENCE FOR ENGINEERING DESIGN ANALYSIS AND MANUFACTURING | 2021年 / 35卷 / 02期
基金
中国国家自然科学基金;
关键词
Association rules; data mining; remanufacturing services; service scheme design; MANUFACTURING SYSTEM CAPABILITIES; A-PRIORI; OPTIMIZATION; ALGORITHM; EXTRACTION; DISCOVERY; SEARCH;
D O I
10.1017/S0890060420000396
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The potential relationship between service demands and remanufacturing services (RMS) is essential to make the decision of a RMS plan accurately and improve the efficiency and benefit. In the traditional association rule mining methods, a large number of candidate sets affect the mining efficiency, and the results are not easy for customers to understand. Therefore, a mining method based on binary particle swarm optimization ant colony algorithm to discover service demands and remanufacture services association rules is proposed. This method preprocesses the RMS records, converts them into a binary matrix, and uses the improved ant colony algorithm to mine the maximum frequent itemset. Because the particle swarm algorithm determines the initial pheromone concentration of the ant colony, it avoids the blindness of the ant colony, effectively enhances the searchability of the algorithm, and makes association rule mining faster and more accurate. Finally, a set of historical RMS record data of straightening machine is used to test the validity and feasibility of this method by extracting valid association rules to guide the design of RMS scheme for straightening machine parts.
引用
收藏
页码:240 / 250
页数:11
相关论文
共 50 条
  • [1] Towards Using Grid Services for Mining Fuzzy Association Rules
    Gabroveanu, Mihai
    Iancu, Ion
    Cosulschi, Mirel
    Constantinescu, Nicolae
    NINTH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING, PROCEEDINGS, 2007, : 507 - 513
  • [2] Association rules mining for knowledge management: A case study of library services
    Chan, Chu Chai Henry
    Lee, Ming-Hsiu
    Kwang, Yun-Chiang
    MATHEMATICAL METHODS AND COMPUTATIONAL TECHNIQUES IN RESEARCH AND EDUCATION, 2007, : 64 - +
  • [3] Mining association rules
    Aly, HH
    Taha, Y
    Amr, A
    COMPUTERS AND THEIR APPLICATIONS, 2001, : 298 - 303
  • [4] Mining generalized association rules for service recommendations for digital home applications
    Hsueh, Sue-Chen
    Lin, Ming-Yen
    Lu, Kun-Lin
    2007 THIRD INTERNATIONAL CONFERENCE ON INTELLIGENT INFORMATION HIDING AND MULTIMEDIA SIGNAL PROCESSING, VOL 1, PROCEEDINGS, 2007, : 631 - 634
  • [5] Association rules mining of vehicle routing for personalized traffic information service
    Li, Jie
    Wang, Na-Na
    Li, Zhi-Peng
    Xu, Yong
    Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2013, 33 (12): : 3209 - 3215
  • [6] Mining association rules between education, family background and earning
    Chang, Chih Yen
    Chang, Ming Sang
    Journal of Computers (Taiwan), 2020, 31 (02) : 56 - 69
  • [7] An approach to the mobile social services recommendation algorithm based on association rules mining
    Xin Mingjun
    Wu Lijun
    Liang Wenfei
    Shu Jie
    INTERNATIONAL JOURNAL OF SERVICES TECHNOLOGY AND MANAGEMENT, 2020, 26 (2-3) : 115 - 130
  • [8] Parallel mining of association rules
    IBM Almaden Research Cent, San Jose, United States
    IEEE Trans Knowl Data Eng, 6 (962-969):
  • [9] Mining association rules in folksonornies
    Schmitz, Christoph
    Hotho, Andreas
    Jaeschke, Robert
    Stumme, Gerd
    DATA SCIENCE AND CLASSIFICATION, 2006, : 261 - +
  • [10] Mining clusters with association rules
    Kosters, WA
    Marchiori, E
    Oerlemans, AAJ
    ADVANCES IN INTELLIGENT DATA ANALYSIS, PROCEEDINGS, 1999, 1642 : 39 - 50