Sciweavers

Share
ICDM
2009
IEEE

Frequent Pattern Discovery from a Single Graph with Quantitative Itemsets

9 years 8 months ago
Frequent Pattern Discovery from a Single Graph with Quantitative Itemsets
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example is a social network whose vertex corresponds to a person with some quantitative items such as age, salary and so on. Although it can be expected that this kind of data will increase rapidly, most of current graph mining algorithms do not handle these complex graphs directly. Motivated by the above background, by effectively combining techniques of graph mining and quantitative itemset mining, we developed an algorithm named FAG-gSpan for finding frequent patterns from a graph with quantitative itemsets. Keywords-graph mining; quantitative itemsets;
Yuuki Miyoshi, Tomonobu Ozaki, Takenao Ohkawa
Added 18 Feb 2011
Updated 18 Feb 2011
Type Journal
Year 2009
Where ICDM
Authors Yuuki Miyoshi, Tomonobu Ozaki, Takenao Ohkawa
Comments (0)
books