21 search results - page 2 / 5 » Discovering frequent geometric subgraphs |
ICDM
2003
IEEE
14 years 22 days ago
2003
IEEE
In this paper we study the problem of classifying chemical compound datasets. We present a sub-structure-based classification algorithm that decouples the sub-structure discovery...
ICDM
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper introduces a new technique of document clustering based on frequent senses. The proposed system, GDClust (Graph-Based Document Clustering) works with frequent senses ra...
IUI
2009
ACM
14 years 2 months ago
2009
ACM
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...
KDD
2005
ACM
14 years 7 months ago
2005
ACM
The search for frequent subgraphs is becoming increasingly important in many application areas including Web mining and bioinformatics. Any use of graph structures in mining, howev...
PKDD
2004
Springer
14 years 24 days ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...