.png){kind=icon}
.png){kind=icon}
Return
Parallelized User Clicks Recognition from Massive HTTP Data Based on Dependency Graph Model
.png){kind=icon}
PRE
AI
DOI：10.1109/CC.2014.7019836.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
With increasingly complex website structure and continuously advancing web technologies, accurate user clicks recognition from massive HTTP data, which is critical for web usage mining, becomes more difficult. In this paper, we propose a dependency graph model to describe the relationships between web requests. Based on this model, we design and implement a heuristic parallel algorithm to distinguish user clicks with the assistance of cloud computing technology. We evaluate the proposed algorithm with real massive data. The size of the dataset collected from a mobile core network is 228.7GB. It covers more than three million users. The experiment results demonstrate that the proposed algorithm can achieve higher accuracy than previous methods.
Keywords:
cloud computing
massive data
graph model
web usage mining
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.1
Papers:
1.9K
Citations:
5.0K