Flash Points: Discovering Exceptional Pairwise Behaviors in Vote or Rating Data

We address the problem of discovering contexts that lead well-distinguished collections of individuals to change their pairwise agreement w.r.t. their usual one. For instance, in the European parliament, while in overall, a strong disagreement is witnessed between deputies of the far-right French party Front National and deputies of the left party Front de Gauche, a strong agreement is observed between these deputies in votes related to the thematic: External relations with the union. We devise the method DSC (Discovering Similarities Changes) which relies on exceptional model mining to uncover three-set patterns that identify contexts and two collections of individuals where an unexpected strengthening or weakening of pairwise agreement is observed. To efficiently explore the search space, we define some closure operators and pruning techniques using upper bounds on the quality measure. In addition of handling usual attributes (e.g. numerical, nominal), we propose a novel pattern domain which involves hierarchical multi-tag attributes that are present in many datasets. A thorough empirical study on two real-world datasets (i.e., European parliament votes and collaborative movie reviews) demonstrates the efficiency and the effectiveness of our approach as well as the interest and the actionability of the patterns.

[1]  Cong Yu,et al.  MRI: Meaningful Interpretations of Collaborative Ratings , 2011, Proc. VLDB Endow..

[2]  Marc Plantevit,et al.  Unsupervised Exceptional Attributed Sub-Graph Mining in Urban Data , 2016, 2016 IEEE 16th International Conference on Data Mining (ICDM).

[3]  Geoffrey I. Webb,et al.  Supervised Descriptive Rule Discovery: A Unifying Survey of Contrast Set, Emerging Pattern and Subgroup Mining , 2009, J. Mach. Learn. Res..

[4]  Bernhard Ganter,et al.  Pattern Structures and Their Projections , 2001, ICCS.

[5]  Wouter Duivesteijn,et al.  Exceptional Model Mining , 2008, Data Mining and Knowledge Discovery.

[6]  A. J. Feelders,et al.  Subgroup Discovery Meets Bayesian Networks -- An Exceptional Model Mining Approach , 2010, 2010 IEEE International Conference on Data Mining.

[7]  Wray L. Buntine,et al.  Analyzing the US Senate in 2003: Similarities, Networks, Clusters and Blocs , 2004 .

[8]  Laks V. S. Lakshmanan,et al.  Exploring Rated Datasets with Rating Maps , 2017, WWW.

[9]  Antti Pajala.  Parliamentary Group and Individual Voting Behaviour in the Finnish Parliament in Year 2003 : A Group Cohesion and Voting Similarity Analysis , 2004 .

[10]  Céline Robardet,et al.  Local Subgroup Discovery for Eliciting and Understanding New Structure-Odor Relationships , 2016, DS.

[11]  Sergei O. Kuznetsov,et al.  Learning of Simple Conceptual Graphs from Positive and Negative Examples , 1999, PKDD.

[12]  Amedeo Napoli,et al.  Mining gene expression data with pattern structures in formal concept analysis , 2011, Inf. Sci..

[13]  Céline Robardet,et al.  Exceptional contextual subgraph mining , 2017, Machine Learning.

[14]  Carlos Soares,et al.  Exceptional Preferences Mining , 2016, DS.

[15]  Arno J. Knobbe,et al.  Diverse subgroup set discovery , 2012, Data Mining and Knowledge Discovery.

[16]  Vincent Etter,et al.  Mining democracy , 2014, COSN '14.

[17]  Sihem Amer-Yahia,et al.  Multi-Objective Group Discovery on the Social Web , 2016, ECML/PKDD.

[18]  Clara Pizzuti,et al.  Analyzing Voting Behavior in Italian Parliament: Group Cohesion and Evolution , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[19]  Florian Lemmerich,et al.  Generic Pattern Trees for Exhaustive Exceptional Model Mining , 2012, ECML/PKDD.

[20]  Stefan Wrobel,et al.  An Algorithm for Multi-relational Discovery of Subgroups , 1997, PKDD.