Identifying Frequent User Tasks from Application Logs

被引:29
作者
Dev, Himel [1 ]
Liu, Zhicheng [2 ]
机构
[1] Univ Illinois, Dept Comp Sci, Champaign, IL 61820 USA
[2] Adobe Res, San Francisco, CA USA
来源
IUI'17: PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON INTELLIGENT USER INTERFACES | 2017年
关键词
User Task; Application Log; Frequent Pattern Mining; Pattern Ranking;
D O I
10.1145/3025171.3025184
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the light of continuous growth in log analytics, application logs remain a valuable source to understand and analyze patterns in user behavior. Today, almost every major software company employs analysts to reveal user insights from log data. To understand the tasks and challenges of the analysts, we conducted a background study with a group of analysts from a major software company. A fundamental analytics objective that we recognized through this study involves identifying frequent user tasks from application logs. More specifically, analysts are interested in identifying operation groups that represent meaningful tasks performed by many users inside applications. This is challenging, primarily because of the nature of modern application logs, which are long, noisy and consist of events from high-cardinality set. In this paper, we address these challenges to design a novel frequent pattern ranking technique that extracts frequent user tasks from application logs. Our experimental study shows that our proposed technique significantly outperforms state of the art for real-world data.
引用
收藏
页码:263 / 273
页数:11
相关论文
共 22 条
[1]  
Adar E, 2008, CHI 2008: 26TH ANNUAL CHI CONFERENCE ON HUMAN FACTORS IN COMPUTING SYSTEMS VOLS 1 AND 2, CONFERENCE PROCEEDINGS, P1197
[2]  
AGRAWAL R, 1995, PROC INT CONF DATA, P3, DOI 10.1109/ICDE.1995.380415
[3]  
Agrawal Rakesh., 1993, P 1993 ACM SIGMOD IN, P207, DOI DOI 10.1145/170035.170072
[4]  
[Anonymous], 2014, FREQUENT PATTERN MIN, DOI DOI 10.1007/978-3-319-07821-2
[5]  
[Anonymous], 2013, IEEE T VISUALIZATION
[6]  
[Anonymous], 2013, P 22 USENIX SEC S WA
[7]  
[Anonymous], 2013, Proceedings of the 2013 conference on Computer supported cooperative work. ACM
[8]  
Cuke Boris, NEW CONSTRAINT MININ, P317, DOI [10.1137/1.9781611972795.28, DOI 10.1137/1.9781611972795.28]
[9]   Analyzing Organizational Routines in Online Knowledge Collaborations: A Case for Sequence Analysis in CSCW [J].
Keegan, Brian C. ;
Lev, Shakked ;
Arazy, Ofer .
ACM CONFERENCE ON COMPUTER-SUPPORTED COOPERATIVE WORK AND SOCIAL COMPUTING (CSCW 2016), 2016, :1065-1079
[10]   ICICLE PLOTS - BETTER DISPLAYS FOR HIERARCHICAL-CLUSTERING [J].
KRUSKAL, JB ;
LANDWEHR, JM .
AMERICAN STATISTICIAN, 1983, 37 (02) :162-168