A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Graph classification based on pattern co-occurrence
2009
Proceeding of the 18th ACM conference on Information and knowledge management - CIKM '09
Subgraph patterns are widely used in graph classification, but their effectiveness is often hampered by large number of patterns or lack of discrimination power among individual patterns. We introduce a novel classification method based on pattern cooccurrence to derive graph classification rules. Our method employs a pattern exploration order such that the complementary discriminative patterns are examined first. Patterns are grouped into co-occurrence rules during the pattern exploration,
doi:10.1145/1645953.1646027
dblp:conf/cikm/JinYW09
fatcat:qhnrgqmi4fakrlcc4fsclzlw7e