An Examination of Experimental Methodology for Classifiers of Relational Data

Authors:
Brian Gallagher;Tina Eliassi-Rad
Affiliations:
-;-
Venue:
ICDMW '07 Proceedings of the Seventh IEEE International Conference on Data Mining Workshops
Year:
2007

Citing 0
Cited 3

Leveraging label-independent features for classification in sparsely labeled networks: an empirical study

SNAKDD'08 Proceedings of the Second international conference on Advances in social network mining and analysis
A Modular Machine Learning System for Flow-Level Traffic Classification in Large Networks

ACM Transactions on Knowledge Discovery from Data (TKDD)
Classifying online social network users through the social graph

FPS'12 Proceedings of the 5th international conference on Foundations and Practice of Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Experimental methodology for evaluating classification algorithms in relational (i.e., networked) data is complicated by dependencies between related data instances. We survey the literature on relational classifiers and examine the various experimental methodologies reported therein. Our survey reveals that methodologies fall into two main groups, based on distinct formulations of the classification problem: (1) between-network classification and (2) within-network classification. While the methodology for the between- network setting is relatively straightforward, methodologies for within-network classification are more complex and varied. We explore a number of these variations and present experimental results to illustrate important similarities and differences among different methodologies for within-network classification.