![]() |
个人信息Personal Information
教授
博士生导师
硕士生导师
性别:女
毕业院校:大连理工大学
学位:博士
所在单位:计算机科学与技术学院
学科:计算机应用技术. 计算机软件与理论
Construct Rough Approximation based on GAE
点击次数:
论文类型:会议论文
发表时间:2013-12-13
收录刊物:EI、CPCI-S、Scopus
页面范围:259-264
关键字:Clouding computing; Google app engine; Granular computing; Rough set
摘要:Recently, cloud computing has emerged as a new paradigm which focuses on web-scale problems, large data centers, multiple models of computing and highly-interactive web applications. It is high available and scalable for distributed and parallel data storage and computing based on a large amount of cheap PCs. As the representative product, Google app engine (GAE), which acts a platform as a service (PaaS) cloud computing platform, mainly contains Google File System (GFS) and MapReduce programming model for massive data process. This paper analyses GAE from the point of Granular computing (GrC) and explain why it is suitable for massive data mining. Further we present an example of how to use it to construct neighborhoods of rough set and compute lower and upper approximations accurately and strictly.