Cloud Based K-Means Clustering Running as a MapReduce Job for Big Data Healthcare Analytics Using Apache Mahout

被引:7
作者
Rallapalli, Sreekanth [1 ]
Gondkar, R. R. [2 ]
Rao, Golajapu Venu Madhava [3 ]
机构
[1] Bharathiyar Univ, R&D Ctr, Coimbatore, Tamil Nadu, India
[2] AIT, Bangalore, Karnataka, India
[3] Botho Univ, Gaborone, Botswana
来源
INFORMATION SYSTEMS DESIGN AND INTELLIGENT APPLICATIONS, VOL 1, INDIA 2016 | 2016年 / 433卷
关键词
Big data; Clustering; Hadoop; K-means; Mahout; NoSQL;
D O I
10.1007/978-81-322-2755-7_14
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Increase in data volume and need for analytics has led towards innovation of big data. To speed up the query responses models like NoSQL has emerged. Virtualized platforms using commodity hardware and implementing Hadoop on it helps small and midsized companies use cloud environment. This will help organizations to decrease the cost for data processing and analytics. As health care generating volumes and variety of data it is required to build parallel algorithms that can support petabytes of data using hadoop and MapReduce parallel processing. K-means clustering is one of the methods for parallel algorithm. In order to build an accurate system large data sets need to be considered. Memory requirement increases with large data sets and algorithms become slow. Mahout scalable algorithms developed works better with huge data sets and improve the performance of the system. Mahout is an open source and can be used to solve problems arising with huge data sets. This paper proposes cloud based K-means clustering running as a MapReduce job. We use health care data on cloud for clustering. We then compare the results with various measures to conclude the best measure to find number of vectors in a given cluster.
引用
收藏
页码:127 / 135
页数:9
相关论文
共 10 条
  • [1] [Anonymous], 2009, Hadoop: The Definitive Guide
  • [2] Dean J, 2004, USENIX ASSOCIATION PROCEEDINGS OF THE SIXTH SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION (OSDE '04), P137
  • [3] Esteves Rui Maximo, IEEE 2011 WORKSH INT, P514
  • [4] Fredrik Farnstorm J, 2002, SIGKDD EXPLORATIONS, V2, P51
  • [5] Garg Dweepna, 2014 IEEE INT C ADV
  • [6] Gu Lin, 2013, 4 INT C CLOUD COMP G
  • [7] Jain A.K., 1998, ALGORITHMS CLUSTERIN
  • [8] An efficient k-means clustering algorithm:: Analysis and implementation
    Kanungo, T
    Mount, DM
    Netanyahu, NS
    Piatko, CD
    Silverman, R
    Wu, AY
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (07) : 881 - 892
  • [9] Owen Sean, MAHOUT ACTION MANNIN
  • [10] Saha Budhaditya, CLUSTERING PATIENT M