A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Mining for Strong Negative Associations in a Large Database of Customer Transactions
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
AutoPart: parameter-free graph partitioning and outlier detection
PKDD '04 Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases
Graphs-at-a-time: query language and access methods for graph databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
On community outliers and their efficient detection in information networks
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
On graph query optimization in large networks
Proceedings of the VLDB Endowment
Outlier detection in graph streams
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Integrating community matching and outlier detection for mining evolutionary community outliers
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Community trend outlier detection using soft temporal pattern mining
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
| Hi-index | 0.00 |
In the real world, various systems can be modeled using heterogeneous networks which consist of entities of different types. People like to discover groups (or cliques) of entities linked to each other with rare and surprising associations from such networks. We define such anomalous cliques as Association-Based Clique Outliers (ABCOutliers) for heterogeneous information networks, and design effective approaches to detect them. The need to find such outlier cliques from networks can be formulated as a conjunctive select query consisting of a set of (type, predicate) pairs. Answering such conjunctive queries efficiently involves two main challenges: (1) computing all matching cliques which satisfy the query and (2) ranking such results based on the rarity and the interestingness of the associations among entities in the cliques. In this paper, we address these two challenges as follows. First, we introduce a new low-cost graph index to assist clique matching. Second, we define the outlierness of an association between two entities based on their attribute values and provide a methodology to efficiently compute such outliers given a conjunctive select query. Experimental results on several synthetic datasets and the Wikipedia dataset containing thousands of entities show the effectiveness of the proposed approach in computing interesting ABCOutliers.