%0 Journal Article %1 Washio:Motoda:03 %A Washio, Takashi %A Motoda, Hiroshi %C New York, NY, USA %D 2003 %I ACM Press %J SIGKDD Explorations %K toread graph dm %N 1 %P 59--68 %T State of the art of graph-based data mining %U http://doi.acm.org/10.1145/959242.959249 %V 5 %X The need for mining structured data has increased in the past few years. One of the best studied data structures in computer science and discrete mathematics are graphs. It can therefore be no surprise that graph based data mining has become quite popular in the last few years.This article introduces the theoretical basis of graph based data mining and surveys the state of the art of graph-based data mining. Brief descriptions of some representative approaches are provided as well.

@article{Washio:Motoda:03, abstract = { The need for mining structured data has increased in the past few years. One of the best studied data structures in computer science and discrete mathematics are graphs. It can therefore be no surprise that graph based data mining has become quite popular in the last few years.This article introduces the theoretical basis of graph based data mining and surveys the state of the art of graph-based data mining. Brief descriptions of some representative approaches are provided as well. }, added-at = {2007-02-12T21:48:01.000+0100}, address = {New York, NY, USA}, author = {Washio, Takashi and Motoda, Hiroshi}, biburl = {https://www.bibsonomy.org/bibtex/20c5107f6feec6fcdc2e791a0b12ce448/hotho}, description = {State of the art of graph-based data mining}, interhash = {d2592c51759257bde584dc92196512d0}, intrahash = {0c5107f6feec6fcdc2e791a0b12ce448}, journal = {SIGKDD Explorations}, keywords = {toread graph dm}, number = 1, pages = {59--68}, publisher = {ACM Press}, timestamp = {2007-02-12T21:48:01.000+0100}, title = {State of the art of graph-based data mining}, url = {http://doi.acm.org/10.1145/959242.959249}, volume = 5, year = 2003 }