Knowledge process of health big data using MapReduce-based associative mining

被引:17
|
作者
Choi, So-Young [1 ]
Chung, Kyungyong [2 ]
机构
[1] Kyonggi Univ, Dept Comp Sci, Data Min Lab, 154-42 Gwanggyosan Ro, Suwon 16227, Gyeonggi Do, South Korea
[2] Kyonggi Univ, Div Comp Sci & Engn, 154-42 Gwanggyosan ro, Suwon 16227, Gyeonggi Do, South Korea
关键词
Data mining; Knowledge process; Associative mining; Healthcare; MapReduce;
D O I
10.1007/s00779-019-01230-3
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Big-data knowledge processing technology facilitates efficient health management services by systematically collecting and promoting information using distributed/parallel processing with the health platform's common data model. Thus, it enables knowledge expansion for healthcare data. In this study, we propose a big-data knowledge process for the health industry using Hadoop's MapReduce software for association mining. The proposed method provides efficient health management knowledge services by collecting and processing heterogeneous health information using WebBot and the common data model. Hadoop is a proprietary method of effectively processing distributed big data. It is a knowledge processing model that combines MapReduce-based distributed processing and a method of finding mining-based associations. The input data in MapReduce is extracted from chronic disease nomenclature from health big data. The corpus divides big data into several blocks of a certain size, creating map tasks. Through the map function of the mapper of each map task, <|key|, value> sets composed of pairs of a key and a value are created. In the map process, a key is created using the same method used for a frequent item set of the Apriori algorithm. The key is a set of 2(p)keys and its value is set to the occurrence frequency of the key. By summing up the values of the same keys by combining, the size of data is decreased and the load of a software program is also decreased. In addition, for each key, the reducer is designated through hash partitioning and stored in the reduce task. In the reduce process, the results of the map are allocated to each reducer, and alignment and merge steps are taken based on the keys. For the same |key|, the values are summed up by performing the reduce function. In this instance, keys whose values fail to meet the minimum support criterion are eliminated. Therefore, from a set of <|key|, value>, a frequent item set that meets the minimum support criterion is extracted. The association rules between datasets constituting the frequent item set are determined, and the support and reliability are calculated to examine whether they are actually associated. As the value of the frequent item set is higher, the support and reliability are also higher. Thus means that the association is obvious. A knowledge base is then constructed using the extracted association rules by repeatedly performing the MapReduce process. Closely associated knowledge bases are created and semantically related in real time with high probability. Furthermore, mining-based knowledge processing of health big data infers more meaningful associations between chronic diseases. The proposed method adds technological value and intelligent efficiency to support the health and medical fields promote healthy lives.
引用
收藏
页码:571 / 581
页数:11
相关论文
共 50 条
  • [31] ScadiBino: An effective MapReduce-based association rule mining method
    Barkhordari, Mohammadhossein
    Niamanesh, Mahdi
    PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL CONFERENCE ON ELECTRONIC COMMERCE (ICEC 2014), 2014, : 1 - 8
  • [32] Associative Feature Information Extraction Using Text Mining from Health Big Data
    Joo-Chang Kim
    Kyungyong Chung
    Wireless Personal Communications, 2019, 105 : 691 - 707
  • [33] Associative Feature Information Extraction Using Text Mining from Health Big Data
    Kim, Joo-Chang
    Chung, Kyungyong
    WIRELESS PERSONAL COMMUNICATIONS, 2019, 105 (02) : 691 - 707
  • [34] MapReduce-based Frequent Itemset Mining for Analysis of Electronic Evidence
    Jiang, Xueqing
    Sun, Guozi
    2013 EIGHTH INTERNATIONAL WORKSHOP ON SYSTEMATIC APPROACHES TO DIGITAL FORENSIC ENGINEERING (SADFE), 2013,
  • [35] PFIMD: a parallel MapReduce-based algorithm for frequent itemset mining
    Mao, Yimin
    Geng, Junhao
    Mwakapesa, Deborah Simon
    Nanehkaran, Yaser Ahangari
    Chi, Zhang
    Deng, Xiaoheng
    Chen, Zhigang
    MULTIMEDIA SYSTEMS, 2021, 27 (04) : 709 - 722
  • [36] A MapReduce-Based User Identification Algorithm in Web Usage Mining
    Srivastava, Mitali
    Garg, Rakhi
    Mishra, P. K.
    INTERNATIONAL JOURNAL OF INFORMATION TECHNOLOGY AND WEB ENGINEERING, 2018, 13 (02) : 11 - 23
  • [37] Gaussian relevance vector MapReduce-based annealed Glowworm optimization for big medical data scheduling
    Patan, Rizwan
    Kallam, Suresh
    Gandomi, Amir H.
    Hanne, Thomas
    Ramachandran, Manikandan
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2022, 73 (10) : 2204 - 2215
  • [38] MapReduce-based big data classification model using feature subset selection and hyperparameter tuned deep belief network
    Rajendran, Surendran
    Khalaf, Osamah Ibrahim
    Alotaibi, Youseef
    Alghamdi, Saleh
    SCIENTIFIC REPORTS, 2021, 11 (01)
  • [39] PARALLEL KNOWLEDGE ACQUISITION ALGORITHM FOR BIG DATA USING MAPREDUCE
    Qian, Jin
    Xia, Min
    Lv, Ping
    PROCEEDINGS OF 2015 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS (ICMLC), VOL. 1, 2015, : 316 - 321
  • [40] A MapReduce-Based Nearest Neighbor Approach for Big-Data-Driven Traffic Flow Prediction
    Xia, Dawen
    Li, Huaqing
    Wang, Binfeng
    Li, Yantao
    Zhang, Zili
    IEEE ACCESS, 2016, 4 : 2920 - 2934