Frequent pattern discovery from a single graph with quantitative itemsets

  • Miyoshi Y
  • Ozaki T
  • Ohkawa T
  • 14


    Mendeley users who have this article in their library.
  • 8


    Citations of this article.


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.

Author-supplied keywords

  • Graph mining
  • Quantitative itemsets

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Yuuki Miyoshi

  • Tomonobu Ozaki

  • Takenao Ohkawa

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free