Register | Log in | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

bigbossman's frequent [6 articles]

Recent papers added to bigbossman's library classified by the tag frequent. You can also see everyone's frequent.
  • Frequent subgraph mining in outerplanar graphs
    (2006), pp. 197-206.
    by Tam&\#225;s Horv&\#225;th, Jan Ramon, Stefan Wrobel
  • Graph indexing: A frequent structure based approach
    (2004)
    by X Yan, P Yu, J Han
  • Complete Mining of Frequent Patterns from Graphs: Mining Graph Data
    Machine Learning, Vol. V50, No. 3. (1 March 2003), pp. 321-354.
    by Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda
  • Discovering Frequent Substructures in Large Unordered Trees
    (2003)
    by T Asai, H Arimura, T Uno, S Nakano
    posted to frequent graph mining trees by bigbossman on 2006-11-27 08:55:02 as *****
  • Efficiently mining frequent trees in a forest
    (2002)
    by M Zaki
    posted to frequent graph mining trees by bigbossman on 2006-11-27 08:54:51 as read
  • An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
    (2000), pp. 13-23.
    by Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda
  • Note: You may cite this page as: http://www.citeulike.org/user/bigbossman/tag/frequent

    RIS BibTeX RSS
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.