Convex Adversarial Collective Classification

In this paper, we present a novel method for robustly performing collective classification in the presence of a malicious adversary that can modify up to a fixed number of binary-valued attributes. Our method is formulated as a convex quadratic program that guarantees optimal weights against a worst-case adversary in polynomial time. In addition to increased robustness against active adversaries, this kind of adversarial regularization can also lead to improved generalization even when no adversary is present. In experiments on real and simulated data, our method consistently outperforms both nonadversarial and non-relational baselines.

[1]  Ben Taskar,et al.  Max-Margin Markov Networks , 2003, NIPS.

[2]  Ben Taskar,et al.  Learning associative Markov networks , 2004, ICML.

[3]  Tobias Scheffer,et al.  Nash Equilibria of Static Prediction Games , 2009, NIPS.

[4]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

[5]  Vladimir Kolmogorov,et al.  What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Nello Cristianini,et al.  Learning the Kernel Matrix with Semidefinite Programming , 2002, J. Mach. Learn. Res..

[7]  Tobias Scheffer,et al.  Thwarting the Nigritude Ultramarine: Learning to Identify Link Spam , 2005, ECML.

[8]  Ling Huang,et al.  Near-Optimal Evasion of Convex-Inducing Classifiers , 2010, AISTATS.

[9]  Stephen P. Boyd,et al.  Robust Fisher Discriminant Analysis , 2005, NIPS.

[10]  Christos Faloutsos,et al.  Detecting Fraudulent Personalities in Networks of Online Auctioneers , 2006, PKDD.

[11]  Richard Lippmann,et al.  Machine learning in adversarial environments , 2010, Machine Learning.

[12]  Lise Getoor,et al.  Collective Classification in Network Data , 2008, AI Mag..

[13]  L. Ghaoui,et al.  Robust Classification with Interval Data , 2003 .

[14]  Pedro M. Domingos,et al.  Efficient Weight Learning for Markov Logic Networks , 2007, PKDD.

[15]  Tobias Scheffer,et al.  Stackelberg games for adversarial prediction problems , 2011, KDD.

[16]  Pedro M. Domingos,et al.  Adversarial classification , 2004, KDD.

[17]  Amir Globerson,et al.  Nightmare at test time: robust learning by feature deletion , 2006, ICML.

[18]  Amos Storkey,et al.  Advances in Neural Information Processing Systems 20 , 2007 .

[19]  Christopher Meek,et al.  Adversarial learning , 2005, KDD '05.

[20]  Alexander J. Smola,et al.  Convex Learning with Invariances , 2007, NIPS.

[21]  Carlos Castillo,et al.  Graph regularization methods for Web spam detection , 2010, Machine Learning.

[22]  Pedro M. Domingos,et al.  Markov Logic: An Interface Layer for Artificial Intelligence , 2009, Markov Logic: An Interface Layer for Artificial Intelligence.

[23]  Fuhui Long,et al.  Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy , 2003, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[24]  Raymond J. Mooney,et al.  Max-Margin Weight Learning for Markov Logic Networks , 2009, ECML/PKDD.

[25]  Christopher Meek,et al.  Good Word Attacks on Statistical Spam Filters , 2005, CEAS.