Sciweavers

59 search results - page 9 / 12
» Frequent subgraph mining in outerplanar graphs
Sort
View
EDBT
2008
ACM
160views Database» more  EDBT 2008»
13 years 9 months ago
Taxonomy-superimposed graph mining
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
Ali Cakmak, Gultekin Özsoyoglu
SDM
2008
SIAM
256views Data Mining» more  SDM 2008»
13 years 9 months ago
Graph Mining with Variational Dirichlet Process Mixture Models
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda, Kenichi Kurihara
PKDD
2010
Springer
127views Data Mining» more  PKDD 2010»
13 years 5 months ago
Software-Defect Localisation by Mining Dataflow-Enabled Call Graphs
Defect localisation is essential in software engineering and is an important task in domain-specific data mining. Existing techniques building on call-graph mining can localise dif...
Frank Eichinger, Klaus Krogmann, Roland Klug, Klem...
IUI
2009
ACM
14 years 2 months ago
Discovering frequent work procedures from resource connections
Intelligent desktop assistants could provide more help for users if they could learn models of the users’ workflows. However, discovering desktop workflows is difficult becau...
Jianqiang Shen, Erin Fitzhenry, Thomas G. Dietteri...
BIBE
2007
IEEE
141views Bioinformatics» more  BIBE 2007»
13 years 11 months ago
Graph and Topological Structure Mining on Scientific Articles
In this paper, we investigate a new approach for literature mining. We use frequent subgraph mining, and its generalization topological structure mining, for finding interesting re...
Fan Wang, Ruoming Jin, Gagan Agrawal, Helen Piontk...