Accelerating the Mobile Cloud: Using Amazon Mobile Analytics and K-Means Clustering

被引:0
|
作者
Beck, Matthew [1 ]
Hao, Wei [1 ]
Campan, Alina [1 ]
机构
[1] Northern Kentucky Univ, Dept Comp Sci, Highland Hts, KY 41099 USA
关键词
Mobile Cloud Computing; AWS Mobile Analytics; Proxy Server Caching; K-Means Database Partitioning; E-Commerce Mobile App;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Current trends show a move away from desktop computing and toward the rise in popularity of mobile devices. Yet mobile devices suffer from limitations in memory, storage, computational power, and battery life. Many of these limitations can be solved by offloading computations and storage to cloud-based platforms. E-commerce mobile applications designed to serve the global customer base of a retail outlet experience fluctuations in demand for resources based on the location of the users. Given a traditional clientserver architecture, where the server application and database are deployed to a single geographic location, this can cause large disparities in response time perceived by users close to the server location and those at a much further distance. This could cause a loss of business or slow user growth in more distant regions. Using several Amazon Web Services(AWS), this paper tests a proxy system and k-means analysis based data partitioning solution to this issue. The discussion of k-means database partitioning describes a preprocessing methodology for adapting raw AWS Mobile Analytics log data for use in the k-means algorithm. The paper also compares a few alternatives for distance measurements and centroid computations for use in the k-means algorithm. Experimental results confirm that this approach significantly reduces response time. It also shows that the approach significantly increases server-side throughput.
引用
收藏
页数:7
相关论文
共 50 条
  • [31] Accelerating the Yinyang K-Means Algorithm Using the GPU
    Taylor, Colin
    Gowanlock, Michael
    2021 IEEE 37TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2021), 2021, : 1835 - 1840
  • [32] K-means-G*: Accelerating k-means clustering algorithm utilizing primitive geometric concepts
    Ismkhan, Hassan
    Izadi, Mohammad
    INFORMATION SCIENCES, 2022, 618 : 298 - 316
  • [33] Spectral Comparison Using k-Means Clustering
    Ramachandran, Vignesh R.
    Mitchell, Herbert J.
    Jacobs, Samantha K.
    Tzeng, Nigel H.
    Firpi, Alexer H.
    Rodriguez, Benjamin M.
    2014 IEEE AEROSPACE CONFERENCE, 2014,
  • [34] Customer Segmentation using K-means Clustering
    Kansal, Tushar
    Bahuguna, Suraj
    Singh, Vishal
    Choudhury, Tanupriya
    PROCEEDINGS OF THE 2018 INTERNATIONAL CONFERENCE ON COMPUTATIONAL TECHNIQUES, ELECTRONICS AND MECHANICAL SYSTEMS (CTEMS), 2018, : 135 - 139
  • [35] Inferring Station Numbers in Metro Trips Using Mobile Magnetometer Sensor via an Unsupervised K-means Clustering Algorithm
    Hosseini, Seyed Hassan
    Gentile, Guido
    Varghese, Ken Koshy
    Miristice, Lory Michelle Bresciani
    2023 8TH INTERNATIONAL CONFERENCE ON MODELS AND TECHNOLOGIES FOR INTELLIGENT TRANSPORTATION SYSTEMS, MT-ITS, 2023,
  • [36] Motif discovery using K-means clustering
    Sayed, Mohammed
    Park, Juw Won
    BMC BIOINFORMATICS, 2016, 17
  • [37] K-means clustering algorithm using the entropy
    Palubinskas, G
    IMAGE AND SIGNAL PROCESSING FOR REMOTE SENSING IV, 1998, 3500 : 63 - 71
  • [38] Crime Analysis using k-means Clustering
    Joshi, Anant
    Sabitha, A. Sai
    Choudhury, Tanupriya
    2017 3RD INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND NETWORKS (CINE), 2017, : 33 - 39
  • [39] Offenders Clustering Using FCM & K-Means
    Farzai, Sara
    Ghasemi, Davood
    Marzuni, Seyed Saeed Mirpour
    JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE-JMCS, 2015, 15 (04): : 294 - 301
  • [40] K-means clustering using entropy minimization
    Okafor, A
    Pardalos, PM
    THEORY AND ALGORITHMS FOR COOPERATIVE SYSTEMS, 2004, 4 : 339 - 351