Interactive personalized interesting pattern discovery

The traditional approach of mining frequent patterns generates a very large number of patterns of which a substantial fraction are not much interesting for many data analysis tasks. So selecting a small number of patterns from the large output set such that the selected patterns best align with a particular user's interest is an important task. Existing works on pattern summarization do not help, as these approaches solve interesting pattern discovery from a global perspective which is far from personalization what is needed to meet the pattern discovery demand of a specific user. In this work, we propose an interactive pattern discovery framework, which identifies a set of interesting patterns for a specific user without requiring any prior input on the interestingness measure of patterns from the user. We develop a gradient boosted regression tree based iterative learning algorithm that uses a limited number of interactive feedback from the user to learn her interestingness profile of the patterns, and use this profile for pattern recommendation. We show experimental results on several real-life datasets to validate the performance of the proposed method. We also compare with the existing methods of interactive pattern discovery to show that the performance of the proposed method is substantially superior to the existing methods.

[1]  Stefan Wrobel,et al.  One click mining: interactive local pattern discovery through implicit preference and performance learning , 2013, IDEA@KDD.

[2]  Pauli Miettinen,et al.  Siren: an interactive tool for mining and visualizing geospatial redescriptions , 2012, KDD.

[3]  Snehasis Mukhopadhyay,et al.  Interactive pattern mining on hidden data: a sampling-based solution , 2012, CIKM.

[4]  Teofilo F. GONZALEZ,et al.  Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..

[5]  Jilles Vreeken,et al.  Tell me what i need to know: succinctly summarizing data with itemsets , 2011, KDD.

[6]  Jilles Vreeken,et al.  Summarizing data succinctly with the most informative itemsets , 2012, TKDD.

[7]  Mohammed J. Zaki Data Mining and Analysis: Fundamental Concepts and Algorithms , 2014 .

[8]  Jilles Vreeken,et al.  Krimp: mining itemsets that compress , 2011, Data Mining and Knowledge Discovery.

[9]  Bart Goethals,et al.  MIME: a framework for interactive visual pattern mining , 2011, KDD.

[10]  Tijl De Bie,et al.  Maximum entropy models and subjective interestingness: an application to tiles in binary databases , 2010, Data Mining and Knowledge Discovery.

[11]  Matthijs van Leeuwen,et al.  Interactive Discovery of Interesting Subgroup Sets , 2013, IDA.

[12]  Marc Boullé,et al.  Exploration vs. exploitation in active learning : A Bayesian approach , 2010, The 2010 International Joint Conference on Neural Networks (IJCNN).

[13]  Jiawei Han,et al.  Discovering interesting patterns through user's interactive feedback , 2006, KDD '06.

[14]  Alexandre Termier,et al.  Interactive User Group Analysis , 2015, CIKM.

[15]  J. Friedman Greedy function approximation: A gradient boosting machine. , 2001 .

[16]  Mohammad Al Hasan,et al.  Output Space Sampling for Graph Patterns , 2009, Proc. VLDB Endow..